oj.uz

답안 #143084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
143084 2019-08-13T00:53:20 Z model_code Split the Attractions (IOI19_split) Java 11
100 / 100
 1238 ms 62880 KB 
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

//IOI 2019
//Split
//Current Version: 31 May 2019
//Mahdi Safarnejad Boroujeni

class Pair implements Comparable<Pair> {
  final int first, second;
  Pair(int first, int second) {
  	this.first=first;
  	this.second=second;
  }
  @Override
	public int compareTo(Pair b) {
		if (first!=b.first)
			return first - b.first;
		return second - b.second;
	}
}

public class split {
	int n;
	List<Integer>[] a;
	ArrayList<Pair> b;
	int[] result, mark, size, startingtime, mintime;
	int counter = 1;
	boolean finishedPhase1 = false;

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

	public int[] find_split(int n, int a_, int b_, int c_, int[] p, int[] q) {
		this.n = n;
		result = new int[n];
		mark = new int[n];
		size = new int[n];
		startingtime = new int[n];
		mintime = new int[n];
		a = new ArrayList[n];
		for (int i = 0; i < n; i++)
			a[i] = new ArrayList<Integer>();
		b = new ArrayList<Pair>();
		b.add(new Pair(a_, 1));
		b.add(new Pair(b_, 2));
		b.add(new Pair(c_, 3));
		Collections.sort(b);
		for (int i = 0; i < p.length; i++) {
			a[p[i]].add(q[i]);
			a[q[i]].add(p[i]);
		}
		dfs(0, -1);
		return result;
	}
//	public static void main(String[] args) {
//		split test = new split();
//		int[] p = {0, 0, 0};
//		int[] q = {1, 2, 3};
//		int[] result = test.do_split(4, 2, 1, 1, p, q);
//		for (int i = 0; i < 4; i++)
//			System.out.print(result[i]+" ");
//		System.out.println();
//	}
}

Compilation message

Note: split.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 9644 KB ok, correct split
2 Correct 85 ms 9732 KB ok, correct split
3 Correct 87 ms 9688 KB ok, correct split
4 Correct 87 ms 9576 KB ok, correct split
5 Correct 91 ms 9592 KB ok, correct split
6 Correct 94 ms 9760 KB ok, correct split
7 Correct 1191 ms 59472 KB ok, correct split
8 Correct 801 ms 52616 KB ok, correct split
9 Correct 842 ms 57104 KB ok, correct split
10 Correct 829 ms 58104 KB ok, correct split
11 Correct 1238 ms 60796 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 9552 KB ok, correct split
2 Correct 87 ms 9660 KB ok, correct split
3 Correct 86 ms 9624 KB ok, correct split
4 Correct 873 ms 42984 KB ok, correct split
5 Correct 794 ms 40700 KB ok, correct split
6 Correct 835 ms 59732 KB ok, correct split
7 Correct 888 ms 61860 KB ok, correct split
8 Correct 864 ms 44192 KB ok, correct split
9 Correct 843 ms 42872 KB ok, correct split
10 Correct 772 ms 41464 KB ok, correct split
11 Correct 786 ms 41120 KB ok, correct split
12 Correct 806 ms 42668 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 9660 KB ok, correct split
2 Correct 784 ms 39280 KB ok, correct split
3 Correct 492 ms 27504 KB ok, correct split
4 Correct 118 ms 9724 KB ok, correct split
5 Correct 1085 ms 48284 KB ok, correct split
6 Correct 879 ms 55096 KB ok, correct split
7 Correct 946 ms 51956 KB ok, correct split
8 Correct 860 ms 52512 KB ok, correct split
9 Correct 1043 ms 50472 KB ok, correct split
10 Correct 486 ms 23384 KB ok, no valid answer
11 Correct 518 ms 28700 KB ok, no valid answer
12 Correct 856 ms 41832 KB ok, no valid answer
13 Correct 793 ms 40184 KB ok, no valid answer
14 Correct 814 ms 43504 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 9744 KB ok, correct split
2 Correct 86 ms 9524 KB ok, no valid answer
3 Correct 86 ms 9764 KB ok, correct split
4 Correct 86 ms 9840 KB ok, correct split
5 Correct 91 ms 9652 KB ok, correct split
6 Correct 86 ms 9632 KB ok, correct split
7 Correct 95 ms 9764 KB ok, correct split
8 Correct 87 ms 9696 KB ok, correct split
9 Correct 163 ms 12264 KB ok, correct split
10 Correct 156 ms 11904 KB ok, correct split
11 Correct 95 ms 9768 KB ok, correct split
12 Correct 192 ms 12532 KB ok, correct split
13 Correct 86 ms 9468 KB ok, correct split
14 Correct 85 ms 9620 KB ok, correct split
15 Correct 90 ms 9700 KB ok, correct split
16 Correct 87 ms 9860 KB ok, correct split
17 Correct 88 ms 9716 KB ok, correct split
18 Correct 95 ms 9772 KB ok, correct split
19 Correct 123 ms 11228 KB ok, correct split
20 Correct 138 ms 11480 KB ok, correct split
21 Correct 168 ms 12192 KB ok, correct split
22 Correct 159 ms 12144 KB ok, correct split
23 Correct 163 ms 12252 KB ok, correct split
24 Correct 156 ms 12444 KB ok, correct split
25 Correct 162 ms 12172 KB ok, correct split
26 Correct 173 ms 12212 KB ok, correct split
27 Correct 197 ms 12144 KB ok, correct split
28 Correct 169 ms 13156 KB ok, correct split
29 Correct 99 ms 9844 KB ok, correct split
30 Correct 169 ms 12216 KB ok, correct split
31 Correct 112 ms 11180 KB ok, correct split
32 Correct 100 ms 9948 KB ok, correct split
33 Correct 103 ms 9852 KB ok, correct split
34 Correct 165 ms 13004 KB ok, correct split
35 Correct 166 ms 12212 KB ok, correct split
36 Correct 162 ms 12072 KB ok, correct split
37 Correct 176 ms 12300 KB ok, correct split
38 Correct 171 ms 12500 KB ok, correct split
39 Correct 169 ms 12208 KB ok, correct split
40 Correct 166 ms 12292 KB ok, correct split
41 Correct 135 ms 11544 KB ok, correct split
42 Correct 145 ms 11864 KB ok, correct split
43 Correct 170 ms 12312 KB ok, correct split
44 Correct 190 ms 13320 KB ok, correct split
45 Correct 170 ms 12400 KB ok, correct split
46 Correct 164 ms 12328 KB ok, correct split
47 Correct 164 ms 12220 KB ok, no valid answer
48 Correct 151 ms 11556 KB ok, correct split
49 Correct 161 ms 12704 KB ok, correct split
50 Correct 95 ms 9816 KB ok, no valid answer
51 Correct 93 ms 9664 KB ok, no valid answer
52 Correct 153 ms 12240 KB ok, no valid answer
53 Correct 178 ms 12252 KB ok, no valid answer
54 Correct 171 ms 12376 KB ok, no valid answer
55 Correct 181 ms 12468 KB ok, no valid answer
56 Correct 166 ms 12160 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 9644 KB ok, correct split
2 Correct 85 ms 9732 KB ok, correct split
3 Correct 87 ms 9688 KB ok, correct split
4 Correct 87 ms 9576 KB ok, correct split
5 Correct 91 ms 9592 KB ok, correct split
6 Correct 94 ms 9760 KB ok, correct split
7 Correct 1191 ms 59472 KB ok, correct split
8 Correct 801 ms 52616 KB ok, correct split
9 Correct 842 ms 57104 KB ok, correct split
10 Correct 829 ms 58104 KB ok, correct split
11 Correct 1238 ms 60796 KB ok, correct split
12 Correct 86 ms 9552 KB ok, correct split
13 Correct 87 ms 9660 KB ok, correct split
14 Correct 86 ms 9624 KB ok, correct split
15 Correct 873 ms 42984 KB ok, correct split
16 Correct 794 ms 40700 KB ok, correct split
17 Correct 835 ms 59732 KB ok, correct split
18 Correct 888 ms 61860 KB ok, correct split
19 Correct 864 ms 44192 KB ok, correct split
20 Correct 843 ms 42872 KB ok, correct split
21 Correct 772 ms 41464 KB ok, correct split
22 Correct 786 ms 41120 KB ok, correct split
23 Correct 806 ms 42668 KB ok, correct split
24 Correct 87 ms 9660 KB ok, correct split
25 Correct 784 ms 39280 KB ok, correct split
26 Correct 492 ms 27504 KB ok, correct split
27 Correct 118 ms 9724 KB ok, correct split
28 Correct 1085 ms 48284 KB ok, correct split
29 Correct 879 ms 55096 KB ok, correct split
30 Correct 946 ms 51956 KB ok, correct split
31 Correct 860 ms 52512 KB ok, correct split
32 Correct 1043 ms 50472 KB ok, correct split
33 Correct 486 ms 23384 KB ok, no valid answer
34 Correct 518 ms 28700 KB ok, no valid answer
35 Correct 856 ms 41832 KB ok, no valid answer
36 Correct 793 ms 40184 KB ok, no valid answer
37 Correct 814 ms 43504 KB ok, no valid answer
38 Correct 86 ms 9744 KB ok, correct split
39 Correct 86 ms 9524 KB ok, no valid answer
40 Correct 86 ms 9764 KB ok, correct split
41 Correct 86 ms 9840 KB ok, correct split
42 Correct 91 ms 9652 KB ok, correct split
43 Correct 86 ms 9632 KB ok, correct split
44 Correct 95 ms 9764 KB ok, correct split
45 Correct 87 ms 9696 KB ok, correct split
46 Correct 163 ms 12264 KB ok, correct split
47 Correct 156 ms 11904 KB ok, correct split
48 Correct 95 ms 9768 KB ok, correct split
49 Correct 192 ms 12532 KB ok, correct split
50 Correct 86 ms 9468 KB ok, correct split
51 Correct 85 ms 9620 KB ok, correct split
52 Correct 90 ms 9700 KB ok, correct split
53 Correct 87 ms 9860 KB ok, correct split
54 Correct 88 ms 9716 KB ok, correct split
55 Correct 95 ms 9772 KB ok, correct split
56 Correct 123 ms 11228 KB ok, correct split
57 Correct 138 ms 11480 KB ok, correct split
58 Correct 168 ms 12192 KB ok, correct split
59 Correct 159 ms 12144 KB ok, correct split
60 Correct 163 ms 12252 KB ok, correct split
61 Correct 156 ms 12444 KB ok, correct split
62 Correct 162 ms 12172 KB ok, correct split
63 Correct 173 ms 12212 KB ok, correct split
64 Correct 197 ms 12144 KB ok, correct split
65 Correct 169 ms 13156 KB ok, correct split
66 Correct 99 ms 9844 KB ok, correct split
67 Correct 169 ms 12216 KB ok, correct split
68 Correct 112 ms 11180 KB ok, correct split
69 Correct 100 ms 9948 KB ok, correct split
70 Correct 103 ms 9852 KB ok, correct split
71 Correct 165 ms 13004 KB ok, correct split
72 Correct 166 ms 12212 KB ok, correct split
73 Correct 162 ms 12072 KB ok, correct split
74 Correct 176 ms 12300 KB ok, correct split
75 Correct 171 ms 12500 KB ok, correct split
76 Correct 169 ms 12208 KB ok, correct split
77 Correct 166 ms 12292 KB ok, correct split
78 Correct 135 ms 11544 KB ok, correct split
79 Correct 145 ms 11864 KB ok, correct split
80 Correct 170 ms 12312 KB ok, correct split
81 Correct 190 ms 13320 KB ok, correct split
82 Correct 170 ms 12400 KB ok, correct split
83 Correct 164 ms 12328 KB ok, correct split
84 Correct 164 ms 12220 KB ok, no valid answer
85 Correct 151 ms 11556 KB ok, correct split
86 Correct 161 ms 12704 KB ok, correct split
87 Correct 95 ms 9816 KB ok, no valid answer
88 Correct 93 ms 9664 KB ok, no valid answer
89 Correct 153 ms 12240 KB ok, no valid answer
90 Correct 178 ms 12252 KB ok, no valid answer
91 Correct 171 ms 12376 KB ok, no valid answer
92 Correct 181 ms 12468 KB ok, no valid answer
93 Correct 166 ms 12160 KB ok, no valid answer
94 Correct 988 ms 54564 KB ok, correct split
95 Correct 1199 ms 62696 KB ok, correct split
96 Correct 1120 ms 62880 KB ok, correct split
97 Correct 471 ms 25352 KB ok, correct split
98 Correct 461 ms 25488 KB ok, correct split
99 Correct 612 ms 32592 KB ok, correct split
100 Correct 815 ms 45456 KB ok, correct split
101 Correct 937 ms 46608 KB ok, correct split
102 Correct 930 ms 47456 KB ok, correct split
103 Correct 804 ms 43456 KB ok, correct split
104 Correct 869 ms 45232 KB ok, correct split
105 Correct 645 ms 32244 KB ok, correct split
106 Correct 967 ms 44636 KB ok, correct split
107 Correct 928 ms 41276 KB ok, correct split
108 Correct 897 ms 42212 KB ok, correct split
109 Correct 1049 ms 44996 KB ok, correct split
110 Correct 866 ms 43912 KB ok, correct split
111 Correct 1027 ms 46848 KB ok, correct split
112 Correct 947 ms 45784 KB ok, correct split
113 Correct 892 ms 45608 KB ok, correct split
114 Correct 300 ms 18660 KB ok, correct split
115 Correct 310 ms 17980 KB ok, correct split
116 Correct 990 ms 46496 KB ok, correct split
117 Correct 977 ms 47100 KB ok, correct split
118 Correct 813 ms 40296 KB ok, correct split
119 Correct 857 ms 42384 KB ok, correct split
120 Correct 1079 ms 54468 KB ok, correct split
121 Correct 806 ms 40800 KB ok, no valid answer
122 Correct 839 ms 41156 KB ok, no valid answer
123 Correct 844 ms 43408 KB ok, no valid answer
124 Correct 826 ms 45040 KB ok, no valid answer
125 Correct 916 ms 44748 KB ok, no valid answer
126 Correct 767 ms 40944 KB ok, no valid answer
127 Correct 797 ms 43192 KB ok, no valid answer