답안 #106693

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
106693	2019-04-19T17:23:33 Z	tincamatei	곤돌라 (IOI14_gondola)	C++14	100 / 100	39 ms	2548 KB

gondola

#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100000;
const int MOD = 1000000009;

int valid(int n, int inputSeq[]) {
	int fixed = -1;

	vector<int> aux(MAX_N, 0);

	for(int i = 0; i < n; ++i)
		if(inputSeq[i] <= n)
			fixed = i;
	
	for(int i = 0; i < n; ++i)
		aux[i] = inputSeq[i];
	
	sort(aux.begin(), aux.begin() + n);
	for(int i = 0; i < n - 1; ++i) // All gondolas must be distinct
		if(aux[i] == aux[i + 1])
			return false;

	if(fixed == -1) // All gondolas have been replaced
		return true;
	
	for(int i = 0; i < n; ++i) {
		int expected = (inputSeq[fixed] + i - 1) % n + 1;
		int expectedPos = (fixed + i) % n;
		if(!(inputSeq[expectedPos] == expected || inputSeq[expectedPos] > n))
			return false;
	}
	return true;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	int top = 0, lastVal = n;
	int fixed = -1;

	vector<pair<int, int> > aux;

	for(int i = 0; i < n; ++i) {
		if(gondolaSeq[i] > n)
			aux.push_back(make_pair(gondolaSeq[i], i));
		else
			fixed = i;
	}

	sort(aux.begin(), aux.end());

	for(auto it: aux) {
		int expectedVal;
		if(fixed != -1)
			expectedVal = (gondolaSeq[fixed] + it.second - fixed + 2 * n - 1) % n + 1;
		else
			expectedVal = it.second + 1;
		
		replacementSeq[top++] = expectedVal;
		++lastVal;
		
		while(lastVal < it.first) {
			replacementSeq[top++] = lastVal;
			lastVal++;
		}
	}

	return top;
}

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

int lgputm(int a, int b) {
	int ac = 1;
	while(b > 0) {
		if(b % 2 == 1)
			ac = (long long)ac * a % MOD;
		a = (long long)a * a % MOD;
		b /= 2;
	}
	return ac;
}

int countReplacement(int n, int inputSeq[]) {
	if(!valid(n, inputSeq)) // ayyyy lmao
		return 0;
	
	int rez = 1, rem, lastVal = n, fixed = -1;

	vector<int> aux;

	for(int i = 0; i < n; ++i)
		if(inputSeq[i] > n)
			aux.push_back(inputSeq[i]);
		else
			fixed = i;

	sort(aux.begin(), aux.end());
	rem = aux.size();

	for(auto it: aux) {
		rez = (long long)rez * lgputm(rem, it - lastVal - 1) % MOD;
		lastVal = it;
		rem--;
	}

	if(fixed == -1)
		rez = (long long) rez * n % MOD;

	return rez;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	768 KB	Output is correct
2	Correct	3 ms	768 KB	Output is correct
3	Correct	2 ms	768 KB	Output is correct
4	Correct	3 ms	768 KB	Output is correct
5	Correct	3 ms	768 KB	Output is correct

Subtask #2
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	768 KB	Output is correct
2	Correct	2 ms	768 KB	Output is correct
3	Correct	2 ms	768 KB	Output is correct
4	Correct	3 ms	768 KB	Output is correct
5	Correct	2 ms	768 KB	Output is correct
6	Correct	11 ms	816 KB	Output is correct
7	Correct	17 ms	1152 KB	Output is correct
8	Correct	18 ms	1024 KB	Output is correct
9	Correct	6 ms	896 KB	Output is correct
10	Correct	19 ms	1024 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	768 KB	Output is correct
2	Correct	3 ms	768 KB	Output is correct
3	Correct	2 ms	768 KB	Output is correct
4	Correct	3 ms	768 KB	Output is correct
5	Correct	2 ms	768 KB	Output is correct
6	Correct	10 ms	896 KB	Output is correct
7	Correct	18 ms	1024 KB	Output is correct
8	Correct	14 ms	1024 KB	Output is correct
9	Correct	7 ms	768 KB	Output is correct
10	Correct	23 ms	1024 KB	Output is correct
11	Correct	2 ms	768 KB	Output is correct
12	Correct	2 ms	768 KB	Output is correct
13	Correct	11 ms	896 KB	Output is correct
14	Correct	2 ms	768 KB	Output is correct
15	Correct	18 ms	1024 KB	Output is correct

Subtask #4
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct

Subtask #5
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	356 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	3 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	3 ms	384 KB	Output is correct

Subtask #6
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	10 ms	640 KB	Output is correct
12	Correct	14 ms	640 KB	Output is correct
13	Correct	16 ms	1296 KB	Output is correct
14	Correct	11 ms	640 KB	Output is correct
15	Correct	24 ms	2296 KB	Output is correct

Subtask #7
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	768 KB	Output is correct
2	Correct	2 ms	768 KB	Output is correct
3	Correct	2 ms	768 KB	Output is correct

Subtask #8
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	768 KB	Output is correct
2	Correct	3 ms	768 KB	Output is correct
3	Correct	3 ms	768 KB	Output is correct
4	Correct	2 ms	768 KB	Output is correct
5	Correct	3 ms	768 KB	Output is correct
6	Correct	2 ms	768 KB	Output is correct
7	Correct	2 ms	768 KB	Output is correct
8	Correct	2 ms	768 KB	Output is correct

Subtask #9
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	768 KB	Output is correct
2	Correct	2 ms	668 KB	Output is correct
3	Correct	3 ms	640 KB	Output is correct
4	Correct	3 ms	768 KB	Output is correct
5	Correct	3 ms	768 KB	Output is correct
6	Correct	0 ms	768 KB	Output is correct
7	Correct	3 ms	768 KB	Output is correct
8	Correct	3 ms	768 KB	Output is correct
9	Correct	30 ms	1136 KB	Output is correct
10	Correct	20 ms	1016 KB	Output is correct
11	Correct	9 ms	768 KB	Output is correct
12	Correct	11 ms	896 KB	Output is correct
13	Correct	5 ms	768 KB	Output is correct

Subtask #10
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	768 KB	Output is correct
2	Correct	3 ms	768 KB	Output is correct
3	Correct	2 ms	768 KB	Output is correct
4	Correct	3 ms	768 KB	Output is correct
5	Correct	2 ms	768 KB	Output is correct
6	Correct	3 ms	768 KB	Output is correct
7	Correct	2 ms	768 KB	Output is correct
8	Correct	3 ms	768 KB	Output is correct
9	Correct	26 ms	1136 KB	Output is correct
10	Correct	20 ms	1024 KB	Output is correct
11	Correct	14 ms	768 KB	Output is correct
12	Correct	14 ms	768 KB	Output is correct
13	Correct	4 ms	768 KB	Output is correct
14	Correct	30 ms	2288 KB	Output is correct
15	Correct	39 ms	2548 KB	Output is correct
16	Correct	9 ms	1024 KB	Output is correct
17	Correct	30 ms	1784 KB	Output is correct
18	Correct	17 ms	1272 KB	Output is correct

답안 #106693

Compilation message