제출 #1285998

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1285998		aritro_	곤돌라 (IOI14_gondola)	C++20	10 / 100	7 ms	1352 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[]){
    //subtask 1
    int new_len=n*2;
    for(int i=0;i<n;i++) a[i]=arr[i];
    for(int i=n;i<new_len;i++){
        int ind=i-n;
        a[i]=arr[ind];
    }
    int cur=1;
    bool b=0;
    for(int i=0;i<new_len;i++){
        if(cur==n+1) break;
        if(a[i]==1&&b==0){
            b=1;
            cur++;
        }
        else if(a[i]==cur) cur++;
        else if(a[i]!=cur&&b==1) return 0;
        if(cur==n+1) break;
    }
    return 1;
}

int replacement(int n,int gondolaSeq[],int replacementSeq[]){
    return 0;
}

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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 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