Submission #978363

#	Time	Username	Problem	Language	Result	Execution time	Memory
978363		Amaarsaa	곤돌라 (IOI14_gondola)	C++14	0 / 100	1 ms	512 KiB

gondola

#include<bits/stdc++.h>
#include "gondola.h"
 
using namespace std;
int Can(int n, int a[]) {
	sort ( a , a + n);
	for (int i = 1; i < n; i ++) if ( a[i]== a[i - 1]) return 0;
	return 1;
}
int valid(int n, int a[]) {
	int cnt = 0, mn = n + 1, ind = 0;
	if (!Can(n, a)) return 0;
	for (int i = 0; i < n; i ++) {
		if ( a[i] <=n) {
			cnt ++;
			if ( mn >= a[i]) {
				mn = a[i];
				ind = i;
			}
		}
	}
	if ( cnt == 0) return 1;
	int last = a[ind];
	cnt --;
	for (int j = 0; j < n; j ++) {
		if (a[ind] <= n &&  a[ind] > last) {
			last = a[ind];
			cnt --;
		}
		ind = (ind + 1) % n;
	}
	if ( cnt == 0) return 1;
	return 0;
}
 
//----------------------
 
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}
 
//----------------------
 
int countReplacement(int n, int inputSeq[])
{
  return -3;
}

• Subtask 1: 0 / 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