제출 #1008948

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1008948		hotboy2703	곤돌라 (IOI14_gondola)	C++14	20 / 100	18 ms	4652 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
using ll = int;
#define pll pair <ll,ll>
#define fi first
#define se second
#define MP make_pair
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL << (i))

int valid(int n, int a[])
{
    set <ll> s;
    for (ll i = 0,expected = -n;i < n;i ++,expected=expected+1>n?1:expected+1){
        if (s.insert(a[i]).se==0)return 0;
        if (a[i] > n)continue;
        if (expected < 0)expected = a[i];
        if (expected != a[i])return 0;
    }
    return 1;
}

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

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