oj.uz

Submission #874006

# Submission time Handle Problem Language Result Execution time Memory
874006 2023-11-16T07:39:17 Z azberjibiou None (JOI14_ho_t5) C++17
100 / 100
 194 ms 42524 KB 
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define lb lower_bound
#define gibon ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define pii pair<int, int>
#define piii pair<pair<int, int>, pair<int, int>>
#define pll pair<ll, ll>
typedef long long ll;
using namespace std;
const int mxN=210005;
const int mxM=500004;
const int mxK=30;
const int MOD=1'000'000'007;
const ll INF=8e18;
const pii tsh=pii(MOD, 0);
typedef struct minmax_seg{
    pii seg[4*mxN];
    int n;
    void set_n(int m){n=m;}
    void init(){for(int i=0;i<4*mxN;i++) seg[i]=tsh;}
    pii f(pii a, pii b){return pii(min(a.fi, b.fi), max(a.se, b.se));}
    void upd(int idx, int s, int e, int pos, pii val){
        if(s==e){
            seg[idx]=val;
            return;
        }
        int mid=(s+e)/2;
        if(pos<=mid) upd(2*idx, s, mid, pos, val);
        else upd(2*idx+1, mid+1, e, pos, val);
        seg[idx]=f(seg[2*idx], seg[2*idx+1]);
    }
    pii solv(int idx, int s1, int e1, int s2, int e2){
        if(s2>e1 || s1>e2)  return tsh;
        if(s2<=s1 && e1<=e2)    return seg[idx];
        int mid=(s1+e1)/2;
        return f(solv(2*idx, s1, mid, s2, e2), solv(2*idx+1, mid+1, e1, s2, e2));
    }
    void upd(int pos, pii val){return upd(1, 1, n, pos, val);}
    pii solv(int s, int e){return solv(1, 1, n, s, e);}
}minmax_seg;
typedef struct BIT{
    int fen[mxN], n;
    void set_n(int m){n=m;}
    void upd(int idx, int val){for(;idx<=n;idx+=(idx&(-idx))) fen[idx]+=val;}
    int sum(int idx){int res=0; for(;idx>0;idx-=(idx&(-idx))) res+=fen[idx]; return res;}
    int solv(int s, int e){return sum(e)-sum(s-1);}
}BIT;
typedef struct line{
    ll x1, x2, y, xy;   ///xy=1: x축과 평행 2: y축과 평행
    line() : x1(), x2(), y(), xy() {}
    line(ll x1, ll x2, ll y, ll xy) : x1(x1), x2(x2), y(y), xy(xy) {}
}line;
int N;
ll H, W;
vector <line> v;
vector <line> ev;
BIT T1;
minmax_seg T2;
ll cntV, cntE, cntC;
void input(){
    cin >> W >> H >> N;
    v.emplace_back(0, W, 0, 1);
    v.emplace_back(0, W, H, 1);
    v.emplace_back(0, H, 0, 2);
    v.emplace_back(0, H, W, 2);
    for(int i=1;i<=N;i++){
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        if(a==c)    v.emplace_back(b, d, c, 2);
        else    v.emplace_back(a, c, b, 1);
    }
}
void coor_comp(){
    vector <ll> crx, cry;
    for(auto &[x1, x2, y, xy] : v){
        x1=3*x1-1, x2=3*x2+1, y=3*y;
        if(xy==1)   crx.push_back(x1), crx.push_back(x2), cry.push_back(y);
        else    cry.push_back(x1), cry.push_back(x2), crx.push_back(y);
    }
    sort(all(crx));
    crx.erase(unique(all(crx)), crx.end());
    sort(all(cry));
    cry.erase(unique(all(cry)), cry.end());
    for(auto &[x1, x2, y, xy] : v){
        if(xy==1){
            x1=lower_bound(all(crx), x1)-crx.begin()+1;
            x2=lower_bound(all(crx), x2)-crx.begin()+1;
            y=lower_bound(all(cry), y)-cry.begin()+1;
        }
        else{
            x1=lower_bound(all(cry), x1)-cry.begin()+1;
            x2=lower_bound(all(cry), x2)-cry.begin()+1;
            y=lower_bound(all(crx), y)-crx.begin()+1;
        }
        if(xy==1) ev.emplace_back(x1, x2, y, xy);
        else ev.emplace_back(y, 1, x1, xy), ev.emplace_back(y, -1, x2, xy);
    }
    W=crx.size(), H=cry.size();
    sort(all(ev), [](line a, line b){return a.y<b.y;});
}
void count_VE(){
    T1.set_n(W);
    cntV=2*(N+4);
    for(auto [x1, x2, y, xy] : ev){
        if(xy==1) cntV+=T1.solv(x1, x2);
        else T1.upd(x1, x2);
        //printf("x1=%d, x2=%d, y=%d, xy=%d\n", x1, x2, y, xy);
    }
    //2*(N+4)+4*(cntV-2*(N+4))=2*cntE
    cntE=2*cntV-3*(N+4);
}
int ci=1; //component index
set <int> s[mxN];   //x coordinate
void count_comp(){
    T2.set_n(W);
    T2.init();
    for(auto [x1, x2, y, xy] : ev){
        //printf("x1=%d, x2=%d, y=%d, xy=%d\n", x1, x2, y, xy);
        if(xy==1){
            pii res=T2.solv(x1, x2);
            if(res==tsh){
                cntC++;
                continue;
            }
            for(;res.fi!=res.se;res=T2.solv(x1, x2)){
                int i1=res.fi, i2=res.se;
                if(s[i1].size()>s[i2].size())   swap(i1, i2);
                for(int ele : s[i1]){
                    T2.upd(ele, pii(i2, i2));
                    s[i2].insert(ele);
                }
                s[i1].clear();
                cntC--;
            }
        }
        else{
            if(x2==1){
                cntC++;
                T2.upd(x1, pii(ci, ci));
                s[ci].insert(x1);
                ci++;
            }
            else{
                int col=T2.solv(x1, x1).fi;
                T2.upd(x1, tsh);
                s[col].erase(x1);
            }
        }
    }
}
int main()
{
    gibon
    input();
    coor_comp();
    count_VE();
    //V-E+F=2
    //printf("cntE=%lld, cntV=%lld\n", cntE, cntV);
    count_comp();
    cout << cntE-cntV+cntC;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16988 KB Output is correct
2 Correct 4 ms 16984 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 4 ms 17040 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 4 ms 16988 KB Output is correct
7 Correct 5 ms 17148 KB Output is correct
8 Correct 6 ms 17200 KB Output is correct
9 Correct 5 ms 17240 KB Output is correct
10 Correct 5 ms 17200 KB Output is correct
11 Correct 5 ms 16988 KB Output is correct
12 Correct 4 ms 16988 KB Output is correct
13 Correct 5 ms 17244 KB Output is correct
14 Correct 5 ms 17244 KB Output is correct
15 Correct 5 ms 17224 KB Output is correct
16 Correct 5 ms 16984 KB Output is correct
17 Correct 4 ms 16984 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16988 KB Output is correct
2 Correct 4 ms 16984 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 4 ms 17040 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 4 ms 16988 KB Output is correct
7 Correct 5 ms 17148 KB Output is correct
8 Correct 6 ms 17200 KB Output is correct
9 Correct 5 ms 17240 KB Output is correct
10 Correct 5 ms 17200 KB Output is correct
11 Correct 5 ms 16988 KB Output is correct
12 Correct 4 ms 16988 KB Output is correct
13 Correct 5 ms 17244 KB Output is correct
14 Correct 5 ms 17244 KB Output is correct
15 Correct 5 ms 17224 KB Output is correct
16 Correct 5 ms 16984 KB Output is correct
17 Correct 4 ms 16984 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 4 ms 16988 KB Output is correct
20 Correct 4 ms 17000 KB Output is correct
21 Correct 5 ms 17196 KB Output is correct
22 Correct 6 ms 17244 KB Output is correct
23 Correct 5 ms 17244 KB Output is correct
24 Correct 6 ms 17116 KB Output is correct
25 Correct 5 ms 17048 KB Output is correct
26 Correct 5 ms 17240 KB Output is correct
27 Correct 6 ms 17244 KB Output is correct
28 Correct 6 ms 17244 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16984 KB Output is correct
2 Correct 5 ms 16988 KB Output is correct
3 Correct 4 ms 16984 KB Output is correct
4 Correct 5 ms 17240 KB Output is correct
5 Correct 19 ms 18972 KB Output is correct
6 Correct 85 ms 30612 KB Output is correct
7 Correct 158 ms 42100 KB Output is correct
8 Correct 165 ms 39868 KB Output is correct
9 Correct 148 ms 41144 KB Output is correct
10 Correct 148 ms 40048 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 5 ms 17120 KB Output is correct
3 Correct 18 ms 18712 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 5 ms 17268 KB Output is correct
6 Correct 194 ms 39860 KB Output is correct
7 Correct 13 ms 18904 KB Output is correct
8 Correct 130 ms 41212 KB Output is correct
9 Correct 126 ms 40168 KB Output is correct
10 Correct 129 ms 41268 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16988 KB Output is correct
2 Correct 4 ms 16984 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 4 ms 17040 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 4 ms 16988 KB Output is correct
7 Correct 5 ms 17148 KB Output is correct
8 Correct 6 ms 17200 KB Output is correct
9 Correct 5 ms 17240 KB Output is correct
10 Correct 5 ms 17200 KB Output is correct
11 Correct 5 ms 16988 KB Output is correct
12 Correct 4 ms 16988 KB Output is correct
13 Correct 5 ms 17244 KB Output is correct
14 Correct 5 ms 17244 KB Output is correct
15 Correct 5 ms 17224 KB Output is correct
16 Correct 5 ms 16984 KB Output is correct
17 Correct 4 ms 16984 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 4 ms 16988 KB Output is correct
20 Correct 4 ms 17000 KB Output is correct
21 Correct 5 ms 17196 KB Output is correct
22 Correct 6 ms 17244 KB Output is correct
23 Correct 5 ms 17244 KB Output is correct
24 Correct 6 ms 17116 KB Output is correct
25 Correct 5 ms 17048 KB Output is correct
26 Correct 5 ms 17240 KB Output is correct
27 Correct 6 ms 17244 KB Output is correct
28 Correct 6 ms 17244 KB Output is correct
29 Correct 5 ms 16984 KB Output is correct
30 Correct 5 ms 16988 KB Output is correct
31 Correct 4 ms 16984 KB Output is correct
32 Correct 5 ms 17240 KB Output is correct
33 Correct 19 ms 18972 KB Output is correct
34 Correct 85 ms 30612 KB Output is correct
35 Correct 158 ms 42100 KB Output is correct
36 Correct 165 ms 39868 KB Output is correct
37 Correct 148 ms 41144 KB Output is correct
38 Correct 148 ms 40048 KB Output is correct
39 Correct 4 ms 16988 KB Output is correct
40 Correct 5 ms 17120 KB Output is correct
41 Correct 18 ms 18712 KB Output is correct
42 Correct 4 ms 16988 KB Output is correct
43 Correct 5 ms 17268 KB Output is correct
44 Correct 194 ms 39860 KB Output is correct
45 Correct 13 ms 18904 KB Output is correct
46 Correct 130 ms 41212 KB Output is correct
47 Correct 126 ms 40168 KB Output is correct
48 Correct 129 ms 41268 KB Output is correct
49 Correct 5 ms 16984 KB Output is correct
50 Correct 5 ms 17244 KB Output is correct
51 Correct 4 ms 16988 KB Output is correct
52 Correct 91 ms 28992 KB Output is correct
53 Correct 74 ms 30356 KB Output is correct
54 Correct 92 ms 30152 KB Output is correct
55 Correct 193 ms 40780 KB Output is correct
56 Correct 160 ms 42236 KB Output is correct
57 Correct 190 ms 39872 KB Output is correct
58 Correct 189 ms 40124 KB Output is correct
59 Correct 141 ms 42524 KB Output is correct
60 Correct 128 ms 39696 KB Output is correct
61 Correct 161 ms 38692 KB Output is correct
62 Correct 150 ms 39836 KB Output is correct
63 Correct 190 ms 40128 KB Output is correct
64 Correct 145 ms 42172 KB Output is correct
65 Correct 186 ms 40588 KB Output is correct
66 Correct 189 ms 40892 KB Output is correct
67 Correct 178 ms 40000 KB Output is correct
68 Correct 170 ms 40456 KB Output is correct
69 Correct 171 ms 39948 KB Output is correct
70 Correct 168 ms 40596 KB Output is correct
71 Correct 189 ms 40328 KB Output is correct
72 Correct 85 ms 34032 KB Output is correct