oj.uz

Submission #202576

# Submission time Handle Problem Language Result Execution time Memory
202576 2020-02-17T03:42:18 Z batmend_kh Split the Attractions (IOI19_split) C++14
7 / 100
 107 ms 15608 KB 
#include "split.h"
#include<bits/stdc++.h>
using namespace std;

vector< vector<int> > gr;
vector<int> val;

void go(int cur, int par, int ind, int n);

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	gr.resize(n + 5);
	val.resize(n);

	int m = p.size();
	for (int i = 0; i < m; i++) {
		int bg = p[i];
		int en = q[i];
		gr[en].push_back(bg);
		gr[bg].push_back(en);
	}
	int uzuur = 0;
	for (int i = 0; i < n; i++) {
		if (gr[i].size() == 1) uzuur = i;
	}
	go (uzuur, -1, 1, n);
	for (int i = 0; i < n; i++) {
		if (val[i] <= a) {
			val[i] = 1;
			continue;
		}
		if (val[i] <= a + b) {
			val[i] = 2; 
			continue;
		}
		val[i] = 3;
	}
	return val;
}



void go(int cur, int par, int ind, int n) {
	val[cur] = ind;
	if (ind == n) return;
	for (int x : gr[cur]) {
		if (x == par) continue;
		go(x, cur, ind + 1, n); 
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB ok, correct split
2 Correct 5 ms 256 KB ok, correct split
3 Correct 5 ms 256 KB ok, correct split
4 Correct 5 ms 128 KB ok, correct split
5 Correct 5 ms 376 KB ok, correct split
6 Correct 5 ms 248 KB ok, correct split
7 Correct 102 ms 15528 KB ok, correct split
8 Correct 100 ms 15608 KB ok, correct split
9 Correct 94 ms 15592 KB ok, correct split
10 Correct 102 ms 15608 KB ok, correct split
11 Correct 107 ms 15608 KB ok, correct split

Subtask #2
0 / 11.0

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

Subtask #3
0 / 22.0

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

Subtask #4
0 / 24.0

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

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB ok, correct split
2 Correct 5 ms 256 KB ok, correct split
3 Correct 5 ms 256 KB ok, correct split
4 Correct 5 ms 128 KB ok, correct split
5 Correct 5 ms 376 KB ok, correct split
6 Correct 5 ms 248 KB ok, correct split
7 Correct 102 ms 15528 KB ok, correct split
8 Correct 100 ms 15608 KB ok, correct split
9 Correct 94 ms 15592 KB ok, correct split
10 Correct 102 ms 15608 KB ok, correct split
11 Correct 107 ms 15608 KB ok, correct split
12 Correct 5 ms 256 KB ok, correct split
13 Correct 5 ms 256 KB ok, correct split
14 Incorrect 5 ms 504 KB invalid split: #1=1, #2=1, #3=3
15 Halted 0 ms 0 KB -