제출 #702535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
702535		jamezzz	곤돌라 (IOI14_gondola)	C++17	25 / 100	27 ms	4520 KiB

gondola

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

int valid(int n,int inputSeq[]){
	int offset=-1;
	set<int> s;
	for(int i=0;i<n;++i){
		if(s.find(inputSeq[i])!=s.end())return 0;
		s.insert(inputSeq[i]);
		if(inputSeq[i]<=n){
			if(offset==-1)offset=(inputSeq[i]-i+n)%n;
			else if(offset!=(inputSeq[i]-i+n)%n)return 0;
		}
	}
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	set<int> changed;
	map<int,int> pos;
	int offset=-1,dummy=0,cur=0;
	int mx=0;
	for(int i=0;i<n;++i){
		if(gondolaSeq[i]<=n)offset=(gondolaSeq[i]-1-i+n)%n;
		else{
			changed.insert(gondolaSeq[i]);
			dummy=i;
		}
		mx=max(mx,gondolaSeq[i]);
	}
	for(int i=0;i<n;++i){
		if(gondolaSeq[i]>n){
			pos[gondolaSeq[i]]=(i+offset)%n+1;
		}
	}
	cur=(dummy+offset)%n+1;
	int ori=cur;
	for(int i=n+1;i<=mx;++i){
		if(changed.find(i)==changed.end()||pos[i]==ori){
			replacementSeq[i-n-1]=cur;
			cur=i;
		}
		else{
			replacementSeq[i-n-1]=pos[i];
			assert(pos[i]!=0);
		}
	}
	return mx-n;
}

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

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

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