oj.uz

Submission #1025425

# Submission time Handle Problem Language Result Execution time Memory
1025425 2024-07-17T03:07:20 Z boyliguanhan Gondola (IOI14_gondola) C++17
100 / 100
 53 ms 5148 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[]) {
    int PS=-1;
    set<int>st;
    for(int i=0;i<n;i++){
        st.insert(inputSeq[i]);
        if(inputSeq[i]>n)
            continue;
        int k=n+i-inputSeq[i];
        k%=n;
        if(PS==-1)
            PS=k;
        if(PS-k)
            return 0;
    }
    return 1&&st.size()==n;
}
map<int,int>IMPORTANT;
set<int>alive;
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    int k=*max_element(gondolaSeq,gondolaSeq+n)-n;
    int gondolaSeq2[250100],dn=0;
    for(int i=0;i<n;i++){
        if(gondolaSeq[i]<=n){
            if(!dn){
                dn=1;
                int j=i,k=gondolaSeq[i];
                do {
                    gondolaSeq2[j]=k;
                    j=(j+1)%n;
                    k=k%n+1;
                }while(j-i);
            }
        } else {
            IMPORTANT[gondolaSeq[i]]=i+1;
            alive.insert(i);
        }
    }
    if(!dn){
        iota(gondolaSeq2,gondolaSeq2+n,1);
    }
    for(int i=n;i++<n+k;){
        if(IMPORTANT[i]){
            int k=IMPORTANT[i]-1;
            replacementSeq[i-n-1]=gondolaSeq2[k];
            gondolaSeq2[k]=i;
            alive.erase(k);
        } else {
            IMPORTANT.erase(i);
            replacementSeq[i-n-1]=gondolaSeq2[*alive.begin()];
            gondolaSeq2[*alive.begin()]=i;
        }
    }
    return k;
}

//----------------------
#define int long long
typedef signed I;
const int mod=1e9+9;
int quickp(int a,int b){
    int ans=1;
    while(b){
        if(b&1)
            ans=ans*a%mod;
        b>>=1;
        a=a*a%mod;
    }
    return ans;
}
I countReplacement(I n, I inputSeq[]) {
    if(!valid(n,inputSeq))return 0;
    int ans=1;
    set<int>onesabove;
    for(int i=0;i<n;i++)
        if(inputSeq[i]>n)
            onesabove.insert(inputSeq[i]);
    if(size(onesabove)==n)
        ans=n;
    int prev=n,K=onesabove.size();
    for(auto i:onesabove){
        ans=ans*quickp(K,i-prev-1)%mod;
        K--;
        prev=i;
    }
    return ans;
}
#undef int

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:18:24: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   18 |     return 1&&st.size()==n;
      |               ~~~~~~~~~^~~
gondola.cpp: In function 'I countReplacement(I, I*)':
gondola.cpp:80:23: warning: comparison of integer expressions of different signedness: 'std::set<long long int>::size_type' {aka 'long unsigned int'} and 'I' {aka 'int'} [-Wsign-compare]
   80 |     if(size(onesabove)==n)
      |        ~~~~~~~~~~~~~~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 2348 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 13 ms 4080 KB Output is correct
9 Correct 4 ms 1368 KB Output is correct
10 Correct 19 ms 4476 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 2140 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 17 ms 3928 KB Output is correct
9 Correct 4 ms 1524 KB Output is correct
10 Correct 18 ms 4440 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 604 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1368 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1368 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1368 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1624 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 6 ms 1628 KB Output is correct
12 Correct 6 ms 1628 KB Output is correct
13 Correct 30 ms 5100 KB Output is correct
14 Correct 7 ms 1628 KB Output is correct
15 Correct 33 ms 4696 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 35 ms 3932 KB Output is correct
10 Correct 26 ms 3420 KB Output is correct
11 Correct 10 ms 1368 KB Output is correct
12 Correct 15 ms 1624 KB Output is correct
13 Correct 3 ms 604 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 36 ms 3924 KB Output is correct
10 Correct 32 ms 3416 KB Output is correct
11 Correct 9 ms 1372 KB Output is correct
12 Correct 12 ms 1628 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 47 ms 4676 KB Output is correct
15 Correct 53 ms 5148 KB Output is correct
16 Correct 8 ms 1112 KB Output is correct
17 Correct 36 ms 3676 KB Output is correct
18 Correct 17 ms 2140 KB Output is correct