oj.uz

Submission #240102

# Submission time Handle Problem Language Result Execution time Memory
240102 2020-06-18T04:53:22 Z b00n0rp Mergers (JOI19_mergers) C++17
0 / 100
 145 ms 53740 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN NEEDED)\
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")\
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// -------------------</optimizations>--------------------

// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
// ---------------</Headers and namespaces>---------------

// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)

typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))

// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);

#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);

#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----

// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);

#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);

#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);

#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----

#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

// ----------------</Defines and typedefs>----------------

// -------------------<Debugging stuff>-------------------
#define TRACE

#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
	cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...);
}
#else
#define trace(...)
#endif

// ------------------</Debugging stuff>-------------------

// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI = acos(-1);

#ifdef int
const int INF = 1e16;
#else
const int INF = 1e9;
#endif

const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;

// -----------------------</Consts>-----------------------

// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.

// ------------------------</RNG>-------------------------
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b) { return(b ? __gcd(a, b) : a); }
template<typename T> T lcm(T a, T b) { return(a * (b / gcd(a, b))); }
int add(int a, int b, int c = MOD) { int res = a + b; return(res >= c ? res - c : res); }
int mod_neg(int a, int b, int c = MOD) { int res; if (abs(a - b) < c)res = a - b; else res = (a - b) % c; return(res < 0 ? res + c : res); }
int mul(int a, int b, int c = MOD) { ll res = (ll)a * b; return(res >= c ? res % c : res); }
int muln(int a, int b, int c = MOD) { ll res = (ll)a * b; return ((res % c) + c) % c; }
ll mulmod(ll a, ll b, ll m = MOD) { ll q = (ll)(((LD)a * (LD)b) / (LD)m); ll r = a * b - q * m; if (r > m)r %= m; if (r < 0)r += m; return r; }
template<typename T>T expo(T e, T n) { T x = 1, p = e; while (n) { if (n & 1)x = x * p; p = p * p; n >>= 1; }return x; }
template<typename T>T power(T e, T n, T m = MOD) { T x = 1, p = e; while (n) { if (n & 1)x = mul(x, p, m); p = mul(p, p, m); n >>= 1; }return x; }
template<typename T>T extended_euclid(T a, T b, T& x, T& y) {
	T xx = 0, yy = 1; y = 0; x = 1; while (b) {
		T q = a / b, t = b; b = a % b; a = t; \
			t = xx; xx = x - q * xx; x = t; t = yy; yy = y - q * yy; y = t;
	}return a;
}
template<typename T>T mod_inverse(T a, T n = MOD) { T x, y, z = 0; T d = extended_euclid(a, n, x, y); return(d > 1 ? -1 : mod_neg(x, z, n)); }
const int FACSZ = 1; // Make sure to change this
int fact[FACSZ], ifact[FACSZ];
void precom(int c = MOD) {
	fact[0] = 1;
	FOR(i, 1, FACSZ) fact[i] = mul(fact[i - 1], i, c);
	ifact[FACSZ - 1] = mod_inverse(fact[FACSZ - 1], c);
	REPD(i, FACSZ - 1) {
		ifact[i] = mul(i + 1, ifact[i + 1], c);
	}
}
int ncr(int n, int r, int c = MOD) {
	return mul(mul(ifact[r], ifact[n - r], c), fact[n], c);
}
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------

void solvethetestcase();

signed main() {
	// (UNCOMMENT FOR CIN/COUT) \
	FAST_IO
	PRECISION(10)

	int t = 1;
	// (UNCOMMENT FOR MULTIPLE TEST CASES) \
	sfl(t);
	FOR(testcase, 1, t + 1) {
		// (UNCOMMENT FOR CODEJAM) \
		printf("Case #%lld: ",testcase); 
		solvethetestcase();
	}
}

int n,k;	
vi adj[500005];
int state[500005];
vi gg[500005];
int mind[500005],dep[500005],par[500005][21];
bitset<500005> bad;
int bcnt[500005];

void dfs(int u,int p,int d = 0){
	dep[u] = mind[u] = d;
	par[u][0] = p;
	for(auto v:adj[u]){
		if(v != p) dfs(v,u,d+1);
	}
}

int lca(int u,int v){
	if(dep[v] < dep[u]) swap(u,v);
	FORD(j,20,0){
		if(dep[v]-(1<<j) >= dep[u]){
			v = par[v][j];
		}
	}
	if(u == v) return u;
	FORD(j,20,0){
		if(par[u][j] != par[v][j]){
			u = par[u][j];
			v = par[v][j];
		}
	}
	return par[u][0];
}

void refresh(int u){
	bcnt[u] = 0;
	for(auto v:adj[u]){
		if(v == par[u][0]) continue;
		refresh(v);
		remin(mind[u],mind[v]);
		bcnt[u] += bcnt[v];
	}
	if(mind[u] == dep[u]) bad[u] = 1;
	bcnt[u] += bad[u];
}

pii dp[500005];

void solve(int u){
	int cur1 = 0,cur2 = 0,cur3 = 0;
	for(auto v:adj[u]){
		if(v == par[u][0] or bcnt[v] == 0) continue;
		solve(v);
		cur1++;
		cur2 += dp[v].F;
		cur3 += dp[v].S;
		if(bad[v] == 0 and dp[v].S == 0){
			cur1--;
		}	
	}
	dp[u].S = cur1%2;
	cur1 -= cur3*2;
	remax(cur1,0LL);
	dp[u].F = (cur1+1)/2 + cur2;
	// trace(u,dp[u].F,dp[u].S);
}

void solvethetestcase() {
	sfl2(n,k)
	REP(i,n-1){
		int u,v; sfl2(u,v)
		adj[u].pb(v);
		adj[v].pb(u);
	}
	dfs(1,1);
	FOR(j,1,21){
		FOR(i,1,n+1){
			par[i][j] = par[par[i][j-1]][j-1];
		}
	}
	FOR(i,1,n+1){
		sfl(state[i])
		gg[state[i]].pb(i);
	}
	FOR(i,1,k+1){
		int x = gg[i][0];
		FOR(j,1,gg[i].size()) x = lca(x,gg[i][j]);
		for(auto u:gg[i]){
			remin(mind[u],dep[x]);
		}
	}
	refresh(1);
	if(bcnt[1] == 0){
		printf("0\n");
		return;
	}
	solve(1);
	pfl(dp[1].F)
}

Compilation message

mergers.cpp:4:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
 ^
mergers.cpp:6:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN NEEDED)\
 ^
mergers.cpp:54:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
mergers.cpp:209:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR CIN/COUT) \
  ^
mergers.cpp:214:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR MULTIPLE TEST CASES) \
  ^
mergers.cpp:217:3: warning: multi-line comment [-Wcomment]
   // (UNCOMMENT FOR CODEJAM) \
   ^
mergers.cpp: In function 'void solvethetestcase()':
mergers.cpp:65:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(i,a,b) for (int i = a; i < b; i++)
mergers.cpp:308:7:
   FOR(j,1,gg[i].size()) x = lca(x,gg[i][j]);
       ~~~~~~~~~~~~~~~~                
mergers.cpp:308:3: note: in expansion of macro 'FOR'
   FOR(j,1,gg[i].size()) x = lca(x,gg[i][j]);
   ^~~
mergers.cpp:94:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
mergers.cpp:290:2: note: in expansion of macro 'sfl2'
  sfl2(n,k)
  ^~~~
mergers.cpp:94:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
mergers.cpp:292:12: note: in expansion of macro 'sfl2'
   int u,v; sfl2(u,v)
            ^~~~
mergers.cpp:93:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl(x) scanf("%lld",&x);
                ~~~~~^~~~~~~~~~~
mergers.cpp:303:3: note: in expansion of macro 'sfl'
   sfl(state[i])
   ^~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23808 KB Output is correct
2 Correct 20 ms 23936 KB Output is correct
3 Correct 20 ms 23936 KB Output is correct
4 Correct 21 ms 23936 KB Output is correct
5 Correct 22 ms 23808 KB Output is correct
6 Correct 20 ms 23936 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 22 ms 23936 KB Output is correct
9 Correct 20 ms 23936 KB Output is correct
10 Correct 20 ms 23936 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct
12 Incorrect 20 ms 23808 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23808 KB Output is correct
2 Correct 20 ms 23936 KB Output is correct
3 Correct 20 ms 23936 KB Output is correct
4 Correct 21 ms 23936 KB Output is correct
5 Correct 22 ms 23808 KB Output is correct
6 Correct 20 ms 23936 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 22 ms 23936 KB Output is correct
9 Correct 20 ms 23936 KB Output is correct
10 Correct 20 ms 23936 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct
12 Incorrect 20 ms 23808 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23808 KB Output is correct
2 Correct 20 ms 23936 KB Output is correct
3 Correct 20 ms 23936 KB Output is correct
4 Correct 21 ms 23936 KB Output is correct
5 Correct 22 ms 23808 KB Output is correct
6 Correct 20 ms 23936 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 22 ms 23936 KB Output is correct
9 Correct 20 ms 23936 KB Output is correct
10 Correct 20 ms 23936 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct
12 Incorrect 20 ms 23808 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 49772 KB Output is correct
2 Correct 145 ms 53740 KB Output is correct
3 Incorrect 25 ms 24696 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23808 KB Output is correct
2 Correct 20 ms 23936 KB Output is correct
3 Correct 20 ms 23936 KB Output is correct
4 Correct 21 ms 23936 KB Output is correct
5 Correct 22 ms 23808 KB Output is correct
6 Correct 20 ms 23936 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 22 ms 23936 KB Output is correct
9 Correct 20 ms 23936 KB Output is correct
10 Correct 20 ms 23936 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct
12 Incorrect 20 ms 23808 KB Output isn't correct
13 Halted 0 ms 0 KB -