oj.uz

Submission #205576

# Submission time Handle Problem Language Result Execution time Memory
205576 2020-02-29T08:31:55 Z jh05013 None (JOI14_ho_t5) C++17
50 / 100
 215 ms 10756 KB 
#include <bits/stdc++.h>
#define sz(X) (int)((X).size())
#define entire(X) X.begin(),X.end()
using namespace std; typedef long long ll;
void OJize(){cin.tie(NULL);ios_base::sync_with_stdio(false);}
template <class T1, class T2>ostream&operator<<(ostream &os,pair<T1,T2>const&x){os<<'('<<x.first<<", "<<x.second<<')';return os;}
template <class Ch, class Tr, class Container>basic_ostream<Ch,Tr>&operator<<(basic_ostream<Ch,Tr>&os,Container const&x){for(auto&y:x)os<<y<<" ";return os;}

template <typename T>
struct Compress{
    int n; vector<T> arr;
    void add(T x){arr.push_back(x); n++;}
    void init(){sort(entire(arr)), 
        arr.erase(unique(entire(arr)), arr.end()), n=arr.size();}
    int lb(T x){return lower_bound(entire(arr), x) - arr.begin();}
};

struct DisjointSet{
    vector<int> par;
    DisjointSet(int n): par(n) {iota(entire(par), 0);}
    void un(int x, int y){par[fd(x)] = fd(y);} // yr becomes parent
    int fd(int x){return par[x]!=x? (par[x]=fd(par[x])):x;}
};

template <typename T>
struct Fenwick{
    int n; vector<T> arr;
    Fenwick(int N): n{N}, arr(N) {}
    void add(int i, T val){
        while(i < n) arr[i]+= val, i |= i+1;
    }
    T getsum(int i){
        T res = 0;
        while(i >= 0) res+= arr[i], i = (i&(i+1))-1;
        return res;
    }
    T intersum(int i, int j){
        if(j < i) return 0;
        return i? (getsum(j) - getsum(i-1)) : getsum(j);
    }
};

int main(){OJize();
    int w,h,n; cin>>w>>h>>n;
    vector<tuple<int,int,int,int,int>> ev; // y, type, l, r, idx
    Compress<int> C;
    C.add(0), C.add(w);
    // type 1 = vertical start (uses l=r)
    // type 2 = horizontal (uses l, r)
    // type 3 = vertical end (uses l=r)
    for(int i=0; i<n; i++){
        int xa,ya,xb,yb; cin>>xa>>ya>>xb>>yb;
        C.add(xa), C.add(xb);
        if(xa == xb){
            ev.push_back({ya, 1, xa, xb, i});
            ev.push_back({yb, 3, xa, xb, i});
        }
        else ev.push_back({ya, 2, xa, xb, i});
    }
    ev.push_back({0,2,0,w,n}), ev.push_back({h,2,0,w,n+1});
    ev.push_back({0,1,0,0,n+2}), ev.push_back({0,1,w,w,n+3});
    ev.push_back({h,3,0,0,n+2}), ev.push_back({h,3,w,w,n+3});
    C.init(), sort(entire(ev));
    Fenwick<int> F(sz(C.arr));

    // count V and E
    ll V=0, E=0, COMP=0;
    for(auto [y,ty,x1,x2,_]: ev){
        x1 = C.lb(x1), x2 = C.lb(x2);
        if(ty == 1) F.add(x1, 1), V++;
        else if(ty == 2){
            ll ic = F.intersum(x1, x2);
            V+= ic+2, E+= 2*ic+1;
        }
        else if(ty == 3) F.add(x1, -1), V++, E++;
    }

    // count COMP
    DisjointSet DS(n+4);
    COMP = 1;
    map<int,int> vert; vert[w+1] = -1;
    for(auto [y,ty,x1,x2,idx]: ev){
        x1 = C.lb(x1), x2 = C.lb(x2);
        if(V > 2000000) break; // subtask 4
        if(ty == 1){
            vert[x1] = idx;
        }
        else if(ty == 2){
            auto it = vert.lower_bound(x1);
            for(; it->first<=x2; it++)
                DS.un(idx, it->second);
        }
        else if(ty == 3){
            vert.erase(x1);
        }
    }
    if(V <= 2000000){
        COMP = 0;
        for(int i=0; i<sz(DS.par); i++)
            COMP+= DS.fd(i) == i;
    }
    cout << E-V+COMP;
}

Compilation message

2014_ho_t5.cpp: In function 'int main()':
2014_ho_t5.cpp:68:27: warning: unused variable 'y' [-Wunused-variable]
     for(auto [y,ty,x1,x2,_]: ev){
                           ^
2014_ho_t5.cpp:68:27: warning: unused variable '_' [-Wunused-variable]
2014_ho_t5.cpp:82:29: warning: unused variable 'y' [-Wunused-variable]
     for(auto [y,ty,x1,x2,idx]: ev){
                             ^

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 380 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 380 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 9 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 8 ms 376 KB Output is correct
14 Correct 7 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 380 KB Output is correct
21 Correct 7 ms 376 KB Output is correct
22 Correct 6 ms 376 KB Output is correct
23 Correct 7 ms 504 KB Output is correct
24 Correct 8 ms 376 KB Output is correct
25 Correct 7 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 9 ms 376 KB Output is correct
28 Correct 8 ms 376 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 25 ms 1236 KB Output is correct
6 Correct 105 ms 5640 KB Output is correct
7 Correct 215 ms 10756 KB Output is correct
8 Correct 215 ms 10756 KB Output is correct
9 Correct 198 ms 10756 KB Output is correct
10 Correct 188 ms 10756 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 17 ms 852 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 8 ms 376 KB Output is correct
6 Correct 147 ms 7172 KB Output is correct
7 Correct 14 ms 852 KB Output is correct
8 Correct 106 ms 7172 KB Output is correct
9 Correct 110 ms 7172 KB Output is correct
10 Correct 109 ms 7172 KB Output is correct

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 380 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 380 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 9 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 8 ms 376 KB Output is correct
14 Correct 7 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 380 KB Output is correct
21 Correct 7 ms 376 KB Output is correct
22 Correct 6 ms 376 KB Output is correct
23 Correct 7 ms 504 KB Output is correct
24 Correct 8 ms 376 KB Output is correct
25 Correct 7 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 9 ms 376 KB Output is correct
28 Correct 8 ms 376 KB Output is correct
29 Correct 6 ms 376 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 6 ms 376 KB Output is correct
32 Correct 7 ms 376 KB Output is correct
33 Correct 25 ms 1236 KB Output is correct
34 Correct 105 ms 5640 KB Output is correct
35 Correct 215 ms 10756 KB Output is correct
36 Correct 215 ms 10756 KB Output is correct
37 Correct 198 ms 10756 KB Output is correct
38 Correct 188 ms 10756 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 8 ms 376 KB Output is correct
41 Correct 17 ms 852 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 8 ms 376 KB Output is correct
44 Correct 147 ms 7172 KB Output is correct
45 Correct 14 ms 852 KB Output is correct
46 Correct 106 ms 7172 KB Output is correct
47 Correct 110 ms 7172 KB Output is correct
48 Correct 109 ms 7172 KB Output is correct
49 Correct 7 ms 376 KB Output is correct
50 Correct 8 ms 504 KB Output is correct
51 Correct 6 ms 376 KB Output is correct
52 Incorrect 77 ms 5644 KB Output isn't correct
53 Halted 0 ms 0 KB -