제출 #122703

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
122703		brcode	Gondola (IOI14_gondola)	C++14	25 / 100	57 ms	4816 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]] = 1;
    }
   
    for(int i=ind;i<n;i++){
        if(inputSeq[i]<=n && inputSeq[i]!=holdmin){
            return 0;
        }
        holdmin++;
    }
    if(ind == 0){
        return 1;
    }
    
    for(int i=0;i<ind;i++){
        if(inputSeq[i]<=n && inputSeq[i]!=holdmin){
           // cout<<inputSeq[i]<<endl;
            return 0;
        }
        holdmin++;
    }
    return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    map<int,int> m1;
   int holdmax = 0;
   for(int i=0;i<n;i++){
       holdmax = max(holdmax,gondolaSeq[i]);
       m1[gondolaSeq[i]]++;
   }
   int ans = holdmax-n;
   int cntr = 0;
   for(int i=1;i<=holdmax;i++){
       if(!m1[i]){
           replacementSeq[cntr] = i;
          // cout<<replacementSeq[cntr]<<endl;
           cntr++;
       }
   }
   return ans;
}
int countReplacement(int n, int inputSeq[]){
  return 0;
}

/*int main(){
    int arr[8] = {3, 1, 4};
    int arr2[45];
    cout<<replacement(3,arr,arr2)<<endl;
}*/

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 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