oj.uz

Submission #978352

# Submission time Handle Problem Language Result Execution time Memory
978352 2024-05-09T06:56:16 Z Amaarsaa Gondola (IOI14_gondola) C++14
10 / 100
 7 ms 1116 KB 
#include<bits/stdc++.h>
#include "gondola.h"

using namespace std;
int valid(int n, int a[]) {
	int cnt = 0, mn = n + 1, ind = 0;
	for (int i = 0; i < n; i ++) {
		if ( a[i] <=n) {
			cnt ++;
			if ( mn >= a[i]) {
				mn = a[i];
				ind = i;
			}
		}
	}
	if ( cnt == 0) return 1;
	int last = a[ind];
	cnt --;
	for (int j = 0; j < n; j ++) {
		if (a[ind] <= n &&  a[ind] > last) {
			last = a[ind];
			cnt --;
		}
		ind = (ind + 1) % n;
	}
	if ( cnt == 0) return 1;
	return 0;
}

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

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

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

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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 7 ms 1116 KB Output is correct
8 Correct 5 ms 972 KB Output is correct
9 Correct 2 ms 584 KB Output is correct
10 Correct 7 ms 1116 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 700 KB Output is correct
7 Correct 7 ms 1096 KB Output is correct
8 Correct 6 ms 1116 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 6 ms 1112 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 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 1 ms 348 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 1 ms 348 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 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -