oj.uz

답안 #140147

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
140147 2019-08-02T07:45:33 Z ggoh 곤돌라 (IOI14_gondola) C++14
20 / 100
 15 ms 1656 KB 
#include "gondola.h"
#include <bits/stdc++.h>

int ch[100005],i;
int valid(int n, int inputSeq[])
{
    int ST=-1,st,C=0;
    for(i=0;i<n;i++)ch[i]=0;
    for(i=0;i<n;i++)
    {
      if(ch[inputSeq[i]]==1){C=1;break;}
      ch[inputSeq[i]]=1;
    }
    for(i=0;i<n;i++)
    {
        if(inputSeq[i]<=n){st=i-inputSeq[i]+1;st=(st+n)%n;
            if(ST==-1)ST=st;
            else if(ST!=st){C=1;break;}
        }
    }
    if(C)return 0;
    else 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 7 ms 760 KB Output is correct
7 Correct 14 ms 1528 KB Output is correct
8 Correct 12 ms 1224 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 14 ms 1408 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 888 KB Output is correct
7 Correct 14 ms 1528 KB Output is correct
8 Correct 11 ms 1272 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 13 ms 1528 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 8 ms 1528 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 15 ms 1656 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 376 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -