oj.uz

Submission #1010876

# Submission time Handle Problem Language Result Execution time Memory
1010876 2024-06-29T13:04:16 Z Mardonbekhazratov Gondola (IOI14_gondola) C++17
90 / 100
 36 ms 9032 KB 
#include "gondola.h"
#include<bits/stdc++.h>

using namespace std;

int valid(int n, int inputSeq[]){
    int mn=n,id=-1;
    map<int,int>cnt;
    for(int i=0;i<n;i++){
        cnt[inputSeq[i]]++;
        if(inputSeq[i]<=mn){
            mn=inputSeq[i];
            id=i;
        }
    }
    for(auto [x,y]:cnt){
        if(y>1) return 0;
    }
    if(mn==n) return 1;
    id=(id-mn+1+n)%n;
    for(int i=0;i<n;i++){
        if(inputSeq[(id+i)%n]==i+1 || inputSeq[(id+i)%n]>n) continue;
        return 0;
    }
    return 1;
}

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


int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    const int N=2.5e5;
    vector<int>cnt(N+1,0);
    int mn=N,id=0,mx=0;
    set<int>s;
    set<pair<int,int>>t;
    for(int i=0;i<n;i++){
        cnt[gondolaSeq[i]]++;
        if(gondolaSeq[i]<mn){
            mn=gondolaSeq[i];
            id=i;
        }
        mx=max(mx,gondolaSeq[i]);
        if(gondolaSeq[i]<=n) s.insert(gondolaSeq[i]);
        else t.insert({gondolaSeq[i],i});
    }
    if(mn<=n){
        id=(id-mn+1+n)%n;
    }
    int ans=0,last=n+1;
    for(auto [x,y]:t){
        int k=(y-id+n)%n;
        replacementSeq[ans++]=k+1;
        for(int j=last;j<x;j++) replacementSeq[ans++]=j;
        last=x+1;
    }
    return ans;
}

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


const int MOD=1e9+9;

int binpow(int a,int b){
    if(b==1) return a;
    if(b&1){
        return 1LL*a*binpow(a,b-1)%MOD;
    }
    int x=binpow(a,b/2);
    return 1LL*x*x%MOD;
}

int countReplacement(int n, int inputSeq[]){
    if(!valid(n,inputSeq)){
        return 0;
    }
    int c=0;
    vector<int>cnt((int)2.5e5+2,0);
    vector<int>f={n};
    for(int i=0;i<n;i++){
        if(inputSeq[i]>n) f.push_back(inputSeq[i]),c++;
        cnt[inputSeq[i]]++;
    }
    sort(f.begin(),f.end());
    long long ans=1;
    if(c==n) ans=n;
    for(int i=1;i<f.size();i++){
        for(int j=0;j<f[i]-f[i-1]-1;j++) ans=ans*c%MOD;
        c--;
    }
    return ans;
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:88:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for(int i=1;i<f.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
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 1 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 1 ms 604 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 11 ms 2396 KB Output is correct
7 Correct 21 ms 4188 KB Output is correct
8 Correct 14 ms 4444 KB Output is correct
9 Correct 4 ms 1628 KB Output is correct
10 Correct 17 ms 4952 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 0 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
6 Correct 9 ms 2396 KB Output is correct
7 Correct 19 ms 4292 KB Output is correct
8 Correct 16 ms 4440 KB Output is correct
9 Correct 5 ms 1628 KB Output is correct
10 Correct 14 ms 4956 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 10 ms 2468 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 28 ms 5212 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 0 ms 1372 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 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 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 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 1216 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 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 1372 KB Output is correct
5 Correct 1 ms 1368 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 1216 KB Output is correct
10 Correct 2 ms 1372 KB Output is correct
11 Correct 16 ms 5724 KB Output is correct
12 Correct 18 ms 6472 KB Output is correct
13 Correct 17 ms 3676 KB Output is correct
14 Correct 14 ms 5724 KB Output is correct
15 Correct 15 ms 3020 KB Output is correct

Subtask #7
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 1368 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 1 ms 1368 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

Subtask #9
15.0 / 15.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 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 1412 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 30 ms 3932 KB Output is correct
10 Correct 25 ms 4444 KB Output is correct
11 Correct 9 ms 2544 KB Output is correct
12 Correct 11 ms 2652 KB Output is correct
13 Correct 3 ms 1628 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 1 ms 1368 KB Output is correct
3 Correct 1 ms 1372 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 1368 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 28 ms 4184 KB Output is correct
10 Correct 23 ms 4424 KB Output is correct
11 Correct 9 ms 2484 KB Output is correct
12 Correct 11 ms 2648 KB Output is correct
13 Correct 3 ms 1628 KB Output is correct
14 Runtime error 36 ms 9032 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -