이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
using ll=long long;
ll mod=1e9, sum=1, n, kul=-1, f;
/*
ll hatv(ll a, ll b) {
ll ans=1;
while(b) {
if (b%2) ans*=a, ans%=mod;
a*=a, a%=mod;
b/=2;
}
return ans;
}
*/
int valid(int w, int s[]) {
n=w;
for (int i=0; i<n; i++) if (s[i]<n) {
f=(s[i]-i+n)%n;
if (kul!=-1 && kul!=f) sum=0;
kul=f;
}
return sum;
}
int replacement(int w, int s[], int v[]) {
return 0;
}
int countReplacement(int w, int s[]) {
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |