# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
767619 | 2023-06-26T22:59:09 Z | tigar | Gondola (IOI14_gondola) | C++14 | 0 ms | 0 KB |
//#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int* inputSeq) { int last=-1, pos=-1; for(int i=0; i<n; i++) { if(inputSeq[i]<=n and last==-1){last=inputSeq[i]; pos=i;} else if(inputSeq[i]<=n) { if((last%n+i-pos)%n==(inputSeq[i])%n){last=inputSeq[i]; pos=i;} else {return 0;} } } return 1; } int replacement(int n, int* gondolaSeq, int* replacementSeq) { return 2005; } int countReplacement(int n, int* inputSeq) { return 24; } /*int main() { int n; cin>>n; int gondole[n]; for(int i=0; i<n; i++)cin>>gondole[i]; cout<<valid(n, gondole); }*/