Submission #379184

#TimeUsernameProblemLanguageResultExecution timeMemory
379184MounirGondola (IOI14_gondola)C++14
10 / 100
12 ms1788 KiB
#include "gondola.h" #include <bits/stdc++.h> #define pb push_back #define sz(x) (int)x.size() using namespace std; int valid(int n, int inputSeq[]) { vector<int> restant; for (int ind = 0; ind < n; ++ind){ if (inputSeq[ind] <= n) restant.pb(ind); } for (int ind = 0; ind < sz(restant) - 1; ++ind){ int a = restant[ind] - inputSeq[restant[ind]], b = restant[ind + 1] - inputSeq[restant[ind + 1]]; a += n; a %= n; b += n; b %= n; //cout << restant[ind] << " " << restant[ind + 1] << " " << a << " " << b << endl; if (a != b) return 0; } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return 0; } //---------------------- int countReplacement(int n, int inputSeq[]){ return 0; }
#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...