QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#409740 | #6748. Spin the Wheel | asoulcoming# | WA | 11ms | 7200kb | C++20 | 1.6kb | 2024-05-12 17:08:14 | 2024-05-12 17:08:16 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
//upper_bound >
//lower_bound >=
#define LL long long
#define ULL unsigned long long
#define PII pair<int,int>
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define PI acos(-1)
#define endl '\n'
#define ee cout<<'\n';
#define __lcm(a, b) a*b/__gcd(a,b)
#define fo(a,b,c) for(int a=b;a<=c;a++)
#define of(a,b,c) for(int a=b;a>=c;a--)
#define debug(x) cout<<#x<<' '<<x<<endl;
#define nep next_permutation
#define prep prev_permutation
#define g(a) a,vector<a>,greater<a>
#define all(a) a.begin(),a.end()
#define alls(a) a.begin()+1,a.end()
#define int long long
//const int p = 998244353, pp = 1000000007;
LL qmi(LL a,LL b,LL mod){LL res=1;while(b){if(b&1)res=res*a%mod;b>>=1;a=a*a%mod;}return res; }
const int N = 2000010, M = 4000010;
int a[N];
int c[N];
void solve()
{
int n;
cin >> n;
int idx = -1;
int mn = 1e9;
set<int> se;
for (int i = 0; i < n; i ++)
{
cin >> a[i];
se.insert(a[i]);
if (a[i] < mn) mn = a[i], idx = i;
}
vector<int> b;
for (int i = 0; i < n; i ++)
{
b.push_back(a[(i + idx) % n]);
}
int c = b[1] - b[0];
if (se.size() == 1)
{
if (a[0] == 0) cout << 0;
else cout << n + 1;
return;
}
if (c == 0)
{
cout << -1;
return;
}
for (int i = 1; i < n - 1; i ++)
{
if ((b[i] + c) % n == b[i + 1]) continue;
else
{
cout << -1;
return;
}
}
if (idx == 0) cout << c;
else cout << c + 1;
}
signed main()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//int T; cin >> T; while (T --)
solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 5652kb
input:
5 1 3 0 2 4
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 11ms
memory: 7200kb
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: 6ms
memory: 6408kb
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: -100
Wrong Answer
time: 7ms
memory: 6296kb
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:
400
result:
wrong answer 1st numbers differ - expected: '401', found: '400'