QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #413289 | #6748. Spin the Wheel | albion | WA | 0ms | 3808kb | C++17 | 393b | 2024-05-17 11:22:09 | 2024-05-17 11:22:10 |
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]+x[1]==0?0:1);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3808kb
input:
5 1 3 0 2 4
output:
1
result:
wrong answer 1st numbers differ - expected: '3', found: '1'