# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
118826 | 2019-06-19T22:48:26 Z | ly20 | Gondola (IOI14_gondola) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> using namespace std; const int INF=1123456789; map<int,int> vld; #include "gondola.h" int valid(int n,int seq[]) { int mn=INF,at=INF,at2=INF; int st=0; bool vl=1; for(int i=0;i<n;i++) { if(vld[seq[i]]>0)vl=0; vld[seq[i]]++; if(st==0) { if(seq[i]>n)continue; if(seq[i]<at && at==INF) { at=seq[i];mn=seq[i]; } else if(seq[i]<at) { at2=seq[i];st=1; if(at2>min)vl=0; } else at=seq[i]; } else { if(seq[i]>n)continue; if(seq[i]<at2 || seq[i]>mn || seq[i]>at)vl=0; at2=seq[i]; } } return vl; } int replacement(int n,int gondolaseq[],int replacementseq[]) { return 0; } int countReplacement(int n,int inputSeq[]) { return 0; }