Submission #433414

#	Time	Username	Problem	Language	Result	Execution time	Memory
433414		muhammad_hokimiyon	Gondola (IOI14_gondola)	C++14	15 / 100	35 ms	1100 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

int valid(int n, int inputSeq[])
{
        int st = 0;
        for(int i = 0; i < n; i++){
                if(inputSeq[i] == 1)st = i;
        }
        for(int it = 0; it < n - 2; it++){
                int p = (it + st) % n;
                int nx = (it + 1 + st) % n;
                if(inputSeq[p] > n || inputSeq[nx] > n){
                        continue;
                }
                if(inputSeq[nx] - inputSeq[p] != 1){
                        return 0;
                }
        }
        return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
        int mx = 0;
        for(int i = 0; i < n; i++)mx = max(mx, gondolaSeq[i]);
        vector<int> used(mx + 1, 0);
        for(int i = 0; i < n; i++)used[gondolaSeq[i]] = 1;
        int l = 0;
        for(int i = 1; i <= mx; i++){
                if(!used[i]){
                        replacementSeq[l++] = i;
                }
        }
        return l;
}

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

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

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