Submission #254509

#	Time	Username	Problem	Language	Result	Execution time	Memory
254509		b00n0rp	곤돌라 (IOI14_gondola)	C++17	20 / 100	12 ms	640 KiB

gondola

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

#define ll long long

int valid(int n, int inputSeq[]){
	for(int i = 0; i < n; i ++){
		// cout << i << " " << inputSeq[i] << " " << inputSeq[(i+1)%n] << endl;
		if(inputSeq[(i+1)%n]-inputSeq[i] != 1 and inputSeq[(i+1)%n]-inputSeq[i] != 1-n) return 0;
	}
	return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

//----------------------

const ll MOD = 1000000009;

int countReplacement(int n, int inputSeq[]){
	int mx = inputSeq[0],mn = inputSeq[0];
	for(int i = 1; i < n; i ++){
		mx = max(mx,inputSeq[i]);
		mn = min(mn,inputSeq[i]);
	}
	if(mn > n){
		ll ans = 1;
		for(int i = 1; i <= n; i ++){
			ans = (ans*i)%MOD;
		}
		return ans;
	}
	else assert(0 == 1);
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 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