oj.uz

Submission #893523

# Submission time Handle Problem Language Result Execution time Memory
893523 2023-12-27T06:15:36 Z Faisal_Saqib Split the Attractions (IOI19_split) C++17
100 / 100
 80 ms 49488 KB 
//IOI 2019
//Split - Version 1.1 - First Solution
//Current Version: 9 May 2019
//Older version: 31 March 2019
//Mahdi Safarnejad Boroujeni

#define forn(i, n) for (int i = 0; i < int(n); i++)

#include "split.h"

#include <vector>
#include <algorithm>
using namespace std;

const int maxn = 1000000+110;
typedef pair<int,int> intpair;

int n;
vector<int> a[maxn];
vector<int> result(maxn);
intpair b[3];

bool finishedPhase1 = false;

int mark[maxn], sz[maxn];
int counter=1, startingtime[maxn], mintime[maxn];

int dfs2(int v, int goal, int comp, bool ignore_st=false) {
	int sum=1;
	mark[v]=2;
	result[v]=comp;
	goal -= 1;
	forn(i, a[v].size())
    if (goal > 0 && mark[a[v][i]] < 2 && (ignore_st || (startingtime[a[v][i]] > startingtime[v]))) {
        int thisSize = dfs2(a[v][i], goal, comp, ignore_st);
        sum += thisSize;
        goal -= thisSize;
    }
    return sum;
}

void dfs(int v, int par) {
    mark[v]=1;
    sz[v]=1;
    startingtime[v] = counter++;
    mintime[v] = startingtime[v];
    int removablesSum=0;
    forn(i, a[v].size())
        if (!mark[a[v][i]]) {
            dfs(a[v][i], v);
            if (finishedPhase1)
            	return;
            sz[v]+=sz[a[v][i]];
            mintime[v] = min(mintime[v], mintime[a[v][i]]);
            if (mintime[a[v][i]] < startingtime[v])
                removablesSum += sz[a[v][i]];
        } else if (a[v][i]!=par) {
            mintime[v] = min(mintime[v], mintime[a[v][i]]);
        }
    if (sz[v] >= b[0].first) {
    	finishedPhase1 = true;
    	if (n - sz[v] + removablesSum < b[0].first)
    		return; //No Solution
    	int element = 0;
    	if (n - sz[v] + removablesSum < b[1].first)
    		element = 1;
    	result[v] = b[element].second;
        mark[v] = 2;
    	int goal = b[element].first - 1;
    	forn(i, a[v].size()) {
    		if (mark[a[v][i]] < 2 && goal > 0 && mintime[a[v][i]] >= startingtime[v] && startingtime[a[v][i]] > startingtime[v])
    			goal -= dfs2(a[v][i], goal, b[element].second);
    	}
    	forn(i, a[v].size()) {
    		if (mark[a[v][i]] < 2 && goal > 0 && mintime[a[v][i]] < startingtime[v] && startingtime[a[v][i]] > startingtime[v])
    			goal -= dfs2(a[v][i], goal, b[element].second);
    	}
    	dfs2(0, b[1-element].first, b[1-element].second, true);
    	forn(i, n)
    		if (result[i]==0)
    			result[i]=b[2].second;
    }
}

vector <int> find_split(int n_, int a_, int b_, int c_, vector <int> p, vector <int> q) {
	n = n_;
    b[0]=intpair(a_, 1); b[1]=intpair(b_, 2); b[2]=intpair(c_, 3);
	sort(b, b+3);
	forn(i, p.size()) {
		a[p[i]].push_back(q[i]);
		a[q[i]].push_back(p[i]);
	}
    dfs(0, -1);
		result.resize(n);
    return result;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 34140 KB ok, correct split
2 Correct 7 ms 34228 KB ok, correct split
3 Correct 7 ms 34140 KB ok, correct split
4 Correct 8 ms 34140 KB ok, correct split
5 Correct 7 ms 34392 KB ok, correct split
6 Correct 7 ms 34124 KB ok, correct split
7 Correct 53 ms 48432 KB ok, correct split
8 Correct 42 ms 42836 KB ok, correct split
9 Correct 55 ms 47196 KB ok, correct split
10 Correct 51 ms 48976 KB ok, correct split
11 Correct 53 ms 48976 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 34140 KB ok, correct split
2 Correct 7 ms 34156 KB ok, correct split
3 Correct 7 ms 34140 KB ok, correct split
4 Correct 49 ms 40412 KB ok, correct split
5 Correct 49 ms 39260 KB ok, correct split
6 Correct 51 ms 48988 KB ok, correct split
7 Correct 52 ms 49488 KB ok, correct split
8 Correct 60 ms 41552 KB ok, correct split
9 Correct 41 ms 39764 KB ok, correct split
10 Correct 37 ms 39624 KB ok, correct split
11 Correct 38 ms 39888 KB ok, correct split
12 Correct 39 ms 39624 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 34340 KB ok, correct split
2 Correct 50 ms 39640 KB ok, correct split
3 Correct 20 ms 36444 KB ok, correct split
4 Correct 7 ms 34140 KB ok, correct split
5 Correct 47 ms 42832 KB ok, correct split
6 Correct 55 ms 42324 KB ok, correct split
7 Correct 52 ms 42328 KB ok, correct split
8 Correct 50 ms 43888 KB ok, correct split
9 Correct 52 ms 41996 KB ok, correct split
10 Correct 20 ms 35928 KB ok, no valid answer
11 Correct 25 ms 36956 KB ok, no valid answer
12 Correct 41 ms 39896 KB ok, no valid answer
13 Correct 43 ms 39764 KB ok, no valid answer
14 Correct 38 ms 40024 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 34140 KB ok, correct split
2 Correct 7 ms 34140 KB ok, no valid answer
3 Correct 7 ms 34164 KB ok, correct split
4 Correct 7 ms 34140 KB ok, correct split
5 Correct 8 ms 34268 KB ok, correct split
6 Correct 7 ms 34136 KB ok, correct split
7 Correct 8 ms 34256 KB ok, correct split
8 Correct 8 ms 34140 KB ok, correct split
9 Correct 8 ms 34396 KB ok, correct split
10 Correct 8 ms 34396 KB ok, correct split
11 Correct 8 ms 34232 KB ok, correct split
12 Correct 9 ms 34396 KB ok, correct split
13 Correct 7 ms 34140 KB ok, correct split
14 Correct 7 ms 34140 KB ok, correct split
15 Correct 7 ms 34140 KB ok, correct split
16 Correct 7 ms 34140 KB ok, correct split
17 Correct 7 ms 34244 KB ok, correct split
18 Correct 7 ms 34140 KB ok, correct split
19 Correct 7 ms 34140 KB ok, correct split
20 Correct 8 ms 34140 KB ok, correct split
21 Correct 9 ms 34260 KB ok, correct split
22 Correct 8 ms 34396 KB ok, correct split
23 Correct 8 ms 34396 KB ok, correct split
24 Correct 8 ms 34392 KB ok, correct split
25 Correct 8 ms 34396 KB ok, correct split
26 Correct 8 ms 34472 KB ok, correct split
27 Correct 10 ms 34396 KB ok, correct split
28 Correct 8 ms 34396 KB ok, correct split
29 Correct 7 ms 34140 KB ok, correct split
30 Correct 9 ms 34396 KB ok, correct split
31 Correct 7 ms 34140 KB ok, correct split
32 Correct 7 ms 34140 KB ok, correct split
33 Correct 7 ms 34156 KB ok, correct split
34 Correct 8 ms 34396 KB ok, correct split
35 Correct 8 ms 34396 KB ok, correct split
36 Correct 9 ms 34392 KB ok, correct split
37 Correct 9 ms 34396 KB ok, correct split
38 Correct 8 ms 34396 KB ok, correct split
39 Correct 9 ms 34396 KB ok, correct split
40 Correct 8 ms 34396 KB ok, correct split
41 Correct 8 ms 34140 KB ok, correct split
42 Correct 8 ms 34140 KB ok, correct split
43 Correct 8 ms 34396 KB ok, correct split
44 Correct 9 ms 34396 KB ok, correct split
45 Correct 8 ms 34392 KB ok, correct split
46 Correct 8 ms 34396 KB ok, correct split
47 Correct 8 ms 34396 KB ok, no valid answer
48 Correct 8 ms 34396 KB ok, correct split
49 Correct 8 ms 34396 KB ok, correct split
50 Correct 7 ms 34140 KB ok, no valid answer
51 Correct 7 ms 34140 KB ok, no valid answer
52 Correct 8 ms 34396 KB ok, no valid answer
53 Correct 9 ms 34396 KB ok, no valid answer
54 Correct 8 ms 34396 KB ok, no valid answer
55 Correct 8 ms 34396 KB ok, no valid answer
56 Correct 8 ms 34396 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 34140 KB ok, correct split
2 Correct 7 ms 34228 KB ok, correct split
3 Correct 7 ms 34140 KB ok, correct split
4 Correct 8 ms 34140 KB ok, correct split
5 Correct 7 ms 34392 KB ok, correct split
6 Correct 7 ms 34124 KB ok, correct split
7 Correct 53 ms 48432 KB ok, correct split
8 Correct 42 ms 42836 KB ok, correct split
9 Correct 55 ms 47196 KB ok, correct split
10 Correct 51 ms 48976 KB ok, correct split
11 Correct 53 ms 48976 KB ok, correct split
12 Correct 8 ms 34140 KB ok, correct split
13 Correct 7 ms 34156 KB ok, correct split
14 Correct 7 ms 34140 KB ok, correct split
15 Correct 49 ms 40412 KB ok, correct split
16 Correct 49 ms 39260 KB ok, correct split
17 Correct 51 ms 48988 KB ok, correct split
18 Correct 52 ms 49488 KB ok, correct split
19 Correct 60 ms 41552 KB ok, correct split
20 Correct 41 ms 39764 KB ok, correct split
21 Correct 37 ms 39624 KB ok, correct split
22 Correct 38 ms 39888 KB ok, correct split
23 Correct 39 ms 39624 KB ok, correct split
24 Correct 7 ms 34340 KB ok, correct split
25 Correct 50 ms 39640 KB ok, correct split
26 Correct 20 ms 36444 KB ok, correct split
27 Correct 7 ms 34140 KB ok, correct split
28 Correct 47 ms 42832 KB ok, correct split
29 Correct 55 ms 42324 KB ok, correct split
30 Correct 52 ms 42328 KB ok, correct split
31 Correct 50 ms 43888 KB ok, correct split
32 Correct 52 ms 41996 KB ok, correct split
33 Correct 20 ms 35928 KB ok, no valid answer
34 Correct 25 ms 36956 KB ok, no valid answer
35 Correct 41 ms 39896 KB ok, no valid answer
36 Correct 43 ms 39764 KB ok, no valid answer
37 Correct 38 ms 40024 KB ok, no valid answer
38 Correct 7 ms 34140 KB ok, correct split
39 Correct 7 ms 34140 KB ok, no valid answer
40 Correct 7 ms 34164 KB ok, correct split
41 Correct 7 ms 34140 KB ok, correct split
42 Correct 8 ms 34268 KB ok, correct split
43 Correct 7 ms 34136 KB ok, correct split
44 Correct 8 ms 34256 KB ok, correct split
45 Correct 8 ms 34140 KB ok, correct split
46 Correct 8 ms 34396 KB ok, correct split
47 Correct 8 ms 34396 KB ok, correct split
48 Correct 8 ms 34232 KB ok, correct split
49 Correct 9 ms 34396 KB ok, correct split
50 Correct 7 ms 34140 KB ok, correct split
51 Correct 7 ms 34140 KB ok, correct split
52 Correct 7 ms 34140 KB ok, correct split
53 Correct 7 ms 34140 KB ok, correct split
54 Correct 7 ms 34244 KB ok, correct split
55 Correct 7 ms 34140 KB ok, correct split
56 Correct 7 ms 34140 KB ok, correct split
57 Correct 8 ms 34140 KB ok, correct split
58 Correct 9 ms 34260 KB ok, correct split
59 Correct 8 ms 34396 KB ok, correct split
60 Correct 8 ms 34396 KB ok, correct split
61 Correct 8 ms 34392 KB ok, correct split
62 Correct 8 ms 34396 KB ok, correct split
63 Correct 8 ms 34472 KB ok, correct split
64 Correct 10 ms 34396 KB ok, correct split
65 Correct 8 ms 34396 KB ok, correct split
66 Correct 7 ms 34140 KB ok, correct split
67 Correct 9 ms 34396 KB ok, correct split
68 Correct 7 ms 34140 KB ok, correct split
69 Correct 7 ms 34140 KB ok, correct split
70 Correct 7 ms 34156 KB ok, correct split
71 Correct 8 ms 34396 KB ok, correct split
72 Correct 8 ms 34396 KB ok, correct split
73 Correct 9 ms 34392 KB ok, correct split
74 Correct 9 ms 34396 KB ok, correct split
75 Correct 8 ms 34396 KB ok, correct split
76 Correct 9 ms 34396 KB ok, correct split
77 Correct 8 ms 34396 KB ok, correct split
78 Correct 8 ms 34140 KB ok, correct split
79 Correct 8 ms 34140 KB ok, correct split
80 Correct 8 ms 34396 KB ok, correct split
81 Correct 9 ms 34396 KB ok, correct split
82 Correct 8 ms 34392 KB ok, correct split
83 Correct 8 ms 34396 KB ok, correct split
84 Correct 8 ms 34396 KB ok, no valid answer
85 Correct 8 ms 34396 KB ok, correct split
86 Correct 8 ms 34396 KB ok, correct split
87 Correct 7 ms 34140 KB ok, no valid answer
88 Correct 7 ms 34140 KB ok, no valid answer
89 Correct 8 ms 34396 KB ok, no valid answer
90 Correct 9 ms 34396 KB ok, no valid answer
91 Correct 8 ms 34396 KB ok, no valid answer
92 Correct 8 ms 34396 KB ok, no valid answer
93 Correct 8 ms 34396 KB ok, no valid answer
94 Correct 54 ms 44664 KB ok, correct split
95 Correct 79 ms 49396 KB ok, correct split
96 Correct 70 ms 47852 KB ok, correct split
97 Correct 21 ms 36188 KB ok, correct split
98 Correct 23 ms 36444 KB ok, correct split
99 Correct 34 ms 38744 KB ok, correct split
100 Correct 62 ms 42580 KB ok, correct split
101 Correct 55 ms 41696 KB ok, correct split
102 Correct 61 ms 41068 KB ok, correct split
103 Correct 49 ms 40660 KB ok, correct split
104 Correct 57 ms 42176 KB ok, correct split
105 Correct 32 ms 37724 KB ok, correct split
106 Correct 58 ms 42048 KB ok, correct split
107 Correct 46 ms 39788 KB ok, correct split
108 Correct 46 ms 39764 KB ok, correct split
109 Correct 69 ms 41812 KB ok, correct split
110 Correct 67 ms 41572 KB ok, correct split
111 Correct 80 ms 41828 KB ok, correct split
112 Correct 65 ms 41932 KB ok, correct split
113 Correct 65 ms 41836 KB ok, correct split
114 Correct 13 ms 35420 KB ok, correct split
115 Correct 13 ms 35164 KB ok, correct split
116 Correct 62 ms 41676 KB ok, correct split
117 Correct 63 ms 41524 KB ok, correct split
118 Correct 46 ms 39760 KB ok, correct split
119 Correct 41 ms 39768 KB ok, correct split
120 Correct 50 ms 44564 KB ok, correct split
121 Correct 44 ms 39776 KB ok, no valid answer
122 Correct 43 ms 39764 KB ok, no valid answer
123 Correct 70 ms 42700 KB ok, no valid answer
124 Correct 71 ms 42576 KB ok, no valid answer
125 Correct 62 ms 40392 KB ok, no valid answer
126 Correct 36 ms 39368 KB ok, no valid answer
127 Correct 52 ms 40900 KB ok, no valid answer