oj.uz

답안 #912621

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912621 2024-01-19T16:34:39 Z Wansur Split the Attractions (IOI19_split) C++14
18 / 100
 108 ms 34900 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){
			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];
			}
			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(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 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 4 ms 16732 KB ok, correct split
5 Correct 4 ms 16728 KB ok, correct split
6 Correct 4 ms 16732 KB ok, correct split
7 Correct 108 ms 34436 KB ok, correct split
8 Correct 76 ms 32080 KB ok, correct split
9 Correct 75 ms 31316 KB ok, correct split
10 Correct 73 ms 34644 KB ok, correct split
11 Correct 87 ms 34900 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 4 ms 16728 KB ok, correct split
4 Correct 81 ms 31572 KB ok, correct split
5 Correct 65 ms 26960 KB ok, correct split
6 Correct 73 ms 34644 KB ok, correct split
7 Correct 78 ms 31824 KB ok, correct split
8 Correct 85 ms 29268 KB ok, correct split
9 Correct 83 ms 27076 KB ok, correct split
10 Correct 73 ms 27340 KB ok, correct split
11 Correct 71 ms 27376 KB ok, correct split
12 Correct 64 ms 27364 KB ok, correct split

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16732 KB ok, correct split
2 Correct 86 ms 27368 KB ok, correct split
3 Correct 27 ms 20828 KB ok, correct split
4 Correct 4 ms 16728 KB ok, correct split
5 Correct 70 ms 29480 KB ok, correct split
6 Incorrect 77 ms 29268 KB invalid split: #1=12621, #2=35000, #3=52379
7 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16732 KB ok, correct split
2 Correct 4 ms 16732 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 5 ms 16728 KB ok, correct split
6 Correct 4 ms 16732 KB ok, correct split
7 Incorrect 5 ms 16732 KB invalid split: #1=2, #2=4, #3=6
8 Halted 0 ms 0 KB -

Subtask #5
0 / 36.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 4 ms 16732 KB ok, correct split
5 Correct 4 ms 16728 KB ok, correct split
6 Correct 4 ms 16732 KB ok, correct split
7 Correct 108 ms 34436 KB ok, correct split
8 Correct 76 ms 32080 KB ok, correct split
9 Correct 75 ms 31316 KB ok, correct split
10 Correct 73 ms 34644 KB ok, correct split
11 Correct 87 ms 34900 KB ok, correct split
12 Correct 4 ms 16728 KB ok, correct split
13 Correct 4 ms 16732 KB ok, correct split
14 Correct 4 ms 16728 KB ok, correct split
15 Correct 81 ms 31572 KB ok, correct split
16 Correct 65 ms 26960 KB ok, correct split
17 Correct 73 ms 34644 KB ok, correct split
18 Correct 78 ms 31824 KB ok, correct split
19 Correct 85 ms 29268 KB ok, correct split
20 Correct 83 ms 27076 KB ok, correct split
21 Correct 73 ms 27340 KB ok, correct split
22 Correct 71 ms 27376 KB ok, correct split
23 Correct 64 ms 27364 KB ok, correct split
24 Correct 4 ms 16732 KB ok, correct split
25 Correct 86 ms 27368 KB ok, correct split
26 Correct 27 ms 20828 KB ok, correct split
27 Correct 4 ms 16728 KB ok, correct split
28 Correct 70 ms 29480 KB ok, correct split
29 Incorrect 77 ms 29268 KB invalid split: #1=12621, #2=35000, #3=52379
30 Halted 0 ms 0 KB -