제출 #1311925

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1311925		settop	Roller Coaster Railroad (IOI16_railroad)	C++20	0 / 100	127 ms	17984 KiB

railroad

#include "railroad.h"
#include<bits/stdc++.h>

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

#define ll long long
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
const ll inf=1e16;
typedef pair<ll,ll> pii;

vector<int> pai;

int find(int x){
    return x==pai[x]?x:pai[x]=find(pai[x]);
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = sz(s);

    pai.resize(n);

    fall(i,0,n-1) pai[i]=i;

    set<pii> st;

    fall(i,0,n-1) st.insert({s[i],i});

    vector<int> ord;

    fall(i,0,n-1) ord.pb(i);

    sort(all(ord),[&](int a,int b){
        if(t[a]!=t[b]) return t[a]<t[b];
        return a<b;
    });

    bool foi=0;

    for(auto u:ord){
        auto it=st.lower_bound({t[u],-1});
        if(it==st.end() && !foi){
            foi=1;
            continue;
        }
        else if(it==st.end()) return 1;

        auto [x,i]=*it; 
        if(find(i)!=find(u)){
            pai[find(i)]=find(u);
            st.erase(it);
            continue;
        }
        it++;
        if(it==st.end() && !foi){
            foi=1;
            continue;
        }
        else if(it==st.end()) return 1;

        pai[find((*it).second)]=find(u);
        st.erase(it);    
    }

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

railroad.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
railroad_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 23
• Subtask 3: 0 / 30
• Subtask 4: 0 / 36