oj.uz

Submission #625893

# Submission time Handle Problem Language Result Execution time Memory
625893 2022-08-11T01:03:43 Z as111 Gondola (IOI14_gondola) C++14
20 / 100
 14 ms 632 KB 
#include "gondola.h"
#include <iostream>
#include <set>
#include <algorithm>

#define MAXN 100000

using namespace std;

int valid(int n, int inputSeq[]) {
	int start = 0;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] <= n) {
			start = i;
			break;
		}
	}
	if (start < n) {
		for (int j = 0; j < n; j++) {
			if (inputSeq[j] <= n && (inputSeq[j] + start) % n != (inputSeq[start] + j) % n) return 0;
		}
	}
	sort(inputSeq, inputSeq + n);
	for (int i = 1; i < n; i++) {
		if (inputSeq[i - 1] == inputSeq[i]) {
			return 0;
		}
	}
	return 1;
}
int og[MAXN + 1]; // original order
set<pair<int, int>> Q; // Q gondolas above n least to greatest
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	int start = 0; // pos of 1 in the sequence
	for (int i = 0; i < n; i++) {
		if (gondolaSeq[i] <= n) {
			start = i + (n - gondolaSeq[i] + 1); // pos of 1
			start %= n; // keep in bounds of array
			break;
		}
	}
	for (int i = 0; i < n; i++) {
		og[i] = n + 1 + (i - start);
		og[i] %= n;
		if (gondolaSeq[i] > n) {
			Q.insert(make_pair(gondolaSeq[i], i));
		}
	}
	int curr = n;
	set<pair<int, int>>::iterator it;
	for (it = Q.begin(); it != Q.end(); it++) {
		pair<int, int> a = *it;
		while (curr < a.first) {
			replacementSeq[curr - n] = og[a.second];
			cout << replacementSeq[curr - n] << endl;
			curr++;
			og[a.second] = curr;
		}
	}
	return curr-n;
}
int countReplacement(int n, int inputSeq[]) {
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 7 ms 596 KB Output is correct
8 Correct 10 ms 596 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 14 ms 596 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 452 KB Output is correct
7 Correct 7 ms 596 KB Output is correct
8 Correct 9 ms 584 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 13 ms 632 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 7 ms 564 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB 잘못된 접근입니다.
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB 잘못된 접근입니다.
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 잘못된 접근입니다.
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -