제출 #73243

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73243		TuGSGeReL	곤돌라 (IOI14_gondola)	C++14	5 / 100	1077 ms	2876 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
#define ll int
#define mp make_pair
#define pub push_back
#define pob pop_back
#define ss second
#define ff first
#define ext exit(0)
using namespace std;
ll i,j,z=0;
vector<ll> v,vc;
map<ll,ll>m;
int valid(int n, int inputSeq[])
{
	for(i=0;i<n;i++){
		if(m[inputSeq[i]]==1) return 0;
		m[inputSeq[i]]++;
	}
	for(i=0;i<n;i++){
		if(inputSeq[i]<n) v.pub(inputSeq[i]);
		else v.pub(0);
	}
	for(i=0;i<n;i++){
		if(v[i]>0){
			int x=v[i]-1;
			j=i-1;
			if(j==-1) j+=n;
			while(x>0){
				if(v[j]==0){
					if(v[j]!=x) return 0;
				}
				v[j]=x;
				x--;
				j--;
				if(j==-1) j=n-1;
			}
		}
	}
	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: 0 / 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