oj.uz

Submission #154767

# Submission time Handle Problem Language Result Execution time Memory
154767 2019-09-24T14:31:17 Z AKaan37 Split the Attractions (IOI19_split) C++17
11 / 100
 136 ms 22732 KB 
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
#include "split.h"
 
using namespace std;
 
typedef long long lo;
typedef pair< int,int > 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,bb,k,flag,t,vis[li],say;
int cev;
string s;
vector<int> v[li];
vector<int> vv;
 
inline void dfs(int node,int der){
	if(vis[node]==1)return ;
	if(say==bb)return ;
	say++;
	vis[node]=1;
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i];
		dfs(go,der+1);
	}
}
 
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);
	for(int i=0;i<n;i++){
		if(vis[i]==1){vv.pb(2);}
		else if(a>0){a--;vv.pb(1);}
		else vv.pb(3);
	}
	return vv;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12152 KB ok, correct split
2 Correct 14 ms 12024 KB ok, correct split
3 Correct 14 ms 12024 KB ok, correct split
4 Correct 14 ms 12024 KB ok, correct split
5 Correct 14 ms 12152 KB ok, correct split
6 Incorrect 14 ms 12024 KB 2 components are not connected
7 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12024 KB ok, correct split
2 Correct 14 ms 12024 KB ok, correct split
3 Correct 14 ms 12028 KB ok, correct split
4 Correct 104 ms 20564 KB ok, correct split
5 Correct 90 ms 19320 KB ok, correct split
6 Correct 86 ms 18944 KB ok, correct split
7 Correct 89 ms 20340 KB ok, correct split
8 Correct 136 ms 22732 KB ok, correct split
9 Correct 90 ms 19312 KB ok, correct split
10 Correct 74 ms 19312 KB ok, correct split
11 Correct 73 ms 19312 KB ok, correct split
12 Correct 76 ms 19696 KB ok, correct split

Subtask #3
0 / 22.0

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

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 12024 KB 2 components are not connected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12152 KB ok, correct split
2 Correct 14 ms 12024 KB ok, correct split
3 Correct 14 ms 12024 KB ok, correct split
4 Correct 14 ms 12024 KB ok, correct split
5 Correct 14 ms 12152 KB ok, correct split
6 Incorrect 14 ms 12024 KB 2 components are not connected
7 Halted 0 ms 0 KB -