oj.uz

Submission #147566

# Submission time Handle Problem Language Result Execution time Memory
147566 2019-08-30T05:42:01 Z AKaan37 Split the Attractions (IOI19_split) C++17
11 / 100
 142 ms 20424 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(flag==0){flag=1;vv.pb(1);}
		else vv.pb(3);
	}
	return vv;
}

//~ int main(){
	//~ vector<int>vec;
	//~ vector<int>vec1;
	//~ vector<int>vec2;
	//~ vec.clear();
	//~ vec1.clear();
	//~ vec2.clear();
	//~ vec1.pb(0);vec1.pb(0);vec1.pb(0);vec1.pb(0);vec1.pb(0);
	//~ vec2.pb(1);vec2.pb(2);vec2.pb(3);vec2.pb(4);vec2.pb(4);
	//~ vec=find_split(5,1,2,2,vec1,vec2);
	//~ for(int i=0;i<(int)vec.size();i++){
		//~ printf("%d\n",vec[i]);
	//~ }
	//~ return 0;
//~ }

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12024 KB ok, correct split
2 Correct 13 ms 12124 KB ok, correct split
3 Correct 13 ms 12024 KB ok, correct split
4 Incorrect 13 ms 12024 KB invalid split: #1=1, #2=1, #3=2
5 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12024 KB ok, correct split
2 Correct 14 ms 12052 KB ok, correct split
3 Correct 14 ms 12024 KB ok, correct split
4 Correct 104 ms 18800 KB ok, correct split
5 Correct 85 ms 18164 KB ok, correct split
6 Correct 83 ms 17672 KB ok, correct split
7 Correct 91 ms 19188 KB ok, correct split
8 Correct 142 ms 20424 KB ok, correct split
9 Correct 87 ms 18292 KB ok, correct split
10 Correct 72 ms 18456 KB ok, correct split
11 Correct 72 ms 18540 KB ok, correct split
12 Correct 74 ms 18412 KB ok, correct split

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 12024 KB invalid split: #1=1, #2=1, #3=3
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 12024 KB invalid split: #1=1, #2=2, #3=6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12024 KB ok, correct split
2 Correct 13 ms 12124 KB ok, correct split
3 Correct 13 ms 12024 KB ok, correct split
4 Incorrect 13 ms 12024 KB invalid split: #1=1, #2=1, #3=2
5 Halted 0 ms 0 KB -