oj.uz

답안 #912649

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912649 2024-01-19T17:16:22 Z Wansur Split the Attractions (IOI19_split) C++14
40 / 100
 93 ms 35664 KB 
#include <bits/stdc++.h>
#define f first
#define s second
#define ent '\n'

using namespace std;
typedef long long ll;
const int mx=2e5+12;

vector<pair<int,int>> del;
vector<pair<int,int>> add;
vector<int> ans;
pair<int,int> fup[mx];
vector<int> g[mx];
set<int> e[mx];
int Ans[mx];
int par[mx];
int tin[mx];
int ver[mx];
int sz[mx];
int pos[]={1,2,3};
int timer;

void calc(int v){
	sz[v]=1;
	for(int to:g[v]){
		if(sz[to]>0)continue;
		calc(to);
		par[to]=v;
		e[v].insert(to);
		sz[v]+=sz[to];
	}
}

void dfs(int v,int p){
	tin[v]=fup[v].f=++timer;
	fup[v].s=v;
	ver[tin[v]]=v;
	for(int to:g[v]){
		if(to==p)continue;
		if(tin[to]>0){
			fup[v]=min(fup[v],{tin[to],v});
		}
		else{
			dfs(to,v);
			fup[v]=min(fup[v],fup[to]);
		}
	}
}

void get(int v,int p,int &cnt,int t){
	if(!cnt)return;
	Ans[v]=pos[t];
	cnt--;
	if(!cnt)return;
	for(int to:e[v]){
		get(to,v,cnt,t);
	}
}

void get(int v,int n,int a,int b,int c){
	vector<int> edg;
	for(int to:e[v]){
		edg.push_back(to);
	}
	int s=sz[v];
	for(int to:edg){
		if(s-sz[to]<a){
			break;
		}
		if(fup[to].f<tin[v]){
			s-=sz[to];
			e[v].erase(to);
			add.push_back({v,to});
			e[ver[fup[to].f]].insert(fup[to].s);
			del.push_back({ver[fup[to].f],fup[to].s});
		}
	}
	e[par[v]].erase(v);
	add.push_back({par[v],v});
	if(s>=a && n-s>=b){
		get(v,0,a,0);
		get(0,0,b,1);
		for(int i=0;i<n;i++){
			ans[i]=Ans[i];
			if(!ans[i])ans[i]=pos[2];
		}
	}
	else if(s>=b && n-s>=a){
		get(v,0,b,1);
		get(0,0,a,0);
		for(int i=0;i<n;i++){
			ans[i]=Ans[i];
			if(!ans[i])ans[i]=pos[2];
		}
	}
}

std::vector<int> find_split(int n, int a, int b, int c, std::vector<int> p, std::vector<int> q){
	for(int i=0;i<p.size();i++){
		g[p[i]].push_back(q[i]);
		g[q[i]].push_back(p[i]);
	}
	if(a>b){
		swap(a,b);
		swap(pos[0],pos[1]);
	}
	if(a>c){
		swap(a,c);
		swap(pos[0],pos[2]);
	}
	if(b>c){
		swap(b,c);
		swap(pos[1],pos[2]);
	}
	calc(0);
	int v=-1;
	vector<int> d;
	for(int i=0;i<n;i++){
		ans.push_back(0);
	}
	for(int i=1;i<n;i++){
		if(sz[i]<a)continue;
		if(sz[i]>=a){
			d.push_back(i);
		}
	}
	sort(d.begin(),d.end(),[](int i,int j){
		return sz[i]<sz[j];
	});
	for(int v:d){
		del.clear();
		add.clear();
		get(v,n,a,b,c);
		if(ans[0]!=0)return ans;
		for(auto x:del){
			e[x.f].erase(x.s);
		}
		for(auto x:add){
			e[x.f].insert(x.s);
		}
	}
	return ans;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:100:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |  for(int i=0;i<p.size();i++){
      |              ~^~~~~~~~~
split.cpp:117:6: warning: unused variable 'v' [-Wunused-variable]
  117 |  int v=-1;
      |      ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16732 KB ok, correct split
2 Correct 5 ms 16984 KB ok, correct split
3 Correct 4 ms 16728 KB ok, correct split
4 Correct 5 ms 16732 KB ok, correct split
5 Correct 4 ms 16732 KB ok, correct split
6 Correct 4 ms 16732 KB ok, correct split
7 Correct 76 ms 35248 KB ok, correct split
8 Correct 82 ms 33012 KB ok, correct split
9 Correct 75 ms 32356 KB ok, correct split
10 Correct 76 ms 35564 KB ok, correct split
11 Correct 80 ms 35564 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16732 KB ok, correct split
2 Correct 4 ms 16732 KB ok, correct split
3 Correct 4 ms 16732 KB ok, correct split
4 Correct 84 ms 32540 KB ok, correct split
5 Correct 64 ms 27984 KB ok, correct split
6 Correct 75 ms 35664 KB ok, correct split
7 Correct 80 ms 32844 KB ok, correct split
8 Correct 93 ms 30252 KB ok, correct split
9 Correct 74 ms 27888 KB ok, correct split
10 Correct 66 ms 28116 KB ok, correct split
11 Correct 68 ms 28120 KB ok, correct split
12 Correct 81 ms 28368 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16732 KB ok, correct split
2 Correct 62 ms 27488 KB ok, correct split
3 Correct 25 ms 21208 KB ok, correct split
4 Correct 4 ms 16728 KB ok, correct split
5 Correct 75 ms 30156 KB ok, correct split
6 Correct 68 ms 29784 KB ok, correct split
7 Correct 71 ms 29584 KB ok, correct split
8 Correct 85 ms 30892 KB ok, correct split
9 Correct 69 ms 29308 KB ok, correct split
10 Correct 20 ms 20312 KB ok, no valid answer
11 Correct 30 ms 22232 KB ok, no valid answer
12 Correct 75 ms 27728 KB ok, no valid answer
13 Correct 62 ms 27604 KB ok, no valid answer
14 Correct 66 ms 27992 KB ok, no valid answer

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 16732 KB ok, correct split
2 Correct 4 ms 16728 KB ok, no valid answer
3 Correct 5 ms 16732 KB ok, correct split
4 Correct 4 ms 16732 KB ok, correct split
5 Correct 5 ms 16732 KB ok, correct split
6 Correct 4 ms 16732 KB ok, correct split
7 Correct 4 ms 16732 KB ok, correct split
8 Correct 6 ms 16728 KB ok, correct split
9 Correct 6 ms 16988 KB ok, correct split
10 Correct 5 ms 17084 KB ok, correct split
11 Correct 5 ms 16732 KB ok, correct split
12 Correct 6 ms 16984 KB ok, correct split
13 Correct 4 ms 16732 KB ok, correct split
14 Correct 4 ms 16732 KB ok, correct split
15 Correct 4 ms 16732 KB ok, correct split
16 Correct 4 ms 16732 KB ok, correct split
17 Correct 4 ms 16732 KB ok, correct split
18 Correct 4 ms 16732 KB ok, correct split
19 Correct 5 ms 16732 KB ok, correct split
20 Correct 5 ms 16988 KB ok, correct split
21 Correct 5 ms 17084 KB ok, correct split
22 Correct 7 ms 16988 KB ok, correct split
23 Correct 7 ms 16988 KB ok, correct split
24 Correct 5 ms 16988 KB ok, correct split
25 Correct 5 ms 17132 KB ok, correct split
26 Incorrect 7 ms 16984 KB jury found a solution, contestant did not
27 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16732 KB ok, correct split
2 Correct 5 ms 16984 KB ok, correct split
3 Correct 4 ms 16728 KB ok, correct split
4 Correct 5 ms 16732 KB ok, correct split
5 Correct 4 ms 16732 KB ok, correct split
6 Correct 4 ms 16732 KB ok, correct split
7 Correct 76 ms 35248 KB ok, correct split
8 Correct 82 ms 33012 KB ok, correct split
9 Correct 75 ms 32356 KB ok, correct split
10 Correct 76 ms 35564 KB ok, correct split
11 Correct 80 ms 35564 KB ok, correct split
12 Correct 4 ms 16732 KB ok, correct split
13 Correct 4 ms 16732 KB ok, correct split
14 Correct 4 ms 16732 KB ok, correct split
15 Correct 84 ms 32540 KB ok, correct split
16 Correct 64 ms 27984 KB ok, correct split
17 Correct 75 ms 35664 KB ok, correct split
18 Correct 80 ms 32844 KB ok, correct split
19 Correct 93 ms 30252 KB ok, correct split
20 Correct 74 ms 27888 KB ok, correct split
21 Correct 66 ms 28116 KB ok, correct split
22 Correct 68 ms 28120 KB ok, correct split
23 Correct 81 ms 28368 KB ok, correct split
24 Correct 4 ms 16732 KB ok, correct split
25 Correct 62 ms 27488 KB ok, correct split
26 Correct 25 ms 21208 KB ok, correct split
27 Correct 4 ms 16728 KB ok, correct split
28 Correct 75 ms 30156 KB ok, correct split
29 Correct 68 ms 29784 KB ok, correct split
30 Correct 71 ms 29584 KB ok, correct split
31 Correct 85 ms 30892 KB ok, correct split
32 Correct 69 ms 29308 KB ok, correct split
33 Correct 20 ms 20312 KB ok, no valid answer
34 Correct 30 ms 22232 KB ok, no valid answer
35 Correct 75 ms 27728 KB ok, no valid answer
36 Correct 62 ms 27604 KB ok, no valid answer
37 Correct 66 ms 27992 KB ok, no valid answer
38 Correct 5 ms 16732 KB ok, correct split
39 Correct 4 ms 16728 KB ok, no valid answer
40 Correct 5 ms 16732 KB ok, correct split
41 Correct 4 ms 16732 KB ok, correct split
42 Correct 5 ms 16732 KB ok, correct split
43 Correct 4 ms 16732 KB ok, correct split
44 Correct 4 ms 16732 KB ok, correct split
45 Correct 6 ms 16728 KB ok, correct split
46 Correct 6 ms 16988 KB ok, correct split
47 Correct 5 ms 17084 KB ok, correct split
48 Correct 5 ms 16732 KB ok, correct split
49 Correct 6 ms 16984 KB ok, correct split
50 Correct 4 ms 16732 KB ok, correct split
51 Correct 4 ms 16732 KB ok, correct split
52 Correct 4 ms 16732 KB ok, correct split
53 Correct 4 ms 16732 KB ok, correct split
54 Correct 4 ms 16732 KB ok, correct split
55 Correct 4 ms 16732 KB ok, correct split
56 Correct 5 ms 16732 KB ok, correct split
57 Correct 5 ms 16988 KB ok, correct split
58 Correct 5 ms 17084 KB ok, correct split
59 Correct 7 ms 16988 KB ok, correct split
60 Correct 7 ms 16988 KB ok, correct split
61 Correct 5 ms 16988 KB ok, correct split
62 Correct 5 ms 17132 KB ok, correct split
63 Incorrect 7 ms 16984 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -