oj.uz

Submission #810239

# Submission time Handle Problem Language Result Execution time Memory
810239 2023-08-06T07:23:18 Z ymm Mixture (BOI20_mixture) C++17
60 / 100
 2000 ms 35800 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
typedef long long ll;
using namespace std;

typedef complex<double> pnt;

const double eps = 1e-8;

struct obj {
	pnt P;
	bool first;
	pnt F;
	double mn, mx;
	set<double> S;
	bool line;
	bool zero;

	void add(pnt A)
	{
		A -= P;
		if (abs(A) < eps) {
			zero = 1;
			return;
		}
		if (!first) {
			F = A;
			first = 1;
		}
		A *= conj(F);
		double theta = arg(A);
		mn = min(mn, theta);
		mx = max(mx, theta);
		double theta2 = theta;
		if (theta > 0)
			theta2 -= M_PI;
		else
			theta2 += M_PI;
		auto it = S.lower_bound(theta2-eps);
		if (it != S.end() && *it - theta2 < eps)
			line = 1;
		S.insert(theta);
	}

	int get_ans() {
		if (zero)
			return 1;
		if (line)
			return 2;
		if (first && mx - mn > M_PI - eps)
			return 3;
		return 0;
	}
};

pnt normalize(double x, double y, double z)
{
	double sum = x+y+z;
	x /= sum;
	y /= sum;
	return {x, y};
}

const int N = 100'010;
int n;

namespace seg {
	vector<pnt> t[N*4];
	void add(int l, int r, pnt P, int i, int b, int e) {
		if (l <= b && e <= r) {
			t[i].push_back(P);
			return;
		}
		if (r <= b || e <= l)
			return;
		add(l, r, P, 2*i+1, b, (b+e)/2);
		add(l, r, P, 2*i+2, (b+e)/2, e);
	}
	void add(int l, int r, pnt P) { add(l, r, P, 0, 0, n); }

	void dfs(obj o0, int i, int b, int e) {
		obj o = o0;
		for (auto P : t[i])
			o.add(P);
		if (e-b == 1) {
			cout << o.get_ans() << '\n';
			return;
		}
		dfs(o, 2*i+1, b, (b+e)/2);
		dfs(o, 2*i+2, (b+e)/2, e);
	}
	void dfs(pnt P) {
		obj o = {};
		o.P = P;
		dfs(o, 0, 0, n);
	}
}

pnt readp()
{
	ll x, y, z;
	cin >> x >> y >> z;
	return normalize(x, y, z);
}

pnt a[N];
int l[N];
bool rem[N];

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	pnt P = readp();
	cin >> n;
	int cnt = 0;
	Loop (i,0,n) {
		char c;
		cin >> c;
		if (c == 'A') {
			a[cnt] = readp();
			l[cnt] = i;
			++cnt;
		} else {
			int x;
			cin >> x;
			--x;
			seg::add(l[x], i, a[x]);
			rem[x] = 1;
		}
	}
	Loop (i,0,cnt) {
		if (!rem[i])
			seg::add(l[i], n, a[i]);
	}
	seg::dfs(P);
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9724 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9724 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 5 ms 9724 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 4 ms 9728 KB Output is correct
9 Correct 6 ms 9720 KB Output is correct
10 Correct 4 ms 9720 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 6 ms 9688 KB Output is correct
13 Correct 5 ms 9720 KB Output is correct
14 Correct 5 ms 9680 KB Output is correct
15 Correct 5 ms 9720 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 5 ms 9716 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 4 ms 9684 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9724 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9724 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 5 ms 9724 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 4 ms 9728 KB Output is correct
9 Correct 6 ms 9720 KB Output is correct
10 Correct 4 ms 9720 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 6 ms 9688 KB Output is correct
13 Correct 5 ms 9720 KB Output is correct
14 Correct 5 ms 9680 KB Output is correct
15 Correct 5 ms 9720 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 5 ms 9716 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 4 ms 9684 KB Output is correct
20 Correct 5 ms 9724 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 6 ms 9724 KB Output is correct
23 Correct 14 ms 10068 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 8 ms 9812 KB Output is correct
26 Correct 8 ms 9812 KB Output is correct
27 Correct 6 ms 9812 KB Output is correct
28 Correct 9 ms 9832 KB Output is correct
29 Correct 9 ms 9812 KB Output is correct
30 Correct 7 ms 9812 KB Output is correct
31 Correct 6 ms 9728 KB Output is correct
32 Correct 18 ms 10004 KB Output is correct
33 Correct 4 ms 9744 KB Output is correct
34 Correct 14 ms 10036 KB Output is correct
35 Correct 6 ms 9812 KB Output is correct
36 Correct 7 ms 9812 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9724 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9724 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 5 ms 9724 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 4 ms 9728 KB Output is correct
9 Correct 6 ms 9720 KB Output is correct
10 Correct 4 ms 9720 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 6 ms 9688 KB Output is correct
13 Correct 5 ms 9720 KB Output is correct
14 Correct 5 ms 9680 KB Output is correct
15 Correct 5 ms 9720 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 5 ms 9716 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 4 ms 9684 KB Output is correct
20 Correct 5 ms 9724 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 6 ms 9724 KB Output is correct
23 Correct 14 ms 10068 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 8 ms 9812 KB Output is correct
26 Correct 8 ms 9812 KB Output is correct
27 Correct 6 ms 9812 KB Output is correct
28 Correct 9 ms 9832 KB Output is correct
29 Correct 9 ms 9812 KB Output is correct
30 Correct 7 ms 9812 KB Output is correct
31 Correct 6 ms 9728 KB Output is correct
32 Correct 18 ms 10004 KB Output is correct
33 Correct 4 ms 9744 KB Output is correct
34 Correct 14 ms 10036 KB Output is correct
35 Correct 6 ms 9812 KB Output is correct
36 Correct 7 ms 9812 KB Output is correct
37 Correct 10 ms 9728 KB Output is correct
38 Correct 9 ms 9828 KB Output is correct
39 Correct 38 ms 10212 KB Output is correct
40 Correct 23 ms 10216 KB Output is correct
41 Correct 25 ms 10212 KB Output is correct
42 Correct 23 ms 10148 KB Output is correct
43 Correct 31 ms 10228 KB Output is correct
44 Correct 30 ms 10224 KB Output is correct
45 Correct 35 ms 10196 KB Output is correct
46 Correct 290 ms 11724 KB Output is correct
47 Correct 286 ms 11644 KB Output is correct
48 Correct 7 ms 9812 KB Output is correct
49 Correct 27 ms 10068 KB Output is correct
50 Correct 20 ms 10064 KB Output is correct
51 Correct 569 ms 12068 KB Output is correct
52 Correct 67 ms 10772 KB Output is correct
53 Correct 760 ms 12628 KB Output is correct
54 Correct 763 ms 12588 KB Output is correct
55 Correct 13 ms 10372 KB Output is correct
56 Correct 12 ms 10452 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9724 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9724 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 5 ms 9724 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 4 ms 9728 KB Output is correct
9 Correct 6 ms 9720 KB Output is correct
10 Correct 4 ms 9720 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 6 ms 9688 KB Output is correct
13 Correct 5 ms 9720 KB Output is correct
14 Correct 5 ms 9680 KB Output is correct
15 Correct 5 ms 9720 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 5 ms 9716 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 4 ms 9684 KB Output is correct
20 Correct 5 ms 9724 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 6 ms 9724 KB Output is correct
23 Correct 14 ms 10068 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 8 ms 9812 KB Output is correct
26 Correct 8 ms 9812 KB Output is correct
27 Correct 6 ms 9812 KB Output is correct
28 Correct 9 ms 9832 KB Output is correct
29 Correct 9 ms 9812 KB Output is correct
30 Correct 7 ms 9812 KB Output is correct
31 Correct 6 ms 9728 KB Output is correct
32 Correct 18 ms 10004 KB Output is correct
33 Correct 4 ms 9744 KB Output is correct
34 Correct 14 ms 10036 KB Output is correct
35 Correct 6 ms 9812 KB Output is correct
36 Correct 7 ms 9812 KB Output is correct
37 Correct 10 ms 9728 KB Output is correct
38 Correct 9 ms 9828 KB Output is correct
39 Correct 38 ms 10212 KB Output is correct
40 Correct 23 ms 10216 KB Output is correct
41 Correct 25 ms 10212 KB Output is correct
42 Correct 23 ms 10148 KB Output is correct
43 Correct 31 ms 10228 KB Output is correct
44 Correct 30 ms 10224 KB Output is correct
45 Correct 35 ms 10196 KB Output is correct
46 Correct 290 ms 11724 KB Output is correct
47 Correct 286 ms 11644 KB Output is correct
48 Correct 7 ms 9812 KB Output is correct
49 Correct 27 ms 10068 KB Output is correct
50 Correct 20 ms 10064 KB Output is correct
51 Correct 569 ms 12068 KB Output is correct
52 Correct 67 ms 10772 KB Output is correct
53 Correct 760 ms 12628 KB Output is correct
54 Correct 763 ms 12588 KB Output is correct
55 Correct 13 ms 10372 KB Output is correct
56 Correct 12 ms 10452 KB Output is correct
57 Correct 74 ms 10928 KB Output is correct
58 Correct 558 ms 11984 KB Output is correct
59 Correct 587 ms 11992 KB Output is correct
60 Correct 455 ms 11764 KB Output is correct
61 Correct 60 ms 13792 KB Output is correct
62 Correct 58 ms 13816 KB Output is correct
63 Execution timed out 2064 ms 35800 KB Time limit exceeded
64 Halted 0 ms 0 KB -