제출 #243412

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
243412		aloo123	곤돌라 (IOI14_gondola)	C++14	10 / 100	18 ms	1280 KiB

gondola

#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+7;


int valid(int n, int a[]){
    bool done[n+1];
    ll spare = n+1;
    set<ll> se;
    for(int i =1;i<=n;i++) done[i] = false;
    for(int i = 0;i<n-1;i++){
        done[a[i]] = true;
        ll nxt = a[i]+1;
        if(nxt > n) nxt = 1;
        if(a[i+1] == nxt){
            // cout << "Here\n";
            if(done[nxt]) return 0;
        }
        else if(a[i+1] > n){
            if(a[i+1] < spare){
                return 0;
            }
            spare = a[i+1];
            return 1;
        }
        else{
            return 0;
        }
    }
    return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {return -2;}
int countReplacement(int n, int inputSeq[]) {return -3;}

// int main(){
//     int a[] = {1, 5, 3, 4, 2, 7, 6};
//     cout << valid(7,a) << endl;
// }

• 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