Submission #392152

#TimeUsernameProblemLanguageResultExecution timeMemory
392152rainboyGondola (IOI14_gondola)C++98
20 / 100
13 ms1200 KiB
#include "gondola.h" #define A 250000 int valid(int n, int aa[]) { static char used[A + 1]; int i, j; for (i = 0; i < n; i++) { if (used[aa[i]]) return 0; used[aa[i]] = 1; } for (i = 0; i < n; i++) if (aa[i] <= n) { for (j = 0; j < n; j++) if (aa[(i + j) % n] <= n && aa[(i + j) % n] != (aa[i] - 1 + j) % n + 1) return 0; return 1; } return 1; } int replacement(int n, int aa[], int bb[]) { return -2; } int countReplacement(int n, int aa[]) { 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...