Submission #1278820

#TimeUsernameProblemLanguageResultExecution timeMemory
1278820stanwaibbangeGondola (IOI14_gondola)C++20
0 / 100
1 ms344 KiB
#include <bits/stdc++.h> using namespace std; #include "gondola.h" const int INF = numeric_limits<int>::max() / 2; int valid(int n, int inputSeq[]) { int minv = INF; int index = -1; for (int i = 0; i < n; ++i) { if (inputSeq[i] <= 0) { return 0; } if (inputSeq[i] <= n) { minv = inputSeq[i] - i; index = i; break; } } for (int i = index + 1; i < n; ++i) { if (inputSeq[i] <= 0) { return 0; } if (inputSeq[i] <= n) { if (inputSeq[i]%n != (minv + i)%n) { return 0; } } } sort(inputSeq,inputSeq+n); int last = -1; for (int i = 0; i < n; ++i) { if (inputSeq[i] == last) { return 0; } last = inputSeq[i]; } } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
   47 | }
      | ^
#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...