oj.uz

답안 #322395

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
322395 2020-11-14T15:04:03 Z jc713 동기화 (JOI13_synchronization) C++17
100 / 100
 624 ms 34180 KB 
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>,
    rb_tree_tag, tree_order_statistics_node_update>;
 
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);
    }
};

int depth[131072], par[131072];

template<class T, int n> struct Seg { // comb(ID,b) = b
	const T ID = 0; T comb(T a, T b) { return a+b; } 
	vector<T> seg;
	Seg() { seg.assign(2*n,ID); }
	void pull(int p) { seg[p] = comb(seg[2*p],seg[2*p+1]); }
	void upd(int p, T val) { // set val at position p
		seg[p += n] = val; for (p /= 2; p; p /= 2) pull(p); }
	T query(int l, int r) {	// sum on interval [l, r]
		T ra = ID, rb = ID; 
		for (l += n, r += n+1; l < r; l /= 2, r /= 2) {
			if (l&1) ra = comb(ra,seg[l++]);
			if (r&1) rb = comb(seg[--r],rb);
		}
		return comb(ra,rb);
	}
};

template<int SZ, bool VALS_IN_EDGES> struct HLD {
	int N; vi adj[SZ];
	int root[SZ], sz[SZ], info[SZ], ti;
	int anc[SZ][20];
	int pos[SZ]; vi rpos; // rpos not used, but could be useful
	void ae(int x, int y) { adj[x].pb(y), adj[y].pb(x); }
	void dfsSz(int x) {
		sz[x] = 1;
		trav(y,adj[x]) {
			par[y] = x; depth[y] = depth[x]+1;
			adj[y].erase(find(all(adj[y]),x)); // remove parent from adj list
			dfsSz(y); sz[x] += sz[y];
			if (sz[y] > sz[adj[x][0]]) swap(y,adj[x][0]);
		}
	}
	void dfsHld(int x) {
		pos[x] = ti++; rpos.pb(x);
		trav(y,adj[x]) {
			root[y] = (y == adj[x][0] ? root[x] : y);
			dfsHld(y); }
	}
	void init(int _N, int R = 0) { N = _N;
		par[R] = depth[R] = ti = 0; dfsSz(R);
		root[R] = R; dfsHld(R);
		fill(info, info + SZ, 1);
		F0R(a, N)
			anc[a][0] = par[a];
		F0R(a, N)
			FOR(b, 1, 20)
				anc[a][b] = anc[anc[a][b - 1]][b - 1];
	}
	Seg<ll,SZ> tree; // segtree for ancestor
	template <class BinaryOp>
	void processPath(int x, int y, BinaryOp op) {
		for (; root[x] != root[y]; y = par[root[y]]) {
			if (depth[root[x]] > depth[root[y]]) swap(x,y);
			op(pos[root[y]],pos[y]); }
		if (depth[x] > depth[y]) swap(x,y);
		op(pos[x]+VALS_IN_EDGES,pos[y]);
	}
	void modifyPath(int x, int y, int v) {
		processPath(x,y,[this,&v](int l, int r) {
			tree.upd(l,v); }); }
	ll queryPath(int x, int y) {
		ll res = 0; processPath(x,y,[this,&res](int l, int r) {
			res += tree.query(l,r); });
		return res; }
	int getroot(int x){ // 1 = root, 0 = normal
		if(queryPath(x, x) > 0)
			return x;
		R0F(a, 20)
			while(queryPath(anc[x][a], x) == 0)
				x = anc[x][a];
		return anc[x][0];
	}
	void setroot(int x, int v) {
		modifyPath(x, x, v);
   	}
	int getnum(int x){
		return info[x];
	}
	void setnum(int x, ll v){
		info[x] = v;
	}
};

vpi edg;
bool on[131072];
ll last[131072];

int main(){
    setIO();
	HLD<131072, false> l;
	int N, M, Q;
	cin >> N >> M >> Q;
	F0R(a, N - 1){
		int X, Y;
		cin >> X >> Y;
		X--, Y--;
		l.ae(X, Y);
		edg.pb({X, Y});
	}
	l.init(N);
	F0R(a, N)
		l.setroot(a, 1);
	F0R(a, M){
		int D;
		cin >> D;
		D--;
		if(on[D]){
			on[D] = false;
			int lo = edg[D].f, hi = edg[D].s;
			if(depth[lo] < depth[hi])
				swap(lo, hi);
			int r = l.getroot(hi);
			last[D] = l.getnum(r);
			l.setroot(lo, 1);
			l.setnum(lo, last[D]);
		}
		else{
			on[D] = true;
			int lo = edg[D].f, hi = edg[D].s;
			if(depth[lo] < depth[hi])
				swap(lo, hi);
			int r = l.getroot(hi);
			l.setroot(lo, 0);
			int nval = l.getnum(r) + l.getnum(lo) - last[D];
			l.setnum(r, nval);
		}
	}
	while(Q--){
		int x;
		cin >> x;
		x--;
		cout << l.getnum(l.getroot(x)) << endl;
	}
    // you should actually read the stuff at the bottom
}
 
/* 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

synchronization.cpp: In function 'void setIn(str)':
synchronization.cpp:190:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  190 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
synchronization.cpp: In function 'void setOut(str)':
synchronization.cpp:191:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  191 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5996 KB Output is correct
2 Correct 4 ms 5996 KB Output is correct
3 Correct 4 ms 5996 KB Output is correct
4 Correct 4 ms 5996 KB Output is correct
5 Correct 5 ms 5996 KB Output is correct
6 Correct 5 ms 6252 KB Output is correct
7 Correct 20 ms 7788 KB Output is correct
8 Correct 24 ms 7788 KB Output is correct
9 Correct 21 ms 7788 KB Output is correct
10 Correct 290 ms 23984 KB Output is correct
11 Correct 279 ms 23904 KB Output is correct
12 Correct 277 ms 33248 KB Output is correct
13 Correct 106 ms 23900 KB Output is correct
14 Correct 206 ms 22624 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 210 ms 28000 KB Output is correct
2 Correct 221 ms 27436 KB Output is correct
3 Correct 162 ms 31968 KB Output is correct
4 Correct 163 ms 31880 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5996 KB Output is correct
2 Correct 4 ms 5996 KB Output is correct
3 Correct 4 ms 5996 KB Output is correct
4 Correct 4 ms 5996 KB Output is correct
5 Correct 4 ms 5996 KB Output is correct
6 Correct 9 ms 6252 KB Output is correct
7 Correct 50 ms 8812 KB Output is correct
8 Correct 582 ms 34144 KB Output is correct
9 Correct 587 ms 34180 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 570 ms 34144 KB Output is correct
2 Correct 542 ms 32864 KB Output is correct
3 Correct 560 ms 33120 KB Output is correct
4 Correct 547 ms 33248 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5996 KB Output is correct
2 Correct 4 ms 5996 KB Output is correct
3 Correct 4 ms 5996 KB Output is correct
4 Correct 5 ms 5996 KB Output is correct
5 Correct 8 ms 6252 KB Output is correct
6 Correct 51 ms 7916 KB Output is correct
7 Correct 595 ms 24800 KB Output is correct
8 Correct 574 ms 34144 KB Output is correct
9 Correct 356 ms 24924 KB Output is correct
10 Correct 624 ms 23852 KB Output is correct
11 Correct 553 ms 29104 KB Output is correct
12 Correct 548 ms 29280 KB Output is correct
13 Correct 545 ms 33120 KB Output is correct