Submission #586207

#	Time	Username	Problem	Language	Result	Execution time	Memory
586207		Tekor	Gondola (IOI14_gondola)	C++17	5 / 100	1 ms	212 KiB

gondola

#include "gondola.h"

#include <bits/stdc++.h>
using namespace std;
#define pii pair <int,int>
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(),v.end()
int valid(int n, int a[]) {
	int c[n + 1];
	for(int i = 0;i < n;i++) {
		if(a[i] <= n) {
			int tek = a[i];
			for(int j = i + 1;j < n;j++) {
				tek++;
				if(tek == n + 1)tek = 1;
				c[j] = tek;
			}
			for(int j = 0;j < i;j++) {
				tek++;
				if(tek == n + 1)tek = 1;
				c[j] = tek;
			}
			break;
		}
	}
	for(int i = 0;i < n;i++) {
		if(a[i] <= n && c[i] != a[i])return 0;
	}
	return 1;
}

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

int replacement(int n, int a[], int b[]) {
	int c[n + 1];
	bool ch = 0;
	for(int i = 0;i < n;i++) {
		if(a[i] <= n) {
			int tek = a[i];
			for(int j = i + 1;j < n;j++) {
				tek++;
				if(tek == n + 1)tek = 1;
				c[j] = tek;
			}
			for(int j = 0;j < i;j++) {
				tek++;
				if(tek == n + 1)tek = 1;
				c[j] = tek;
			}
			ch = 1;
			break;
		}
	}
	if(!ch) {
		for(int i = 0;i < n;i++) {
			c[i] = i + 1;
		}
	}
	set <pii> g;
	for(int i = 0;i < n;i++) {
		if(a[i] > n)g.insert(mp(a[i],i));
	}
	int k = 0;
	int cnt = n + 1;
	while(!g.empty()) {
		pii vv = *(g.begin());
		int val = vv.f,bilo = c[vv.s];
		while(1) {
			b[k++] = bilo;
			if(cnt == val)break;
			bilo = cnt++;
		}
		g.erase(vv);
	}
	return k;
}
/*
4
2
3 2

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

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