oj.uz

Submission #114375

# Submission time Handle Problem Language Result Execution time Memory
114375 2019-06-01T06:34:53 Z E869120 Gondola (IOI14_gondola) C++14
55 / 100
 52 ms 4728 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]) {
	int minx = (1 << 30), minid = -1; map<int, int>Map;
	for (int i = 0; i < n; i++) { if (minx > inputSeq[i]) { minx = inputSeq[i]; minid = i; } if (Map[inputSeq[i]] == 1) return 0; Map[inputSeq[i]] = 1;}
	for (int i = 0; i < n; i++) {
		int s = (i + minid) % n;
		if (inputSeq[s] <= n && inputSeq[s] != i + 1) return 0;
	}
	return 1;
}

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

int id[250009];

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	int G = 0; for (int i = 0; i < n; i++) { if (gondolaSeq[i] <= n) G = (i - (gondolaSeq[i] - 1) + n) % n; }
	
	int maxn = 0;
	for (int i = 0; i <= 250000; i++) id[i] = -1;
	for (int i = 0; i < n; i++) { id[gondolaSeq[i]] = (i - G + n) % n; maxn = max(maxn, gondolaSeq[i]); }
	
	for (int i = 0; i < n; i++) gondolaSeq[i] = i + 1;
	for (int i = n + 1; i <= maxn; i++) {
		if (id[i] >= 0) {
			replacementSeq[i - (n + 1)] = gondolaSeq[id[i]];
			gondolaSeq[id[i]] = i;
		}
		else {
			replacementSeq[i - (n + 1)] = gondolaSeq[id[maxn]];
			gondolaSeq[id[maxn]] = i;
		}
	}
	return maxn - n;
}

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

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 384 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 17 ms 2304 KB Output is correct
7 Correct 11 ms 640 KB Output is correct
8 Correct 30 ms 3960 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 39 ms 4600 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 384 KB Output is correct
6 Correct 16 ms 2176 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 30 ms 3960 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 39 ms 4472 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 20 ms 2176 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 52 ms 4728 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1280 KB Output is correct
2 Correct 30 ms 1344 KB Output is correct
3 Correct 2 ms 1280 KB Output is correct
4 Correct 3 ms 1280 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1280 KB Output is correct
2 Correct 3 ms 1280 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 3 ms 1280 KB Output is correct
5 Correct 6 ms 1280 KB Output is correct
6 Correct 3 ms 1280 KB Output is correct
7 Correct 3 ms 1280 KB Output is correct
8 Correct 3 ms 1280 KB Output is correct
9 Correct 3 ms 1408 KB Output is correct
10 Correct 3 ms 1408 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1280 KB Output is correct
2 Correct 3 ms 1280 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 3 ms 1280 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 2 ms 1280 KB Output is correct
7 Correct 2 ms 1280 KB Output is correct
8 Correct 3 ms 1328 KB Output is correct
9 Correct 3 ms 1408 KB Output is correct
10 Correct 3 ms 1412 KB Output is correct
11 Correct 9 ms 1532 KB Output is correct
12 Correct 12 ms 1664 KB Output is correct
13 Correct 11 ms 2176 KB Output is correct
14 Correct 12 ms 2076 KB Output is correct
15 Correct 19 ms 3192 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -