Submission #73188

#TimeUsernameProblemLanguageResultExecution timeMemory
73188Batmend4Gondola (IOI14_gondola)C++98
10 / 100
17 ms4808 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { bool lol = 1; int ind = -1; for( int i = 0 ; i < n ; i++ ){ if( inputSeq[i] <= n ){ lol = 0; ind = i; } } if( lol == 1 ){ return 1; } int ct[n + 5]; int nn = n + inputSeq[ind] - 1 - ind; for( int i = 0 ; i < n ; i++ ){ ct[(nn + i) % n] = inputSeq[i]; } for( int i = 0 ; i < n ; i++ ){ if( ct[i] <= n ){ if( i != ct[i] - 1 ){ return 0; } } } return 1; return -1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }
#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...