oj.uz

답안 #140190

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

int ch[100005],i;
struct A{
    int val,ind;
}data[100005];
bool cmp(A aa,A bb){return aa.val<bb.val;}

long long X=1e9+9;
long long f(long long p,long long q)
{
    if(q==0)return 1ll;
    if(q==1)return p;
    long long O=f(p,q/2);
    if(q%2)return O*O%X*p%X;
    return O*O%X;
}

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=0,ba,sz=0,ans=0;
    for(i=0;i<n;i++)
    {
        if(gondolaSeq[i]<=n)ST=(i-gondolaSeq[i]+1+n)%n;
        else data[sz++]={gondolaSeq[i],i};
    }
    std::sort(data,data+sz,cmp);
    ba=n;
    for(i=0;i<sz;i++)
    {
        replacementSeq[ans++]=(data[i].ind-ST+n)%n+1;
        for(int j=ba+1;j<data[i].val;j++)
        {
            replacementSeq[ans++]=j;
        }
        ba=data[i].val;
    }
    return ans;
}

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

int countReplacement(int n, int inputSeq[])
{
    if(valid(n,inputSeq)==0)return 0;
    int ST=-1,ba,sz=0;
    long long ans=1ll;
    for(i=0;i<n;i++)
    {
        if(inputSeq[i]<=n)ST=(i-inputSeq[i]+1+n)%n;
        else data[sz++]={inputSeq[i],i};
    }
    if(ST==-1)ST=0,ans*=n;
    std::sort(data,data+sz,cmp);
    ba=n;
    for(i=0;i<sz;i++)
    {
        ans*=f(sz-i,data[i].val-ba-1);
        ans%=X;
        ba=data[i].val;
    }


    return ans;
}

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

Subtask #4
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 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #5
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 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 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #6
20.0 / 20.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
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 12 ms 764 KB Output is correct
12 Correct 13 ms 760 KB Output is correct
13 Correct 18 ms 1528 KB Output is correct
14 Correct 12 ms 760 KB Output is correct
15 Correct 23 ms 2428 KB Output is correct

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

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 312 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 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct

Subtask #9
15.0 / 15.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
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 23 ms 2296 KB Output is correct
10 Correct 20 ms 1784 KB Output is correct
11 Correct 10 ms 1528 KB Output is correct
12 Correct 11 ms 1272 KB Output is correct
13 Correct 4 ms 636 KB Output is correct

Subtask #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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 252 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 23 ms 2296 KB Output is correct
10 Correct 20 ms 1756 KB Output is correct
11 Correct 10 ms 1528 KB Output is correct
12 Correct 11 ms 1400 KB Output is correct
13 Correct 4 ms 760 KB Output is correct
14 Runtime error 18 ms 2680 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -