oj.uz

답안 #98368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98368 2019-02-22T19:05:58 Z scanhex Cats or Dogs (JOI18_catdog) C++17
100 / 100
 1526 ms 30712 KB 
#include<bits/stdc++.h>
#include "catdog.h"

using namespace std;
const int N=1<<17;
using val=array<array<int,2>,2>;
val t[2*N];

int par[N];
int cur[N];

#define chmi(x,y) if(x>y)x=y
#define chma(x,y) if(x<y)x=y

const int oo=100001;

int invind[N];

val gett(int x){
	if(x<N)
		return t[x];
	val ans;
	int u=invind[x-N];
	for(int i=0;i<2;++i)
		for(int j=0;j<2;++j)
			if(i==j&&((i+1)&cur[u]))
				ans[i][j]=t[x][i][j];
			else
				ans[i][j]=oo;
	return ans;
}

val merge(val a,val b){
	val ans;
	for(int st=0;st<2;++st)
		for(int en=0;en<2;++en){
			ans[st][en]=oo;
			for(int le=0;le<2;++le)
				for(int ri=0;ri<2;++ri){
					chmi(ans[st][en],a[st][le]+b[ri][en]+(le!=ri));
				}
		}
	return ans;
}

void upd1(int x){
//	if(x==(N+2)/2);
//	cerr<<"lul "<<gett(x<<1)[0][0]<<' '<<gett(x<<1^1)[0][0]<<'\n';
	t[x]=merge(gett(x<<1),gett(x<<1^1));
}

void upd(int x){
	x+=N;
	while(x>1)
		upd1(x>>1),x>>=1;
}
val neut={0,oo,oo,0};
val get(int l,int r){
	l+=N;
	r+=N;
	val ansle=neut,ansri=neut;
	while(l<r){
		if(l&1)
			ansle=merge(ansle,gett(l++));
		if(r&1)
			ansri=merge(gett(--r),ansri);
		l/=2,r/=2;
	}
	return merge(ansle,ansri);
}

vector<int> ch[N];
int ind[N];
int sz[N];
int top[N];
int listok[N];

/*
val vals[4];
void init_vals(){
	vals[1]={{0,oo},{oo,oo}};
	vals[2]={{oo,oo},{oo,0}};
	vals[3]={{0,oo},{oo,0}};
}
bool trash=(init_vals(),true);
*/

void update_c(int x,int coef){
	upd(ind[x]);
	vector<int>memos;
	while(true){
		x=top[x];
		if(x==0)break;
		memos.push_back(x);
		x=par[x];
	}
	if(coef==-1)reverse(memos.begin(),memos.end());
	for(int x:memos){
		val kek=get(ind[x],ind[listok[x]]+1);
		x=par[x];
		int y=ind[x]+N;
		int k0=min(kek[0][0],kek[0][1]),k1=min(kek[1][0],kek[1][1]);
		if(k0>=oo&&k1>=oo){
			int aoeustnaoeu=22390;
		}
		assert(k0<oo||k1<oo);
		t[y][0][0]+=coef*(min(k0,k1+1));
		t[y][1][1]+=coef*(min(k1,k0+1));
		upd(ind[x]);
	}
}

void update(int x,int nw){
	update_c(x,-1);
//	cerr<<t[N][0][0]<<'\n';
	cur[x]=nw;
	update_c(x,1);
//	cerr<<t[N][0][0]<<'\n';
}


vector<int>g[N];

void d1(int u,int p=-1){
	par[u]=p;
	sz[u]=1;
	for(int v:g[u]){
		if(v==p)continue;
		ch[u].push_back(v);
		d1(v,u);
		sz[u]+=sz[v];
		if(sz[v]>sz[ch[u][0]])
			swap(ch[u].back(),ch[u][0]);
	}
	if(ch[u].size())listok[u]=listok[ch[u][0]];
	else listok[u]=u;
}

int tot=0;


void d2(int u){
	ind[u]=tot++;
	invind[ind[u]]=u;
	for(int v:ch[u]){
		if(v==ch[u][0])
			top[v]=top[u];
		else
			top[v]=v;
		d2(v);
	}
}
void d3(int u){
	update_c(u,1);
	for(int v:ch[u])d3(v);
}

int n;

void initialize(int N1, std::vector<int> A, std::vector<int> B) {
	n=N1;
	for(int i=0;i<n-1;++i)
		g[A[i]-1].push_back(B[i]-1),g[B[i]-1].push_back(A[i]-1);
	fill(cur,cur+n,3);
	d1(0);
	d2(0);
	d3(0);
}

int get(){
	val mem=get(ind[0],ind[listok[0]]+1);
	int ans=oo;
	for(int i=0;i<2;++i)
		for(int j=0;j<2;++j)
			ans=min(ans,mem[i][j]);
	return ans;
}

int cat(int v) {
	update(v-1,1);
	/*
	auto mem=gett((2+N)/2);
	auto mem=merge(gett(2+N),gett(3+N));
	cerr<<mem[0][0]<<' '<<mem[1][1]<<'\n';
	upd(2);
	mem=gett((2+N)/2);
	cerr<<mem[0][0]<<' '<<mem[1][1]<<'\n';
	for(int i=0;i<n;++i)
		cerr<<gett((i+N)/1)[0][0]<<' '<<gett((i+N)/1)[1][1]<<'\n';
	cerr<<'\n';
//	exit(0);
	for(int i=0;i<n;++i)
		cerr<<gett((i+N)/1)[0][0]<<' '<<gett((i+N)/1)[1][1]<<'\n';
	cerr<<'\n';
	*/
	return get();
}

int dog(int v) {
	update(v-1,2);
//	for(int i=0;i<n;++i)
//		cerr<<gett((i+N)/1)[0][0]<<' '<<gett((i+N)/1)[1][1]<<'\n';
//	cerr<<'\n';
	return get();
}

int neighbor(int v) {
	update(v-1,3);
	return get();
}

Compilation message

catdog.cpp: In function 'void update_c(int, int)':
catdog.cpp:104:8: warning: unused variable 'aoeustnaoeu' [-Wunused-variable]
    int aoeustnaoeu=22390;
        ^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6528 KB Output is correct
2 Correct 8 ms 6528 KB Output is correct
3 Correct 9 ms 6744 KB Output is correct
4 Correct 9 ms 6528 KB Output is correct
5 Correct 9 ms 6528 KB Output is correct
6 Correct 9 ms 6528 KB Output is correct
7 Correct 10 ms 6572 KB Output is correct
8 Correct 7 ms 6528 KB Output is correct
9 Correct 9 ms 6528 KB Output is correct
10 Correct 9 ms 6528 KB Output is correct
11 Correct 8 ms 6528 KB Output is correct
12 Correct 7 ms 6528 KB Output is correct
13 Correct 7 ms 6528 KB Output is correct
14 Correct 7 ms 6528 KB Output is correct
15 Correct 8 ms 6528 KB Output is correct
16 Correct 10 ms 6528 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6528 KB Output is correct
2 Correct 8 ms 6528 KB Output is correct
3 Correct 9 ms 6744 KB Output is correct
4 Correct 9 ms 6528 KB Output is correct
5 Correct 9 ms 6528 KB Output is correct
6 Correct 9 ms 6528 KB Output is correct
7 Correct 10 ms 6572 KB Output is correct
8 Correct 7 ms 6528 KB Output is correct
9 Correct 9 ms 6528 KB Output is correct
10 Correct 9 ms 6528 KB Output is correct
11 Correct 8 ms 6528 KB Output is correct
12 Correct 7 ms 6528 KB Output is correct
13 Correct 7 ms 6528 KB Output is correct
14 Correct 7 ms 6528 KB Output is correct
15 Correct 8 ms 6528 KB Output is correct
16 Correct 10 ms 6528 KB Output is correct
17 Correct 15 ms 6760 KB Output is correct
18 Correct 12 ms 6656 KB Output is correct
19 Correct 13 ms 6656 KB Output is correct
20 Correct 8 ms 6656 KB Output is correct
21 Correct 12 ms 6656 KB Output is correct
22 Correct 10 ms 6656 KB Output is correct
23 Correct 15 ms 6656 KB Output is correct
24 Correct 17 ms 6656 KB Output is correct
25 Correct 12 ms 6656 KB Output is correct
26 Correct 11 ms 6656 KB Output is correct
27 Correct 11 ms 6656 KB Output is correct
28 Correct 8 ms 6656 KB Output is correct
29 Correct 10 ms 6784 KB Output is correct
30 Correct 12 ms 6656 KB Output is correct
31 Correct 9 ms 6656 KB Output is correct
32 Correct 12 ms 6656 KB Output is correct

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6528 KB Output is correct
2 Correct 8 ms 6528 KB Output is correct
3 Correct 9 ms 6744 KB Output is correct
4 Correct 9 ms 6528 KB Output is correct
5 Correct 9 ms 6528 KB Output is correct
6 Correct 9 ms 6528 KB Output is correct
7 Correct 10 ms 6572 KB Output is correct
8 Correct 7 ms 6528 KB Output is correct
9 Correct 9 ms 6528 KB Output is correct
10 Correct 9 ms 6528 KB Output is correct
11 Correct 8 ms 6528 KB Output is correct
12 Correct 7 ms 6528 KB Output is correct
13 Correct 7 ms 6528 KB Output is correct
14 Correct 7 ms 6528 KB Output is correct
15 Correct 8 ms 6528 KB Output is correct
16 Correct 10 ms 6528 KB Output is correct
17 Correct 15 ms 6760 KB Output is correct
18 Correct 12 ms 6656 KB Output is correct
19 Correct 13 ms 6656 KB Output is correct
20 Correct 8 ms 6656 KB Output is correct
21 Correct 12 ms 6656 KB Output is correct
22 Correct 10 ms 6656 KB Output is correct
23 Correct 15 ms 6656 KB Output is correct
24 Correct 17 ms 6656 KB Output is correct
25 Correct 12 ms 6656 KB Output is correct
26 Correct 11 ms 6656 KB Output is correct
27 Correct 11 ms 6656 KB Output is correct
28 Correct 8 ms 6656 KB Output is correct
29 Correct 10 ms 6784 KB Output is correct
30 Correct 12 ms 6656 KB Output is correct
31 Correct 9 ms 6656 KB Output is correct
32 Correct 12 ms 6656 KB Output is correct
33 Correct 937 ms 13796 KB Output is correct
34 Correct 434 ms 15716 KB Output is correct
35 Correct 775 ms 12856 KB Output is correct
36 Correct 1346 ms 20464 KB Output is correct
37 Correct 149 ms 10648 KB Output is correct
38 Correct 1475 ms 21936 KB Output is correct
39 Correct 1468 ms 21932 KB Output is correct
40 Correct 1479 ms 21940 KB Output is correct
41 Correct 1508 ms 22248 KB Output is correct
42 Correct 1421 ms 22116 KB Output is correct
43 Correct 1428 ms 21884 KB Output is correct
44 Correct 1328 ms 21960 KB Output is correct
45 Correct 1381 ms 22072 KB Output is correct
46 Correct 1526 ms 21976 KB Output is correct
47 Correct 1418 ms 22064 KB Output is correct
48 Correct 334 ms 15600 KB Output is correct
49 Correct 400 ms 17904 KB Output is correct
50 Correct 140 ms 9336 KB Output is correct
51 Correct 160 ms 11252 KB Output is correct
52 Correct 70 ms 8964 KB Output is correct
53 Correct 737 ms 20812 KB Output is correct
54 Correct 466 ms 12884 KB Output is correct
55 Correct 1085 ms 17488 KB Output is correct
56 Correct 693 ms 13916 KB Output is correct
57 Correct 878 ms 19960 KB Output is correct
58 Correct 96 ms 11380 KB Output is correct
59 Correct 155 ms 10768 KB Output is correct
60 Correct 337 ms 16752 KB Output is correct
61 Correct 360 ms 17224 KB Output is correct
62 Correct 248 ms 14960 KB Output is correct
63 Correct 153 ms 17144 KB Output is correct
64 Correct 120 ms 19320 KB Output is correct
65 Correct 203 ms 26460 KB Output is correct
66 Correct 127 ms 11640 KB Output is correct
67 Correct 197 ms 20656 KB Output is correct
68 Correct 375 ms 26972 KB Output is correct
69 Correct 58 ms 8568 KB Output is correct
70 Correct 21 ms 6912 KB Output is correct
71 Correct 125 ms 15964 KB Output is correct
72 Correct 200 ms 23712 KB Output is correct
73 Correct 535 ms 30712 KB Output is correct
74 Correct 557 ms 26368 KB Output is correct
75 Correct 370 ms 30604 KB Output is correct
76 Correct 417 ms 29012 KB Output is correct
77 Correct 582 ms 26804 KB Output is correct