oj.uz

Submission #156747

# Submission time Handle Problem Language Result Execution time Memory
156747 2019-10-07T08:33:55 Z AKaan37 Split the Attractions (IOI19_split) C++17
18 / 100
 150 ms 23156 KB 
#include "split.h"
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int m,b[li],a[li],k,flag,t,vis[li],bb,say,visit[li],renk[li];
int cev;
PII pa[5];
string s;
vector<int> v[li];
vector<int> vv;
 
inline void dfs(int node,int der,int ind){
	if(vis[node]==1)return ;
	vis[node]=1;
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i];
		dfs(go,der+1,ind);
	}
	if(visit[node]==0){
		if(say>=bb)return ;
		say++;
		visit[node]=ind;
		//~ cout<<say<<endl;
	}
	//~ renk[node]=ind;
}
 
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	pa[1].fi=a;
	pa[1].se=1;
	pa[2].fi=b;
	pa[2].se=2;
	pa[3].fi=c;
	pa[3].se=3;
	sort(pa+1,pa+3+1);
	bb=pa[2].fi;
	for(int i=0;i<(int)p.size();i++){
		v[q[i]].pb(p[i]);
		v[p[i]].pb(q[i]);
	}
	dfs(0,0,pa[2].se);
	say=0;
	bb=pa[1].fi;
	memset(vis,0,sizeof(vis));
	dfs(0,0,pa[1].se);
	for(int i=0;i<n;i++){
		if(visit[i]==0)visit[i]=pa[3].se;
		vv.pb(visit[i]);
	}
	return vv;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14072 KB ok, correct split
2 Correct 14 ms 14200 KB ok, correct split
3 Correct 14 ms 14072 KB ok, correct split
4 Correct 14 ms 14072 KB ok, correct split
5 Correct 14 ms 14072 KB ok, correct split
6 Correct 14 ms 14072 KB ok, correct split
7 Correct 148 ms 23056 KB ok, correct split
8 Correct 104 ms 22132 KB ok, correct split
9 Correct 101 ms 21752 KB ok, correct split
10 Correct 102 ms 23156 KB ok, correct split
11 Correct 105 ms 23156 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 13992 KB ok, correct split
2 Correct 14 ms 14072 KB ok, correct split
3 Correct 14 ms 14072 KB ok, correct split
4 Correct 119 ms 22632 KB ok, correct split
5 Correct 92 ms 20176 KB ok, correct split
6 Correct 111 ms 23136 KB ok, correct split
7 Correct 105 ms 22004 KB ok, correct split
8 Correct 150 ms 22440 KB ok, correct split
9 Correct 109 ms 20084 KB ok, correct split
10 Correct 73 ms 20464 KB ok, correct split
11 Correct 85 ms 20464 KB ok, correct split
12 Correct 82 ms 20436 KB ok, correct split

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14072 KB ok, correct split
2 Incorrect 96 ms 20116 KB 2 components are not connected
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14072 KB ok, correct split
2 Incorrect 14 ms 14072 KB 2 components are not connected
3 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14072 KB ok, correct split
2 Correct 14 ms 14200 KB ok, correct split
3 Correct 14 ms 14072 KB ok, correct split
4 Correct 14 ms 14072 KB ok, correct split
5 Correct 14 ms 14072 KB ok, correct split
6 Correct 14 ms 14072 KB ok, correct split
7 Correct 148 ms 23056 KB ok, correct split
8 Correct 104 ms 22132 KB ok, correct split
9 Correct 101 ms 21752 KB ok, correct split
10 Correct 102 ms 23156 KB ok, correct split
11 Correct 105 ms 23156 KB ok, correct split
12 Correct 14 ms 13992 KB ok, correct split
13 Correct 14 ms 14072 KB ok, correct split
14 Correct 14 ms 14072 KB ok, correct split
15 Correct 119 ms 22632 KB ok, correct split
16 Correct 92 ms 20176 KB ok, correct split
17 Correct 111 ms 23136 KB ok, correct split
18 Correct 105 ms 22004 KB ok, correct split
19 Correct 150 ms 22440 KB ok, correct split
20 Correct 109 ms 20084 KB ok, correct split
21 Correct 73 ms 20464 KB ok, correct split
22 Correct 85 ms 20464 KB ok, correct split
23 Correct 82 ms 20436 KB ok, correct split
24 Correct 14 ms 14072 KB ok, correct split
25 Incorrect 96 ms 20116 KB 2 components are not connected
26 Halted 0 ms 0 KB -