oj.uz

답안 #912636

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912636 2024-01-19T17:04:57 Z Wansur Split the Attractions (IOI19_split) C++14
40 / 100
 133 ms 35276 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;

pair<int,int> fup[mx];
vector<int> g[mx];
vector<int> ord;
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:e[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 caalc(int v,int p){
	ord.push_back(v);
	sz[v]=1;
	for(int to:e[v]){
		if(to!=p){
			sz[v]+=sz[to];
			caalc(to,v);
		}
	}
}

void get(int v,int x,int c){
	ord.clear();
	caalc(v,0);
	sort(ord.begin(),ord.end(),[](int i,int j){
		return sz[i]>sz[j];
	});
	for(int x:ord){
		Ans[x]=pos[c];
	}
	while(ord.size()>x){
		Ans[ord.back()]=pos[2];
		ord.pop_back();
	}
}

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]);
	}
	int A=a,B=b,C=c;
	calc(0);
	int v=-1;
	for(int i=0;i<n;i++){
		if(sz[i]<a)continue;
		bool ok=1;
		for(int to:e[i]){
			if(sz[to]>=a)ok=0;
		}
		if(ok){
			v=i;
			break;
		}
	}
	vector<int> ans(n);
	if(v<0)return ans;
	bool bad=0;
	vector<int> edg;
	for(int to:e[v]){
		edg.push_back(to);
	}
	for(int to:edg){
		if(sz[v]-sz[to]<a){
			e[par[v]].erase(v);
			get(v,a,0);
			get(0,b,1);
			int c=0;
			for(int i=0;i<n;i++){
				ans[i]=Ans[i];
				if(ans[i]==pos[0])c++;
				if(!ans[i])ans[i]=pos[2];
			}
			return ans;
			continue;
		}
		if(fup[to].f<tin[v]){
			sz[v]-=sz[to];
			e[v].erase(to);
			e[ver[fup[to].f]].insert(fup[to].s);
		}
	}
	e[par[v]].erase(v);
	if(n-sz[v]>=b){
		get(v,a,0);
		get(0,b,1);
		for(int i=0;i<n;i++){
			ans[i]=Ans[i];
			if(!ans[i])ans[i]=pos[2];
		}
	}
	else if(n-sz[v]>=a){
		get(v,b,1);
		get(0,a,0);
		for(int i=0;i<n;i++){
			ans[i]=Ans[i];
			if(!ans[i])ans[i]=pos[2];
		}
	}
	return ans;
}

Compilation message

split.cpp: In function 'void get(int, int, int)':
split.cpp:69:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   69 |  while(ord.size()>x){
      |        ~~~~~~~~~~^~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:76:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |  for(int i=0;i<p.size();i++){
      |              ~^~~~~~~~~
split.cpp:92:6: warning: unused variable 'A' [-Wunused-variable]
   92 |  int A=a,B=b,C=c;
      |      ^
split.cpp:92:10: warning: unused variable 'B' [-Wunused-variable]
   92 |  int A=a,B=b,C=c;
      |          ^
split.cpp:92:14: warning: unused variable 'C' [-Wunused-variable]
   92 |  int A=a,B=b,C=c;
      |              ^
split.cpp:108:7: warning: unused variable 'bad' [-Wunused-variable]
  108 |  bool bad=0;
      |       ^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16728 KB ok, correct split
2 Correct 4 ms 16732 KB ok, correct split
3 Correct 4 ms 16732 KB ok, correct split
4 Correct 4 ms 16732 KB ok, correct split
5 Correct 4 ms 16728 KB ok, correct split
6 Correct 4 ms 16728 KB ok, correct split
7 Correct 83 ms 34980 KB ok, correct split
8 Correct 84 ms 32720 KB ok, correct split
9 Correct 104 ms 32032 KB ok, correct split
10 Correct 85 ms 35276 KB ok, correct split
11 Correct 93 ms 35256 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16728 KB ok, correct split
2 Correct 4 ms 16728 KB ok, correct split
3 Correct 4 ms 16732 KB ok, correct split
4 Correct 92 ms 32308 KB ok, correct split
5 Correct 98 ms 27872 KB ok, correct split
6 Correct 84 ms 35276 KB ok, correct split
7 Correct 89 ms 32464 KB ok, correct split
8 Correct 100 ms 29812 KB ok, correct split
9 Correct 76 ms 27856 KB ok, correct split
10 Correct 76 ms 28104 KB ok, correct split
11 Correct 76 ms 28108 KB ok, correct split
12 Correct 72 ms 28056 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 16728 KB ok, correct split
2 Correct 73 ms 27600 KB ok, correct split
3 Correct 32 ms 21336 KB ok, correct split
4 Correct 4 ms 16732 KB ok, correct split
5 Correct 133 ms 30236 KB ok, correct split
6 Correct 96 ms 29900 KB ok, correct split
7 Correct 89 ms 29808 KB ok, correct split
8 Correct 81 ms 31188 KB ok, correct split
9 Correct 90 ms 29648 KB ok, correct split
10 Correct 23 ms 20060 KB ok, no valid answer
11 Correct 33 ms 21848 KB ok, no valid answer
12 Correct 67 ms 27628 KB ok, no valid answer
13 Correct 68 ms 27216 KB ok, no valid answer
14 Correct 93 ms 28100 KB ok, no valid answer

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16732 KB ok, correct split
2 Correct 6 ms 16732 KB ok, no valid answer
3 Correct 4 ms 16852 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 16844 KB ok, correct split
7 Correct 5 ms 16732 KB ok, correct split
8 Correct 4 ms 16732 KB ok, correct split
9 Correct 7 ms 16988 KB ok, correct split
10 Correct 8 ms 16988 KB ok, correct split
11 Correct 5 ms 16732 KB ok, correct split
12 Correct 7 ms 17148 KB ok, correct split
13 Correct 5 ms 16732 KB ok, correct split
14 Correct 5 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 6 ms 16732 KB ok, correct split
18 Correct 4 ms 16732 KB ok, correct split
19 Correct 5 ms 16896 KB ok, correct split
20 Correct 5 ms 16988 KB ok, correct split
21 Correct 6 ms 17184 KB ok, correct split
22 Correct 6 ms 16988 KB ok, correct split
23 Correct 6 ms 17100 KB ok, correct split
24 Correct 5 ms 17088 KB ok, correct split
25 Correct 7 ms 17132 KB ok, correct split
26 Incorrect 6 ms 16988 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 16728 KB ok, correct split
2 Correct 4 ms 16732 KB ok, correct split
3 Correct 4 ms 16732 KB ok, correct split
4 Correct 4 ms 16732 KB ok, correct split
5 Correct 4 ms 16728 KB ok, correct split
6 Correct 4 ms 16728 KB ok, correct split
7 Correct 83 ms 34980 KB ok, correct split
8 Correct 84 ms 32720 KB ok, correct split
9 Correct 104 ms 32032 KB ok, correct split
10 Correct 85 ms 35276 KB ok, correct split
11 Correct 93 ms 35256 KB ok, correct split
12 Correct 4 ms 16728 KB ok, correct split
13 Correct 4 ms 16728 KB ok, correct split
14 Correct 4 ms 16732 KB ok, correct split
15 Correct 92 ms 32308 KB ok, correct split
16 Correct 98 ms 27872 KB ok, correct split
17 Correct 84 ms 35276 KB ok, correct split
18 Correct 89 ms 32464 KB ok, correct split
19 Correct 100 ms 29812 KB ok, correct split
20 Correct 76 ms 27856 KB ok, correct split
21 Correct 76 ms 28104 KB ok, correct split
22 Correct 76 ms 28108 KB ok, correct split
23 Correct 72 ms 28056 KB ok, correct split
24 Correct 5 ms 16728 KB ok, correct split
25 Correct 73 ms 27600 KB ok, correct split
26 Correct 32 ms 21336 KB ok, correct split
27 Correct 4 ms 16732 KB ok, correct split
28 Correct 133 ms 30236 KB ok, correct split
29 Correct 96 ms 29900 KB ok, correct split
30 Correct 89 ms 29808 KB ok, correct split
31 Correct 81 ms 31188 KB ok, correct split
32 Correct 90 ms 29648 KB ok, correct split
33 Correct 23 ms 20060 KB ok, no valid answer
34 Correct 33 ms 21848 KB ok, no valid answer
35 Correct 67 ms 27628 KB ok, no valid answer
36 Correct 68 ms 27216 KB ok, no valid answer
37 Correct 93 ms 28100 KB ok, no valid answer
38 Correct 4 ms 16732 KB ok, correct split
39 Correct 6 ms 16732 KB ok, no valid answer
40 Correct 4 ms 16852 KB ok, correct split
41 Correct 5 ms 16732 KB ok, correct split
42 Correct 4 ms 16732 KB ok, correct split
43 Correct 4 ms 16844 KB ok, correct split
44 Correct 5 ms 16732 KB ok, correct split
45 Correct 4 ms 16732 KB ok, correct split
46 Correct 7 ms 16988 KB ok, correct split
47 Correct 8 ms 16988 KB ok, correct split
48 Correct 5 ms 16732 KB ok, correct split
49 Correct 7 ms 17148 KB ok, correct split
50 Correct 5 ms 16732 KB ok, correct split
51 Correct 5 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 6 ms 16732 KB ok, correct split
55 Correct 4 ms 16732 KB ok, correct split
56 Correct 5 ms 16896 KB ok, correct split
57 Correct 5 ms 16988 KB ok, correct split
58 Correct 6 ms 17184 KB ok, correct split
59 Correct 6 ms 16988 KB ok, correct split
60 Correct 6 ms 17100 KB ok, correct split
61 Correct 5 ms 17088 KB ok, correct split
62 Correct 7 ms 17132 KB ok, correct split
63 Incorrect 6 ms 16988 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -