제출 #346695

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
346695		ant101	철로 (IOI14_rail)	C++14	컴파일 에러	0 ms	0 KiB

rail

#include "books.h"
#include <iostream>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <assert.h>
#include <limits>
#include <cstdio>
#include <complex>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
#define mp make_pair
#define f first
#define s second

typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353; // = (119<<23)+1
const int MX = 2e2+5;
const ll INF = 1e18;
const ld PI = 4*atan((ld)1);
const int dx[4] = {0,1,0,-1}, dy[4] = {1,0,-1,0};


namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        // cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
        if (sz(s)) {
            setIn(s+".in");
            setOut(s+".out");
        } // for USACO
    }
}

using namespace io;

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }
    
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);
    
    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{",x.f,", ",x.s,"}");
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

using namespace input;

ll add(ll a, ll b) {
    a += b;
    if(a >= MOD) {
        a -= MOD;
    }
    return a;
}
ll sub(ll a, ll b) {
    a -= b;
    if(a < 0) {
        a += MOD;
    }
    return a;
}

ll mul(ll a, ll b) {
    return (a * b)%MOD;
}

void add_self(ll& a, ll b) {
    a = add(a, b);
}
void sub_self(ll& a, ll b) {
    a = sub(a, b);
}
void mul_self(ll& a, ll b) {
    a = mul(a, b);
}


struct DSU {
    ll f[MX], cnt[MX], l[MX], r[MX];
    DSU() {
        for (ll i = 0; i<MX; i++) {
            f[i] = l[i] = r[i] = i;
            cnt[i] = 1;
        }
    }
    ll Find(ll x) {
        if (f[x] == x) {
            return x;
        }
        f[x] = Find(f[x]);
        return f[x];
    }
    void Union(ll x, ll y) {
        x = Find(x);
        y = Find(y);
        if (x == y) {
            return;
        }
        if (cnt[x] < cnt[y]) {
            swap(x, y);
        }
        cnt[x]+=cnt[y];
        l[x] = min(l[x], l[y]);
        r[x] = max(r[x], r[y]);
        f[y] = x;
    }
    ll getl(ll x) {
        return l[Find(x)];
    }
    ll getr(ll x) {
        return r[Find(x)];
    }
};
DSU dsu;
ll segments[2][MX];

bool in_range(bool dir, ll pos, ll le, ll ri) {
    if (!dir) {
        return pos > le;
    }
    else {
        return pos < ri;
    }
}
bool overlap(ll l1, ll r1, ll l2, ll r2) {
    return (l1<l2 && r1>r2) || (l1>r2 && r1<l2);
}

ll minimum_walk(vector<int> p, int s) {
    ll n = p.size();
    ll ans = 0;
    for (ll i = 0; i<n; i++) {
        ans+=abs(p[i]-i);
        dsu.Union(i, p[i]);
    }
    vector<ll> vec;
    for (ll i = n-1; i>=0; i--) {
        while (vec.size() && dsu.getr(i) >= vec.back()) {
            if (dsu.getl(vec.back()) < i) {
                dsu.Union(i, vec.back());
            }
            vec.pop_back();
        }
        vec.push_back(i);
    }
    for (ll i = 0; i<n; i++) {
        segments[0][i] = segments[1][i] = i;
    }
    for (ll i = 0; i<n; i++) {
        if (dsu.Find(i) == i && dsu.getl(i)!=dsu.getr(i)) {
            segments[0][dsu.getl(i)] = dsu.getr(i);
            segments[1][dsu.getr(i)] = dsu.getl(i);
        }
    }
    ll le = 0, ri = n-1;
    while (le<s && dsu.getl(le) == dsu.getr(le)) {
        le++;
    }
    while (ri>s && dsu.getl(ri) == dsu.getr(ri)) {
        ri--;
    }
    while (true) {
        ll cur = -1;
        for (ll i = dsu.getl(s)-1; i>=le; i--) {
            if (overlap(i, dsu.getr(i), s, s)) {
                cur = i;
                break;
            }
        }
        ll cost1 = 1, cost2 = 1;
        ll start = cur+1;
        if (cur == -1) {
            start = le;
            cost1 = 0;
        }
        for (ll i = start; i<dsu.getl(s); i--) {
            cost1++;
            i = dsu.getr(i);
        }
        if (cur == -1) {
            start = ri;
            cost2 = 0;
        }
        else start = dsu.getr(cur)-1;
        for (ll i = start; i>dsu.getr(s); i--) {
            cost2++;
            i = dsu.getl(i);
        }
        if (cur == -1) {
            ans+=(cost1+cost2)*2;
            break;
        }
        ans+=min(cost1, cost2)*2;
        dsu.Union(cur, s);
    }
    return ans;
}

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

rail.cpp:1:10: fatal error: books.h: No such file or directory
    1 | #include "books.h"
      |          ^~~~~~~~~
compilation terminated.