Submission #1064529

#TimeUsernameProblemLanguageResultExecution timeMemory
1064529sunboiGondola (IOI14_gondola)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int n, int inputSeq[]){ vector<int> a; int mn = 1e9; int pos = -1; for (int i = 0; i < n; i++){ if (inputSeq[i] <= n){ if (inputSeq[i] < mn){ pos = i; mn = inputSeq[i]; } } } for (int i = pos; i < n; i++){ a.push_back(inputSeq[i]); } for (int i = 0; i < pos; i++){ a.push_back(inputSeq[i]); } int cnt = a[0]; bool f = 0; for (int i = 0; i < n; i++){ if (a[i] == cnt || a[i] > n){ }else f = 1; cnt++; } return f; } 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...