QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#404772 | #6751. Game | Lance# | WA | 11ms | 6176kb | C++14 | 1.2kb | 2024-05-04 17:52:29 | 2024-05-04 17:52:49 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
using ll=long long;
using ull=unsigned long long;
#define pi pair<int, int>
#ifdef LOCAL
#include"D:/Administrator/Documents/vscode/algo/debug.h"
#else
#define debug(...) 42
#endif
const int INF = 2e9 + 1000;
const ll INFLL = 8e18 + 1000;
mt19937 mrand(random_device{}());
void solve(){
int n;
cin>>n;
vector<ll> a(n);
for(auto &t:a)
cin>>t;
vector<ll> b(n);
ll ans=0;
for(int i=0;i<n;i++)
{
ll id=(i-1+n)%n;
ll idx=(i+1)%n;
ll t;
if(a[id]-b[id]>a[idx]-b[idx])
{
t=min(a[i]-b[i],a[id]-b[id]);
ans+=t;
b[i]+=t;
b[id]+=t;
}else {
t=min(a[i]-b[i],a[idx]-b[idx]);
ans+=t;
b[i]+=t;
b[idx]+=t;
}
}
cout<<ans;
}
signed main(){
#ifndef LOCAL
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#endif
#ifdef LOCAL
freopen("D:/Administrator/Documents/vscode/in.txt","r",stdin);
freopen("D:/Administrator/Documents/vscode/out.txt","w",stdout);
#endif
int T = 1;
// cin >> T;
while(T--) solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3500kb
input:
2 7 5
output:
5
result:
ok 1 number(s): "5"
Test #2:
score: -100
Wrong Answer
time: 11ms
memory: 6176kb
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'