oj.uz

Submission #64841

# Submission time Handle Problem Language Result Execution time Memory
64841 2018-08-05T20:18:51 Z TadijaSebez Cats or Dogs (JOI18_catdog) C++11
100 / 100
 451 ms 74724 KB 
#include "catdog.h"
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
#define mp make_pair
#define pb push_back
const int inf=1e9+7;
int min(int a, int b){ return a>b?b:a;}
const int N=100050;
const int M=2*N;
struct Matrix
{
	int a[2][2];
	void init(){ a[0][0]=a[1][1]=0;a[1][0]=a[0][1]=inf;}
	Matrix(){ init();}
	Matrix operator * (Matrix b) const
	{
		Matrix c;
		int i,j,k,l;
		for(i=0;i<2;i++) for(j=0;j<2;j++)
		{
			c.a[i][j]=inf;
			for(k=0;k<2;k++) for(l=0;l<2;l++) c.a[i][j]=min(c.a[i][j],a[i][k]+b.a[l][j]+(k^l));
		}
		return c;
	}
} node[M];
int ls[M],rs[M],root[N],tsz;
void Set(int &c, int ss, int se, int qi, int a, int b)
{
	if(!c) c=++tsz;
	if(ss==se){ node[c].a[0][0]+=a;node[c].a[1][1]+=b;return;}
	int mid=ss+se>>1;
	if(qi<=mid) Set(ls[c],ss,mid,qi,a,b);
	else Set(rs[c],mid+1,se,qi,a,b);
	node[c]=node[ls[c]]*node[rs[c]];
}
pair<int,int> Get(int c)
{
	int a=min(node[c].a[0][0],node[c].a[0][1]);
	int b=min(node[c].a[1][0],node[c].a[1][1]);
	a=min(a,b+1);
	b=min(b,a+1);
	return mp(a,b);
}
int head[N],sz[N],dep[N],par[N],csz[N];
vector<int> E[N];
void DFS(int u, int p)
{
	par[u]=p;dep[u]=dep[p]+1;sz[u]=1;
	for(int i=0;i<E[u].size();i++) if(E[u][i]!=p) DFS(E[u][i],u),sz[u]+=sz[E[u][i]];
}
void HLD(int u, int p)
{
	if(!head[u]) head[u]=u;
	csz[head[u]]++;
	int HC=0,i;
	for(i=0;i<E[u].size();i++) if(E[u][i]!=p && sz[HC]<sz[E[u][i]]) HC=E[u][i];
	if(HC) head[HC]=head[u];
	for(i=0;i<E[u].size();i++) if(E[u][i]!=p) HLD(E[u][i],u);
}
int t[N];
void initialize(int n, vector<int> a, vector<int> b)
{
	for(int i=0;i<n-1;i++) E[a[i]].pb(b[i]),E[b[i]].pb(a[i]);
	DFS(1,0);HLD(1,0);
}
int Solve(){ pair<int,int> sol=Get(root[1]);return min(sol.first,sol.second);}
void Set(int u, int a, int b)
{
	while(u)
	{
		int la,lb,na,nb;
		pair<int,int> tmp=Get(root[head[u]]);
		la=tmp.first;lb=tmp.second;
		Set(root[head[u]],1,csz[head[u]],dep[u]-dep[head[u]]+1,a,b);
		tmp=Get(root[head[u]]);
		na=tmp.first;nb=tmp.second;
		a=na-la;b=nb-lb;
		u=par[head[u]];
	}
}
int cat(int u){ t[u]=1;Set(u,N,0);return Solve();}
int dog(int u){ t[u]=2;Set(u,0,N);return Solve();}
int neighbor(int u)
{
	if(t[u]==1) Set(u,-N,0);
	if(t[u]==2) Set(u,0,-N);
	return Solve();
}

Compilation message

catdog.cpp: In function 'void Set(int&, int, int, int, int, int)':
catdog.cpp:34:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
catdog.cpp: In function 'void DFS(int, int)':
catdog.cpp:52:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<E[u].size();i++) if(E[u][i]!=p) DFS(E[u][i],u),sz[u]+=sz[E[u][i]];
              ~^~~~~~~~~~~~
catdog.cpp: In function 'void HLD(int, int)':
catdog.cpp:59:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<E[u].size();i++) if(E[u][i]!=p && sz[HC]<sz[E[u][i]]) HC=E[u][i];
          ~^~~~~~~~~~~~
catdog.cpp:61:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<E[u].size();i++) if(E[u][i]!=p) HLD(E[u][i],u);
          ~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5880 KB Output is correct
2 Correct 6 ms 5880 KB Output is correct
3 Correct 7 ms 5916 KB Output is correct
4 Correct 8 ms 6048 KB Output is correct
5 Correct 8 ms 6048 KB Output is correct
6 Correct 8 ms 6048 KB Output is correct
7 Correct 8 ms 6060 KB Output is correct
8 Correct 8 ms 6120 KB Output is correct
9 Correct 8 ms 6128 KB Output is correct
10 Correct 7 ms 6152 KB Output is correct
11 Correct 9 ms 6152 KB Output is correct
12 Correct 10 ms 6160 KB Output is correct
13 Correct 7 ms 6160 KB Output is correct
14 Correct 8 ms 6168 KB Output is correct
15 Correct 8 ms 6168 KB Output is correct
16 Correct 9 ms 6176 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5880 KB Output is correct
2 Correct 6 ms 5880 KB Output is correct
3 Correct 7 ms 5916 KB Output is correct
4 Correct 8 ms 6048 KB Output is correct
5 Correct 8 ms 6048 KB Output is correct
6 Correct 8 ms 6048 KB Output is correct
7 Correct 8 ms 6060 KB Output is correct
8 Correct 8 ms 6120 KB Output is correct
9 Correct 8 ms 6128 KB Output is correct
10 Correct 7 ms 6152 KB Output is correct
11 Correct 9 ms 6152 KB Output is correct
12 Correct 10 ms 6160 KB Output is correct
13 Correct 7 ms 6160 KB Output is correct
14 Correct 8 ms 6168 KB Output is correct
15 Correct 8 ms 6168 KB Output is correct
16 Correct 9 ms 6176 KB Output is correct
17 Correct 10 ms 6180 KB Output is correct
18 Correct 10 ms 6192 KB Output is correct
19 Correct 9 ms 6204 KB Output is correct
20 Correct 8 ms 6216 KB Output is correct
21 Correct 9 ms 6220 KB Output is correct
22 Correct 8 ms 6228 KB Output is correct
23 Correct 9 ms 6236 KB Output is correct
24 Correct 10 ms 6248 KB Output is correct
25 Correct 8 ms 6248 KB Output is correct
26 Correct 9 ms 6268 KB Output is correct
27 Correct 8 ms 6276 KB Output is correct
28 Correct 8 ms 6280 KB Output is correct
29 Correct 9 ms 6288 KB Output is correct
30 Correct 9 ms 6304 KB Output is correct
31 Correct 9 ms 6312 KB Output is correct
32 Correct 9 ms 6320 KB Output is correct

Subtask #3
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5880 KB Output is correct
2 Correct 6 ms 5880 KB Output is correct
3 Correct 7 ms 5916 KB Output is correct
4 Correct 8 ms 6048 KB Output is correct
5 Correct 8 ms 6048 KB Output is correct
6 Correct 8 ms 6048 KB Output is correct
7 Correct 8 ms 6060 KB Output is correct
8 Correct 8 ms 6120 KB Output is correct
9 Correct 8 ms 6128 KB Output is correct
10 Correct 7 ms 6152 KB Output is correct
11 Correct 9 ms 6152 KB Output is correct
12 Correct 10 ms 6160 KB Output is correct
13 Correct 7 ms 6160 KB Output is correct
14 Correct 8 ms 6168 KB Output is correct
15 Correct 8 ms 6168 KB Output is correct
16 Correct 9 ms 6176 KB Output is correct
17 Correct 10 ms 6180 KB Output is correct
18 Correct 10 ms 6192 KB Output is correct
19 Correct 9 ms 6204 KB Output is correct
20 Correct 8 ms 6216 KB Output is correct
21 Correct 9 ms 6220 KB Output is correct
22 Correct 8 ms 6228 KB Output is correct
23 Correct 9 ms 6236 KB Output is correct
24 Correct 10 ms 6248 KB Output is correct
25 Correct 8 ms 6248 KB Output is correct
26 Correct 9 ms 6268 KB Output is correct
27 Correct 8 ms 6276 KB Output is correct
28 Correct 8 ms 6280 KB Output is correct
29 Correct 9 ms 6288 KB Output is correct
30 Correct 9 ms 6304 KB Output is correct
31 Correct 9 ms 6312 KB Output is correct
32 Correct 9 ms 6320 KB Output is correct
33 Correct 237 ms 12604 KB Output is correct
34 Correct 143 ms 13364 KB Output is correct
35 Correct 170 ms 13364 KB Output is correct
36 Correct 338 ms 19820 KB Output is correct
37 Correct 34 ms 19820 KB Output is correct
38 Correct 366 ms 22832 KB Output is correct
39 Correct 384 ms 24680 KB Output is correct
40 Correct 346 ms 26620 KB Output is correct
41 Correct 383 ms 28544 KB Output is correct
42 Correct 390 ms 30612 KB Output is correct
43 Correct 390 ms 32584 KB Output is correct
44 Correct 361 ms 34452 KB Output is correct
45 Correct 418 ms 36432 KB Output is correct
46 Correct 398 ms 38228 KB Output is correct
47 Correct 451 ms 40344 KB Output is correct
48 Correct 102 ms 40344 KB Output is correct
49 Correct 138 ms 41392 KB Output is correct
50 Correct 45 ms 41392 KB Output is correct
51 Correct 55 ms 41392 KB Output is correct
52 Correct 26 ms 41392 KB Output is correct
53 Correct 153 ms 43928 KB Output is correct
54 Correct 104 ms 43928 KB Output is correct
55 Correct 301 ms 45468 KB Output is correct
56 Correct 126 ms 45468 KB Output is correct
57 Correct 214 ms 48504 KB Output is correct
58 Correct 51 ms 48504 KB Output is correct
59 Correct 48 ms 48504 KB Output is correct
60 Correct 178 ms 50680 KB Output is correct
61 Correct 137 ms 52740 KB Output is correct
62 Correct 84 ms 52740 KB Output is correct
63 Correct 67 ms 52740 KB Output is correct
64 Correct 86 ms 54532 KB Output is correct
65 Correct 94 ms 59392 KB Output is correct
66 Correct 62 ms 59392 KB Output is correct
67 Correct 75 ms 59392 KB Output is correct
68 Correct 134 ms 62636 KB Output is correct
69 Correct 38 ms 62636 KB Output is correct
70 Correct 14 ms 62636 KB Output is correct
71 Correct 84 ms 62636 KB Output is correct
72 Correct 156 ms 63608 KB Output is correct
73 Correct 210 ms 68936 KB Output is correct
74 Correct 221 ms 68936 KB Output is correct
75 Correct 163 ms 72672 KB Output is correct
76 Correct 190 ms 73952 KB Output is correct
77 Correct 223 ms 74724 KB Output is correct