oj.uz

Submission #27745

# Submission time Handle Problem Language Result Execution time Memory
27745 2017-07-13T18:32:42 Z zoomswk Gondola (IOI14_gondola) C++14
20 / 100
 59 ms 7484 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

map<int, int> occ;

int valid(int n, int inputSeq[]){
    for(int i=0; i<n; i++){
        inputSeq[i]--;
        if(occ[inputSeq[i]]) return 0;
        occ[inputSeq[i]] = 1;
    }
    int must = -1;
    for(int i=0; i<n; i++) if(inputSeq[i] < n) must = i;
    if(must == -1) return 1;
    for(int i=0; i<n; i++) if(inputSeq[i] < n && (inputSeq[i]+n+must-i)%n != inputSeq[must]) 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 3392 KB Output is correct
2 Correct 0 ms 3392 KB Output is correct
3 Correct 0 ms 3392 KB Output is correct
4 Correct 0 ms 3392 KB Output is correct
5 Correct 0 ms 3392 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3392 KB Output is correct
2 Correct 0 ms 3392 KB Output is correct
3 Correct 0 ms 3392 KB Output is correct
4 Correct 0 ms 3392 KB Output is correct
5 Correct 0 ms 3392 KB Output is correct
6 Correct 16 ms 5108 KB Output is correct
7 Correct 9 ms 3392 KB Output is correct
8 Correct 33 ms 6692 KB Output is correct
9 Correct 6 ms 4448 KB Output is correct
10 Correct 36 ms 7352 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3392 KB Output is correct
2 Correct 0 ms 3392 KB Output is correct
3 Correct 0 ms 3392 KB Output is correct
4 Correct 0 ms 3392 KB Output is correct
5 Correct 0 ms 3392 KB Output is correct
6 Correct 13 ms 5108 KB Output is correct
7 Correct 13 ms 3392 KB Output is correct
8 Correct 26 ms 6692 KB Output is correct
9 Correct 6 ms 4448 KB Output is correct
10 Correct 36 ms 7352 KB Output is correct
11 Correct 0 ms 3392 KB Output is correct
12 Correct 0 ms 3392 KB Output is correct
13 Correct 19 ms 5108 KB Output is correct
14 Correct 0 ms 3392 KB Output is correct
15 Correct 59 ms 7484 KB Output is correct

Subtask #4
0 / 5.0

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