제출 #819023

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

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
#define SETIO cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false);
#define fi first
#define se second
#define pb push_back
#define SORT(v) sort(begin(v),end(v))
#define REV(v) reverse(begin(v),end(v))
#define FORI(v) for(auto i:v)
#define REP(i,o,n) for(int i=o;i<n;i++)


int valid(int n, int inputSeq[])
{
  int cur=-1;
  REP(i,0,n) {
    if(cur!=-1)cur++;
    if(cur==n+1)cur=1;
    if(inputSeq[i]>n)continue;
    if(cur!=-1)if(cur!=inputSeq[i])return 0;
    cur=inputSeq[i];
  }
  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