QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#387403 | #6748. Spin the Wheel | k1nsom | WA | 0ms | 3588kb | C++17 | 513b | 2024-04-12 14:41:25 | 2024-04-12 14:41:26 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define N 200005
#define int long long
#define endl '\n'
int ans = 0, n, gc, a[N];
signed main()
{
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
gc = (a[2] - a[1] + n - 1) % n + 1; // 公差
for (int i = 2; i <= n; i++)
if ((a[i % n + 1] - a[i] + n - 1) % n + 1 != gc)
{
cout << -1;
// cout << i;
return 0;
}
cout << ((a[1] == 0) + gc);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3588kb
input:
5 1 3 0 2 4
output:
2
result:
wrong answer 1st numbers differ - expected: '3', found: '2'