Submission #1360499

#	Time	Username	Problem	Language	Result	Execution time	Memory
1360499		lizi14	곤돌라 (IOI14_gondola)	C++20	10 / 100	21 ms	4904 KiB

gondola

#include <bits/stdc++.h>
using namespace std;
#include "gondola.h"
int inputSeq[10000];
int valid(int n, int inputSeq[]){
    int hi=0;
    vector<int>v;
    set<int>s;
    for(int i=0; i<n; i++){
        if(inputSeq[i]<=n)v.push_back(inputSeq[i]);
        if(s.find(inputSeq[i])!=s.end()){
            hi=1;
        }
        s.insert(inputSeq[i]);
    }
    for(int i=1; i<n; i++){
        if(v[i-1]==1)continue;
        if(v[i]==1){
            continue;
        }
        if(v[i]==v[i-1]+1)continue;
        hi=1;
    }
    if(hi==1)return false;
    else return true;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    return 0;
}

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

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