제출 #388482

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
388482		ACmachine	철로 (IOI14_rail)	C++17	30 / 100	599 ms	98572 KiB

rail

#include "rail.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;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
struct dsu{
    vector<int> p;
    dsu(){}
    dsu(int _n){
        p.resize(_n, -1);
    }
    int find(int x){return (p[x] < 0 ? x : p[x] = find(p[x]));}
    bool join(int a, int b){
        a = find(a); b = find(b);
        if(a == b) return false;
        if(p[a] > p[b])
            swap(a, b);
        p[a] += p[b]; p[b] = a;
        return true;
    }
};

void findLocation(int n, int first, int location[], int stype[])
{
    auto solve_subtask1 = [&](){
        dsu d(n);
        REP(i, n) stype[i] = -1;
        location[0] = first; stype[0] = 1;
        vector<vector<int>> dist(n, vector<int>(n, 0));
        REP(i, n){
            REP(j, i){
                dist[i][j] = dist[j][i] = getDistance(i, j);
            }
        }
        vector<int> nxt(n, 0);
        REP(i, n){
            if(i == 0) nxt[i] = 1;
            REP(j, n){
                if(i == j) continue;
                if(dist[i][nxt[i]] > dist[i][j])
                    nxt[i] = j;
            }
        }
        REP(i, n) d.join(i, nxt[i]);
        int mc = d.find(0);
        vector<int> distance_main(n, -1);
        vector<int> oth(n, -1);
        REP(component_number, n){
            if(component_number == mc) continue;
            int pv = -1;
            REP(i, n){
                if(d.find(i) == component_number){
                    int min_dist = INF;
                    int oth_dist = -1;
                    REP(k, n){
                        if(d.find(k) == mc){
                            if(min_dist > dist[i][k]){
                                min_dist = dist[i][k];
                                oth_dist = k;
                            }
                        }
                    }
                    distance_main[i] = min_dist;
                    oth[i] = oth_dist;
                    if(pv == -1 || distance_main[i] < distance_main[pv])
                        pv = i;
                }
            }
            if(pv != -1)
                nxt[pv] = oth[pv];
        }
        REP(i, n){
            REP(j, n){
                if(stype[j] == -1  && stype[nxt[j]] != -1){
                    if(stype[nxt[j]] == 1){
                        stype[j] = 2;
                        location[j] = location[nxt[j]] + dist[j][nxt[j]];
                    }
                    else{
                        stype[j] = 1;
                        location[j] = location[nxt[j]] - dist[j][nxt[j]];
                    }
                }
            }
        }
    };
    solve_subtask1();
}

• Subtask 1: 8 / 8
• Subtask 2: 22 / 22
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44