제출 #285533

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
285533		emanIaicepsa	Gondola (IOI14_gondola)	C++14	20 / 100	13 ms	1280 KiB

gondola

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

int valid(int n, int inputSeq[]){
	for(int i=0;i<n;i++) inputSeq[i]--;
	vector<bool> used(250000);
	int pos0 = -1;
	for(int i=0;i<n;i++){
		if(inputSeq[i] < n) pos0 = (i - inputSeq[i] + n) % n;
		if(used[inputSeq[i]]) return 0;
		used[inputSeq[i]] = 1;
	}
	if(pos0 == -1) return 1;
	for(int i=0;i<n;i++){
		if(inputSeq[i] < n){
			if((pos0 + inputSeq[i]) % n != i) return 0;
		}
	}
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	vector<int> pos(250000, -1);
	int mx = 0;
	for(int i=0;i<n;i++) gondolaSeq[i]--, pos[gondolaSeq[i]] = i, mx = max(mx, gondolaSeq[i]);
	int pos0 = 0, ans = 0;
	for(int i=0;i<n;i++){
		if(gondolaSeq[i] < n) pos0 = (i - gondolaSeq[i] + n) % n;
	}
	/* for(int i=0;i<2*n;i++) cout<<pos[i]<<'\n'; */ 
	int prev = n;
	for(int i=n;i<=mx;i++){
		if(pos[i] != -1){
			replacementSeq[ans++] = (pos[i] - pos0 + n) % n + 1;
			for(int j=prev;j<=i;j++) replacementSeq[ans++] = j + 1;
			prev = i+1;
		}
	}
	return ans;
}

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

• 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