oj.uz

Submission #31164

# Submission time Handle Problem Language Result Execution time Memory
31164 2017-08-12T07:34:57 Z cscandkswon Gondola (IOI14_gondola) C++14
20 / 100
 26 ms 3776 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN=100000;

int init[MAXN];

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

Subtask #2
5.0 / 5.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
0 / 5.0

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