oj.uz

Submission #873078

# Submission time Handle Problem Language Result Execution time Memory
873078 2023-11-14T12:14:11 Z Trisanu_Das Mixture (BOI20_mixture) C++17
100 / 100
 728 ms 24116 KB 
#include <bits/stdc++.h>
#define PI 3.1415926535
using namespace std;
typedef long long ll;
 
const int MN = 1e5+5;
 
ll gcd(ll a, ll b)
{
	a = abs(a);
	b = abs(b);
	if(a<b) swap(a,b);
	if(a==0) return 1;
	if(b==0) return a;
	return gcd(b,a%b);
}
 
double getA(double x, double y, double z)
{
	if(!x&&!y&&!z) return -1;
	//x /= 10000.0, y /= 10000.0, z /= 10000.0;
	double a = (x-y/2.0-z/2.0)/sqrt(x*x+y*y+z*z)/sqrt(1.5);
	if(a>1) a = 1;
	if(a<-1) a = -1;
	a = acos(a);
	if(y<z) a = 2*PI-a;
	return a;
}
 
struct point
{
	ll x,y,z;
	bool operator < (const point& p) const { return getA(x,y,z)<getA(p.x,p.y,p.z); }
};
 
double getA(point p)
{
	return getA(p.x,p.y,p.z);
}
 
point inv(point p)
{
	return point{-p.x,-p.y,-p.z};
}
 
map<point,int> m;
set<point> s;
 
bool solve()
{
	if(s.empty()) return 0;
	auto it = s.begin();
 
	if(getA(*it)>PI) return 0;
	it = s.lower_bound(inv(*it));
 
	if(it==s.end()) return 0;
	double hi = getA(*it);
 
	it--;
 
	if(it==s.begin()) return 0;
	double lo = getA(*it);
 
	return hi-lo<=PI;
}
 
int main()
{
    ios_base::sync_with_stdio(0),cin.tie(0);
    
    ll X,Y,Z,T;
    cin >> X >> Y >> Z;
    T = X+Y+Z;
 
    int N;
    cin >> N;
    
    int num = 0;
    ll cnt = 0;
    vector<point> p(N+1);
    vector<double> a(N+1);
 
    p[0] = point{0,0,0}; 
    while(N--){
    	char C;
    	cin >> C;
 
    	ll x,y,z,t,g;
    	if(C=='A'){
    		cin >> x >> y >> z;
    		t = x+y+z;
			x = x*T-X*t, y = y*T-Y*t, z = z*T-Z*t;
			g = gcd(gcd(x,y),z);
			x /= g, y /= g, z /= g;
    		p[++num] = point{x,y,z};
    		//if(N==6952) cout << x << ' ' << y << ' ' << z << ' ';
    		m[p[num]]++;
    		//cout << m[p[0]] << '\n';
    		s.insert(p[num]);
    		if(x||y||z){
    			cnt += m[inv(p[num])];
    		}
    	}
    	if(C=='R'){
    		cin >> t;
    		m[p[t]]--;
    		if(!m[p[t]]) s.erase(p[t]);
    		if(p[t].x||p[t].y||p[t].z){
    			cnt -= m[inv(p[t])];
    		}
    	}
     	if(m[p[0]]){
    		cout << 1 << '\n';
    	}
    	else if(cnt){
    		cout << 2 << '\n';
    	}
    	else if(solve()){
    		cout << 3 << '\n';
    	}
    	else{
    		cout << 0 << '\n';
    	}
    }
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 1 ms 412 KB Output is correct
34 Correct 3 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 1 ms 412 KB Output is correct
34 Correct 3 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 3 ms 348 KB Output is correct
38 Correct 3 ms 348 KB Output is correct
39 Correct 3 ms 464 KB Output is correct
40 Correct 4 ms 592 KB Output is correct
41 Correct 4 ms 604 KB Output is correct
42 Correct 3 ms 536 KB Output is correct
43 Correct 5 ms 476 KB Output is correct
44 Correct 4 ms 604 KB Output is correct
45 Correct 4 ms 604 KB Output is correct
46 Correct 13 ms 856 KB Output is correct
47 Correct 15 ms 860 KB Output is correct
48 Correct 7 ms 604 KB Output is correct
49 Correct 9 ms 584 KB Output is correct
50 Correct 9 ms 604 KB Output is correct
51 Correct 24 ms 1116 KB Output is correct
52 Correct 12 ms 604 KB Output is correct
53 Correct 19 ms 904 KB Output is correct
54 Correct 19 ms 1080 KB Output is correct
55 Correct 3 ms 604 KB Output is correct
56 Correct 2 ms 604 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 1 ms 412 KB Output is correct
34 Correct 3 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 3 ms 348 KB Output is correct
38 Correct 3 ms 348 KB Output is correct
39 Correct 3 ms 464 KB Output is correct
40 Correct 4 ms 592 KB Output is correct
41 Correct 4 ms 604 KB Output is correct
42 Correct 3 ms 536 KB Output is correct
43 Correct 5 ms 476 KB Output is correct
44 Correct 4 ms 604 KB Output is correct
45 Correct 4 ms 604 KB Output is correct
46 Correct 13 ms 856 KB Output is correct
47 Correct 15 ms 860 KB Output is correct
48 Correct 7 ms 604 KB Output is correct
49 Correct 9 ms 584 KB Output is correct
50 Correct 9 ms 604 KB Output is correct
51 Correct 24 ms 1116 KB Output is correct
52 Correct 12 ms 604 KB Output is correct
53 Correct 19 ms 904 KB Output is correct
54 Correct 19 ms 1080 KB Output is correct
55 Correct 3 ms 604 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 8 ms 1116 KB Output is correct
58 Correct 35 ms 1304 KB Output is correct
59 Correct 35 ms 1360 KB Output is correct
60 Correct 27 ms 1212 KB Output is correct
61 Correct 30 ms 1372 KB Output is correct
62 Correct 35 ms 1372 KB Output is correct
63 Correct 580 ms 17156 KB Output is correct
64 Correct 598 ms 17032 KB Output is correct
65 Correct 621 ms 14588 KB Output is correct
66 Correct 693 ms 14452 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 728 ms 24116 KB Output is correct
70 Correct 656 ms 19528 KB Output is correct
71 Correct 645 ms 19796 KB Output is correct
72 Correct 477 ms 15396 KB Output is correct
73 Correct 647 ms 17368 KB Output is correct