oj.uz

Submission #470844

# Submission time Handle Problem Language Result Execution time Memory
470844 2021-09-06T00:45:01 Z hibye1217 Gondola (IOI14_gondola) C++17
20 / 100
 11 ms 1100 KB 
// Subtask 1

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

int valid(int n, int inputSeq[]){
	int st = 0;
	for (int i = 0; i < n; i++){ if (inputSeq[i] == 1){ st = i; } }
	for (int i = 0; i < n; i++){
		int p = (i+st) % n;
		if (inputSeq[p] != i+1){ return 0; }
	}
	return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){ return 0; }

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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 5 ms 648 KB Output is correct
7 Correct 10 ms 1100 KB Output is correct
8 Correct 9 ms 900 KB Output is correct
9 Correct 3 ms 432 KB Output is correct
10 Correct 11 ms 1004 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 6 ms 588 KB Output is correct
7 Correct 10 ms 1100 KB Output is correct
8 Correct 9 ms 956 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 10 ms 984 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 5 ms 588 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 11 ms 1100 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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