oj.uz

Submission #205152

# Submission time Handle Problem Language Result Execution time Memory
205152 2020-02-28T08:04:07 Z cheetose Mergers (JOI19_mergers) C++11
24 / 100
 3000 ms 45412 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];
Pi d[2][500005];
bool chk[500005];
int a[500005];
ll sub[500005];
int cnt[500005],deg[500005];
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]++;
	}
}
void dfs2(int N,int p=-1)
{
	sub[N]|=1LL<<a[N];
	for(int next:v[N])
	{
		if(next==p)continue;
		dfs2(next,N);
		sub[N]|=sub[next];
	}
}
void dfs3(int N,ll now,int p=-1)
{
	Vi t(k);
	for(int next:v[N])
	{
		if(next==p)continue;
		fup(i,0,k-1,1)if(sub[next]&(1LL<<i))t[i]++;
	}
	for(int next:v[N])
	{
		if(next==p)continue;
		fup(i,0,k-1,1)if(sub[next]&(1LL<<i))t[i]--;
		ll nx=now|(1LL<<a[N]);
		fup(i,0,k-1,1)if(t[i])nx|=(1LL<<i);
		if(!(nx&sub[next]))chk[N]=chk[next]=1;
		dfs3(next,nx,N);
		fup(i,0,k-1,1)if(sub[next]&(1LL<<i))t[i]++;
	}
}
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() {
	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]--;
	dfs2(1);
	dfs3(1,0);
	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:67:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
mergers.cpp: In function 'int main()':
mergers.cpp:123:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  printf("%d\n",res+1>>1);
                ~~~^~
mergers.cpp:108: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:112: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:116:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fup(i,1,n,1)scanf("%d",a+i),a[i]--;
              ~~~~~~~~~~~~~~~^~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12156 KB Output is correct
2 Correct 13 ms 12152 KB Output is correct
3 Correct 13 ms 12152 KB Output is correct
4 Correct 13 ms 12024 KB Output is correct
5 Correct 12 ms 12024 KB Output is correct
6 Correct 13 ms 12152 KB Output is correct
7 Correct 12 ms 12024 KB Output is correct
8 Correct 13 ms 12152 KB Output is correct
9 Correct 13 ms 12152 KB Output is correct
10 Correct 13 ms 12024 KB Output is correct
11 Correct 13 ms 12152 KB Output is correct
12 Correct 13 ms 12152 KB Output is correct
13 Correct 13 ms 12024 KB Output is correct
14 Correct 13 ms 12152 KB Output is correct
15 Correct 13 ms 12152 KB Output is correct
16 Correct 12 ms 12152 KB Output is correct
17 Correct 12 ms 12152 KB Output is correct
18 Correct 12 ms 12024 KB Output is correct
19 Correct 13 ms 12024 KB Output is correct
20 Correct 13 ms 12152 KB Output is correct
21 Correct 13 ms 12152 KB Output is correct
22 Correct 12 ms 12024 KB Output is correct
23 Correct 13 ms 12024 KB Output is correct
24 Correct 13 ms 12024 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12156 KB Output is correct
2 Correct 13 ms 12152 KB Output is correct
3 Correct 13 ms 12152 KB Output is correct
4 Correct 13 ms 12024 KB Output is correct
5 Correct 12 ms 12024 KB Output is correct
6 Correct 13 ms 12152 KB Output is correct
7 Correct 12 ms 12024 KB Output is correct
8 Correct 13 ms 12152 KB Output is correct
9 Correct 13 ms 12152 KB Output is correct
10 Correct 13 ms 12024 KB Output is correct
11 Correct 13 ms 12152 KB Output is correct
12 Correct 13 ms 12152 KB Output is correct
13 Correct 13 ms 12024 KB Output is correct
14 Correct 13 ms 12152 KB Output is correct
15 Correct 13 ms 12152 KB Output is correct
16 Correct 12 ms 12152 KB Output is correct
17 Correct 12 ms 12152 KB Output is correct
18 Correct 12 ms 12024 KB Output is correct
19 Correct 13 ms 12024 KB Output is correct
20 Correct 13 ms 12152 KB Output is correct
21 Correct 13 ms 12152 KB Output is correct
22 Correct 12 ms 12024 KB Output is correct
23 Correct 13 ms 12024 KB Output is correct
24 Correct 13 ms 12024 KB Output is correct
25 Correct 12 ms 12152 KB Output is correct
26 Incorrect 52 ms 12604 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12156 KB Output is correct
2 Correct 13 ms 12152 KB Output is correct
3 Correct 13 ms 12152 KB Output is correct
4 Correct 13 ms 12024 KB Output is correct
5 Correct 12 ms 12024 KB Output is correct
6 Correct 13 ms 12152 KB Output is correct
7 Correct 12 ms 12024 KB Output is correct
8 Correct 13 ms 12152 KB Output is correct
9 Correct 13 ms 12152 KB Output is correct
10 Correct 13 ms 12024 KB Output is correct
11 Correct 13 ms 12152 KB Output is correct
12 Correct 13 ms 12152 KB Output is correct
13 Correct 13 ms 12024 KB Output is correct
14 Correct 13 ms 12152 KB Output is correct
15 Correct 13 ms 12152 KB Output is correct
16 Correct 12 ms 12152 KB Output is correct
17 Correct 12 ms 12152 KB Output is correct
18 Correct 12 ms 12024 KB Output is correct
19 Correct 13 ms 12024 KB Output is correct
20 Correct 13 ms 12152 KB Output is correct
21 Correct 13 ms 12152 KB Output is correct
22 Correct 12 ms 12024 KB Output is correct
23 Correct 13 ms 12024 KB Output is correct
24 Correct 13 ms 12024 KB Output is correct
25 Correct 13 ms 12024 KB Output is correct
26 Correct 106 ms 18672 KB Output is correct
27 Correct 184 ms 18348 KB Output is correct
28 Correct 16 ms 12280 KB Output is correct
29 Correct 12 ms 12024 KB Output is correct
30 Correct 12 ms 12024 KB Output is correct
31 Correct 165 ms 18808 KB Output is correct
32 Correct 16 ms 12280 KB Output is correct
33 Correct 227 ms 45412 KB Output is correct
34 Correct 177 ms 18400 KB Output is correct
35 Correct 16 ms 12280 KB Output is correct
36 Correct 199 ms 21172 KB Output is correct
37 Correct 15 ms 12280 KB Output is correct
38 Correct 15 ms 12280 KB Output is correct
39 Correct 122 ms 18672 KB Output is correct
40 Correct 15 ms 12664 KB Output is correct
41 Correct 125 ms 18168 KB Output is correct
42 Correct 227 ms 27000 KB Output is correct
43 Correct 14 ms 12152 KB Output is correct
44 Correct 166 ms 30328 KB Output is correct
45 Correct 190 ms 32376 KB Output is correct
46 Correct 15 ms 12280 KB Output is correct
47 Correct 16 ms 12280 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 18672 KB Output is correct
2 Execution timed out 3031 ms 19312 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12156 KB Output is correct
2 Correct 13 ms 12152 KB Output is correct
3 Correct 13 ms 12152 KB Output is correct
4 Correct 13 ms 12024 KB Output is correct
5 Correct 12 ms 12024 KB Output is correct
6 Correct 13 ms 12152 KB Output is correct
7 Correct 12 ms 12024 KB Output is correct
8 Correct 13 ms 12152 KB Output is correct
9 Correct 13 ms 12152 KB Output is correct
10 Correct 13 ms 12024 KB Output is correct
11 Correct 13 ms 12152 KB Output is correct
12 Correct 13 ms 12152 KB Output is correct
13 Correct 13 ms 12024 KB Output is correct
14 Correct 13 ms 12152 KB Output is correct
15 Correct 13 ms 12152 KB Output is correct
16 Correct 12 ms 12152 KB Output is correct
17 Correct 12 ms 12152 KB Output is correct
18 Correct 12 ms 12024 KB Output is correct
19 Correct 13 ms 12024 KB Output is correct
20 Correct 13 ms 12152 KB Output is correct
21 Correct 13 ms 12152 KB Output is correct
22 Correct 12 ms 12024 KB Output is correct
23 Correct 13 ms 12024 KB Output is correct
24 Correct 13 ms 12024 KB Output is correct
25 Correct 12 ms 12152 KB Output is correct
26 Incorrect 52 ms 12604 KB Output isn't correct
27 Halted 0 ms 0 KB -