QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#475509 | #6748. Spin the Wheel | crispshadow | WA | 18ms | 4264kb | C++20 | 894b | 2024-07-13 15:08:33 | 2024-07-13 15:08:34 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e7+10;
const int MOD=1e9+7;
signed main(){
int n;
cin >> n;
vector<int> m;
for(int i=0;i<n;i++){
int x;
cin >> x;
m.push_back(x);
}
int ans=m[1]-m[0];
if(ans<0)
ans=m[1]+n-m[0];
for(int i=1;i<m.size();i++){
if( m[i]-m[i-1]!=ans && m[i]+n-m[i-1]!=ans){
cout << -1;
return 0;
}
}
int siz=m[0];
int siz0=m[1]-siz;
if(siz0<0){
siz0=m[1]+n-siz;
}
if(siz0==0){
cout << 0;
return 0;
}
else if(siz==0){
cout << siz0;
return 0;
}
cout << 1+siz0;
// int siz=m[0];
// int siz0=m[1]-siz*2;
// int cntt=1;
// while(siz0<0){
// siz0=m[1]+cntt*n-siz*2;
// cntt++;
// }
//
// if(siz0==0){
// cout << 0;
// return 0;
// }
// else if(siz==0){
// cout << siz0;
// return 0;
// }
// cout << 2+siz0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3524kb
input:
5 1 3 0 2 4
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 18ms
memory: 4112kb
input:
100000 0 55555 11110 66665 22220 77775 33330 88885 44440 99995 55550 11105 66660 22215 77770 33325 88880 44435 99990 55545 11100 66655 22210 77765 33320 88875 44430 99985 55540 11095 66650 22205 77760 33315 88870 44425 99980 55535 11090 66645 22200 77755 33310 88865 44420 99975 55530 11085 66640 221...
output:
55555
result:
ok 1 number(s): "55555"
Test #3:
score: 0
Accepted
time: 13ms
memory: 4180kb
input:
100000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 50000 0 500...
output:
50000
result:
ok 1 number(s): "50000"
Test #4:
score: 0
Accepted
time: 13ms
memory: 4192kb
input:
100000 1 401 801 1201 1601 2001 2401 2801 3201 3601 4001 4401 4801 5201 5601 6001 6401 6801 7201 7601 8001 8401 8801 9201 9601 10001 10401 10801 11201 11601 12001 12401 12801 13201 13601 14001 14401 14801 15201 15601 16001 16401 16801 17201 17601 18001 18401 18801 19201 19601 20001 20401 20801 21201...
output:
401
result:
ok 1 number(s): "401"
Test #5:
score: 0
Accepted
time: 17ms
memory: 4264kb
input:
100000 37631 70399 3167 35935 68703 1471 34239 67007 99775 32543 65311 98079 30847 63615 96383 29151 61919 94687 27455 60223 92991 25759 58527 91295 24063 56831 89599 22367 55135 87903 20671 53439 86207 18975 51743 84511 17279 50047 82815 15583 48351 81119 13887 46655 79423 12191 44959 77727 10495 4...
output:
32769
result:
ok 1 number(s): "32769"
Test #6:
score: 0
Accepted
time: 17ms
memory: 4200kb
input:
100000 71294 42588 13882 85176 56470 27764 99058 70352 41646 12940 84234 55528 26822 98116 69410 40704 11998 83292 54586 25880 97174 68468 39762 11056 82350 53644 24938 96232 67526 38820 10114 81408 52702 23996 95290 66584 37878 9172 80466 51760 23054 94348 65642 36936 8230 79524 50818 22112 93406 6...
output:
71295
result:
ok 1 number(s): "71295"
Test #7:
score: 0
Accepted
time: 6ms
memory: 4224kb
input:
100000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
0
result:
ok 1 number(s): "0"
Test #8:
score: -100
Wrong Answer
time: 14ms
memory: 4172kb
input:
100000 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294 71294...
output:
0
result:
wrong answer 1st numbers differ - expected: '100001', found: '0'