#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,e) for (int i = s; i <= e; ++i)
#define rrep(i,s,e) for (int i = s; i >= e; --i)
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define len(a) (int)a.size()
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
const double eps = 1e-8, pi = acos(-1);
const int mx = 1e5;
bool eq (double a, double b) {
return abs(a-b)<=5*eps;
}
double ang[mx+1] = {};
int bud[mx+1] = {}, b = 0;
set<pair<double,int>> st2;
void do_two (int id) {
double poss[5] = {fmod(ang[id]+pi+eps,2*pi),
ang[id]+pi-eps,
fmod(ang[id]+pi-eps,2*pi),
fmod(ang[id]+pi,2*pi)+eps,
fmod(ang[id]+pi,2*pi)-eps};
rep (i,0,3) {
double pos = poss[i];
auto it = st2.lower_bound({pos, 0});
if (it!=st2.end() && eq((*it).fi,pos)) {
bud[id] = (*it).se;
bud[(*it).se] = id;
st2.erase(it);
b++;
return;
}
}
st2.insert({ang[id], id});
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
double S, P, G; cin >> S >> P >> G;
double X = S/(S+P+G), Y = P/(S+P+G);
int n; cin >>n;
int id = 1, a=0, p[n+1] = {};
multiset<double> st3;
rep (i,1,n) {
char tp; cin >> tp;
if (tp=='A') {
double Si, Pi, Gi;
cin >> Si >> Pi >> Gi;
double x = Si/(Si+Pi+Gi), y = Pi/(Si+Pi+Gi);
if (eq(X,x) && eq(Y,y)) {
a++;
p[id] = 1;
}
else {
ang[id] = fmod(pi+atan2(y-Y, x-X),2*pi);
st3.insert(ang[id]);
do_two(id);
}
++id;
}
else {
int x; cin >> x;
st3.erase(ang[x]);
a -= p[x];
if (bud[x]) {
b--;
bud[bud[x]] = 0;
do_two(bud[x]);
bud[x] = 0;
}
}
bool c = 0;
if (len(st3)>2) {
double un = (*st3.begin());
double dos = (*--st3.upper_bound(un+pi));
double tres = (*--st3.upper_bound(dos+pi));
if (max(dos-un,max(tres-dos,2*pi+un-tres))<=pi) c = 1;
}
if (a) cout << "1\n";
else if (b) cout << "2\n";
else if (c) cout << "3\n";
else cout << "0\n";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
