제출 #50733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
50733		antimirage	Gondola (IOI14_gondola)	C++17	20 / 100	14 ms	1532 KiB

gondola

#include "gondola.h"

#include <bits/stdc++.h>

#define fr first
#define sc second
#define mk make_pair
#define pb emplace_back
#define all(s) s.begin(), s.end()

const int N = 1e5 + 5;

int mp[N];

int valid(int n, int ar[])
{
    for (int i = 1; i < n; i++)
    {
        mp[ar[i]]++;
        if (ar[i] < 1 || mp[ ar[i] ] > 1) return 0;
        if (ar[i] > n) continue;
        if (ar[i - 1] <= n && ar[i - 1] % n + 1 != ar[i]) return 0;
    }
    if (ar[0] <= n && ar[n - 1] <= n && ar[n - 1] % n + 1 != ar[0]) 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