Submission #1198380

#TimeUsernameProblemLanguageResultExecution timeMemory
1198380TahirAliyevGondola (IOI14_gondola)C++20
20 / 100
33 ms6216 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int arr[]){ set<int> s; set<int> s2; for(int i = 0; i < n; i++){ if(arr[i] <= n){ s.insert((arr[i] - i + n) % n); } s2.insert(arr[i]); } return (s2.size() == n && s.size() == 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...