제출 #599399

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
599399		AriaH	곤돌라 (IOI14_gondola)	C++17	10 / 100	9 ms	644 KiB

gondola

#include "gondola.h"
#pragma GCC optimize("O3")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;
typedef pair < ll, ll > pll;

#define F first
#define S second
#define all(x) x.begin(), x.end()
#define SZ(x) (int)x.size()
#define Mp make_pair
#define endl "\n"
#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

const int N = 1e6 + 10;
const int LOG = 20;
const ll mod = 1e9 + 7;
const ll inf = 8e18;

int valid(int n, int inputSeq[])
{
  int id = -1;
  for(int i = 0; i < n; i ++)
  {
    if(inputSeq[i] <= n)
    {
      id = i;
    }
  }
  if(id == -1) return 0;
  int start = (id - (inputSeq[id] - 1) + n + n) % n;
  for(int i = 0; i < n; i ++)
  {
    int j = (i + start) % n;
    if(inputSeq[j] > n) continue;
    if(inputSeq[j] != i + 1)
    {
      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: 0 / 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