제출 #422244

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
422244		Ozy	곤돌라 (IOI14_gondola)	C++17	20 / 100	28 ms	5736 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define lli long long int
#define debugsl(a) cout << #a << " = " << a << ", "
#define debug(a) cout << #a << " = " << a << endl

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

    unordered_map<lli,lli> mapa;
    lli ult = -1;
    lli val = -1;
    bool res,iguales = false;

    rep(i,0,n-1) {
        if (inputSeq[i] <= n) {
            ult = i;
            val = inputSeq[i];
        }
        
        if (mapa[inputSeq[i]] == 1) {iguales = true; break;}
        else mapa[inputSeq[i]] = 1;
    }
    if (iguales) return 0;
    if (ult == -1) return 1;

    val -= ult;
    if(val < 1) val += n;

    res = true;
    rep(i,0,n-1) {
        if (inputSeq[i] <= n){
            if (inputSeq[i] != val) {res = false; break;}
        }
        val++;
        if (val > n) val = 1;
    }

    return res;
}

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

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

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

• 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