oj.uz

답안 #140180

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
140180 2019-08-02T08:18:14 Z ggoh 곤돌라 (IOI14_gondola) C++14
55 / 100
 23 ms 3192 KB 
#include "gondola.h"
#include <bits/stdc++.h>

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

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int ST=-1,m=-1,ba,sz=0;
    for(i=1;i<=250000;i++)ch[i]=-1;
    for(i=0;i<n;i++)
    {
        m=std::max(gondolaSeq[i],m);
        ch[gondolaSeq[i]]=i;
        if(gondolaSeq[i]<=n)ST=(i-gondolaSeq[i]+1+n)%n;
    }
    if(ST==-1)ST=0;
    ba=n;
    for(i=n+1;i<=m;i++)
    {
        if(ch[i]>=0)
        {
            replacementSeq[sz++]=(ch[i]-ST+n)%n+1;
            for(int j=ba+1;j<i;j++)
            {
                replacementSeq[sz++]=j;
            }
            ba=i;
        }
    }
    return m-n;
}

//----------------------

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 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

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 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 632 KB Output is correct
7 Correct 14 ms 1272 KB Output is correct
8 Correct 11 ms 1144 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 13 ms 1256 KB Output is correct

Subtask #3
10.0 / 10.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 256 KB Output is correct
4 Correct 12 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 1016 KB Output is correct
8 Correct 11 ms 1144 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 13 ms 1016 KB Output is correct
11 Correct 2 ms 256 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 1272 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1244 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1400 KB Output is correct
8 Correct 3 ms 1272 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 4 ms 1528 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1296 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1264 KB Output is correct
5 Correct 3 ms 1244 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 1272 KB Output is correct
9 Correct 3 ms 1404 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 13 ms 2040 KB Output is correct
12 Correct 14 ms 2168 KB Output is correct
13 Correct 16 ms 2296 KB Output is correct
14 Correct 13 ms 2040 KB Output is correct
15 Correct 23 ms 3192 KB Output is correct

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 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -