Submission #72859

#	Time	Username	Problem	Language	Result	Execution time	Memory
72859		nvmdava	곤돌라 (IOI14_gondola)	C++17	10 / 100	63 ms	5100 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int ord[100001];
map<int, int> in;
int valid(int n, int inputSeq[])
{
	int i;
	for(i = 0; i < n; i++){
		if(inputSeq[i] <= n) break;
	}
	if(i == n) return 1;
	int k = inputSeq[i] - 1;
	for(int j = 0; j < n; j++){
		ord[(k + j) % n] = inputSeq[(i + j) % n];
		if(in[inputSeq[(i + j) % n]]) return 0;
		in[inputSeq[(i + j) % n]] = 1;
	}
	for(i = 0; i < n; i++){
		if((ord[i] != i + 1 && ord[i] <= n) || ord[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