QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #413285 | #6748. Spin the Wheel | albion | WA | 3ms | 4576kb | C++17 | 383b | 2024-05-17 11:21:05 | 2024-05-17 11:21:05 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int i,n;
int x[100005],a[100005];
int main()
{
scanf("%d",&n);
for (i=1;i<=n;++i)
{
scanf("%d",&x[i]);
if (i>=2) a[i]=(n+x[i]-x[i-1])%n;
}
a[1]=(n+x[1]-x[n])%n;
for (i=1;i<n;++i)
if (a[i]!=a[i+1])
{
printf("-1");
return 0;
}
printf("%d",a[1]+1);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3956kb
input:
5 1 3 0 2 4
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: -100
Wrong Answer
time: 3ms
memory: 4576kb
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:
55556
result:
wrong answer 1st numbers differ - expected: '55555', found: '55556'