Submission #739169

#TimeUsernameProblemLanguageResultExecution timeMemory
739169NeroZeinGondola (IOI14_gondola)C++17
5 / 100
1 ms312 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { return -1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { int mx = 0; for (int i = 0; i < n; ++i) { mx = max(mx, gondolaSeq[i]); } vector<bool> vis(mx + 1); for (int i = 0; i < n; ++i) { vis[gondolaSeq[i]] = true; } int ans = 0; for (int i = 1; i <= mx; ++i) { if (!vis[i]) { replacementSeq[ans++] = i; } } return ans; } //---------------------- 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...