Submission #739271

#	Time	Username	Problem	Language	Result	Execution time	Memory
739271		NeroZein	Gondola (IOI14_gondola)	C++17	45 / 100	11 ms	4544 KiB

gondola

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

const int M = (int) 1e6 + 1;
const int md = (int) 1e9 + 9; 

int mx; 
bitset<M> vis;

int valid(int n, int inputSeq[]) {
	for (int i = 0; i < n; ++i) {
		if (vis[inputSeq[i]] == true) {
			return false; 
		}
		mx = max(mx, inputSeq[i]);
		vis[inputSeq[i]] = true;
	}
	function<bool(int, int, int)> Go = [&](int id, int cur, int step) {
		if (id < 0 || id >= n) {
			return true; 
		}
		if (cur == 0) cur = n; 
		if (cur == n + 1) cur = 1; 
		if (inputSeq[id] <= n && inputSeq[id] != cur) {
			return false; 
		}
		return Go(id + step, cur + step, step); 
	}; 
	bool ret = true; 
  for (int i = 0; i < n; ++i) {
		if (inputSeq[i] <= n) {
			ret &= Go(i, inputSeq[i], 1);
			vis[inputSeq[i]] = 0;  
			ret &= Go(i, inputSeq[i], -1); 
			break; 
		}
	}
	return ret;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
  for (int i = 0; i < n; ++i) {
		mx = max(mx, gondolaSeq[i]); 
	}
	for (int i = 0; i < n; ++i) {
		vis[gondolaSeq[i]] = true; 
	}  
	int ans = 0; 
	for (int i = 1; i <= mx; ++i) {
		if (!vis[i]) {
			replacementSeq[ans++] = i;  
		}
	}
	return ans; 
}

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

int countReplacement(int n, int inputSeq[]) {
  if (!valid(n, inputSeq)) {
		return 0; 
	}
	int ans = 1;
	int cnt = 0;  
	for (int i = mx; i > n; --i) {
		if (vis[i]) {
			cnt++; 
			continue; 
		}
		ans = (long long) ans * cnt % md; 
	}
	return ans; 
}

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