oj.uz

Submission #243903

# Submission time Handle Problem Language Result Execution time Memory
243903 2020-07-02T06:02:36 Z aloo123 Gondola (IOI14_gondola) C++14
75 / 100
 1000 ms 4864 KB 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
 #include <gondola.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
// #define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> os;
 
 
const ll INF = 1e18;
const ll N =(1e5+5); // TODO : change value as per problem
const ll MOD = 1e9+9;


int valid(int n, int a[]){
    
    
    ll idx = 0;
    bool original = 0;
    for(int i =0;i<n;i++){
        if(a[i] <= n){
            idx =i;
            original = true;
            break;
        }   
   }
    if(original == false){
        set<ll> se;
        for(int i = 0;i<n;i++) se.in(a[i]);
        if(sz(se) == n){
            return 1;
        }
        else return 0;
    }
    int b[n];
    vector<int> ans;
    vector<pair<int,int>> gg;
    ll count = 1;
    ll nxt = a[idx];
    if(original == false) nxt = 1; 
    // cout << idx << endl;
    while(count <= n){
        
            b[idx] = nxt;
            nxt++;
            idx++;
            if(nxt > n) nxt = 1;
            if(idx >= n) idx = 0;
            count++;
        
    }
    set<ll> se;
    for(int i =0;i<n;i++){
        if(a[i] <= n && b[i] != a[i]){
            return 0;
        }
        else
            se.in(a[i]);
    }
    if(sz(se) != n) return 0;
    return 1;
}
int replacement(int n, int a[], int replacementSeq[]) {
    ll idx = 0;
    bool original = 0;
    for(int i =0;i<n;i++){
        if(a[i] <= n){
            idx =i;
            original = true;
            break;
        }
    }
 
    int b[n];
    vector<int> ans;
    vector<pair<int,int>> gg;
    ll count = 1;
    ll nxt = a[idx];
    if(original == false) nxt = 1; 
    // cout << idx << endl;
    while(count <= n){
        
            b[idx] = nxt;
            nxt++;
            idx++;
            if(nxt > n) nxt = 1;
            if(idx >= n) idx = 0;
            count++;
        
    }
    ll sp = n+1;
    // for(int i =0;i<n;i++) cout << b[i] << " ";cout<<endl;
    for(int i =0;i<n;i++){
        if(a[i] > n)
            gg.pb({a[i],b[i]});
    }
    sort(gg.begin(),gg.end());
    for(int i = 0;i<sz(gg);i++){
        ans.pb(gg[i].s);
        ll x = sp;
        while(x != gg[i].f){
            ans.pb(x);
            x++;
        }
        sp = gg[i].f+1;
        
    }
    // for(int i = 0;i<sz(ans);i++) cout<<ans[i]<<" ";cout<<endl;
    for(int i = 0;i<sz(ans);i++) replacementSeq[i] = ans[i];
    return sz(ans);

}
int countReplacement(int n, int inputSeq[]) {
    //cout << "QQA\n";
    if(!valid(n,inputSeq)) return 69;
    //cout<<"QQA\n";
    ll special = 0;
    vll v;
    for(int i =0;i<n;i++){
        if(inputSeq[i] > n){
            special += 1;
            v.pb(inputSeq[i]);
        }
    }
    if(special == 0) return 1;
    ll ans = n;
    if(special != n) ans = 1;
    sort(v.begin(),v.end());
    for(int i = n+1;i<=v.back();i++){
        ll cnt = 0;
        for(int j = 0;j<sz(v);j++) {
            if(v[j] == i){
                cnt = 1;
                break;
            }
            else if(v[j] > i) cnt++;
        }
        if(cnt != 0)
   //     cout << i << " " << cnt << endl;
        ans = (ans * cnt)%MOD;
    }
    return ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 17 ms 2432 KB Output is correct
7 Correct 20 ms 1024 KB Output is correct
8 Correct 28 ms 4224 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 34 ms 4856 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 20 ms 2432 KB Output is correct
7 Correct 17 ms 1024 KB Output is correct
8 Correct 29 ms 4196 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 33 ms 4864 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 10 ms 640 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 18 ms 1024 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 16 ms 1024 KB Output is correct
12 Correct 17 ms 1024 KB Output is correct
13 Correct 20 ms 1532 KB Output is correct
14 Correct 16 ms 896 KB Output is correct
15 Correct 27 ms 2384 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct

Subtask #8
15.0 / 15.0

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

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 6 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Execution timed out 1090 ms 4856 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Execution timed out 1092 ms 4856 KB Time limit exceeded
10 Halted 0 ms 0 KB -