QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#728594#9528. New Energy VehiclerdcamelotWA 0ms3608kbC++201.4kb2024-11-09 15:30:152024-11-09 15:30:15

Judging History

This is the latest submission verdict.

  • [2024-11-09 15:30:15]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 3608kb
  • [2024-11-09 15:30:15]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
using i64=long long;
using u64=unsigned long long;
#define ll long long
const int inf=1e9;
const ll inff=1e18;
using i128=__int128;
using ld=long double;

void solve(){
    int n,m;
    cin>>n>>m;
    vector<int> a(n),b(n);
    vector<pair<int,int>> k(m);
    for(int i=0;i<n;i++){
        cin>>a[i];
        b[i]=a[i];
    }
    for(int i=0;i<m;i++){
        cin>>k[i].first>>k[i].second;
        k[i].second--;
    }
    sort(k.begin(),k.end());
    vector<int> nxt(m),mp(n,m+1);
    for(int i=m-1;i>=0;i--){
        nxt[i]=mp[k[i].second];
        mp[k[i].second]=i;
    }
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;
    for(int i=0;i<n;i++){
        q.push({mp[i],i});
    }
    i64 ans=0ll,cnt=0;
    while(!q.empty()){
        auto [pos,id]=q.top();
        q.pop();
        i64 dis=k[cnt].first-ans;
        if(cnt<m && a[id]>dis){
            a[id]-=dis;
            ans+=dis;
            a[k[cnt].second]=b[k[cnt].second];
            q.push({nxt[cnt],k[cnt].second});
            if(id!=k[cnt].second){
                q.push({pos,id});
            }
            cnt++;
        }else{
            ans+=a[id];
            a[id]=0;
        }
    }
    cout<<ans<<'\n';
}

int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int t=1;
    cin>>t; 
    while(t--){
        solve();
    }
    return 0;
}

详细

Test #1:

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

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: -100
Wrong Answer
time: 0ms
memory: 3608kb

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:

6
11
4
11
999999999
1000000000

result:

wrong answer 1st lines differ - expected: '9', found: '6'