제출 #474185

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
474185		NhatMinh0208	Mergers (JOI19_mergers)	C++14	0 / 100	95 ms	36508 KiB

mergers

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<pii(int)> gt[500001];
vector<int> buc[500001];
ll n,m,i,j,k,t,t1,u,v,a,b;
int col[500001];
int par[500001];
ll hah[500001];
ll dp[500001];
int eu[500001];
int ev[500001];
int gp[500001];
ll rand60() {
    ll a = (rand()&((1<<30)-1));
    ll b = (rand()&((1<<30)-1))<<10;
    ll c = (rand()&((1<<30)-1))<<20;
    ll d = (rand()&((1<<30)-1))<<30;

    return a^b^c^d;
}
void dfs(int x, int p) {
    dp[x]=hah[x];
    for (auto g : gt[x]) if (g.fi-p) {
        dfs(g.fi,x);
        dp[x]^=dp[g.fi];
    }
    if (dp[x]==0) {
        for (auto g : gt[x]) if (g.fi == p) {
            gp[g.se]=1;
        }
    }
}
void dfs2(int x, int p) {
    col[x]=t;
    for (auto g : gt[x]) if (g.fi-p) dfs2(g.fi,x);
}
int dp2[500001][2];
void dfs3(int x, int p) {
    int u=0,a=0;
    dp2[x][0]=dp2[x][1]=1e9;
    for (auto g : gt[x]) if (g.fi-p) {
        a++;
        dfs3(g.fi,x);
        u+=min(dp2[g.fi][0]+1,dp2[g.fi][1]);
    }
    if (a==0) {
        dp2[x][0]=0;
        dp2[x][1]=1e9;
    } else if (a%2) {
        dp2[x][0]=u-a/2;
        dp2[x][1]=u-a/2;
    } else {
        dp2[x][0]=u-a/2;
        dp2[x][1]=u-(a/2-1);
    }

}
int main()
{
    srand(234123);
	fio;
    cin>>n>>m;
    for (i=1;i<n;i++) {
        cin>>eu[i]>>ev[i];
        gt[eu[i]].push_back({ev[i],i});
        gt[ev[i]].push_back({eu[i],i});
    }
    for (i=1;i<=n;i++) {cin>>col[i]; buc[col[i]].push_back(i);}
    for (i=1;i<=m;i++) {
        u=0;
        for (j=0;j<buc[i].size()-1;j++) {
            hah[buc[i][j]]=rand();
            u^=hah[buc[i][j]];
        }
        hah[buc[i][buc[i].size()-1]]=u;
    }
    dfs(1,-1);
    for (i=1;i<=n;i++) {
        col[i]=0;
        gt[i].clear();
    }
    for (i=1;i<n;i++) if (!gp[i]) {
        gt[eu[i]].push_back({ev[i],i});
        gt[ev[i]].push_back({eu[i],i});
    }
    t=0;
    for (i=1;i<=n;i++) if (!col[i]) {
        t++;
        dfs2(i,-1);
    }
    for (i=1;i<=n;i++) gt[i].clear();
    for (i=1;i<n;i++) if (gp[i]) {
        // cout<<col[eu[i]]<<' '<<col[ev[i]]<<endl;
        gt[col[eu[i]]].push_back({col[ev[i]],i});
        gt[col[ev[i]]].push_back({col[eu[i]],i});
    }
    dfs3(1,-1);
    cout<<min(dp2[1][0],dp2[1][1]);
}
// N;

컴파일 시 표준 에러 (stderr) 메시지

mergers.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
mergers.cpp: In function 'int main()':
mergers.cpp:168:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  168 |         for (j=0;j<buc[i].size()-1;j++) {
      |                  ~^~~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 24
• Subtask 3: 0 / 14
• Subtask 4: 0 / 22
• Subtask 5: 0 / 30