oj.uz

Submission #835821

# Submission time Handle Problem Language Result Execution time Memory
835821 2023-08-23T21:00:44 Z 7mody Gondola (IOI14_gondola) C++17
20 / 100
 1000 ms 4436 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
 
const int maxn = 250005;
const int mod=1e9+9;
 
map<int,int> mp;

ll power(ll a,ll n){
    ll res=1;
    while(n){
        if(n&1) res=(res*a)%mod;
        a=(a*a) % mod;
        n>>=1;
    }
    return res;
}

int valid(int n, int arr[]){
    int start=-1;
    for(int i=0; i < n;i++){
        if(mp[arr[i]]) return 0;
        mp[arr[i]]=true;
        if(arr[i]<=n){
            int curr=(i-arr[i]+1+n)%n;
            if(start==-1) start=curr;
            else if(start!=curr) return 0;
        }
    }
    return 1;
}

 
int replacement(int n, int arr[], int res[]){
    int start=-1;
    deque<int> dq(n);
    for(int i=0; i < n;i++){
        if(arr[i]<=n) start=(i-arr[i]+1+n)%n;
        dq[i]=arr[i];
    }
    while(start){
        dq.push_back(dq.front());
        dq.pop_front();
        start--;
    }
    vector<pair<int,int>> ans(n);
    for(int i=0; i < n;i++){
        ans.push_back({dq[i],i});
    }
    sort(ans.begin(),ans.end());
    int size=0;
    int curr=n+1;
    for(int i=0; i < n;i++){
        if(dq[i]<=n) continue;
        res[size++]=ans[i].second+1;
        while(curr < ans[i].first) res[size++]=curr++;
        curr++;
    }
    return size;
}

 
int countReplacement(int n, int arr[]){
    if(!valid(n,arr)) return 0;
    vector<ll> vec;
    ll curr=n;
    ll res=1;
    ll last=n;
    for(int i=0; i < n;i++){
        if(arr[i]<=n) curr--;
        else vec.push_back(arr[i]);
    }
    if(curr==n) res=n;
    for(ll x : vec){
        res=(res*power(curr,x-last-1))%mod;
        last=x;
        curr--;
    }
    return int(res);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 336 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 9 ms 2132 KB Output is correct
7 Correct 6 ms 596 KB Output is correct
8 Correct 22 ms 3968 KB Output is correct
9 Correct 5 ms 1364 KB Output is correct
10 Correct 22 ms 4436 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 9 ms 2132 KB Output is correct
7 Correct 6 ms 596 KB Output is correct
8 Correct 17 ms 3924 KB Output is correct
9 Correct 5 ms 1364 KB Output is correct
10 Correct 22 ms 4436 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 6 ms 596 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Execution timed out 1045 ms 212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 1089 ms 212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 1041 ms 212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 1082 ms 212 KB Time limit exceeded
3 Halted 0 ms 0 KB -