QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #310322 | #5549. Game Show | LeeShoW# | WA | 9ms | 3696kb | C++14 | 712b | 2024-01-21 11:05:05 | 2024-01-21 11:05:06 |
Judging History
answer
#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
const int N=5e5+5;
int n,m,now=0,q,r;
int v[N]={},u[N]={};
bool flag=1;
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>v[i],v[i+n]=v[i];
for(int i=1;i<=n;i++) cin>>u[i],u[i+n]=u[i];
for(int i=1;i<=n+n;i++){
v[i]+=v[i-1],u[i]+=u[i-1];
if(v[i]+u[i]<v[i-1]+u[i-1]) flag=0;
}
if(v[n]<0||u[n]<0) flag=0;
while(m--){
cin>>q>>r;
if(!flag) cout<<"flawed\n";
else if(q<=r) cout<<min(v[r-1]-v[q-1],u[q+n-1]-u[r-1])<<"\n";
else cout<<min(v[r+n-1]-v[q-1],u[q-1]-u[r-1])<<"\n";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3548kb
input:
4 4 2 3 -4 3 1 2 7 -1 1 3 3 1 1 4 1 1
output:
5 -1 -1 0
result:
ok 4 lines
Test #2:
score: 0
Accepted
time: 1ms
memory: 3608kb
input:
4 3 1 2 -3 4 4 -3 2 1 1 1 2 4 3 1
output:
flawed flawed flawed
result:
ok 3 lines
Test #3:
score: 0
Accepted
time: 0ms
memory: 3696kb
input:
6 2 -6 8 -3 5 -9 4 9 -2 8 -4 12 -1 2 6 3 3
output:
flawed flawed
result:
ok 2 lines
Test #4:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
3 1 1 2 3 2 3 1 3 3
output:
0
result:
ok single line: '0'
Test #5:
score: 0
Accepted
time: 2ms
memory: 3624kb
input:
119 14161 -471334480 -303286501 -823503521 204458352 428751472 -685555801 -315724979 454499825 326635838 274924560 623877126 -41230889 829726183 -901302108 -414222870 430105197 -163781582 -654097302 -785578511 634678229 -53714045 466578268 -156361557 31276696 778119895 744605022 -686693025 368251457...
output:
flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed...
result:
ok 14161 lines
Test #6:
score: -100
Wrong Answer
time: 9ms
memory: 3556kb
input:
310 96100 995988008 -273572056 647506325 206645991 -449149473 -743958256 -263018073 522873394 -995870737 391893724 -602177324 912246319 -671361368 -339118861 787545510 276780215 150123420 -438281015 -486464371 -526419934 457117467 -340697687 -193705644 583522844 -862239080 -783668951 886284879 -2153...
output:
flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed flawed...
result:
wrong answer 1st lines differ - expected: '0', found: 'flawed'