oj.uz

답안 #156745

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
156745 2019-10-07T08:26:28 Z AKaan37 Split the Attractions (IOI19_split) C++17
18 / 100
 139 ms 24568 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;
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) {
	bb=b;
	for(int i=0;i<(int)p.size();i++){
		v[q[i]].pb(p[i]);
		v[p[i]].pb(q[i]);
	}
	dfs(0,0,2);
	say=0;
	bb=a;
	memset(vis,0,sizeof(vis));
	dfs(0,0,1);
	for(int i=0;i<n;i++){
		if(visit[i]==2){vv.pb(2);}
		else if(visit[i]==1){vv.pb(1);}
		else vv.pb(3);
	}
	return vv;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 14072 KB ok, correct split
2 Correct 18 ms 14072 KB ok, correct split
3 Correct 15 ms 14072 KB ok, correct split
4 Correct 14 ms 14072 KB ok, correct split
5 Correct 14 ms 13992 KB ok, correct split
6 Correct 14 ms 14072 KB ok, correct split
7 Correct 113 ms 24180 KB ok, correct split
8 Correct 106 ms 23284 KB ok, correct split
9 Correct 104 ms 23036 KB ok, correct split
10 Correct 110 ms 24000 KB ok, correct split
11 Correct 104 ms 24436 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14072 KB ok, correct split
2 Correct 14 ms 14072 KB ok, correct split
3 Correct 15 ms 14072 KB ok, correct split
4 Correct 122 ms 23892 KB ok, correct split
5 Correct 96 ms 21232 KB ok, correct split
6 Correct 111 ms 23924 KB ok, correct split
7 Correct 111 ms 23156 KB ok, correct split
8 Correct 139 ms 24568 KB ok, correct split
9 Correct 99 ms 21236 KB ok, correct split
10 Correct 71 ms 21232 KB ok, correct split
11 Correct 75 ms 21232 KB ok, correct split
12 Correct 76 ms 21592 KB ok, correct split

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14072 KB ok, correct split
2 Incorrect 96 ms 21236 KB 2 components are not connected
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14072 KB ok, correct split
2 Incorrect 15 ms 14072 KB 2 components are not connected
3 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 14072 KB ok, correct split
2 Correct 18 ms 14072 KB ok, correct split
3 Correct 15 ms 14072 KB ok, correct split
4 Correct 14 ms 14072 KB ok, correct split
5 Correct 14 ms 13992 KB ok, correct split
6 Correct 14 ms 14072 KB ok, correct split
7 Correct 113 ms 24180 KB ok, correct split
8 Correct 106 ms 23284 KB ok, correct split
9 Correct 104 ms 23036 KB ok, correct split
10 Correct 110 ms 24000 KB ok, correct split
11 Correct 104 ms 24436 KB ok, correct split
12 Correct 14 ms 14072 KB ok, correct split
13 Correct 14 ms 14072 KB ok, correct split
14 Correct 15 ms 14072 KB ok, correct split
15 Correct 122 ms 23892 KB ok, correct split
16 Correct 96 ms 21232 KB ok, correct split
17 Correct 111 ms 23924 KB ok, correct split
18 Correct 111 ms 23156 KB ok, correct split
19 Correct 139 ms 24568 KB ok, correct split
20 Correct 99 ms 21236 KB ok, correct split
21 Correct 71 ms 21232 KB ok, correct split
22 Correct 75 ms 21232 KB ok, correct split
23 Correct 76 ms 21592 KB ok, correct split
24 Correct 15 ms 14072 KB ok, correct split
25 Incorrect 96 ms 21236 KB 2 components are not connected
26 Halted 0 ms 0 KB -