Submission #212649

#	Time	Username	Problem	Language	Result	Execution time	Memory
212649		mohamedsobhi777	곤돌라 (IOI14_gondola)	C++14	25 / 100	18 ms	1792 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std ; 

const int N = 3e5 + 7 ; 

int valid(int n, int inputSeq[]){

    vector<int> vis(N , 0) ; 
    int cur = inputSeq[0] -1  ; 
    for(int i = 0 ; i < n; i++){
        if(vis[inputSeq[i]]++)return 0 ; 
        if(--inputSeq[i]!=cur)
            return 0 ; 
        cur = (cur+1) %n ; 
    }
    return 1 ; 
}

int ab[N] ; 

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    priority_queue<int> q ;
    int mx = 0 ;
    for(int i = 0 ; i< n;i ++){
        q.push(gondolaSeq[i] ) ;
        ab[gondolaSeq[i]] = -1 ;  
        mx = max(mx , gondolaSeq[i]) ; 
    }
    int cur = 0 ; 
    int cabs = mx ;

    while(q.size()){
        int tp = q.top() ; 
        if(tp==n)break;
        while(ab[cabs]==-1){
            cabs--; 
        }
        replacementSeq[cur++] = cabs ; 
        q.pop() ; 
        q.push(cabs) ; 
        cabs-- ; 
    }
    reverse(replacementSeq , replacementSeq + cur) ; 
    return cur ; 
}

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

• 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