QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#656769#7622. Yet Another CoffeepRE 1ms7724kbC++172.4kb2024-10-19 13:40:142024-10-19 13:40:17

Judging History

This is the latest submission verdict.

  • [2024-10-19 13:40:17]
  • Judged
  • Verdict: RE
  • Time: 1ms
  • Memory: 7724kb
  • [2024-10-19 13:40:14]
  • Submitted

answer

#include <bits/stdc++.h>

using namespace std;
#define int long long
#define pii pair<int, int>
#define Genshin_Impact return
#define start 0
const int mod = 998244353;
const int N = 2e5 + 10;
int a[N];
struct node
{
    int rq, w;
    bool operator<(const node &W) const
    {
        if (W.rq == rq)
            return 1;
        return rq < W.rq;
    }
} p[N];
int nxt[N];
bool st[N];
void solve()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        st[i] = 0;
        cin >> a[i];
    }
    for (int i = 1; i <= m; i++)
    {
        cin >> p[i].rq >> p[i].w;
    }
    sort(p + 1, p + m + 1);
    int sum = 0, idx = m;
    int mi = 1e9 + 10, minn = -1;
    priority_queue<pii, vector<pii>, greater<pii>> q, q2;
    for (int i = n; i >= 1; i--)
    {
        while (idx >= 1 && p[idx].rq == i)
        {
            sum += p[idx].w;
            idx--;
        }
        nxt[i] = sum;
        q.push({a[i] - sum, i});
    }
    int now = n;
    vector<int> ans;
    int cnt = 0;
    int s = 0;
    int ls = n;
    for (int i = 1; i <= n; i++)
    {
        while (q.size() && q.top().second >= now)
        {
            q.pop();
        }

        int m1 = 1e15, m2 = 1e15;
        if (q.size())
        {
            m1 = min(m1, q.top().first + cnt);
        }
        if (q2.size())
        {
            m2 = min(m2, q2.top().first);
        }
        if (m1 < m2)
        {
            s += q.top().first + cnt;
            now = q.top().second;
            cnt = nxt[now];
            st[now] = 1;
            q.pop();
        }
        else
        {
            s += q2.top().first;
            q2.pop();
        }
        // cout << m1 << ' ' << m2 << ' ';
        // cout << now << ' ' << ls << '\n';
        for (int j = now; j <= ls; j++)
        {
            if (!st[j])
            {
                // cout << i << ": " << j << '\n';
                q2.push({a[j], j});
                st[j] = 1;
            }
        }
        ls = now;
        ans.push_back(s);
    }
    for (auto j : ans)
        cout << j << ' ';
    cout << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cout << fixed << setprecision(20);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    Genshin_Impact start;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 7724kb

input:

5
10 14
17 37 59 65 53 73 68 177 160 111
10 177
5 193
2 30
3 63
2 339
3 263
5 178
2 190
9 23
10 328
10 200
9 8
3 391
6 230
12 9
152 306 86 88 324 59 18 14 42 260 304 55
3 50
2 170
1 252
7 811
1 713
7 215
10 201
4 926
8 319
19 20
182 74 180 201 326 243 195 31 170 263 284 233 48 166 272 281 179 116 31...

output:

-2596 -2559 -2506 -2447 -2382 -2314 -2241 -2130 -1970 -1793 
-3505 -3491 -3473 -3431 -3376 -3317 -3231 -3143 -2883 -2579 -2273 -1949 
-6527 -6496 -6448 -6374 -6258 -6092 -5922 -5743 -5563 -5368 -5167 -4934 -4691 -4428 -4156 -3875 -3591 -3272 -2946 
-3219 -2987 -2572 -2140 -1707 -1238 -768 -274 243 1...

result:

ok 70 numbers

Test #2:

score: 0
Accepted
time: 1ms
memory: 7664kb

input:

2
5 2
1 2 3 4 5
3 1
4 2
7 3
4 3 1 10 3 8 6
4 9
3 8
4 5

output:

-2 0 3 7 12 
-21 -18 -15 -11 -5 3 13 

result:

ok 12 numbers

Test #3:

score: -100
Runtime Error

input:

8
1 0
72916
9 11
130289 240521 653024 625847 679075 529899 486802 540872 353600
2 5400
2 257841
6 48161
3 71484
9 156788
3 181910
4 45589
6 210869
5 70426
9 87059
5 115764
8 7
634608 412120 360938 425426 825551 138578 678304 747502
2 235317
4 281859
5 553042
8 295615
8 32014
8 755313
4 439284
19 10
...

output:


result: