oj.uz

답안 #205162

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
205162 2020-02-28T08:33:35 Z cheetose Mergers (JOI19_mergers) C++11
100 / 100
 1625 ms 131348 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 42043;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

Vi v[500005],col[500005];
Pi d[2][500005];
bool chk[500005];
int a[500005];
ll sub[500005];
int cnt[500005],deg[500005];
int par[500005];
int find(int a)
{
	if (par[a] < 0)return a;
	return par[a] = find(par[a]);
}
void merge(int a, int b)
{
	a = find(a), b = find(b);
	if (a != b)par[b] = a;
}
int n,k;
int dfs(int N,int p=-1,bool ok=0)
{
	if(chk[N])ok=1;
	int tt=0;
	for(int next:v[N])
	{
		if(next==p)continue;
		if(cnt[next]>0)tt++;
	}
	if(tt>1)ok=1;
	for(int next:v[N])
	{
		if(next==p)continue;
		dfs(next,N,ok);
		if(ok && cnt[next]>0)deg[N]++,deg[next]++;
	}
}
int parent[500005][19], depth[500005];
void dfs2(int N,int p,int d)
{
	depth[N]=d;
	parent[N][0]=p;
	for(int next:v[N])
	{
		if(next==p)continue;
		dfs2(next,N,d+1);
	}
}
int LCA(int x, int y)
{
	if (depth[x] < depth[y])swap(x, y);
	int dif = depth[x] - depth[y];
	for (int j = 0; dif > 0; j++)
	{
		if (dif & 1)x = parent[x][j];
		dif >>= 1;
	}

	if (x != y)
	{
		fdn(j,18,0,1)
		{
			if (parent[x][j] != -1 && parent[x][j] != parent[y][j])
			{
				x = parent[x][j];
				y = parent[y][j];
			}
		}
		x = parent[x][0];
	}
	return x;
}
void dfs4(int N,int p=-1)
{
	cnt[N]=chk[N];
	for(int next:v[N])
	{
		if(next==p)continue;
		dfs4(next,N);
		cnt[N]+=cnt[next];
	}
}
int main() {
	MEM_1(par);MEM_1(parent);
	scanf("%d%d",&n,&k);
	fup(i,1,n-1,1)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		v[x].pb(y);
		v[y].pb(x);
	}
	fup(i,1,n,1)
	{
		scanf("%d",a+i),a[i]--;
		col[a[i]].pb(i);
	}
	dfs2(1,-1,0);
	fup(j,0,17,1)
		fup(i,1,n,1)
		if (parent[i][j] != -1)
			parent[i][j + 1] = parent[parent[i][j]][j];
	fup(i,0,k-1,1)
	{
		if(col[i].size()<=1)continue;
		int now=col[i][0];
		fup(j,1,(int)col[i].size()-1,1)
		{
			int u=LCA(now,col[i][j]);
			while(find(u)!=find(col[i][j]))
			{
				col[i][j]=find(col[i][j]);
				merge(parent[col[i][j]][0],col[i][j]);
			}
			while(find(u)!=find(now))
			{
				now=find(now);
				merge(parent[now][0],now);
			}
			now=u;
		}
	}
	fup(i,1,n,1)
	{
		for(int x:v[i])
			if(find(i)!=find(x))chk[i]=chk[x]=1;
	}
	dfs4(1);
	dfs(1);
	int res=0;
	fup(i,1,n,1)if(deg[i]==1)res++;
	printf("%d\n",res+1>>1);
}

Compilation message

mergers.cpp: In function 'int dfs(int, int, bool)':
mergers.cpp:78:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
mergers.cpp: In function 'int main()':
mergers.cpp:173:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  printf("%d\n",res+1>>1);
                ~~~^~
mergers.cpp:126:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&k);
  ~~~~~^~~~~~~~~~~~~~
mergers.cpp:130:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&x,&y);
   ~~~~~^~~~~~~~~~~~~~
mergers.cpp:136:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",a+i),a[i]--;
   ~~~~~~~~~~~~~~~^~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 62968 KB Output is correct
2 Correct 39 ms 62968 KB Output is correct
3 Correct 40 ms 62968 KB Output is correct
4 Correct 40 ms 62968 KB Output is correct
5 Correct 39 ms 62968 KB Output is correct
6 Correct 38 ms 62968 KB Output is correct
7 Correct 39 ms 62968 KB Output is correct
8 Correct 40 ms 62968 KB Output is correct
9 Correct 39 ms 62968 KB Output is correct
10 Correct 38 ms 62968 KB Output is correct
11 Correct 39 ms 62968 KB Output is correct
12 Correct 41 ms 62968 KB Output is correct
13 Correct 38 ms 62968 KB Output is correct
14 Correct 41 ms 62968 KB Output is correct
15 Correct 39 ms 62968 KB Output is correct
16 Correct 40 ms 62972 KB Output is correct
17 Correct 39 ms 62968 KB Output is correct
18 Correct 39 ms 62968 KB Output is correct
19 Correct 40 ms 62968 KB Output is correct
20 Correct 40 ms 62968 KB Output is correct
21 Correct 40 ms 62968 KB Output is correct
22 Correct 41 ms 62968 KB Output is correct
23 Correct 42 ms 62936 KB Output is correct
24 Correct 41 ms 62968 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 62968 KB Output is correct
2 Correct 39 ms 62968 KB Output is correct
3 Correct 40 ms 62968 KB Output is correct
4 Correct 40 ms 62968 KB Output is correct
5 Correct 39 ms 62968 KB Output is correct
6 Correct 38 ms 62968 KB Output is correct
7 Correct 39 ms 62968 KB Output is correct
8 Correct 40 ms 62968 KB Output is correct
9 Correct 39 ms 62968 KB Output is correct
10 Correct 38 ms 62968 KB Output is correct
11 Correct 39 ms 62968 KB Output is correct
12 Correct 41 ms 62968 KB Output is correct
13 Correct 38 ms 62968 KB Output is correct
14 Correct 41 ms 62968 KB Output is correct
15 Correct 39 ms 62968 KB Output is correct
16 Correct 40 ms 62972 KB Output is correct
17 Correct 39 ms 62968 KB Output is correct
18 Correct 39 ms 62968 KB Output is correct
19 Correct 40 ms 62968 KB Output is correct
20 Correct 40 ms 62968 KB Output is correct
21 Correct 40 ms 62968 KB Output is correct
22 Correct 41 ms 62968 KB Output is correct
23 Correct 42 ms 62936 KB Output is correct
24 Correct 41 ms 62968 KB Output is correct
25 Correct 42 ms 62968 KB Output is correct
26 Correct 43 ms 63224 KB Output is correct
27 Correct 42 ms 63224 KB Output is correct
28 Correct 42 ms 63356 KB Output is correct
29 Correct 44 ms 63224 KB Output is correct
30 Correct 42 ms 63224 KB Output is correct
31 Correct 40 ms 62968 KB Output is correct
32 Correct 43 ms 63352 KB Output is correct
33 Correct 40 ms 62968 KB Output is correct
34 Correct 41 ms 63096 KB Output is correct
35 Correct 41 ms 63224 KB Output is correct
36 Correct 41 ms 63224 KB Output is correct
37 Correct 43 ms 63224 KB Output is correct
38 Correct 39 ms 62968 KB Output is correct
39 Correct 42 ms 63224 KB Output is correct
40 Correct 42 ms 63096 KB Output is correct
41 Correct 45 ms 63224 KB Output is correct
42 Correct 42 ms 63224 KB Output is correct
43 Correct 43 ms 63356 KB Output is correct
44 Correct 40 ms 62968 KB Output is correct
45 Correct 43 ms 63224 KB Output is correct
46 Correct 42 ms 63224 KB Output is correct
47 Correct 39 ms 62968 KB Output is correct
48 Correct 47 ms 63224 KB Output is correct
49 Correct 41 ms 63352 KB Output is correct
50 Correct 45 ms 63352 KB Output is correct
51 Correct 43 ms 63228 KB Output is correct
52 Correct 42 ms 63096 KB Output is correct
53 Correct 42 ms 63224 KB Output is correct
54 Correct 42 ms 63096 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 62968 KB Output is correct
2 Correct 39 ms 62968 KB Output is correct
3 Correct 40 ms 62968 KB Output is correct
4 Correct 40 ms 62968 KB Output is correct
5 Correct 39 ms 62968 KB Output is correct
6 Correct 38 ms 62968 KB Output is correct
7 Correct 39 ms 62968 KB Output is correct
8 Correct 40 ms 62968 KB Output is correct
9 Correct 39 ms 62968 KB Output is correct
10 Correct 38 ms 62968 KB Output is correct
11 Correct 39 ms 62968 KB Output is correct
12 Correct 41 ms 62968 KB Output is correct
13 Correct 38 ms 62968 KB Output is correct
14 Correct 41 ms 62968 KB Output is correct
15 Correct 39 ms 62968 KB Output is correct
16 Correct 40 ms 62972 KB Output is correct
17 Correct 39 ms 62968 KB Output is correct
18 Correct 39 ms 62968 KB Output is correct
19 Correct 40 ms 62968 KB Output is correct
20 Correct 40 ms 62968 KB Output is correct
21 Correct 40 ms 62968 KB Output is correct
22 Correct 41 ms 62968 KB Output is correct
23 Correct 42 ms 62936 KB Output is correct
24 Correct 41 ms 62968 KB Output is correct
25 Correct 39 ms 62968 KB Output is correct
26 Correct 123 ms 68172 KB Output is correct
27 Correct 167 ms 67832 KB Output is correct
28 Correct 43 ms 63096 KB Output is correct
29 Correct 41 ms 62968 KB Output is correct
30 Correct 43 ms 62968 KB Output is correct
31 Correct 169 ms 68336 KB Output is correct
32 Correct 43 ms 63096 KB Output is correct
33 Correct 220 ms 75000 KB Output is correct
34 Correct 182 ms 67960 KB Output is correct
35 Correct 42 ms 63224 KB Output is correct
36 Correct 192 ms 68984 KB Output is correct
37 Correct 42 ms 63096 KB Output is correct
38 Correct 41 ms 63096 KB Output is correct
39 Correct 122 ms 68208 KB Output is correct
40 Correct 44 ms 63352 KB Output is correct
41 Correct 154 ms 67956 KB Output is correct
42 Correct 206 ms 70264 KB Output is correct
43 Correct 41 ms 62968 KB Output is correct
44 Correct 211 ms 75380 KB Output is correct
45 Correct 190 ms 71672 KB Output is correct
46 Correct 41 ms 63096 KB Output is correct
47 Correct 42 ms 63100 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 68208 KB Output is correct
2 Correct 135 ms 71408 KB Output is correct
3 Correct 43 ms 63224 KB Output is correct
4 Correct 42 ms 63224 KB Output is correct
5 Correct 40 ms 62968 KB Output is correct
6 Correct 40 ms 62968 KB Output is correct
7 Correct 42 ms 63224 KB Output is correct
8 Correct 189 ms 71160 KB Output is correct
9 Correct 43 ms 63224 KB Output is correct
10 Correct 172 ms 70044 KB Output is correct
11 Correct 42 ms 62968 KB Output is correct
12 Correct 182 ms 69880 KB Output is correct
13 Correct 185 ms 71032 KB Output is correct
14 Correct 172 ms 72696 KB Output is correct
15 Correct 125 ms 69600 KB Output is correct
16 Correct 42 ms 63224 KB Output is correct
17 Correct 40 ms 62972 KB Output is correct
18 Correct 142 ms 72684 KB Output is correct
19 Correct 206 ms 76664 KB Output is correct
20 Correct 43 ms 63224 KB Output is correct
21 Correct 40 ms 62972 KB Output is correct
22 Correct 140 ms 71404 KB Output is correct
23 Correct 43 ms 63224 KB Output is correct
24 Correct 190 ms 70368 KB Output is correct
25 Correct 187 ms 75256 KB Output is correct
26 Correct 41 ms 63228 KB Output is correct
27 Correct 42 ms 63352 KB Output is correct
28 Correct 43 ms 63224 KB Output is correct
29 Correct 41 ms 63224 KB Output is correct
30 Correct 43 ms 63224 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 62968 KB Output is correct
2 Correct 39 ms 62968 KB Output is correct
3 Correct 40 ms 62968 KB Output is correct
4 Correct 40 ms 62968 KB Output is correct
5 Correct 39 ms 62968 KB Output is correct
6 Correct 38 ms 62968 KB Output is correct
7 Correct 39 ms 62968 KB Output is correct
8 Correct 40 ms 62968 KB Output is correct
9 Correct 39 ms 62968 KB Output is correct
10 Correct 38 ms 62968 KB Output is correct
11 Correct 39 ms 62968 KB Output is correct
12 Correct 41 ms 62968 KB Output is correct
13 Correct 38 ms 62968 KB Output is correct
14 Correct 41 ms 62968 KB Output is correct
15 Correct 39 ms 62968 KB Output is correct
16 Correct 40 ms 62972 KB Output is correct
17 Correct 39 ms 62968 KB Output is correct
18 Correct 39 ms 62968 KB Output is correct
19 Correct 40 ms 62968 KB Output is correct
20 Correct 40 ms 62968 KB Output is correct
21 Correct 40 ms 62968 KB Output is correct
22 Correct 41 ms 62968 KB Output is correct
23 Correct 42 ms 62936 KB Output is correct
24 Correct 41 ms 62968 KB Output is correct
25 Correct 42 ms 62968 KB Output is correct
26 Correct 43 ms 63224 KB Output is correct
27 Correct 42 ms 63224 KB Output is correct
28 Correct 42 ms 63356 KB Output is correct
29 Correct 44 ms 63224 KB Output is correct
30 Correct 42 ms 63224 KB Output is correct
31 Correct 40 ms 62968 KB Output is correct
32 Correct 43 ms 63352 KB Output is correct
33 Correct 40 ms 62968 KB Output is correct
34 Correct 41 ms 63096 KB Output is correct
35 Correct 41 ms 63224 KB Output is correct
36 Correct 41 ms 63224 KB Output is correct
37 Correct 43 ms 63224 KB Output is correct
38 Correct 39 ms 62968 KB Output is correct
39 Correct 42 ms 63224 KB Output is correct
40 Correct 42 ms 63096 KB Output is correct
41 Correct 45 ms 63224 KB Output is correct
42 Correct 42 ms 63224 KB Output is correct
43 Correct 43 ms 63356 KB Output is correct
44 Correct 40 ms 62968 KB Output is correct
45 Correct 43 ms 63224 KB Output is correct
46 Correct 42 ms 63224 KB Output is correct
47 Correct 39 ms 62968 KB Output is correct
48 Correct 47 ms 63224 KB Output is correct
49 Correct 41 ms 63352 KB Output is correct
50 Correct 45 ms 63352 KB Output is correct
51 Correct 43 ms 63228 KB Output is correct
52 Correct 42 ms 63096 KB Output is correct
53 Correct 42 ms 63224 KB Output is correct
54 Correct 42 ms 63096 KB Output is correct
55 Correct 39 ms 62968 KB Output is correct
56 Correct 123 ms 68172 KB Output is correct
57 Correct 167 ms 67832 KB Output is correct
58 Correct 43 ms 63096 KB Output is correct
59 Correct 41 ms 62968 KB Output is correct
60 Correct 43 ms 62968 KB Output is correct
61 Correct 169 ms 68336 KB Output is correct
62 Correct 43 ms 63096 KB Output is correct
63 Correct 220 ms 75000 KB Output is correct
64 Correct 182 ms 67960 KB Output is correct
65 Correct 42 ms 63224 KB Output is correct
66 Correct 192 ms 68984 KB Output is correct
67 Correct 42 ms 63096 KB Output is correct
68 Correct 41 ms 63096 KB Output is correct
69 Correct 122 ms 68208 KB Output is correct
70 Correct 44 ms 63352 KB Output is correct
71 Correct 154 ms 67956 KB Output is correct
72 Correct 206 ms 70264 KB Output is correct
73 Correct 41 ms 62968 KB Output is correct
74 Correct 211 ms 75380 KB Output is correct
75 Correct 190 ms 71672 KB Output is correct
76 Correct 41 ms 63096 KB Output is correct
77 Correct 42 ms 63100 KB Output is correct
78 Correct 117 ms 68208 KB Output is correct
79 Correct 135 ms 71408 KB Output is correct
80 Correct 43 ms 63224 KB Output is correct
81 Correct 42 ms 63224 KB Output is correct
82 Correct 40 ms 62968 KB Output is correct
83 Correct 40 ms 62968 KB Output is correct
84 Correct 42 ms 63224 KB Output is correct
85 Correct 189 ms 71160 KB Output is correct
86 Correct 43 ms 63224 KB Output is correct
87 Correct 172 ms 70044 KB Output is correct
88 Correct 42 ms 62968 KB Output is correct
89 Correct 182 ms 69880 KB Output is correct
90 Correct 185 ms 71032 KB Output is correct
91 Correct 172 ms 72696 KB Output is correct
92 Correct 125 ms 69600 KB Output is correct
93 Correct 42 ms 63224 KB Output is correct
94 Correct 40 ms 62972 KB Output is correct
95 Correct 142 ms 72684 KB Output is correct
96 Correct 206 ms 76664 KB Output is correct
97 Correct 43 ms 63224 KB Output is correct
98 Correct 40 ms 62972 KB Output is correct
99 Correct 140 ms 71404 KB Output is correct
100 Correct 43 ms 63224 KB Output is correct
101 Correct 190 ms 70368 KB Output is correct
102 Correct 187 ms 75256 KB Output is correct
103 Correct 41 ms 63228 KB Output is correct
104 Correct 42 ms 63352 KB Output is correct
105 Correct 43 ms 63224 KB Output is correct
106 Correct 41 ms 63224 KB Output is correct
107 Correct 43 ms 63224 KB Output is correct
108 Correct 874 ms 100344 KB Output is correct
109 Correct 1600 ms 110312 KB Output is correct
110 Correct 1625 ms 121396 KB Output is correct
111 Correct 1483 ms 131348 KB Output is correct
112 Correct 1430 ms 121504 KB Output is correct
113 Correct 901 ms 108080 KB Output is correct
114 Correct 1069 ms 92304 KB Output is correct
115 Correct 1067 ms 92388 KB Output is correct
116 Correct 1296 ms 97656 KB Output is correct
117 Correct 1156 ms 108152 KB Output is correct
118 Correct 1082 ms 95312 KB Output is correct
119 Correct 1180 ms 108156 KB Output is correct
120 Correct 1326 ms 122032 KB Output is correct
121 Correct 1150 ms 108280 KB Output is correct
122 Correct 1304 ms 102196 KB Output is correct
123 Correct 748 ms 109668 KB Output is correct
124 Correct 1368 ms 107352 KB Output is correct