oj.uz

답안 #912610

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912610 2024-01-19T16:31:09 Z Wansur Split the Attractions (IOI19_split) C++14
40 / 100
 126 ms 34800 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];
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 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);
	}
}

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=1;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){
			break;
		}
		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(sz[v]>=a && n-sz[v]>=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(sz[v]>=b && n-sz[v]>=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];
		}
	}
	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:59:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |  for(int i=0;i<p.size();i++){
      |              ~^~~~~~~~~
split.cpp:75:6: warning: unused variable 'A' [-Wunused-variable]
   75 |  int A=a,B=b,C=c;
      |      ^
split.cpp:75:10: warning: unused variable 'B' [-Wunused-variable]
   75 |  int A=a,B=b,C=c;
      |          ^
split.cpp:75:14: warning: unused variable 'C' [-Wunused-variable]
   75 |  int A=a,B=b,C=c;
      |              ^
split.cpp:91:7: warning: unused variable 'bad' [-Wunused-variable]
   91 |  bool bad=0;
      |       ^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16728 KB ok, correct split
2 Correct 5 ms 16732 KB ok, correct split
3 Correct 4 ms 16732 KB ok, correct split
4 Correct 6 ms 16732 KB ok, correct split
5 Correct 5 ms 16728 KB ok, correct split
6 Correct 4 ms 16732 KB ok, correct split
7 Correct 100 ms 34284 KB ok, correct split
8 Correct 83 ms 31984 KB ok, correct split
9 Correct 90 ms 31312 KB ok, correct split
10 Correct 106 ms 34644 KB ok, correct split
11 Correct 94 ms 34800 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 16732 KB ok, correct split
3 Correct 5 ms 16732 KB ok, correct split
4 Correct 82 ms 31672 KB ok, correct split
5 Correct 83 ms 26932 KB ok, correct split
6 Correct 72 ms 34644 KB ok, correct split
7 Correct 93 ms 31964 KB ok, correct split
8 Correct 91 ms 29184 KB ok, correct split
9 Correct 83 ms 26964 KB ok, correct split
10 Correct 93 ms 27232 KB ok, correct split
11 Correct 126 ms 27224 KB ok, correct split
12 Correct 80 ms 27324 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 16732 KB ok, correct split
2 Correct 65 ms 26992 KB ok, correct split
3 Correct 29 ms 21340 KB ok, correct split
4 Correct 5 ms 16732 KB ok, correct split
5 Correct 81 ms 30608 KB ok, correct split
6 Correct 93 ms 30296 KB ok, correct split
7 Correct 98 ms 30216 KB ok, correct split
8 Correct 78 ms 31600 KB ok, correct split
9 Correct 71 ms 30036 KB ok, correct split
10 Correct 23 ms 20572 KB ok, no valid answer
11 Correct 37 ms 22428 KB ok, no valid answer
12 Correct 102 ms 28816 KB ok, no valid answer
13 Correct 64 ms 28424 KB ok, no valid answer
14 Correct 85 ms 29132 KB ok, no valid answer

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 16728 KB ok, correct split
2 Correct 4 ms 16732 KB ok, no valid answer
3 Correct 4 ms 16728 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 5 ms 16732 KB ok, correct split
9 Correct 6 ms 16992 KB ok, correct split
10 Correct 7 ms 16988 KB ok, correct split
11 Correct 6 ms 16728 KB ok, correct split
12 Correct 7 ms 16988 KB ok, correct split
13 Correct 4 ms 16732 KB ok, correct split
14 Correct 6 ms 16984 KB ok, correct split
15 Correct 6 ms 16732 KB ok, correct split
16 Correct 6 ms 16728 KB ok, correct split
17 Correct 5 ms 16732 KB ok, correct split
18 Correct 5 ms 16732 KB ok, correct split
19 Correct 6 ms 16728 KB ok, correct split
20 Correct 7 ms 16984 KB ok, correct split
21 Correct 7 ms 16988 KB ok, correct split
22 Correct 6 ms 16988 KB ok, correct split
23 Correct 7 ms 16988 KB ok, correct split
24 Correct 7 ms 16988 KB ok, correct split
25 Correct 7 ms 16992 KB ok, correct split
26 Incorrect 8 ms 17244 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 5 ms 16732 KB ok, correct split
3 Correct 4 ms 16732 KB ok, correct split
4 Correct 6 ms 16732 KB ok, correct split
5 Correct 5 ms 16728 KB ok, correct split
6 Correct 4 ms 16732 KB ok, correct split
7 Correct 100 ms 34284 KB ok, correct split
8 Correct 83 ms 31984 KB ok, correct split
9 Correct 90 ms 31312 KB ok, correct split
10 Correct 106 ms 34644 KB ok, correct split
11 Correct 94 ms 34800 KB ok, correct split
12 Correct 4 ms 16728 KB ok, correct split
13 Correct 4 ms 16732 KB ok, correct split
14 Correct 5 ms 16732 KB ok, correct split
15 Correct 82 ms 31672 KB ok, correct split
16 Correct 83 ms 26932 KB ok, correct split
17 Correct 72 ms 34644 KB ok, correct split
18 Correct 93 ms 31964 KB ok, correct split
19 Correct 91 ms 29184 KB ok, correct split
20 Correct 83 ms 26964 KB ok, correct split
21 Correct 93 ms 27232 KB ok, correct split
22 Correct 126 ms 27224 KB ok, correct split
23 Correct 80 ms 27324 KB ok, correct split
24 Correct 5 ms 16732 KB ok, correct split
25 Correct 65 ms 26992 KB ok, correct split
26 Correct 29 ms 21340 KB ok, correct split
27 Correct 5 ms 16732 KB ok, correct split
28 Correct 81 ms 30608 KB ok, correct split
29 Correct 93 ms 30296 KB ok, correct split
30 Correct 98 ms 30216 KB ok, correct split
31 Correct 78 ms 31600 KB ok, correct split
32 Correct 71 ms 30036 KB ok, correct split
33 Correct 23 ms 20572 KB ok, no valid answer
34 Correct 37 ms 22428 KB ok, no valid answer
35 Correct 102 ms 28816 KB ok, no valid answer
36 Correct 64 ms 28424 KB ok, no valid answer
37 Correct 85 ms 29132 KB ok, no valid answer
38 Correct 6 ms 16728 KB ok, correct split
39 Correct 4 ms 16732 KB ok, no valid answer
40 Correct 4 ms 16728 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 5 ms 16732 KB ok, correct split
46 Correct 6 ms 16992 KB ok, correct split
47 Correct 7 ms 16988 KB ok, correct split
48 Correct 6 ms 16728 KB ok, correct split
49 Correct 7 ms 16988 KB ok, correct split
50 Correct 4 ms 16732 KB ok, correct split
51 Correct 6 ms 16984 KB ok, correct split
52 Correct 6 ms 16732 KB ok, correct split
53 Correct 6 ms 16728 KB ok, correct split
54 Correct 5 ms 16732 KB ok, correct split
55 Correct 5 ms 16732 KB ok, correct split
56 Correct 6 ms 16728 KB ok, correct split
57 Correct 7 ms 16984 KB ok, correct split
58 Correct 7 ms 16988 KB ok, correct split
59 Correct 6 ms 16988 KB ok, correct split
60 Correct 7 ms 16988 KB ok, correct split
61 Correct 7 ms 16988 KB ok, correct split
62 Correct 7 ms 16992 KB ok, correct split
63 Incorrect 8 ms 17244 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -