제출 #298051

#제출 시각아이디문제언어결과실행 시간메모리
298051peti1234Gondola (IOI14_gondola)C++17
10 / 100
13 ms1152 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...