QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#747931#9528. New Energy Vehiclewiseman123WA 29ms8860kbC++202.4kb2024-11-14 18:47:062024-11-14 18:47:08

Judging History

This is the latest submission verdict.

  • [2024-11-14 18:47:08]
  • Judged
  • Verdict: WA
  • Time: 29ms
  • Memory: 8860kb
  • [2024-11-14 18:47:06]
  • Submitted

answer

#include <bits/stdc++.h>
#define int long long
using namespace std;

void solve()
{
    int n, m;
    cin >> n >> m;

    vector<int> battery(n + 10),limit(n+10);
    vector<int> vis(n+10);
    for (int i = 1; i <= n; i++) 
    {
        cin >> battery[i];
        limit[i]=battery[i];
    }
    vector<pair<int, int>> v;
    queue<int> q1,q2;
    for (int i = 1; i <= m; i++) 
    {
        int loc, x;
        cin >> loc >> x;
        vis[x]++;
        q1.push(x);
        v.push_back({loc, x});
    }
    for(int i=1;i<=n;i++) if(!vis[i]) q2.push(i);
    int x=0;
    for(int i=0;i<m;i++)
    {
        int d=v[i].first,id=v[i].second;
        // cout<<i<<"+++++"<<x<<endl;
        while(q1.size())
        {
            int k=q1.front();
            q1.pop();
            // cout<<k<<"---\n";
            if(!battery[k])
            {
                if(--vis[k]==0) q2.push(k);
            }
            if(battery[k]>=d-x) 
            {
                battery[k]-=d-x;
                x=d;
                break;
            }
            else
            {
                x+=battery[k];
                battery[k]=0;
            }
        }
        if(x==d) 
        {
            battery[id]=limit[id];
            if(vis[id]) q1.push(id);
        }
        else
        {
            while(q2.size())
            {
                int k=q2.front();
                // cout<<k<<"+++\n";
                if(battery[k]>=d-x) 
                {
                    // cout<<k<<"***"<<battery[k]<<endl;
                    battery[k]-=d-x;
                    x=d;
                    if(!battery[k]) q2.pop();
                    break;
                }
                else
                {
                    x+=battery[k];
                    battery[k]=0;
                    q2.pop();
                } 
            }
            if(x==d) 
            {
                battery[id]=limit[id];
                if(vis[id]) q1.push(id);
            }
            else break;
        }
        // cout<<i<<"----"<<x<<endl;
    }
    // cout<<x<<endl;
    for(int i=1;i<=n;i++) 
    {
        // cout<<i<<" "<<battery[i]<<endl;
        x+=battery[i];
    }
    cout<<x<<endl;
    return ;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
3 1
3 3 3
8 1
2 2
5 2
1 2
2 1

output:

12
9

result:

ok 2 lines

Test #2:

score: 0
Accepted
time: 0ms
memory: 3540kb

input:

6
3 2
2 2 2
6 1
7 1
2 2
3 3
2 1
6 2
2 3
2 2
5 1
7 2
9 1
2 2
3 3
2 1
6 2
1 1
999999999
1000000000 1
1 1
1000000000
1000000000 1

output:

9
11
4
11
999999999
2000000000

result:

ok 6 lines

Test #3:

score: -100
Wrong Answer
time: 29ms
memory: 8860kb

input:

10
230 8042
599 1039 69 1011 1366 824 14117 1523 806 5002 332 55 3769 996 359 1040 255 1135 3454 3609 6358 2509 3695 8785 3890 1304 3394 14611 33 89 2245 508 22 1043 10411 628 1279 714 903 585 7413 5099 845 148 4689 2110 8683 1613 143 3263 2599 110 244 3297 4742 1571 425 1822 15692 572 9397 328 1691...

output:

1517145
1560894
1320610
1516773
1513454
1553286
733729
1538732
843839
779549

result:

wrong answer 1st lines differ - expected: '1543020', found: '1517145'