Submission #1146205

#TimeUsernameProblemLanguageResultExecution timeMemory
1146205enzyGondola (IOI14_gondola)C++20
15 / 100
6 ms584 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; const int maxn=3e5+10; int valid(int n, int v[]) { int val=v[0]; for(int i=1;i<n;i++){ val++; val%=(n+1); if(!val) val++; if(v[i]>n) continue; if(val!=v[i]) return 0; } return 1; } int marc[maxn]; int replacement(int n, int v[], int resp[]) { int maior=1; for(int i=0;i<n;i++) maior=max(maior,v[i]); for(int i=1;i<=maior;i++) marc[i]=0; for(int i=0;i<n;i++) marc[v[i]]++; int id=0; for(int i=1;i<=maior;i++){ if(!marc[i]){ resp[id]=i; id++; } } 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...