oj.uz

Submission #16342

# Submission time Handle Problem Language Result Execution time Memory
16342 2015-08-21T14:11:42 Z atomzeno Gondola (IOI14_gondola) C++
20 / 100
 15 ms 4208 KB 
#include "gondola.h"
int d[200001],check[250001];
int valid(int n, int inputSeq[]){
    int i,cnt=0,ind;
    for(i=0;i<n;i++){
        if(inputSeq[i]<=n){
            cnt=1;
            ind=(inputSeq[i]-1-i)+n;
            ind%=n;
            break;
        }
    }
    for(i=0;i<n;i++){
        check[inputSeq[i]]++;
        if(check[inputSeq[i]]>=2){return 0;}
    }
    if(cnt==0){return 1;}
    for(i=0;i<n;i++){
        d[(ind+i)%n]=inputSeq[i];
    }
    for(i=0;i<n;i++){
        if(d[i]<=n&&d[i]!=(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 0 ms 4208 KB Output is correct
2 Correct 0 ms 4208 KB Output is correct
3 Correct 0 ms 4208 KB Output is correct
4 Correct 0 ms 4208 KB Output is correct
5 Correct 0 ms 4208 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4208 KB Output is correct
2 Correct 0 ms 4208 KB Output is correct
3 Correct 0 ms 4208 KB Output is correct
4 Correct 0 ms 4208 KB Output is correct
5 Correct 0 ms 4208 KB Output is correct
6 Correct 0 ms 4208 KB Output is correct
7 Correct 0 ms 4208 KB Output is correct
8 Correct 11 ms 4208 KB Output is correct
9 Correct 2 ms 4208 KB Output is correct
10 Correct 15 ms 4208 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4208 KB Output is correct
2 Correct 0 ms 4208 KB Output is correct
3 Correct 0 ms 4208 KB Output is correct
4 Correct 0 ms 4208 KB Output is correct
5 Correct 0 ms 4208 KB Output is correct
6 Correct 0 ms 4208 KB Output is correct
7 Correct 0 ms 4208 KB Output is correct
8 Correct 15 ms 4208 KB Output is correct
9 Correct 0 ms 4208 KB Output is correct
10 Correct 0 ms 4208 KB Output is correct
11 Correct 0 ms 4208 KB Output is correct
12 Correct 0 ms 4208 KB Output is correct
13 Correct 0 ms 4208 KB Output is correct
14 Correct 0 ms 4208 KB Output is correct
15 Correct 0 ms 4208 KB Output is correct

Subtask #4
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4208 KB Output isn't correct - Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4208 KB Output isn't correct - Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4208 KB Output isn't correct - Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4208 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4208 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4208 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4208 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -