QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#697977#9528. New Energy VehicleQianFeng#WA 0ms3868kbC++201.1kb2024-11-01 16:41:242024-11-01 16:41:24

Judging History

This is the latest submission verdict.

  • [2024-11-01 16:41:24]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 3868kb
  • [2024-11-01 16:41:24]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
void test() {cerr << "\n";}
template<typename T, typename... Args> 
void test(T x, Args... args) {cerr << x << " ";test(args...);}
using ll = long long;
using ull = unsigned long long;



void solve(){
    int n,m;
    cin>>n>>m;
    vector<ll> a(n+1);
    ll sum = 0;
    for (int i=1;i<=n;i++){
        cin>>a[i];
        sum += a[i];
    }
    vector<array<ll,2>> ed;
    for (int i=0;i<m;i++){
        int a,b;
        cin>>a>>b;
        ed.push_back({a,b});
    }
    sort(ed.begin(),ed.end());
    ll des = 0;
    ll pre = 0;
    for (auto [u,v]:ed){
        if (des + u-pre>sum){
            break;
        }
        else{
            des += u-pre;
            des -= a[v];
            des=max(des,0ll);
        }
        pre=u;
    }
    pre += sum - des;
    cout<<pre<<"\n";
}



int main(){
    fastio;
    cout << fixed << setprecision(10);
    int T;
    cin>>T;

    while (T--){
        solve();
    }
    return 0;
}

详细

Test #1:

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

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: 3868kb

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:

10
11
4
11
999999999
2000000000

result:

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