QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#272057 | #6751. Game | mobbb# | WA | 11ms | 5096kb | C++17 | 495b | 2023-12-02 15:57:37 | 2023-12-02 15:57:39 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=2e5+100;
ll n;
ll a[N];
ll ans;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
{
if(a[(i-1+n)%n]>=a[i])
ans+=a[i],a[(i-1+n)%n]-=a[i],a[i]=0;
else
ans+=a[(i-1+n)%n],a[i]-=a[(i-1+n)%n],a[(i-1+n)%n]=0;
}
cout<<ans<<endl;
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3348kb
input:
2 7 5
output:
5
result:
ok 1 number(s): "5"
Test #2:
score: -100
Wrong Answer
time: 11ms
memory: 5096kb
input:
200000 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 1...
output:
10000000000
result:
wrong answer 1st numbers differ - expected: '10000050000', found: '10000000000'