Submission #1147656

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147656		ChuanChen	Gondola (IOI14_gondola)	C++20	55 / 100	12 ms	2112 KiB

gondola

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

#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;

int valid(int n, int inputSeq[]){
	vector<bool> marc(250'500, false);
	int u = -1;
	for(int i = 0; i < n; i++){
		if(marc[inputSeq[i]]) return 0;
		marc[inputSeq[i]] = true;
	}

	for(int i = 0; i < n; i++) if(inputSeq[i] <= n){
		u = i;
		break;
	}
	if(u == -1) return 1;

	int dif = (inputSeq[u]-u+n)%n;
	for(int i = 0; i < n; i++) if(inputSeq[i] <= n){
		if((inputSeq[i]-i+n)%n != dif) return 0;
	}
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	vector<pii> mod; //
	int dif = 0;
	for(int i = 0; i < n; i++) if(gondolaSeq[i] <= n){
		dif = (gondolaSeq[i]-i+n)%n;
		break;
	}

	for(int i = 0; i < n; i++) if(gondolaSeq[i] > n){
		int p = (i+dif+n)%n;
		if(p == 0) p = n;
		mod.emplace_back(gondolaSeq[i], p);
	}
	sort(mod.begin(), mod.end());

	int nxt = n+1, rid = 0; //nxt = next gondola to be used, if we replace any
	for(pii no : mod){
		replacementSeq[rid++] = no.ss;
		nxt++;
		while(nxt <= no.ff){
			replacementSeq[rid++] = nxt-1;
			nxt++;
		}
	}
	return rid;
}

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

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: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10