oj.uz

Submission #288970

# Submission time Handle Problem Language Result Execution time Memory
288970 2020-09-02T08:42:55 Z mohammad Split the Attractions (IOI19_split) C++14
11 / 100
 134 ms 15732 KB 
#include "split.h"
#include<bits/stdc++.h>
using namespace std;
 
#define endl "\n"
// #define int long long

typedef long long ll ;
const ll ooo = 1e14 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7  ;
const int N = 10000010  ;

int use[200010];
vector<int> v[200010] , seq;

void dfs(int u ){
	seq.push_back(u);
	use[u] = 1;
	for(auto x : v[u])
		if(!use[x]){
			dfs(x);
		}
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<int> res;
	int m = p.size();
	for(int i = 0 ;  i < m ; ++i) {
		v[p[i]].push_back(q[i]);
		v[q[i]].push_back(p[i]);
	}
	dfs(0);
	if(b > c){
		res = vector<int>(n , 2);
		for(int i = 0 ; i < c ; ++i) res[seq[i]] = 3;
		for(int i = 0 ; i < n ; ++i) if(res[i] == 2){
			res[i] = 1;
			break;
		}
	}else{
		res = vector<int>(n , 3);
		// cout << seq[0] 
		for(int i = 0 ; i < b ; ++i) res[seq[i]] = 2;
		for(int i = 0 ; i < n ; ++i) if(res[i] == 3){
			res[i] = 1;
			break;
		}
	}
	return res;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB ok, correct split
2 Correct 3 ms 4992 KB ok, correct split
3 Correct 3 ms 4992 KB ok, correct split
4 Incorrect 3 ms 4992 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 3 ms 4992 KB ok, correct split
2 Correct 3 ms 4992 KB ok, correct split
3 Correct 3 ms 4992 KB ok, correct split
4 Correct 115 ms 14320 KB ok, correct split
5 Correct 85 ms 11124 KB ok, correct split
6 Correct 106 ms 15732 KB ok, correct split
7 Correct 105 ms 13940 KB ok, correct split
8 Correct 134 ms 13300 KB ok, correct split
9 Correct 94 ms 10996 KB ok, correct split
10 Correct 68 ms 11376 KB ok, correct split
11 Correct 61 ms 11376 KB ok, correct split
12 Correct 65 ms 11376 KB ok, correct split

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4992 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 3 ms 4992 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 4 ms 4992 KB ok, correct split
2 Correct 3 ms 4992 KB ok, correct split
3 Correct 3 ms 4992 KB ok, correct split
4 Incorrect 3 ms 4992 KB invalid split: #1=1, #2=1, #3=2
5 Halted 0 ms 0 KB -