oj.uz

Submission #710464

# Submission time Handle Problem Language Result Execution time Memory
710464 2023-03-15T08:58:44 Z mseebacher Gondola (IOI14_gondola) C++17
20 / 100
 30 ms 4504 KB 
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
int valid(int n,int a[]){
	int last = 0;
	int index = -1;
	set<int> in;
	for(int i = 0;i<n;i++){
		if(a[i] <= n){
			if(index >= 0){
				int diffIndex = i-index;
				int diffWert = a[i]-last;
				if(diffWert < 0) diffWert += n;
				if(diffIndex != diffWert) return false;
			}
			index = i;
			last = a[i];
		}
		if(in.find(a[i]) != in.end()) return 0;
		in.insert(a[i]);
	}
	return true;
}
 
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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 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 12 ms 2132 KB Output is correct
7 Correct 7 ms 596 KB Output is correct
8 Correct 21 ms 3868 KB Output is correct
9 Correct 7 ms 1384 KB Output is correct
10 Correct 30 ms 4504 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 12 ms 2132 KB Output is correct
7 Correct 7 ms 596 KB Output is correct
8 Correct 20 ms 3824 KB Output is correct
9 Correct 8 ms 1364 KB Output is correct
10 Correct 29 ms 4496 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 8 ms 1236 KB Output is correct

Subtask #4
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 #5
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 -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 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 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 -