제출 #922022

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
922022		trMatherz	공장들 (JOI14_factories)	C++17	15 / 100	8090 ms	198364 KiB

factories

#include "factories.h"
/*
#include <fstream>
std::ifstream cin ("ex.in");
std::ofstream cout ("ex.out");
*/




// includes
#include <cmath> 
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>



//usings 
using namespace std;
using namespace __gnu_pbds;


// misc
#define ll long long
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; }
typedef uint64_t hash_t;

// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz resize
#define all(x) x.begin(), x.end()


// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second

// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// maps
#define mii map<int, int>
#define mll map<ll, ll>

// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRE(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define FE(x, y) F(x, y + 1)
#define A(x, y) for(auto &x : y)

int n;
vvpll a;
vb b; vi sz;
vvpll used;
vl node;

int getsz(int x, int p = -1){
    sz[x] = 1;
    A(u, a[x]) if(u.f != p && !b[u.f]) sz[x] += getsz(u.f, x);
    return sz[x];
}

int getc(int x, int z, int p = -1){
    A(u, a[x]) if(u.f != p && !b[u.f] && sz[u.f] * 2 > z) return getc(u.f, z, x);
    return x;
}

void go(int x, int c, ll d, int p = -1){
    used[x].pb({c, d});
    A(u, a[x]) if(u.f != p && !b[u.f]) go(u.f, c, d + u.s, x);
}

void build(int x = 0){
    int c = getc(x, getsz(x));
    b[c] = true;
    A(u, a[c]) if(!b[u.f]) go(u.f, c, u.s);
    A(u, a[c]) if(!b[u.f]) build(u.f);
}

void Init(int N, int A[], int B[], int D[]){
    n = N;
    a = vvpll(n);
    used = vvpll(n);
    sz = vi(n);
    b = vb(n, false);
    F(i, n - 1){
        a[A[i]].pb({B[i], D[i]});
        a[B[i]].pb({A[i], D[i]});
    }
    build();
}
ll an;

void upd(int x){
    A(u, used[x]){
        emin(node[u.f], u.s);
    }
    node[x] = 0;
}

void get(int x){
    A(u, used[x]){
        emin(an, node[u.f] + u.s);
    }
    emin(an, node[x]);
}

ll Query(int S, int X[], int T, int Y[]){
    an = 1e18;
    node = vl(n, 1e18);
    F(i, S) upd(X[i]);
    F(i, T) get(Y[i]);
    return an;
}

• Subtask 1: 15 / 15
• Subtask 2: 0 / 18
• Subtask 3: 0 / 67