Submission #1286147

#	Time	Username	Problem	Language	Result	Execution time	Memory
1286147		aritro_	Gondola (IOI14_gondola)	C++20	5 / 100	2 ms	356 KiB

gondola

#include<bits/stdc++.h>
#include "gondola.h"
using namespace std;

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <typename T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

/*
less<T> can be changed to:
1. less_equal<T>
2. greater<T>

ordered_set functions:
1. *(os.find_by_order(x)) -> return the value at position x (0 base)
2. os.order_of_key(x) -> return the number of elements less than x
*/

typedef long long ll;
//#define int ll
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()

const int MOD=1000000007;

#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))

#define fios(); ios_base::sync_with_stdio(0);cin.tie(0);
#define fraction(x); cout.unsetf(ios::floatfield); cout.precision(x); cout.setf(ios::fixed,ios::floatfield);
#define file(); freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);

const int maxN=2e5+15;
int a[maxN];

int valid(int n,int arr[]){
    /*int ind=0;
    for(int i=0;i<n;i++){
        if(arr[i]<arr[ind]) ind=i;
    }
    for(int i=ind;i<n;i++) a[i-ind]=arr[i];
    for(int i=0;i<ind;i++) a[i+(n-ind)]=arr[i];
    int test[n];
    for(int i=0;i<n;i++) test[i]=i+1;
    int cur=n+1;
    for(int i=0;i<n;i++){
        if(test[i]!=a[i]){
            while(test[i]<a[i]){
                test[i]=cur;
                cur=cur+1;
            }
            if(test[i]>a[i]) return 0;
            //cout<<i<<' '<<cur<<' '<<a[i]<<endl;
        }
    }*/
    return 0;
}

int replacement(int n,int arr[],int ans[]){
    map<int,int> fre;
    for(int i=0;i<n;i++) fre[arr[i]]++;
    int mx=0;
    for(int i=0;i<n;i++) mx=max(mx,arr[i]);
    if(mx==n) return 0;
    for(int i=1;i<=n+1;i++){
        if(fre[i]==0){
            ans[0]=i;
            return 1;
        }
    }
    return 0;
}

int countReplacement(int n,int inputSeq[]){
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 5 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10