Submission #444212

#	Time	Username	Problem	Language	Result	Execution time	Memory
444212		FEDIKUS	Gondola (IOI14_gondola)	C++17	20 / 100	12 ms	636 KiB

gondola

#include "gondola.h"

#include<bits/stdc++.h>

using namespace std;

const int maxn=2.5e5+10;
bool imam[maxn];

int valid(int n, int inputSeq[]){
    int tren=-1;
    for(int i=0;i<n;i++){
        if(imam[inputSeq[i]]) return 0;
        imam[inputSeq[i]]=true;
        if(inputSeq[i]>n){
            if(tren!=-1) tren++;
            continue;
        }
        if(tren==-1) tren=inputSeq[i];
        else{
            if(inputSeq[i]!=tren) return 0;
        }
        tren++;
        if(tren>n) tren=1;
    }
    return 1;
}

//----------------------

int treba[maxn];

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    int l=0;
    int tren=-1;
    int maxi=INT_MIN;
    for(int i=0;i<n;i++) maxi=max(maxi,gondolaSeq[i]);
    for(int j=0;j<2*n;j++){
        int i=j%n;
        if(gondolaSeq[i]>n){
            if(tren!=-1) treba[gondolaSeq[i]]=tren;
            continue;
        }
        if(tren==-1) tren=gondolaSeq[i];
        tren++;
        if(tren>n) tren=1;
    }

    return l;
}

//----------------------

int countReplacement(int n, int inputSeq[])
{
  return -3;
}
/*
2
6
3 4 5 6 1 2
*/

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