Submission #588851

#	Time	Username	Problem	Language	Result	Execution time	Memory
588851		proma	Gondola (IOI14_gondola)	C++17	25 / 100	9 ms	596 KiB

gondola

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

using namespace std;

int valid(int n, int inputSeq[])
{
    int flag = 1;
    for (int i = 1; i < n; i ++) {
        if (inputSeq[i] != inputSeq[i-1] + 1) {
            if (inputSeq[i] != 1) flag = 0;
        }
    }
    return flag;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int mx = 0;
    set <int> s;
    for (int i = 0; i < n; i ++) {
        mx = max(mx, gondolaSeq[i]);
        s.insert(gondolaSeq[i]);
    }
    int pos = 0;
    for (int i = 1; i <= mx; i ++) {
        if (s.find(i) == s.end()) {
            replacementSeq[pos ++] = i;
        }
    }
    return pos;
}

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

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