oj.uz

Submission #515924

# Submission time Handle Problem Language Result Execution time Memory
515924 2022-01-20T06:32:54 Z asadasdas Gondola (IOI14_gondola) C++14
10 / 100
 14 ms 1428 KB 
#include <bits/stdc++.h>
#include <gondola.h>

using namespace std;

int valid(int n, int inputseq[])
{
    int index=-1;
    vector<int> real(n);
    for(int i=0; i<n; ++i)
        if(inputseq[i]<=n)
        {
            real[i]=inputseq[i], index=i;
            break;
        }
    if(index==-1)
        return 1;
    int cur=real[index];
    cur=cur==n?1:cur+1;
    for(int j=index+1; j!=index; j=(j+1)%n,cur=cur==n?1:cur+1)
        if(inputseq[j]<=n && inputseq[j] !=cur)
            return 0;
    return 1;
}

int replacement(int n, int T[], int ans[]) {
            return 0;
}

int countReplacement(int n, int T[]) {
            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 1 ms 296 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 1 ms 300 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 4 ms 696 KB Output is correct
7 Correct 9 ms 1328 KB Output is correct
8 Correct 7 ms 1100 KB Output is correct
9 Correct 3 ms 456 KB Output is correct
10 Correct 14 ms 1356 KB Output is correct

Subtask #3
0 / 10.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 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 4 ms 772 KB Output is correct
7 Correct 8 ms 1428 KB Output is correct
8 Correct 7 ms 1148 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 8 ms 1320 KB Output is correct
11 Incorrect 0 ms 204 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 296 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 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 0 ms 304 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 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 0 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 280 KB Output isn't correct
2 Halted 0 ms 0 KB -