Submission #50716

#TimeUsernameProblemLanguageResultExecution timeMemory
50716TalantGondola (IOI14_gondola)C++17
5 / 100
3 ms732 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; const int N = 2e6 + 5; int u[N],mx; int id; int valid(int n, int inputSeq[]) { return -1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { for (int i = 0; i < n; i ++) { mx = max(mx,gondolaSeq[i]); u[gondolaSeq[i]] = 1; } for (int i = 1; i <= mx; i ++) { if (!u[i]) replacementSeq[id ++] = i; } return id; } //---------------------- 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...