oj.uz

답안 #770111

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770111 2023-06-30T18:55:54 Z tigar 곤돌라 (IOI14_gondola) C++14
90 / 100
 42 ms 9972 KB 
#include "gondola.h"
#include <bits/stdc++.h>
//💖
using namespace std;
typedef long long ll;

ll MOD=1000000009;
bool check[2500050];
int zamena[100];
map<int, int>convent;
vector<int>ord;

int valid(int n, int* inputSeq)
{
    int last=-1, pos=-1;
    for(int i=0; i<n; i++)
    {
        if(inputSeq[i]<=n and last==-1){last=inputSeq[i]; pos=i;}
        else if(inputSeq[i]<=n)
        {
            if((last+i-pos)%n==(inputSeq[i])%n){last=inputSeq[i]; pos=i;}
            else {return 0;}
        }
        else if(check[inputSeq[i]])return 0;
        check[inputSeq[i]]=true;
    }
    return 1;
}

int replacement(int n, int* gondolaSeq, int* replacementSeq)
{
    int maks=-1, g=-1, k=1;
    for(int i=0; i<n; i++)
    {
        //cout<<gondolaSeq[i]<<" "<<n<<endl;
        if(gondolaSeq[i]>n)
        {
            convent[gondolaSeq[i]]=i+1;
            if(gondolaSeq[i]>maks){maks=gondolaSeq[i]; g=i;}
        }
        else {k=i;}
    }
    for(int i=0; i<n; i++)
    {
        gondolaSeq[i]=(gondolaSeq[k]+i-k+n)%n;
        if(gondolaSeq[i]==0)gondolaSeq[i]=n;
    }
    if (maks==-1)return 0;
    for(int i=n+1; i<=maks; i++)
    {
        if(convent[i]==0){replacementSeq[i-n-1]=gondolaSeq[g]; gondolaSeq[g]=i;}
        else{replacementSeq[i-n-1]=gondolaSeq[convent[i]-1]; gondolaSeq[convent[i]-1]=i;}
    }
	return maks-n;
}

int countReplacement(int n, int* inputSeq)
{
    int last=-1, pos=-1;
    for(int i=0; i<n; i++)
    {
        if(inputSeq[i]<=n and last==-1){last=inputSeq[i]; pos=i;}
        else if(inputSeq[i]<=n)
        {
            if((last+i-pos)%n==(inputSeq[i])%n){last=inputSeq[i]; pos=i;}
            else {return 0;}
        }
        else if(check[inputSeq[i]])return 0;
        check[inputSeq[i]]=true;
    }

    int cnt=0;
    ll maks=0;
    for(int i=0; i<n; i++)
    {
        if(inputSeq[i]>n)
        {
            cnt++; ord.push_back(inputSeq[i]);
            if(inputSeq[i]>maks){maks=inputSeq[i];}
        }
    }

    sort(ord.begin(), ord.end());
    ll res=1, pp=0;
    ord.push_back(0);

    for(int i=n+1; i<=maks; i++)
    {
        if(i==ord[pp])pp++;
        else
        {
            res=(res*(ord.size()-pp-1))%MOD;
        }
    }
    if(pp==n)res=(res*n)%MOD;

	return res;
}

/*int main()
{
    int n; cin>>n;
    int gondole[n];
    for(int i=0; i<n; i++)cin>>gondole[i];
    cout<<countReplacement(n, gondole)<<endl;
    //for(int i=0; i<11; i++)cout<<zamena[i]<<" ";
}*/

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 9 ms 596 KB Output is correct
8 Correct 8 ms 584 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 7 ms 596 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 3 ms 396 KB Output is correct
7 Correct 6 ms 596 KB Output is correct
8 Correct 6 ms 596 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 7 ms 644 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 3 ms 564 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 7 ms 624 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 6 ms 596 KB Output is correct
12 Correct 7 ms 596 KB Output is correct
13 Correct 25 ms 4440 KB Output is correct
14 Correct 6 ms 596 KB Output is correct
15 Correct 42 ms 9972 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 10 ms 1108 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 5 ms 724 KB Output is correct
13 Correct 2 ms 340 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 10 ms 1108 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 5 ms 724 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Runtime error 8 ms 988 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -