제출 #882285

#제출 시각아이디문제언어결과실행 시간메모리
882285noompty공장들 (JOI14_factories)C++17
15 / 100
8023 ms73044 KiB
#include <iostream> #include <vector> #include <tuple> #include <queue> #include <stack> #include <deque> #include <set> #include <map> #include <cmath> #include <array> #include <random> #include <string> #include <cassert> #include <climits> #include <algorithm> #include <unordered_set> #include <unordered_map> #include "factories.h" using namespace std; #define ll long long #define f first #define s second void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << '\'' << x << '\''; } void __print(const char *x) { cerr << '\"' << x << '\"'; } void __print(const string &x) { cerr << '\"' << x << '\"'; } void __print(bool x) { cerr << (x ? "true" : "false"); } template<typename A> void __print(const A &x); template<typename A, typename B> void __print(const pair<A, B> &p); template<typename... A> void __print(const tuple<A...> &t); template<typename T> void __print(stack<T> s); template<typename T> void __print(queue<T> q); template<typename T, typename... U> void __print(priority_queue<T, U...> q); template<typename A> void __print(const A &x) { bool first = true; cerr << '{'; for (const auto &i : x) { cerr << (first ? "" : ","), __print(i); first = false; } cerr << '}'; } template<typename A, typename B> void __print(const pair<A, B> &p) { cerr << '('; __print(p.f); cerr << ','; __print(p.s); cerr << ')'; } template<typename... A> void __print(const tuple<A...> &t) { bool first = true; cerr << '('; apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t); cerr << ')'; } template<typename T> void __print(stack<T> s) { vector<T> debugVector; while (!s.empty()) { T t = s.top(); debugVector.push_back(t); s.pop(); } reverse(debugVector.begin(), debugVector.end()); __print(debugVector); } template<typename T> void __print(queue<T> q) { vector<T> debugVector; while (!q.empty()) { T t = q.front(); debugVector.push_back(t); q.pop(); } __print(debugVector); } template<typename T, typename... U> void __print(priority_queue<T, U...> q) { vector<T> debugVector; while (!q.empty()) { T t = q.top(); debugVector.push_back(t); q.pop(); } __print(debugVector); } void _print() { cerr << "]\n"; } template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) { __print(H); if (sizeof...(T)) cerr << ", "; _print(T...); } #ifdef DEBUG #define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__) #else #define D(...) #endif int n; ll ans; vector<pair<int, int>> adj[500005]; bool u[500005], v[500005]; pair<ll, ll> dfs(int curr, int par) { ll mnu = 1e16, mnv = 1e16; for (auto [i, d] : adj[curr]) { if (i == par) continue; pair<ll, ll> nxt = dfs(i, curr); mnu = min(mnu, nxt.f + d); mnv = min(mnv, nxt.s + d); } if (u[curr]) mnu = 0; if (v[curr]) mnv = 0; ans = min(ans, mnu + mnv); return {mnu, mnv}; } void Init(int N, int A[], int B[], int D[]) { n = N; for (int i = 0; i < n - 1; i++) { adj[A[i]].push_back({B[i], D[i]}); adj[B[i]].push_back({A[i], D[i]}); } } ll Query(int S, int X[], int T, int Y[]) { for (int i = 0; i < S; i++) { u[X[i]] = true; } for (int i = 0; i < T; i++) { v[Y[i]] = true; } ans = 1e16; dfs(0, -1); for (int i = 0; i < S; i++) { u[X[i]] = false; } for (int i = 0; i < T; i++) { v[Y[i]] = false; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...