답안 #826681

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
826681	2023-08-15T20:04:35 Z	QwertyPi	Mixture (BOI20_mixture)	C++14	60 / 100	2000 ms	14956 KB

Mixture

#include <bits/stdc++.h>
#define int long long
using namespace std;

struct V3d{
	int x, y, z;
	void norm(){
		int g = __gcd(__gcd(x, y), z); g = abs(g);
		if(g != 0) x /= g, y /= g, z /= g;
	}
	bool operator< (const V3d o) const {
		if(x != o.x) return x < o.x;
		if(y != o.y) return y < o.y;
		if(z != o.z) return z < o.z;
		return 0;
	}
};

int dot(V3d a, V3d b){
	return a.x * b.x + a.y * b.y + a.z * b.z;
}

__int128_t dot128(V3d a, V3d b){
	return (__int128_t) a.x * b.x + (__int128_t) a.y * b.y + (__int128_t) a.z * b.z;
}

long double triple(V3d a, V3d b, V3d c){
	long double r = 0;
	r += (long double) a.x * b.y * c.z;
	r += (long double) a.z * b.x * c.y;
	r += (long double) a.y * b.z * c.x;
	r -= (long double) a.x * b.z * c.y;
	r -= (long double) a.y * b.x * c.z;
	r -= (long double) a.z * b.y * c.x;
	return r;
}

V3d operator* (V3d a, int n){
	return {a.x * n, a.y * n, a.z * n};
}

V3d operator- (V3d a, V3d b){
	return {a.x - b.x, a.y - b.y, a.z - b.z};
}

V3d operator- (V3d b){
	return {-b.x, -b.y, -b.z};
}

V3d vds[100011]; int ai = 0;
V3d f;

long double deg(V3d a, V3d b){
	__int128_t p = dot128(a, b);
	long double q = sqrt((long double) dot128(a, a)) * sqrt((long double) dot128(b, b));
	return acos(min(1.0L, (long double) p / q)) * (triple(f, a, b) > 0 ? 1 : -1);
}

const long double PI = 3.1415926535;

struct Angle{
	bool init = false;
	multiset<long double> S;
	void add(long double d){
		S.insert(d);
	}
	void rem(long double d){
		S.erase(S.find(d));
	}
	bool qry(){
		if(!init) return false;
		if(S.size() < 3) return false;
		uniform_real_distribution<long double> dist(-PI, PI);
		random_device rd;
		for(int tr = 0; tr < 50; tr++){
			long double d = dist(rd);
			auto ptr = S.lower_bound(d);
			if(ptr != S.begin() && ptr != S.end()){
				long double diff = *ptr - *prev(ptr);
				if(diff > PI) return false;
			}else{
				long double diff = *S.begin() + PI * 2 - *prev(S.end());
				if(diff > PI) return false;
			}
		}
		return true;
	}
} Solver;

struct Handle{
	int c1 = 0, c2 = 0; map<V3d, int> cnt;
	V3d o;
	void add(V3d a){
		a.norm();
		if(a.x == 0 && a.y == 0 && a.z == 0) { c1++; return; }
		if(!Solver.init){
			Solver.init = true;
			o = a; Solver.add(deg(o, a));
		}else{
			Solver.add(deg(o, a));
		}
		cnt[a]++; if(cnt[a] == 1 && cnt[-a] > 0) c2++;
	}
	void rem(V3d a){
		a.norm();
		if(a.x == 0 && a.y == 0 && a.z == 0) { c1--; return; }
		Solver.rem(deg(o, a));
		cnt[a]--; if(cnt[a] == 0 && cnt[-a] > 0) c2--;
	}
	int qry(){
		if(c1 > 0) return 1;
		if(c2 > 0) return 2;
		if(Solver.qry()) return 3;
		return 0;
	}
} handle;

int32_t main(){
	cin.tie(0); cout.tie(0)->sync_with_stdio(false);
	int x, y, z; cin >> x >> y >> z; f = V3d {x, y, z};
	int n; cin >> n;
	for(int i = 0; i < n; i++){
		char c; cin >> c;
		if(c == 'A'){
			int x, y, z; cin >> x >> y >> z;
			V3d a {x, y, z};
			vds[++ai] = a * dot(f, f) - f * dot(a, f);
			handle.add(vds[ai]);
		}else{
			int x; cin >> x;
			handle.rem(vds[x]);
		}
		cout << handle.qry() << '\n';
	}
}

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	216 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	2 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct

Subtask #2
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	216 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	2 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	9 ms	324 KB	Output is correct
28	Correct	2 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	17 ms	376 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	14 ms	428 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	19 ms	340 KB	Output is correct

Subtask #3
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	216 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	2 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	9 ms	324 KB	Output is correct
28	Correct	2 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	17 ms	376 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	14 ms	428 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	19 ms	340 KB	Output is correct
37	Correct	15 ms	340 KB	Output is correct
38	Correct	4 ms	392 KB	Output is correct
39	Correct	16 ms	360 KB	Output is correct
40	Correct	52 ms	340 KB	Output is correct
41	Correct	54 ms	440 KB	Output is correct
42	Correct	52 ms	392 KB	Output is correct
43	Correct	45 ms	476 KB	Output is correct
44	Correct	45 ms	380 KB	Output is correct
45	Correct	40 ms	392 KB	Output is correct
46	Correct	19 ms	724 KB	Output is correct
47	Correct	161 ms	744 KB	Output is correct
48	Correct	65 ms	348 KB	Output is correct
49	Correct	153 ms	340 KB	Output is correct
50	Correct	126 ms	356 KB	Output is correct
51	Correct	238 ms	888 KB	Output is correct
52	Correct	24 ms	608 KB	Output is correct
53	Correct	24 ms	936 KB	Output is correct
54	Correct	323 ms	968 KB	Output is correct
55	Correct	2 ms	468 KB	Output is correct
56	Correct	3 ms	468 KB	Output is correct

Subtask #4
0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	216 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	2 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	9 ms	324 KB	Output is correct
28	Correct	2 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	17 ms	376 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	14 ms	428 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	19 ms	340 KB	Output is correct
37	Correct	15 ms	340 KB	Output is correct
38	Correct	4 ms	392 KB	Output is correct
39	Correct	16 ms	360 KB	Output is correct
40	Correct	52 ms	340 KB	Output is correct
41	Correct	54 ms	440 KB	Output is correct
42	Correct	52 ms	392 KB	Output is correct
43	Correct	45 ms	476 KB	Output is correct
44	Correct	45 ms	380 KB	Output is correct
45	Correct	40 ms	392 KB	Output is correct
46	Correct	19 ms	724 KB	Output is correct
47	Correct	161 ms	744 KB	Output is correct
48	Correct	65 ms	348 KB	Output is correct
49	Correct	153 ms	340 KB	Output is correct
50	Correct	126 ms	356 KB	Output is correct
51	Correct	238 ms	888 KB	Output is correct
52	Correct	24 ms	608 KB	Output is correct
53	Correct	24 ms	936 KB	Output is correct
54	Correct	323 ms	968 KB	Output is correct
55	Correct	2 ms	468 KB	Output is correct
56	Correct	3 ms	468 KB	Output is correct
57	Correct	3 ms	468 KB	Output is correct
58	Correct	452 ms	1120 KB	Output is correct
59	Correct	445 ms	1056 KB	Output is correct
60	Correct	8 ms	980 KB	Output is correct
61	Correct	13 ms	1656 KB	Output is correct
62	Correct	615 ms	1728 KB	Output is correct
63	Correct	611 ms	14956 KB	Output is correct
64	Execution timed out	2076 ms	5692 KB	Time limit exceeded
65	Halted	0 ms	0 KB	-

답안 #826681

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 17.0 / 17.0

Subtask #3 30.0 / 30.0

Subtask #4 0 / 40.0

Subtask #1
13.0 / 13.0

Subtask #2
17.0 / 17.0

Subtask #3
30.0 / 30.0

Subtask #4
0 / 40.0