QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#693048#9528. New Energy Vehiclecandy34#WA 0ms3900kbC++201007b2024-10-31 15:26:042024-10-31 15:26:11

Judging History

This is the latest submission verdict.

  • [2024-10-31 15:26:11]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 3900kb
  • [2024-10-31 15:26:04]
  • Submitted

answer

#include <iostream>
#include <cstdio>
#include <cctype>
#define il inline
#define ll long long
#define int long long
#define gc getchar
using namespace std;
il int read() {
    int x=0;bool f=0;char ch=gc();
    while(!isdigit(ch)) {f|=ch=='-';ch=gc();}
    while(isdigit(ch)) {x=(x<<1)+(x<<3)+(ch^48);ch=gc();}
    return f?-x:x;
}

const int N=1e5+10;
int T,n,m;
int a[N];
int x[N],t[N];

signed main() {
    T=read();
    while(T--) {
        n=read();m=read();
        int sum=0;
        for(int i=1;i<=n;++i) {
            a[i]=read();
            sum+=a[i];
        }
        for(int i=1;i<=m;++i) {
            x[i]=read();t[i]=read();
        }
        int xb=0;
        int cur = 0;
        for(int i=1;i<=m;++i) {
            if(x[i]-x[i-1]+cur>sum){
                break;
            }
            xb = i;
            cur+=x[i]-x[i-1];
            cur = max((int)0,cur-a[t[i]]);
        }
        printf("%lld\n",x[xb]+sum-cur);
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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'