Submission #586987

# Submission time Handle Problem Language Result Execution time Memory
586987 2022-07-01T07:38:13 Z 반딧불(#8396) Mixture (BOI20_mixture) C++17
0 / 100
1 ms 212 KB
#include <bits/stdc++.h>

using namespace std;

#ifdef TEST
typedef long long ll;
#else
typedef __int128 ll;
#endif

struct vector2{
    ll x, y;
    vector2(){}
    vector2(ll x, ll y): x(x), y(y){}

    vector2 operator-()const{
        return vector2(-x, -y);
    }

    vector2 operator-(const vector2 &r)const{
        return vector2(x-r.x, y-r.y);
    }

    ll cross(vector2 r)const{
        return x*r.y - y*r.x;
    }

    bool operator<(const vector2 &r)const{
        if((make_pair(y, x) > make_pair(ll(0), ll(0))) ^ (make_pair(r.y, r.x) > make_pair(ll(0), ll(0)))){
            return make_pair(y, x) > make_pair(ll(0), ll(0));
        }
        return (vector2(0, 0) - *this).cross(r - *this) < 0;
    }

    bool operator==(const vector2 &r)const{
        return x==r.x && y==r.y;
    }
};

ll ccw(vector2 a, vector2 b){
    return a.cross(b);
}

ll ccw(vector2 a, vector2 b, vector2 c){
    return (b-a).cross(c-a);
}

ll mabs(ll x){
    return x>=0?x:-x;
}

vector2 calc(ll A, ll B, ll C, ll x, ll y, ll z){
    C += A+B, z += x+y;
    A*=z, B*=z, x*=C, y*=C;
    x-=A, y-=B;
    ll g = mabs(__gcd(x, y));
    if(g) x/=g, y/=g;
    return vector2(x, y);
}

long long A, B, C;
int n;
vector2 arr[100002];
int arrCnt;

/// ans=1 ���
int oneCnt;

/// ans=2 ���
map<vector2, ll> twoMp;
ll twoCnt;

/// ans=3 ���
map<vector2, int> threeMp;
bool threeCnt; /// 180�� �ʰ��� ������ ���°�?

bool large(vector2 a, vector2 b){
    return ccw(a, vector2(0, 0), b) > 0;
}

void addPoint(){
    long long x, y, z;
    scanf("%lld %lld %lld", &x, &y, &z);
    int i = ++arrCnt;
    arr[i] = calc(A, B, C, x, y, z);

    /// ans=1 update
    if(arr[i] == vector2(0, 0)){
        oneCnt++;
        return;
    }

    /// ans=2 update
    twoMp[arr[i]]++;
    twoCnt += twoMp[-arr[i]];

    /// ans=3 update
    if((int)threeMp.size() < 2){
        threeMp[arr[i]]++;
        if((int)threeMp.size() == 2 && twoCnt) threeCnt = 1;
        else threeCnt = 0;
        return;
    }
    if(threeMp.find(arr[i]) != threeMp.end() || threeCnt){
        threeMp[arr[i]]++;
        return;
    }

    auto it = threeMp.lower_bound(arr[i]);
    bool delOrig = 0;
    if(it == threeMp.begin()) delOrig = large(threeMp.rbegin()->first, threeMp.begin()->first);
    else delOrig = large(prev(it)->first, it->first);
    if(delOrig) threeCnt = 1;

    threeMp[arr[i]]++;
//    for(auto p: threeMp) printf("(%lld, %lld) ", p.first.x, p.first.y);
//    puts("");
    it = threeMp.lower_bound(arr[i]);
    bool newOrig = 0;
    if(it == prev(threeMp.end())) newOrig |= large(it->first, threeMp.begin()->first);
    else newOrig |= large(it->first, next(it)->first);
    if(it == threeMp.begin()) newOrig |= large(threeMp.rbegin()->first, it->first);
    else newOrig |= large(prev(it)->first, it->first);
    if(newOrig) threeCnt = 0;
}

void delPoint(){
    int i;
    scanf("%d", &i);

    /// ans=1 update
    if(arr[i] == vector2(0, 0)){
        oneCnt--;
        return;
    }

    /// ans=2 update
    twoCnt -= twoMp[-arr[i]];
    twoMp[arr[i]]--;

    /// ans=3 update
    if((int)threeMp.size() <= 2){
        threeMp[arr[i]]--;
        if(!threeMp[arr[i]]) threeMp.erase(arr[i]);
        if((int)threeMp.size() == 2 && twoCnt) threeCnt = 1;
        else threeCnt = 0;
        return;
    }
    if(threeMp[arr[i]] > 1 || !threeCnt){
        threeMp[arr[i]]--;
        return;
    }

    threeMp.erase(arr[i]);
    if((int)threeMp.size() == 2 && twoCnt){
        threeCnt = 1;
        return;
    }

    auto it = threeMp.lower_bound(arr[i]);
    bool newOrig = 0;
    if(it == threeMp.begin()) newOrig = large(threeMp.rbegin()->first, threeMp.begin()->first);
    else newOrig = large(prev(it)->first, it->first);
    if(newOrig) threeCnt = 0;
}

void print(){
    if(oneCnt) puts("1");
    else if(twoCnt) puts("2");
    else if(threeCnt) puts("3");
    else puts("0");
}

int main(){
    scanf("%lld %lld %lld %d", &A, &B, &C, &n);
    for(int i=1; i<=n; i++){
        char c;
        scanf(" %c", &c);
        if(c=='A') addPoint();
        else delPoint();
        print();
    }
}

Compilation message

Mixture.cpp: In function 'void addPoint()':
Mixture.cpp:83:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |     scanf("%lld %lld %lld", &x, &y, &z);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Mixture.cpp: In function 'void delPoint()':
Mixture.cpp:129:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  129 |     scanf("%d", &i);
      |     ~~~~~^~~~~~~~~~
Mixture.cpp: In function 'int main()':
Mixture.cpp:175:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  175 |     scanf("%lld %lld %lld %d", &A, &B, &C, &n);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Mixture.cpp:178:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  178 |         scanf(" %c", &c);
      |         ~~~~~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -