Submission #122688

#	Time	Username	Problem	Language	Result	Execution time	Memory
122688		brcode	Gondola (IOI14_gondola)	C++14	0 / 100	2 ms	504 KiB

gondola

#include <iostream>
#include <algorithm>
#include <map>
#include "gondola.h"

using namespace std;
int arr[2500];
int valid(int n, int inputSeq[]){
    map<int,int> m1;
    int holdmin = 1e9;
    int ind = 0;
    for(int i=0;i<n;i++){
        if(m1[inputSeq[i]] == 1){
            return 0;
            
        }
        if(inputSeq[i]<holdmin){
            holdmin = inputSeq[i];
            ind = i;
        }
        m1[inputSeq[i]] = 0;
    }
    
    for(int i=ind;i<n;i++){
        if(inputSeq[i]<=n && inputSeq[i]!=holdmin){
            return 0;
        }
        holdmin++;
    }
    
    for(int i=1;i<holdmin;i++){
        if(inputSeq[i]<=n && inputSeq[i]!=holdmin){
            return 0;
        }
        holdmin++;
    }
    return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
  return 0;
}
int countReplacement(int n, int inputSeq[]){
  return 0;
}

/*int main(){
    
}*/

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10