oj.uz

Submission #328801

# Submission time Handle Problem Language Result Execution time Memory
328801 2020-11-18T06:08:10 Z jc713 Factories (JOI14_factories) C++17
100 / 100
 6072 ms 175308 KB 
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using db = double; 
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>; 
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>; 
using vpd = vector<pd>;

#define tcT template<class T
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 

// pairs
#define mp make_pair
#define f first
#define s second

// vectors
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define sor(x) sort(all(x)) 
#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 

// loops
#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;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const int IINF = 1e9;
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

// helper funcs
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down

tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; }

#define tcTU tcT, class U
tcTU> T fstTrue(T lo, T hi, U f) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        T mid = lo+(hi-lo)/2;
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
    lo --; assert(lo <= hi); // assuming f is decreasing
    while (lo < hi) { // find first index such that f is true 
        T mid = lo+(hi-lo+1)/2;
        f(mid) ? lo = mid : hi = mid-1;
    } 
    return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
    sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
    auto it = t.find(u); assert(it != end(t));
    t.erase(u); } // element that doesn't exist from (multi)set

// INPUT
#define tcTUU tcT, class ...U
tcT> void re(complex<T>& c);
tcTU> void re(pair<T,U>& p);
tcT> void re(vector<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);

tcT> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }

tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> void re(vector<T>& x) { trav(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
    #ifdef LOCAL
        return b ? "true" : "false"; 
    #else 
        return ts((int)b);
    #endif
}
tcT> str ts(complex<T> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
tcTU> str ts(pair<T,U> p);
tcT> str ts(T v) { // containers with begin(), end()
    #ifdef LOCAL
        bool fst = 1; str res = "{";
        for (const auto& x: v) {
            if (!fst) res += ", ";
            fst = 0; res += ts(x);
        }
        res += "}"; return res;
    #else
        bool fst = 1; str res = "";
        for (const auto& x: v) {
            if (!fst) res += " ";
            fst = 0; res += ts(x);
        }
        return res;

    #endif
}
tcTU> str ts(pair<T,U> p) {
    #ifdef LOCAL
        return "("+ts(p.f)+", "+ts(p.s)+")"; 
    #else
        return ts(p.f)+" "+ts(p.s);
    #endif
}

// OUTPUT
tcT> void pr(T x) { cout << ts(x); }
tcTUU> void pr(const T& t, const U&... u) { 
    pr(t); pr(u...); }
void ps() { pr("\n"); } // print w/ spaces
tcTUU> void ps(const T& t, const U&... u) { 
    pr(t); if (sizeof...(u)) pr(" "); ps(u...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
    cerr << ts(t); if (sizeof...(u)) cerr << ", ";
    DBG(u...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
    #define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
    #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
         << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
    #define dbg(...) 0
    #define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

template<int SZ> struct Centroid {
	vector<pair<int, ll>> adj[SZ]; void ae(int a,int b,ll c){adj[a].eb(b, c),adj[b].eb(a, c);}
	bool done[SZ]; // processed as centroid yet
	int N,sub[SZ],cen[SZ],lev[SZ]; // subtree size, centroid anc
	ll dist[32-__builtin_clz(SZ)][SZ]; // dists to all ancs
	pair<pair<ll, int>, pair<ll, int>> stor[SZ];
	void dfs(int x, int p) { sub[x] = 1;
		trav(y,adj[x]) if (!done[y.f] && y.f != p)
			dfs(y.f,x), sub[x] += sub[y.f];
	}
	int centroid(int x) {
		dfs(x,-1);
		for (int sz = sub[x];;) {
			pi mx = {0,0};
			trav(y,adj[x]) if (!done[y.f] && sub[y.f] < sub[x])
				ckmax(mx,{sub[y.f],y.f});
			if (mx.f*2 <= sz) return x;
			x = mx.s;
		}
	}
	void genDist(int x, int p, int lev, ll ADD) {
		dist[lev][x] = dist[lev][p]+ADD;
		trav(y,adj[x]) if (!done[y.f] && y.f != p) genDist(y.f,x,lev,y.s); }
	void gen(int CEN, int _x) { // CEN = centroid above x
		int x = centroid(_x); done[x] = 1; cen[x] = CEN;
		sub[x] = sub[_x]; lev[x] = (CEN == -1 ? 0 : lev[CEN]+1);
		dist[lev[x]][x] = 0;
		trav(y,adj[x]) if (!done[y.f]) genDist(y.f,x,lev[x],y.s);
		trav(y,adj[x]) if (!done[y.f]) gen(x,y.f);
	}
	void init(int _N) { N = _N; FOR(i,1,N+1) done[i] = 0;
		fill(stor, stor + SZ, mp(mp(INF/2,-2),mp(INF/2,-2)));
		gen(-1,1); } // start at vert 1
	void upd(int x) {
		int cur = x, pre = -1;
		R0F(i,lev[x]+1) {
			if(stor[cur].f.s == pre)
				ckmin(stor[cur].f.f, dist[i][x]);
			else if(stor[cur].s.s == pre)
				ckmin(stor[cur].s.f, dist[i][x]);
			else
				ckmin(stor[cur].s, {dist[i][x], pre});
			if(stor[cur].f > stor[cur].s)
				swap(stor[cur].f, stor[cur].s);
			if (i > 0) pre = cur, cur = cen[cur];
		}
	} // call propAll() after all updates
	void clean(int x){
		int cur = x, pre = -1;
		R0F(i,lev[x]+1) {
			stor[cur] = mp(mp(INF/2,-2),mp(INF/2,-2));
			if (i > 0) pre = cur, cur = cen[cur];
		}
	}
	ll query(int x) { // get value at vertex x
		int cur = x, pre = -1;
		ll ans = INF / 2;
		R0F(i,lev[x]+1) { // if pre != -1, subtract those from
			if(stor[cur].f.s == -1 || stor[cur].f.s != pre)
				ckmin(ans, stor[cur].f.f + dist[i][x]);
			else
				ckmin(ans, stor[cur].s.f + dist[i][x]);
			if (i > 0) pre = cur, cur = cen[cur];
		}
		return ans;
	}
};

/*int main(){
    setIO();
    // you should actually read the stuff at the bottom
}*/

#include "factories.h"

Centroid<500010> l;

void Init(int N, int A[], int B[], int D[]) {
	F0R(a, N - 1)
		l.ae(A[a] + 1, B[a] + 1, D[a]);
	l.init(N);
}

long long Query(int S, int X[], int T, int Y[]) {
	F0R(a, S)
		l.upd(X[a] + 1);
	ll ans = INF / 2;
	F0R(a, T)
		ckmin(ans, l.query(Y[a] + 1));
	F0R(a, S)
		l.clean(X[a] + 1);
  return ans;
}
 
/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
    * DON'T GET STUCK ON ONE APPROACH
*/

Compilation message

factories.cpp: In instantiation of 'void Centroid<SZ>::clean(int) [with int SZ = 500010]':
factories.cpp:300:19:   required from here
factories.cpp:258:16: warning: variable 'pre' set but not used [-Wunused-but-set-variable]
  258 |   int cur = x, pre = -1;
      |                ^~~
factories.cpp: In function 'void setIn(str)':
factories.cpp:184:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  184 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
factories.cpp: In function 'void setOut(str)':
factories.cpp:185:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  185 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 28396 KB Output is correct
2 Correct 416 ms 37100 KB Output is correct
3 Correct 494 ms 37356 KB Output is correct
4 Correct 460 ms 37228 KB Output is correct
5 Correct 549 ms 37740 KB Output is correct
6 Correct 262 ms 36972 KB Output is correct
7 Correct 483 ms 37356 KB Output is correct
8 Correct 493 ms 37324 KB Output is correct
9 Correct 569 ms 37612 KB Output is correct
10 Correct 264 ms 36836 KB Output is correct
11 Correct 481 ms 37228 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 28012 KB Output is correct
2 Correct 2504 ms 132948 KB Output is correct
3 Correct 3793 ms 151084 KB Output is correct
4 Correct 770 ms 79320 KB Output is correct
5 Correct 4849 ms 175308 KB Output is correct
6 Correct 3997 ms 151864 KB Output is correct
7 Correct 1656 ms 60484 KB Output is correct
8 Correct 428 ms 48604 KB Output is correct
9 Correct 1970 ms 64176 KB Output is correct
10 Correct 1757 ms 60012 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 28396 KB Output is correct
2 Correct 416 ms 37100 KB Output is correct
3 Correct 494 ms 37356 KB Output is correct
4 Correct 460 ms 37228 KB Output is correct
5 Correct 549 ms 37740 KB Output is correct
6 Correct 262 ms 36972 KB Output is correct
7 Correct 483 ms 37356 KB Output is correct
8 Correct 493 ms 37324 KB Output is correct
9 Correct 569 ms 37612 KB Output is correct
10 Correct 264 ms 36836 KB Output is correct
11 Correct 481 ms 37228 KB Output is correct
12 Correct 21 ms 28012 KB Output is correct
13 Correct 2504 ms 132948 KB Output is correct
14 Correct 3793 ms 151084 KB Output is correct
15 Correct 770 ms 79320 KB Output is correct
16 Correct 4849 ms 175308 KB Output is correct
17 Correct 3997 ms 151864 KB Output is correct
18 Correct 1656 ms 60484 KB Output is correct
19 Correct 428 ms 48604 KB Output is correct
20 Correct 1970 ms 64176 KB Output is correct
21 Correct 1757 ms 60012 KB Output is correct
22 Correct 3209 ms 132176 KB Output is correct
23 Correct 3290 ms 136688 KB Output is correct
24 Correct 4964 ms 152060 KB Output is correct
25 Correct 4972 ms 156176 KB Output is correct
26 Correct 4984 ms 153788 KB Output is correct
27 Correct 6072 ms 173516 KB Output is correct
28 Correct 1035 ms 82856 KB Output is correct
29 Correct 4892 ms 152644 KB Output is correct
30 Correct 4939 ms 151916 KB Output is correct
31 Correct 4916 ms 153228 KB Output is correct
32 Correct 1931 ms 77716 KB Output is correct
33 Correct 491 ms 60796 KB Output is correct
34 Correct 1169 ms 67564 KB Output is correct
35 Correct 1191 ms 67564 KB Output is correct
36 Correct 1641 ms 70764 KB Output is correct
37 Correct 1660 ms 71112 KB Output is correct