oj.uz

Submission #826679

# Submission time Handle Problem Language Result Execution time Memory
826679 2023-08-15T20:02:35 Z QwertyPi Mixture (BOI20_mixture) C++14
60 / 100
 2000 ms 16824 KB 
#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 < 100; 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(){
	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() << endl;
	}
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 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 1 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 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 1 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 3 ms 212 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 17 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 312 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 33 ms 356 KB Output is correct
33 Correct 2 ms 212 KB Output is correct
34 Correct 28 ms 412 KB Output is correct
35 Correct 2 ms 324 KB Output is correct
36 Correct 36 ms 348 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 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 1 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 3 ms 212 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 17 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 312 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 33 ms 356 KB Output is correct
33 Correct 2 ms 212 KB Output is correct
34 Correct 28 ms 412 KB Output is correct
35 Correct 2 ms 324 KB Output is correct
36 Correct 36 ms 348 KB Output is correct
37 Correct 26 ms 360 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 32 ms 428 KB Output is correct
40 Correct 110 ms 384 KB Output is correct
41 Correct 104 ms 448 KB Output is correct
42 Correct 101 ms 436 KB Output is correct
43 Correct 87 ms 488 KB Output is correct
44 Correct 89 ms 424 KB Output is correct
45 Correct 79 ms 392 KB Output is correct
46 Correct 39 ms 752 KB Output is correct
47 Correct 315 ms 832 KB Output is correct
48 Correct 127 ms 368 KB Output is correct
49 Correct 300 ms 388 KB Output is correct
50 Correct 254 ms 380 KB Output is correct
51 Correct 448 ms 944 KB Output is correct
52 Correct 50 ms 716 KB Output is correct
53 Correct 33 ms 956 KB Output is correct
54 Correct 636 ms 904 KB Output is correct
55 Correct 9 ms 468 KB Output is correct
56 Correct 10 ms 428 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 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 1 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 3 ms 212 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 17 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 312 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 33 ms 356 KB Output is correct
33 Correct 2 ms 212 KB Output is correct
34 Correct 28 ms 412 KB Output is correct
35 Correct 2 ms 324 KB Output is correct
36 Correct 36 ms 348 KB Output is correct
37 Correct 26 ms 360 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 32 ms 428 KB Output is correct
40 Correct 110 ms 384 KB Output is correct
41 Correct 104 ms 448 KB Output is correct
42 Correct 101 ms 436 KB Output is correct
43 Correct 87 ms 488 KB Output is correct
44 Correct 89 ms 424 KB Output is correct
45 Correct 79 ms 392 KB Output is correct
46 Correct 39 ms 752 KB Output is correct
47 Correct 315 ms 832 KB Output is correct
48 Correct 127 ms 368 KB Output is correct
49 Correct 300 ms 388 KB Output is correct
50 Correct 254 ms 380 KB Output is correct
51 Correct 448 ms 944 KB Output is correct
52 Correct 50 ms 716 KB Output is correct
53 Correct 33 ms 956 KB Output is correct
54 Correct 636 ms 904 KB Output is correct
55 Correct 9 ms 468 KB Output is correct
56 Correct 10 ms 428 KB Output is correct
57 Correct 16 ms 596 KB Output is correct
58 Correct 881 ms 1392 KB Output is correct
59 Correct 875 ms 1140 KB Output is correct
60 Correct 17 ms 1108 KB Output is correct
61 Correct 46 ms 2128 KB Output is correct
62 Correct 1177 ms 2112 KB Output is correct
63 Correct 765 ms 16824 KB Output is correct
64 Execution timed out 2045 ms 3668 KB Time limit exceeded
65 Halted 0 ms 0 KB -