oj.uz

Submission #530692

# Submission time Handle Problem Language Result Execution time Memory
530692 2022-02-26T12:33:28 Z c28dnv9q3 Mixture (BOI20_mixture) C++17
60 / 100
 2000 ms 1984 KB 
#include <iostream>
#include <bits/stdc++.h>
#define lli __int128_t
#define RBit _Rb_tree_iterator<pair<const pair<lli, lli>, int>>

using namespace std;

long long int a, b, c;

lli ab(lli n) {
    return n < 0 ? -n : n;
}

lli ggt(lli x, lli y) {
    return x == 0 ? y : ggt(y % x, x);
}

pair<lli, lli> toPoint(lli tX, lli tY, lli tZ) {
    //cout << tX << " " << tY << " " << tZ << "\n";
    lli x, y;
    if (a != 0) {
        x = tY * a - tX * b; y = tZ * a - tX * c;
    } else if (b != 0) {
        x = tX * b - tY * a; y = tZ * b - tY * c;
    } else {
        x = tX * c - tZ * a; y = tY * c - tZ * b;
    }
    lli d = ab(ggt(x, y));
    //cout << x << " " << y << "\n";
    if (d == 0) return {0, 0};
    x /= d;
    y /= d;
    return {x, y};
}

pair<lli, lli> inverse(pair<lli, lli> p) {
    return {- p.first, - p.second};
}

struct cmp {
    bool operator()(const pair<lli, lli>& pA, const pair<lli, lli>& pB) const {
        if (pA.first >= 0 && pB.first < 0) return true;
        if (pB.first >= 0 && pA.first < 0) return false;
        if (pA.second * pB.first == pB.second * pA.first && pA.first == 0 && pB.first == 0) return pA.second > pB.second;
        return pA.second * pB.first > pB.second * pA.first;
    }
};

/*
ostream& operator << (ostream& io, const pair<lli, lli>& p) {
    io << p.first << " " << p.second;
    return io;
}

ostream& operator << (ostream& io, const pair<pair<lli, lli>, int>& p) {
    io << p.first << " x " << p.second << "\n";
    return io;
}
 */

bool okay(map<pair<lli, lli>, int, cmp> circle) {
    if (circle.empty()) return false;
    RBit it = circle.begin();
    RBit inv = circle.upper_bound(inverse((*it).first));
    if (circle.end() == inv) inv = circle.begin();
    RBit invinv = circle.upper_bound(inverse((*inv).first));
    if (circle.end() == invinv) invinv = circle.begin();
    return it != inv && inv != invinv;
}

int main() {
    cin >> a >> b >> c;

    int n = 0, d = 0;
    pair<lli, lli> p, inv;
    vector<pair<lli, lli>> regal;
    map<pair<lli, lli>, int, cmp> circle;

    int q;
    cin >> q;

    string inst;
    int pos;

    long long int x, y, z;

    for (int i = 0; i < q; ++i) {
        //cout << i << "\n";

        cin >> inst;

        if (inst == "A") {
            cin >> x >> y >> z;
            p = toPoint(x, y, z);
            inv = inverse(p);

            /*
            cout << "\n";
            cout << x << " " << y << " " << z << "\n";
            cout << p;
            cout << "\n\n";
             */

            /*
            cout << "adding\n";
            cout << p;
            cout << "\n";
             */

            if ((*circle.find(p)).first == p && (*circle.find(inv)).first == inv) d--;

            regal.push_back(p);
            if (p.first == 0 && p.second == 0) n++; else {
                circle[p]++;
            }

            /*
            cout << "dtest\n";
            cout << *circle.end();
            cout << circle[p] << "\n";
            cout << *circle.find(p);
            cout << p << "\n";
            cout << *circle.find(inv);
            cout << inv << "\n";
             */

            if ((*circle.find(p)).first == p && (*circle.find(inv)).first == inv) d++;
        }

        if (inst == "R") {
            cin >> pos;
            p = regal[pos - 1];
            inv = inverse(p);

            if ((*circle.find(p)).first == p && (*circle.find(inv)).first == inv) d--;

            if (p.first == 0 && p.second == 0) n--; else {
                circle[p]--;
                if (circle[p] == 0) circle.erase(p);
            }

            if ((*circle.find(p)).first == p && (*circle.find(inv)).first == inv) d++;
        }

        /*
        cout << "0 0 x " << n << "\n";
        for (pair<pair<lli, lli>, int> j: circle) cout << j;
        cout << "\n";
         */

        if (n > 0) {
            cout << 1;
        } else {
            if (d > 0) {
                cout << 2;
            } else {
                if (okay(circle)) {
                    cout << 3;
                } else {
                    cout << 0;
                }
            }
        }
        cout << "\n";
    }
}

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 2 ms 320 KB Output is correct
24 Correct 2 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 2 ms 204 KB Output is correct
27 Correct 2 ms 204 KB Output is correct
28 Correct 2 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 2 ms 204 KB Output is correct
34 Correct 7 ms 332 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 2 ms 332 KB Output is correct
37 Correct 3 ms 216 KB Output is correct
38 Correct 3 ms 332 KB Output is correct
39 Correct 4 ms 332 KB Output is correct
40 Correct 16 ms 376 KB Output is correct
41 Correct 10 ms 332 KB Output is correct
42 Correct 10 ms 332 KB Output is correct
43 Correct 10 ms 332 KB Output is correct
44 Correct 10 ms 460 KB Output is correct
45 Correct 8 ms 332 KB Output is correct
46 Correct 10 ms 608 KB Output is correct
47 Correct 64 ms 656 KB Output is correct
48 Correct 7 ms 332 KB Output is correct
49 Correct 11 ms 448 KB Output is correct
50 Correct 11 ms 396 KB Output is correct
51 Correct 189 ms 736 KB Output is correct
52 Correct 14 ms 780 KB Output is correct
53 Correct 263 ms 1052 KB Output is correct
54 Correct 261 ms 892 KB Output is correct
55 Correct 10 ms 588 KB Output is correct
56 Correct 12 ms 588 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 2 ms 320 KB Output is correct
24 Correct 2 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 2 ms 204 KB Output is correct
27 Correct 2 ms 204 KB Output is correct
28 Correct 2 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 2 ms 204 KB Output is correct
34 Correct 7 ms 332 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 2 ms 332 KB Output is correct
37 Correct 3 ms 216 KB Output is correct
38 Correct 3 ms 332 KB Output is correct
39 Correct 4 ms 332 KB Output is correct
40 Correct 16 ms 376 KB Output is correct
41 Correct 10 ms 332 KB Output is correct
42 Correct 10 ms 332 KB Output is correct
43 Correct 10 ms 332 KB Output is correct
44 Correct 10 ms 460 KB Output is correct
45 Correct 8 ms 332 KB Output is correct
46 Correct 10 ms 608 KB Output is correct
47 Correct 64 ms 656 KB Output is correct
48 Correct 7 ms 332 KB Output is correct
49 Correct 11 ms 448 KB Output is correct
50 Correct 11 ms 396 KB Output is correct
51 Correct 189 ms 736 KB Output is correct
52 Correct 14 ms 780 KB Output is correct
53 Correct 263 ms 1052 KB Output is correct
54 Correct 261 ms 892 KB Output is correct
55 Correct 10 ms 588 KB Output is correct
56 Correct 12 ms 588 KB Output is correct
57 Correct 16 ms 796 KB Output is correct
58 Correct 212 ms 828 KB Output is correct
59 Correct 204 ms 708 KB Output is correct
60 Correct 18 ms 608 KB Output is correct
61 Correct 48 ms 1400 KB Output is correct
62 Correct 61 ms 1468 KB Output is correct
63 Execution timed out 2078 ms 1984 KB Time limit exceeded
64 Halted 0 ms 0 KB -