Submission #1250810

#TimeUsernameProblemLanguageResultExecution timeMemory
1250810hmms127Gondola (IOI14_gondola)C++20
30 / 100
6 ms584 KiB
#include <bits/stdc++.h> #include "gondola.h" #define pb push_back using namespace std; int valid(int n, int a[]) { int idx; for(int i=0;i<n;i++){ if(a[i]==1){idx=i;break;} } int sm=0; for(int i=idx;i<n;i++)sm+=a[i]; int sz=n-idx; return (sm==sz*(sz+1)/2); } //---------------------- int replacement(int n, int a[], int replacementSeq[]) { int frq[n+1]={},cnt=0; for(int i=0;i<n;i++)frq[a[i]]++; for(int i=1;i<=n;i++){ if(frq[i]==0){ replacementSeq[0]=i; cnt++; break; } } return cnt; } //---------------------- int countReplacement(int n, int a[]) { int cnt=0,mx=0; for(int i=0;i<n;i++){ cnt+=(a[i]>n); mx=max(mx,a[i]); } return (cnt==3 ? 1:(cnt==2&&mx==n+3 ? 2:1)); }
#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...