oj.uz

Submission #912654

# Submission time Handle Problem Language Result Execution time Memory
912654 2024-01-19T17:18:59 Z Wansur Split the Attractions (IOI19_split) C++14
40 / 100
 101 ms 34692 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: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);
	}
}

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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16728 KB ok, correct split
2 Correct 5 ms 16732 KB ok, correct split
3 Correct 5 ms 16840 KB ok, correct split
4 Correct 5 ms 16732 KB ok, correct split
5 Correct 5 ms 16728 KB ok, correct split
6 Correct 6 ms 16732 KB ok, correct split
7 Correct 77 ms 34388 KB ok, correct split
8 Correct 72 ms 32084 KB ok, correct split
9 Correct 99 ms 31384 KB ok, correct split
10 Correct 80 ms 34684 KB ok, correct split
11 Correct 88 ms 34640 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 101 ms 31508 KB ok, correct split
5 Correct 67 ms 26960 KB ok, correct split
6 Correct 81 ms 34692 KB ok, correct split
7 Correct 87 ms 31964 KB ok, correct split
8 Correct 89 ms 29148 KB ok, correct split
9 Correct 72 ms 27044 KB ok, correct split
10 Correct 88 ms 27328 KB ok, correct split
11 Correct 71 ms 27340 KB ok, correct split
12 Correct 100 ms 27420 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16728 KB ok, correct split
2 Correct 83 ms 27124 KB ok, correct split
3 Correct 26 ms 20828 KB ok, correct split
4 Correct 4 ms 16732 KB ok, correct split
5 Correct 82 ms 29608 KB ok, correct split
6 Correct 80 ms 29264 KB ok, correct split
7 Correct 69 ms 29084 KB ok, correct split
8 Correct 71 ms 30544 KB ok, correct split
9 Correct 82 ms 28904 KB ok, correct split
10 Correct 24 ms 20280 KB ok, no valid answer
11 Correct 31 ms 21852 KB ok, no valid answer
12 Correct 67 ms 27548 KB ok, no valid answer
13 Correct 70 ms 27212 KB ok, no valid answer
14 Correct 71 ms 28000 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16728 KB ok, correct split
2 Correct 5 ms 16728 KB ok, no valid answer
3 Correct 4 ms 16732 KB ok, correct split
4 Correct 4 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 5 ms 16816 KB ok, correct split
8 Correct 4 ms 16728 KB ok, correct split
9 Correct 7 ms 16988 KB ok, correct split
10 Correct 6 ms 16988 KB ok, correct split
11 Correct 4 ms 16732 KB ok, correct split
12 Correct 5 ms 16988 KB ok, correct split
13 Correct 4 ms 16860 KB ok, correct split
14 Correct 4 ms 16728 KB ok, correct split
15 Correct 5 ms 16732 KB ok, correct split
16 Correct 5 ms 16984 KB ok, correct split
17 Correct 4 ms 16732 KB ok, correct split
18 Correct 4 ms 16732 KB ok, correct split
19 Correct 4 ms 16732 KB ok, correct split
20 Correct 4 ms 16988 KB ok, correct split
21 Correct 5 ms 16988 KB ok, correct split
22 Correct 5 ms 16988 KB ok, correct split
23 Correct 5 ms 17200 KB ok, correct split
24 Correct 6 ms 16988 KB ok, correct split
25 Correct 6 ms 16988 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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16728 KB ok, correct split
2 Correct 5 ms 16732 KB ok, correct split
3 Correct 5 ms 16840 KB ok, correct split
4 Correct 5 ms 16732 KB ok, correct split
5 Correct 5 ms 16728 KB ok, correct split
6 Correct 6 ms 16732 KB ok, correct split
7 Correct 77 ms 34388 KB ok, correct split
8 Correct 72 ms 32084 KB ok, correct split
9 Correct 99 ms 31384 KB ok, correct split
10 Correct 80 ms 34684 KB ok, correct split
11 Correct 88 ms 34640 KB ok, correct split
12 Correct 5 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 101 ms 31508 KB ok, correct split
16 Correct 67 ms 26960 KB ok, correct split
17 Correct 81 ms 34692 KB ok, correct split
18 Correct 87 ms 31964 KB ok, correct split
19 Correct 89 ms 29148 KB ok, correct split
20 Correct 72 ms 27044 KB ok, correct split
21 Correct 88 ms 27328 KB ok, correct split
22 Correct 71 ms 27340 KB ok, correct split
23 Correct 100 ms 27420 KB ok, correct split
24 Correct 4 ms 16728 KB ok, correct split
25 Correct 83 ms 27124 KB ok, correct split
26 Correct 26 ms 20828 KB ok, correct split
27 Correct 4 ms 16732 KB ok, correct split
28 Correct 82 ms 29608 KB ok, correct split
29 Correct 80 ms 29264 KB ok, correct split
30 Correct 69 ms 29084 KB ok, correct split
31 Correct 71 ms 30544 KB ok, correct split
32 Correct 82 ms 28904 KB ok, correct split
33 Correct 24 ms 20280 KB ok, no valid answer
34 Correct 31 ms 21852 KB ok, no valid answer
35 Correct 67 ms 27548 KB ok, no valid answer
36 Correct 70 ms 27212 KB ok, no valid answer
37 Correct 71 ms 28000 KB ok, no valid answer
38 Correct 4 ms 16728 KB ok, correct split
39 Correct 5 ms 16728 KB ok, no valid answer
40 Correct 4 ms 16732 KB ok, correct split
41 Correct 4 ms 16732 KB ok, correct split
42 Correct 4 ms 16732 KB ok, correct split
43 Correct 4 ms 16732 KB ok, correct split
44 Correct 5 ms 16816 KB ok, correct split
45 Correct 4 ms 16728 KB ok, correct split
46 Correct 7 ms 16988 KB ok, correct split
47 Correct 6 ms 16988 KB ok, correct split
48 Correct 4 ms 16732 KB ok, correct split
49 Correct 5 ms 16988 KB ok, correct split
50 Correct 4 ms 16860 KB ok, correct split
51 Correct 4 ms 16728 KB ok, correct split
52 Correct 5 ms 16732 KB ok, correct split
53 Correct 5 ms 16984 KB ok, correct split
54 Correct 4 ms 16732 KB ok, correct split
55 Correct 4 ms 16732 KB ok, correct split
56 Correct 4 ms 16732 KB ok, correct split
57 Correct 4 ms 16988 KB ok, correct split
58 Correct 5 ms 16988 KB ok, correct split
59 Correct 5 ms 16988 KB ok, correct split
60 Correct 5 ms 17200 KB ok, correct split
61 Correct 6 ms 16988 KB ok, correct split
62 Correct 6 ms 16988 KB ok, correct split
63 Incorrect 6 ms 16988 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -