oj.uz

답안 #143803

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
143803 2019-08-15T08:05:02 Z dacin21 Rectangles (IOI19_rect) C++14
100 / 100
 4974 ms 905252 KB 
#include "rect.h"

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using fl = long double;
template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename S, typename T>
void xmin(S&a, T const&b){if(b<a) a=b;}
template<typename S, typename T>
void xmax(S&a, T const&b){if(b>a) a=b;}

template<bool enabled>
struct Debug{
    template<typename S, typename T = void> struct Tag_Printable : false_type {};
    template<typename S> struct Tag_Printable<S, decltype((void)(cerr << declval<S>()))> : true_type {};
    template<typename S, typename T = void> struct Tag_Iterable: false_type {};
    template<typename S> struct Tag_Iterable<S, decltype((void)(begin(declval<S>()), end(declval<S>())))> : true_type {};

    template<typename T, size_t N> struct Tuple_Printer{
        template<typename S>
        static S& print(S& stream, T const&t){
            return Tuple_Printer<T, N-1>::print(stream, t) << ", " << get<N>(t);
        }
    };
    template<typename T> struct Tuple_Printer<T, 0>{
        template<typename S>
        static S& print(S& stream, T const&t){
            return stream << get<0>(t);
        }
    };

    template<typename T, typename... Args>
    Debug& print(T const&x, true_type, Args...){
        #ifdef LOCAL_RUN
        if(enabled){
            cerr << boolalpha << x;
        }
        #endif // LOCAL_RUN
        return *this;
    }
    template<typename T>
    Debug& print(T const&x, false_type, true_type){
        *this << "[";
        bool first = true;
        for(auto &e:x){
            if(!first) *this << ", ";
            *this << e;
            first = false;
        }
        return *this << "]";
    }
    template<typename S, typename T>
    Debug& print(pair<S, T> const&x, false_type, false_type){
        return *this << "(" << x.first << ", " << x.second << ")";
    }
    template<typename... Args>
    Debug& print(tuple<Args...> const&t, false_type, false_type){
        return Tuple_Printer<decltype(t), sizeof...(Args)-1>::print(*this, t);
    }
    template<typename T>
    Debug& operator<<(T const&x){
        return print(x, Tag_Printable<T>{}, Tag_Iterable<T>{});
    }
};
 Debug<true> debug;
// Debug<false> debug; // disable debug printing
#define named(x) string(#x) << " : " <<  x


vector<vector<int> > transposed(vector<vector<int> > const&v){
    const int n = v.size(), m = v.empty() ? 0 : v[0].size();
    vector<vector<int> > ret(m, vector<int>(n));
    for(int i=0;i<n;++i){
        for(int j=0;j<m;++j){
            ret[j][i] = v[i][j];
        }
    }
    return ret;
}


struct Range_And{
    Range_And(){}
    Range_And(int Y_, vector<pair<int, int> > const&v) : Y(Y_), data(Y){
        for(auto const&e:v){
            data[e.second].emplace_back(e.first);
        }
        for(auto &e:data){
            sort(e.begin(), e.end());
            e.erase(unique(e.begin(), e.end()), e.end());
        }
    }
    // all points present in {x} x [y1, y2)
    bool all(int x, int y1, int y2) const {
        const int dy = y2-y1;
        auto it = lower_bound(data[x].begin(), data[x].end(), y1);
        return data[x].end() - it >= dy && it[dy-1]<y2;
        //auto it2 = lower_bound(data[x].begin(), data[x].end(), y2);
        //return it2-it == y2-y1;
    }
    int Y;
    vector<vector<int> > data;
};

vector<Range_And> build_ds(int X, vector<vector<pair<int, int> > > const&v){
    vector<Range_And> ret;
    for(auto const&e:v){
        ret.emplace_back(X, e);
    }
    return ret;
}

// compute good ranges
vector<vector<pair<int, int> > > precalc(vector<vector<int> > const&v, vector<vector<int> > *L, vector<vector<int> > *R){
    const int X = v.size(), Y = v[0].size();
    vector<vector<pair<int, int> > > ret(Y);
    for(int i=0;i<X;++i){
        stack<pair<int, int> > s; // value, y
        auto cand = [&](int y, int h, vector<vector<int> > *w){
            while(!s.empty() && s.top().first <= h){
                const int y2 = s.top().second;
                ret[abs(y-y2)].emplace_back(i, min(y, y2));
                if(w) (*w)[i][y2] = y;
                s.pop();
            }
            s.emplace(h, y);
        };
        for(int j=0;j<Y;++j){
            cand(j, v[i][j], R);
        }
        while(!s.empty()) s.pop();
        for(int j=Y-1;j>=0;--j){
            cand(j, v[i][j], L);
        }
    }
    /*for(auto &e:ret){
        sort(e.begin(), e.end());
        e.erase(unique(e.begin(), e.end()), e.end());
    }*/
    return ret;
}


ll count_rectangles(std::vector<std::vector<int> > a) {
    const int X = a.size(), Y = a[0].size();
    vector<vector<int> > right_larger(X, vector<int>(Y, -1)), left_larger(X, vector<int>(Y, -1));
    auto const row_ranges = precalc(a, &left_larger, &right_larger);
    auto const row_ds = build_ds(Y, row_ranges);
    auto const col_ranges = precalc(transposed(a), nullptr, nullptr);
    auto const col_ds = build_ds(X, col_ranges);
    //debug << named(row_ranges) << "\n";
    //debug << named(col_ranges) << "\n";
    vector<tuple<int, int, int, int> > ret;
    auto add_rec = [&](int x1, int x2, int y1, int y2){
        ret.emplace_back(x1, x2, y1, y2);
        //debug << "Rec: " << ret.back() << "\n";
    };

    for(int dx=2;dx<X;++dx){
        for(auto const&u:col_ranges[dx]){
            const int y = u.first, x = u.second;
            // top left corner
            if(y!=0){
                //auto const tmp = row_cart[x+1].right_larger<false, true>(y-1, a[x+1][y-1]);
                auto const tmp = right_larger[x+1][y-1];
                //if(dx == 2) debug << u << " " << named(tmp) << "\n";
                if(tmp!=-1){
                    const int y2 = tmp;
                    const int dy = y2-y+1;
                    if(dy != 1){
                        if(col_ds[dx].all(x, y, y2) && row_ds[dy].all(y-1, x+1, x+dx)){
                            add_rec(x+1, x+dx-1, y, y2-1);
                        }
                    }
                }
            }

            // top right corner
            if(y+1 != Y){
                auto const tmp = left_larger[x+1][y+1];
                if(tmp!=-1){
                    const int y2 = tmp;
                    const int dy = y-y2+1;
                    if(dy != 1){
                        if(col_ds[dx].all(x, y2+1, y+1) && row_ds[dy].all(y2, x+1, x+dx)){
                            add_rec(x+1, x+dx-1, y2+1, y);
                        }
                    }
                }
            }
        }
    }




    sort(ret.begin(), ret.end());
    ret.erase(unique(ret.begin(), ret.end()), ret.end());
    return ret.size();
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 508 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 1 ms 380 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 508 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 1 ms 380 KB Output is correct
17 Correct 6 ms 1404 KB Output is correct
18 Correct 5 ms 1400 KB Output is correct
19 Correct 5 ms 1372 KB Output is correct
20 Correct 5 ms 1144 KB Output is correct
21 Correct 6 ms 1400 KB Output is correct
22 Correct 6 ms 1272 KB Output is correct
23 Correct 6 ms 1272 KB Output is correct
24 Correct 1 ms 760 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 508 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 1 ms 380 KB Output is correct
17 Correct 6 ms 1404 KB Output is correct
18 Correct 5 ms 1400 KB Output is correct
19 Correct 5 ms 1372 KB Output is correct
20 Correct 5 ms 1144 KB Output is correct
21 Correct 6 ms 1400 KB Output is correct
22 Correct 6 ms 1272 KB Output is correct
23 Correct 6 ms 1272 KB Output is correct
24 Correct 1 ms 760 KB Output is correct
25 Correct 20 ms 6256 KB Output is correct
26 Correct 24 ms 6308 KB Output is correct
27 Correct 23 ms 6252 KB Output is correct
28 Correct 21 ms 5736 KB Output is correct
29 Correct 25 ms 5740 KB Output is correct
30 Correct 25 ms 5744 KB Output is correct
31 Correct 24 ms 5744 KB Output is correct
32 Correct 25 ms 5616 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 3 ms 348 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 508 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 1 ms 380 KB Output is correct
17 Correct 6 ms 1404 KB Output is correct
18 Correct 5 ms 1400 KB Output is correct
19 Correct 5 ms 1372 KB Output is correct
20 Correct 5 ms 1144 KB Output is correct
21 Correct 6 ms 1400 KB Output is correct
22 Correct 6 ms 1272 KB Output is correct
23 Correct 6 ms 1272 KB Output is correct
24 Correct 1 ms 760 KB Output is correct
25 Correct 20 ms 6256 KB Output is correct
26 Correct 24 ms 6308 KB Output is correct
27 Correct 23 ms 6252 KB Output is correct
28 Correct 21 ms 5736 KB Output is correct
29 Correct 25 ms 5740 KB Output is correct
30 Correct 25 ms 5744 KB Output is correct
31 Correct 24 ms 5744 KB Output is correct
32 Correct 25 ms 5616 KB Output is correct
33 Correct 172 ms 65488 KB Output is correct
34 Correct 175 ms 65636 KB Output is correct
35 Correct 179 ms 65500 KB Output is correct
36 Correct 175 ms 65500 KB Output is correct
37 Correct 297 ms 69864 KB Output is correct
38 Correct 311 ms 69716 KB Output is correct
39 Correct 299 ms 69848 KB Output is correct
40 Correct 272 ms 66440 KB Output is correct
41 Correct 221 ms 64172 KB Output is correct
42 Correct 277 ms 61772 KB Output is correct
43 Correct 300 ms 66500 KB Output is correct
44 Correct 307 ms 66416 KB Output is correct
45 Correct 150 ms 37092 KB Output is correct
46 Correct 156 ms 36624 KB Output is correct
47 Correct 304 ms 65844 KB Output is correct
48 Correct 309 ms 65936 KB Output is correct
49 Correct 3 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 3 ms 348 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 148 ms 148012 KB Output is correct
2 Correct 110 ms 107028 KB Output is correct
3 Correct 147 ms 147960 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 148 ms 148060 KB Output is correct
6 Correct 146 ms 148060 KB Output is correct
7 Correct 148 ms 148088 KB Output is correct
8 Correct 169 ms 148064 KB Output is correct
9 Correct 147 ms 148028 KB Output is correct
10 Correct 159 ms 147616 KB Output is correct
11 Correct 147 ms 147960 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 1449 ms 377044 KB Output is correct
3 Correct 3365 ms 743668 KB Output is correct
4 Correct 3256 ms 746016 KB Output is correct
5 Correct 3370 ms 747140 KB Output is correct
6 Correct 1325 ms 399924 KB Output is correct
7 Correct 2262 ms 685776 KB Output is correct
8 Correct 2468 ms 727396 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 508 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 1 ms 380 KB Output is correct
17 Correct 6 ms 1404 KB Output is correct
18 Correct 5 ms 1400 KB Output is correct
19 Correct 5 ms 1372 KB Output is correct
20 Correct 5 ms 1144 KB Output is correct
21 Correct 6 ms 1400 KB Output is correct
22 Correct 6 ms 1272 KB Output is correct
23 Correct 6 ms 1272 KB Output is correct
24 Correct 1 ms 760 KB Output is correct
25 Correct 20 ms 6256 KB Output is correct
26 Correct 24 ms 6308 KB Output is correct
27 Correct 23 ms 6252 KB Output is correct
28 Correct 21 ms 5736 KB Output is correct
29 Correct 25 ms 5740 KB Output is correct
30 Correct 25 ms 5744 KB Output is correct
31 Correct 24 ms 5744 KB Output is correct
32 Correct 25 ms 5616 KB Output is correct
33 Correct 172 ms 65488 KB Output is correct
34 Correct 175 ms 65636 KB Output is correct
35 Correct 179 ms 65500 KB Output is correct
36 Correct 175 ms 65500 KB Output is correct
37 Correct 297 ms 69864 KB Output is correct
38 Correct 311 ms 69716 KB Output is correct
39 Correct 299 ms 69848 KB Output is correct
40 Correct 272 ms 66440 KB Output is correct
41 Correct 221 ms 64172 KB Output is correct
42 Correct 277 ms 61772 KB Output is correct
43 Correct 300 ms 66500 KB Output is correct
44 Correct 307 ms 66416 KB Output is correct
45 Correct 150 ms 37092 KB Output is correct
46 Correct 156 ms 36624 KB Output is correct
47 Correct 304 ms 65844 KB Output is correct
48 Correct 309 ms 65936 KB Output is correct
49 Correct 148 ms 148012 KB Output is correct
50 Correct 110 ms 107028 KB Output is correct
51 Correct 147 ms 147960 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 148 ms 148060 KB Output is correct
54 Correct 146 ms 148060 KB Output is correct
55 Correct 148 ms 148088 KB Output is correct
56 Correct 169 ms 148064 KB Output is correct
57 Correct 147 ms 148028 KB Output is correct
58 Correct 159 ms 147616 KB Output is correct
59 Correct 147 ms 147960 KB Output is correct
60 Correct 2 ms 256 KB Output is correct
61 Correct 1449 ms 377044 KB Output is correct
62 Correct 3365 ms 743668 KB Output is correct
63 Correct 3256 ms 746016 KB Output is correct
64 Correct 3370 ms 747140 KB Output is correct
65 Correct 1325 ms 399924 KB Output is correct
66 Correct 2262 ms 685776 KB Output is correct
67 Correct 2468 ms 727396 KB Output is correct
68 Correct 2579 ms 828172 KB Output is correct
69 Correct 2550 ms 828044 KB Output is correct
70 Correct 2656 ms 830140 KB Output is correct
71 Correct 2625 ms 830260 KB Output is correct
72 Correct 4739 ms 905192 KB Output is correct
73 Correct 2783 ms 536024 KB Output is correct
74 Correct 2837 ms 556532 KB Output is correct
75 Correct 4668 ms 822668 KB Output is correct
76 Correct 2814 ms 534780 KB Output is correct
77 Correct 3681 ms 654968 KB Output is correct
78 Correct 4720 ms 819428 KB Output is correct
79 Correct 2733 ms 525528 KB Output is correct
80 Correct 4724 ms 818192 KB Output is correct
81 Correct 4761 ms 783376 KB Output is correct
82 Correct 2668 ms 548964 KB Output is correct
83 Correct 4729 ms 904960 KB Output is correct
84 Correct 4736 ms 905252 KB Output is correct
85 Correct 4974 ms 905000 KB Output is correct
86 Correct 3 ms 376 KB Output is correct
87 Correct 2 ms 376 KB Output is correct
88 Correct 3 ms 348 KB Output is correct
89 Correct 2 ms 376 KB Output is correct
90 Correct 2 ms 376 KB Output is correct