oj.uz

Submission #995405

# Submission time Handle Problem Language Result Execution time Memory
995405 2024-06-09T03:21:11 Z thinknoexit Gondola (IOI14_gondola) C++17
10 / 100
 12 ms 764 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int valid(int n, int a[]) {
    int mn = n + 1;
    int idx = 0;
    for (int i = 0;i < n;i++) {
        if (a[i] <= n) {
            if (a[i] < mn) {
                mn = a[i];
                idx = i;
            }
        }
    }
    if (mn == n + 1) return 1;
    idx = (idx - mn + 1 + n) % n;
    for (int i = 0;i < n;i++) {
        if (a[(i + idx) % n] <= n && a[(i + idx) % n] != i + 1) return 0;
    }
    sort(a, a + n);
    for (int i = 1;i < n;i++) {
        if (a[i] == a[i - 1]) return 0;
    }
    return 1;
}

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 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 10 ms 764 KB Output is correct
8 Correct 7 ms 604 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 10 ms 604 KB Output is correct

Subtask #3
0 / 10.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 432 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 508 KB Output is correct
7 Correct 5 ms 688 KB Output is correct
8 Correct 6 ms 680 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 12 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 5 ms 704 KB Output is correct
14 Incorrect 1 ms 348 KB Output isn't correct
15 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 348 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 348 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 0 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 0 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 344 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 -