結果

問題 No.1708 Quality of Contest
ユーザー atjh16
提出日時 2021-10-17 11:23:08
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 1,314 bytes
コンパイル時間 2,338 ms
コンパイル使用メモリ 206,868 KB
最終ジャッジ日時 2025-01-25 01:43:48
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 2 RE * 21
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /usr/include/c++/13/vector:66,
                 from /usr/include/c++/13/functional:64,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:53,
                 from main.cpp:1:
In member function ‘std::vector<_Tp, _Alloc>::size_type std::vector<_Tp, _Alloc>::size() const [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
    inlined from ‘int main()’ at main.cpp:76:18:
/usr/include/c++/13/bits/stl_vector.h:993:40: warning: ‘q2’ may be used uninitialized [-Wmaybe-uninitialized]
  993 |       { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }
      |                          ~~~~~~~~~~~~~~^~~~~~~~~
main.cpp: In function ‘int main()’:
main.cpp:45:31: note: ‘q2’ was declared here
   45 |         int w = 1, y = 0, q1, q2;
      |                               ^~
In member function ‘std::vector<_Tp, _Alloc>::size_type std::vector<_Tp, _Alloc>::size() const [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
    inlined from ‘int main()’ at main.cpp:65:18:
/usr/include/c++/13/bits/stl_vector.h:993:66: warning: ‘q1’ may be used uninitialized [-Wmaybe-uninitialized]
  993 |       { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }
      |                                                    ~~~~~~~~~~~~~~^~~~~~~~
main.cpp: In function ‘int main()’:
main.cpp:45:27: note: ‘q1’ was declared here
   45 |         int w = 1, y = 0, q1, q2;
      |                           ^~

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
int n, k;
long long m, x, s, t, z = 0;
vector<long long> a[200000];
int c[200000], d[200001];
priority_queue<pair<long long, int>> Q1, Q2;
int main()
{
    cin >> n >> m >> x;
    for (int i = 0; i < n; i++) {
        cin >> s >> t;
        t--;
        a[t].push_back(s);
    }
    for (int i = 0; i < m; i++) {
        sort(a[i].begin(), a[i].end());
        Q2.push({ a[i].back(), i });
        a[i].pop_back();
    }
    cin >> k;
    for (int i = 0; i < k; i++)
        cin >> c[i];
    sort(c, c + k);
    int j = 0, u = k;
    for (int i = 0; i < k; i++) {
        while (j <= c[i]) {
            d[j] = u;
            j++;
        }
        u--;
    }
    long long p1 = 0, p2 = 0, z1 = -1, z2 = -1;
    int w = 1, y = 0, q1, q2;
    while (!Q1.empty() || !Q2.empty()) {
        if (!Q1.empty()) {
            p1 = Q1.top().first;
            q1 = Q1.top().second;
            Q1.pop();
            z1 = p1;
        }
        if (!Q2.empty()) {
            p2 = Q2.top().first;
            q2 = Q2.top().second;
            Q2.pop();
            z2 = p2 + x;
        }
        if (z1 >= z2) {
            z += z1 * d[w];
            z1 = 0;
            if (a[q1].size() > 0) {
                Q1.push({ a[q1].back(), q1 });
                a[q1].pop_back();
            }
            if(z2 > 0)
                Q2.push({ p2, q2 });
        }
        else {
            z += z2 * d[w];
            y++;
            z2 = 0;
            if (a[q2].size() > 0) {
                Q1.push({ a[q2].back(), q2 });
                a[q2].pop_back();
            }
            if(z1 > 0)
                Q1.push({ p1, q1 });
        }
        w++;
    }
    cout << z << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0