Submission #842640

#TimeUsernameProblemLanguageResultExecution timeMemory
842640WarinchaiGondola (IOI14_gondola)C++14
10 / 100
23 ms5248 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; int valid(int n, int s[]) { map<int,int>mp; int prev=0,count=0; int first=0; for(int i=0;i<n;i++){ mp[s[i]]++; if(mp[s[i]]>1){ return 0; } if(s[i]<=n){ if(first==0){ first=s[i]; } if(s[i]<prev){ count++; } prev=s[i]; } } if(first<prev){ count++; } if(count>1){ return 0; } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- 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...