oj.uz

답안 #770141

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

ll MOD=1000000009;
map<int, bool>check;
map<int, int>convent;
vector<int>ord;

ll powerOptimised(ll a, ll n)
{
    int res=1;
    while(n>0)
    {
        int last_bit=(n&1);
        if(last_bit)res=(res*a)%MOD;
        a=(a*a)%MOD;
        n=n>>1;
    }
    return res;
}
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;

    for(int i=0; i<ord.size(); i++)
    {
        if(i==0)res=(res*powerOptimised(ord.size()-i, ord[i]-n-1))%MOD;
        else {res=(res*powerOptimised(ord.size()-i, ord[i]-ord[i-1]-1))%MOD;}
    }
    if(ord.size()==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]<<" ";
}*/

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:97:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |     for(int i=0; i<ord.size(); i++)
      |                  ~^~~~~~~~~~~
gondola.cpp:102:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  102 |     if(ord.size()==n)res=(res*n)%MOD;
      |        ~~~~~~~~~~^~~
gondola.cpp:95:15: warning: unused variable 'pp' [-Wunused-variable]
   95 |     ll res=1, pp=0;
      |               ^~

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 1 ms 212 KB Output is correct
4 Correct 0 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 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 8 ms 2212 KB Output is correct
7 Correct 7 ms 604 KB Output is correct
8 Correct 14 ms 3904 KB Output is correct
9 Correct 5 ms 1364 KB Output is correct
10 Correct 17 ms 4536 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 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 7 ms 2132 KB Output is correct
7 Correct 7 ms 596 KB Output is correct
8 Correct 14 ms 3924 KB Output is correct
9 Correct 4 ms 1364 KB Output is correct
10 Correct 17 ms 4452 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 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 6 ms 596 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 1 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 1 ms 468 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 224 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 1 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 724 KB Output is correct
12 Correct 7 ms 596 KB Output is correct
13 Correct 25 ms 4436 KB Output is correct
14 Correct 6 ms 596 KB Output is correct
15 Correct 39 ms 9964 KB Output is correct

Subtask #7
5.0 / 5.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

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 1 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 1 ms 304 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 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 31 ms 4408 KB Output is correct
10 Correct 24 ms 3748 KB Output is correct
11 Correct 10 ms 1540 KB Output is correct
12 Correct 14 ms 1876 KB Output is correct
13 Correct 3 ms 596 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 224 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 1 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 1 ms 212 KB Output is correct
9 Correct 31 ms 4312 KB Output is correct
10 Correct 24 ms 3740 KB Output is correct
11 Correct 9 ms 1568 KB Output is correct
12 Correct 12 ms 1876 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 40 ms 5184 KB Output is correct
15 Correct 46 ms 6680 KB Output is correct
16 Correct 8 ms 1492 KB Output is correct
17 Correct 30 ms 4528 KB Output is correct
18 Correct 16 ms 2852 KB Output is correct