oj.uz

Submission #212037

# Submission time Handle Problem Language Result Execution time Memory
212037 2020-03-22T06:19:33 Z anonymous Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 901276 KB 
#include "rect.h"
#include<unordered_set>
#include<vector>
#include<algorithm>
#include<utility>
#define MAXN 2505
using namespace std;
int N,M,A[MAXN][MAXN];
struct pair_hash {
    inline std::size_t operator()(const std::pair<int,int> & v) const {
        return(v.first*2569 + v.second);
    }
};
vector<pair<int,int> > Hor[MAXN][MAXN], Vert[MAXN][MAXN];
unordered_set <pair<int,int> ,pair_hash> HorM[MAXN], VertM[MAXN]; //unordered?
vector<pair<int,int> > S;

class fenwick {
    int ft[MAXN + 5];
public:
    void add(int v, int p) {
        for (int i=p; i<=MAXN; i+=i&(-i)) {ft[i]+=v;}
    }
    int ask(int p) {
        int res = 0;
        for (int i=p; i>0; i-=i&(-i)) {res+=ft[i];}
        return(res);
    }
} BIT;

void pairs() {
    for (int i=1; i<=N; i++) { //init horizontal
        while (S.size()) {S.pop_back();}
        for (int j=1; j<=M; j++) {
            bool same = false;
            while(S.size() && S.back().first <= A[i][j]) {
                if (A[i][j] == S.back().first) {same=true;}
                if (j - S.back().second > 1) {HorM[i].insert({S.back().second, j});}
                S.pop_back();
            }
            if (!same && S.size() && j - S.back().second > 1) {HorM[i].insert({S.back().second, j});}
            S.push_back({A[i][j], j});
        }
    }
    for (int j=1; j<=M; j++) {
        while (S.size()) {S.pop_back();}
        for (int i=1; i<=N; i++) {
            bool same = false;
            while (S.size() && S.back().first <= A[i][j]) {
                if (A[i][j] == S.back().first) {same=true;}
                if (i - S.back().second > 1) {VertM[j].insert({S.back().second,i});}
                S.pop_back();
            }
            if (!same && S.size() && i - S.back().second > 1) {VertM[j].insert({S.back().second,i});}
            S.push_back({A[i][j], i});
        }
    }
    for (int i=N; i>=1; i--) {
        while (HorM[i].size()) {
            int pt = i;
            pair <int,int> p = *HorM[i].begin();
            while (HorM[pt].find(p) != HorM[pt].end()) {
                Hor[pt][p.first].push_back({p.second, i}); //i is goes up to
                HorM[pt].erase(p), pt--;
            }
        }
    }
    for (int j=M; j>=1; j--) {
        while (VertM[j].size()) {
            int pt = j;
            pair <int,int> p = *VertM[j].begin();
            while (VertM[pt].find(p) != VertM[pt].end()) {
                Vert[p.first][pt].push_back({j, p.second});
                VertM[pt].erase(p), pt--;
            }
        }
    }
    for (int i=1; i<=N; i++) {
        for (int j=1; j<=M; j++) {
            sort(Hor[i][j].begin(), Hor[i][j].end());
            sort(Vert[i][j].begin(), Vert[i][j].end());
        }
    }
}

long long count_rectangles(vector<vector<int> > a) {
    long long ans = 0;
    N = a.size(), M = a[0].size();
    for (int i=0; i<N; i++) {
        for (int j=0; j<M; j++) {
            A[i+1][j+1]=a[i][j]; //zero index
        }
    }
    pairs();
    for (int i=1; i<=N; i++) {
        for (int j=1; j<=M; j++) {
            //(i,j) top left
            int pt1 = Hor[i+1][j].size()-1, pt2 = Vert[i][j+1].size()-1; //go (i,j+1) for vert and (i+1,j) for hor
            while (pt1 >= 0 || pt2 >= 0) {
                if (pt1 == -1 || (pt2 >= 0 && Hor[i+1][j][pt1].first <= Vert[i][j+1][pt2].first+1)) {
                    BIT.add(1, Vert[i][j+1][pt2].second);
                    pt2--;
                } else {
                    ans += (long long) BIT.ask(Hor[i+1][j][pt1].second+1) - BIT.ask(i+1);
                    pt1--;
                }
            }
            for (auto v: Vert[i][j+1]) {
                BIT.add(-1, v.second);
            }
        }
    }
    return(ans);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 295416 KB Output is correct
2 Correct 172 ms 295544 KB Output is correct
3 Correct 171 ms 295544 KB Output is correct
4 Correct 168 ms 295544 KB Output is correct
5 Correct 166 ms 295416 KB Output is correct
6 Correct 178 ms 295544 KB Output is correct
7 Correct 174 ms 295416 KB Output is correct
8 Correct 166 ms 295416 KB Output is correct
9 Correct 172 ms 295544 KB Output is correct
10 Correct 173 ms 295544 KB Output is correct
11 Correct 172 ms 295544 KB Output is correct
12 Correct 165 ms 295548 KB Output is correct
13 Correct 166 ms 295288 KB Output is correct
14 Correct 164 ms 295288 KB Output is correct
15 Correct 173 ms 295416 KB Output is correct
16 Correct 163 ms 295288 KB Output is correct
17 Correct 167 ms 295288 KB Output is correct
18 Correct 174 ms 295428 KB Output is correct
19 Correct 167 ms 295544 KB Output is correct
20 Correct 179 ms 295436 KB Output is correct
21 Correct 165 ms 295416 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 295416 KB Output is correct
2 Correct 172 ms 295544 KB Output is correct
3 Correct 171 ms 295544 KB Output is correct
4 Correct 168 ms 295544 KB Output is correct
5 Correct 166 ms 295416 KB Output is correct
6 Correct 178 ms 295544 KB Output is correct
7 Correct 174 ms 295416 KB Output is correct
8 Correct 166 ms 295416 KB Output is correct
9 Correct 172 ms 295544 KB Output is correct
10 Correct 173 ms 295544 KB Output is correct
11 Correct 172 ms 295544 KB Output is correct
12 Correct 165 ms 295548 KB Output is correct
13 Correct 166 ms 295288 KB Output is correct
14 Correct 164 ms 295288 KB Output is correct
15 Correct 173 ms 295416 KB Output is correct
16 Correct 163 ms 295288 KB Output is correct
17 Correct 168 ms 296188 KB Output is correct
18 Correct 170 ms 296312 KB Output is correct
19 Correct 166 ms 296184 KB Output is correct
20 Correct 182 ms 296056 KB Output is correct
21 Correct 171 ms 296316 KB Output is correct
22 Correct 168 ms 296184 KB Output is correct
23 Correct 172 ms 296168 KB Output is correct
24 Correct 166 ms 295928 KB Output is correct
25 Correct 167 ms 295288 KB Output is correct
26 Correct 174 ms 295428 KB Output is correct
27 Correct 167 ms 295544 KB Output is correct
28 Correct 179 ms 295436 KB Output is correct
29 Correct 165 ms 295416 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 295416 KB Output is correct
2 Correct 172 ms 295544 KB Output is correct
3 Correct 171 ms 295544 KB Output is correct
4 Correct 168 ms 295544 KB Output is correct
5 Correct 166 ms 295416 KB Output is correct
6 Correct 178 ms 295544 KB Output is correct
7 Correct 174 ms 295416 KB Output is correct
8 Correct 166 ms 295416 KB Output is correct
9 Correct 172 ms 295544 KB Output is correct
10 Correct 173 ms 295544 KB Output is correct
11 Correct 172 ms 295544 KB Output is correct
12 Correct 165 ms 295548 KB Output is correct
13 Correct 166 ms 295288 KB Output is correct
14 Correct 164 ms 295288 KB Output is correct
15 Correct 173 ms 295416 KB Output is correct
16 Correct 163 ms 295288 KB Output is correct
17 Correct 168 ms 296188 KB Output is correct
18 Correct 170 ms 296312 KB Output is correct
19 Correct 166 ms 296184 KB Output is correct
20 Correct 182 ms 296056 KB Output is correct
21 Correct 171 ms 296316 KB Output is correct
22 Correct 168 ms 296184 KB Output is correct
23 Correct 172 ms 296168 KB Output is correct
24 Correct 166 ms 295928 KB Output is correct
25 Correct 185 ms 300408 KB Output is correct
26 Correct 194 ms 300408 KB Output is correct
27 Correct 193 ms 300536 KB Output is correct
28 Correct 181 ms 297976 KB Output is correct
29 Correct 199 ms 300152 KB Output is correct
30 Correct 201 ms 300536 KB Output is correct
31 Correct 199 ms 300164 KB Output is correct
32 Correct 193 ms 300024 KB Output is correct
33 Correct 167 ms 295288 KB Output is correct
34 Correct 174 ms 295428 KB Output is correct
35 Correct 167 ms 295544 KB Output is correct
36 Correct 179 ms 295436 KB Output is correct
37 Correct 165 ms 295416 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 295416 KB Output is correct
2 Correct 172 ms 295544 KB Output is correct
3 Correct 171 ms 295544 KB Output is correct
4 Correct 168 ms 295544 KB Output is correct
5 Correct 166 ms 295416 KB Output is correct
6 Correct 178 ms 295544 KB Output is correct
7 Correct 174 ms 295416 KB Output is correct
8 Correct 166 ms 295416 KB Output is correct
9 Correct 172 ms 295544 KB Output is correct
10 Correct 173 ms 295544 KB Output is correct
11 Correct 172 ms 295544 KB Output is correct
12 Correct 165 ms 295548 KB Output is correct
13 Correct 166 ms 295288 KB Output is correct
14 Correct 164 ms 295288 KB Output is correct
15 Correct 173 ms 295416 KB Output is correct
16 Correct 163 ms 295288 KB Output is correct
17 Correct 168 ms 296188 KB Output is correct
18 Correct 170 ms 296312 KB Output is correct
19 Correct 166 ms 296184 KB Output is correct
20 Correct 182 ms 296056 KB Output is correct
21 Correct 171 ms 296316 KB Output is correct
22 Correct 168 ms 296184 KB Output is correct
23 Correct 172 ms 296168 KB Output is correct
24 Correct 166 ms 295928 KB Output is correct
25 Correct 185 ms 300408 KB Output is correct
26 Correct 194 ms 300408 KB Output is correct
27 Correct 193 ms 300536 KB Output is correct
28 Correct 181 ms 297976 KB Output is correct
29 Correct 199 ms 300152 KB Output is correct
30 Correct 201 ms 300536 KB Output is correct
31 Correct 199 ms 300164 KB Output is correct
32 Correct 193 ms 300024 KB Output is correct
33 Correct 312 ms 327800 KB Output is correct
34 Correct 314 ms 327672 KB Output is correct
35 Correct 303 ms 327672 KB Output is correct
36 Correct 289 ms 327672 KB Output is correct
37 Correct 471 ms 345720 KB Output is correct
38 Correct 463 ms 345720 KB Output is correct
39 Correct 470 ms 346104 KB Output is correct
40 Correct 450 ms 343032 KB Output is correct
41 Correct 320 ms 316152 KB Output is correct
42 Correct 341 ms 320504 KB Output is correct
43 Correct 574 ms 343468 KB Output is correct
44 Correct 595 ms 345720 KB Output is correct
45 Correct 366 ms 323192 KB Output is correct
46 Correct 367 ms 321656 KB Output is correct
47 Correct 546 ms 342136 KB Output is correct
48 Correct 567 ms 343220 KB Output is correct
49 Correct 167 ms 295288 KB Output is correct
50 Correct 174 ms 295428 KB Output is correct
51 Correct 167 ms 295544 KB Output is correct
52 Correct 179 ms 295436 KB Output is correct
53 Correct 165 ms 295416 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 295928 KB Output is correct
2 Correct 167 ms 295928 KB Output is correct
3 Correct 176 ms 295544 KB Output is correct
4 Correct 167 ms 295288 KB Output is correct
5 Correct 170 ms 295800 KB Output is correct
6 Correct 177 ms 296160 KB Output is correct
7 Correct 169 ms 295800 KB Output is correct
8 Correct 170 ms 295768 KB Output is correct
9 Correct 172 ms 295800 KB Output is correct
10 Correct 167 ms 295416 KB Output is correct
11 Correct 170 ms 295672 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 295416 KB Output is correct
2 Correct 935 ms 392896 KB Output is correct
3 Correct 1848 ms 496760 KB Output is correct
4 Correct 1901 ms 497752 KB Output is correct
5 Correct 1836 ms 497384 KB Output is correct
6 Correct 322 ms 336120 KB Output is correct
7 Correct 443 ms 368668 KB Output is correct
8 Correct 470 ms 371744 KB Output is correct
9 Correct 167 ms 295288 KB Output is correct
10 Correct 174 ms 295428 KB Output is correct
11 Correct 167 ms 295544 KB Output is correct
12 Correct 179 ms 295436 KB Output is correct
13 Correct 165 ms 295416 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 295416 KB Output is correct
2 Correct 172 ms 295544 KB Output is correct
3 Correct 171 ms 295544 KB Output is correct
4 Correct 168 ms 295544 KB Output is correct
5 Correct 166 ms 295416 KB Output is correct
6 Correct 178 ms 295544 KB Output is correct
7 Correct 174 ms 295416 KB Output is correct
8 Correct 166 ms 295416 KB Output is correct
9 Correct 172 ms 295544 KB Output is correct
10 Correct 173 ms 295544 KB Output is correct
11 Correct 172 ms 295544 KB Output is correct
12 Correct 165 ms 295548 KB Output is correct
13 Correct 166 ms 295288 KB Output is correct
14 Correct 164 ms 295288 KB Output is correct
15 Correct 173 ms 295416 KB Output is correct
16 Correct 163 ms 295288 KB Output is correct
17 Correct 168 ms 296188 KB Output is correct
18 Correct 170 ms 296312 KB Output is correct
19 Correct 166 ms 296184 KB Output is correct
20 Correct 182 ms 296056 KB Output is correct
21 Correct 171 ms 296316 KB Output is correct
22 Correct 168 ms 296184 KB Output is correct
23 Correct 172 ms 296168 KB Output is correct
24 Correct 166 ms 295928 KB Output is correct
25 Correct 185 ms 300408 KB Output is correct
26 Correct 194 ms 300408 KB Output is correct
27 Correct 193 ms 300536 KB Output is correct
28 Correct 181 ms 297976 KB Output is correct
29 Correct 199 ms 300152 KB Output is correct
30 Correct 201 ms 300536 KB Output is correct
31 Correct 199 ms 300164 KB Output is correct
32 Correct 193 ms 300024 KB Output is correct
33 Correct 312 ms 327800 KB Output is correct
34 Correct 314 ms 327672 KB Output is correct
35 Correct 303 ms 327672 KB Output is correct
36 Correct 289 ms 327672 KB Output is correct
37 Correct 471 ms 345720 KB Output is correct
38 Correct 463 ms 345720 KB Output is correct
39 Correct 470 ms 346104 KB Output is correct
40 Correct 450 ms 343032 KB Output is correct
41 Correct 320 ms 316152 KB Output is correct
42 Correct 341 ms 320504 KB Output is correct
43 Correct 574 ms 343468 KB Output is correct
44 Correct 595 ms 345720 KB Output is correct
45 Correct 366 ms 323192 KB Output is correct
46 Correct 367 ms 321656 KB Output is correct
47 Correct 546 ms 342136 KB Output is correct
48 Correct 567 ms 343220 KB Output is correct
49 Correct 170 ms 295928 KB Output is correct
50 Correct 167 ms 295928 KB Output is correct
51 Correct 176 ms 295544 KB Output is correct
52 Correct 167 ms 295288 KB Output is correct
53 Correct 170 ms 295800 KB Output is correct
54 Correct 177 ms 296160 KB Output is correct
55 Correct 169 ms 295800 KB Output is correct
56 Correct 170 ms 295768 KB Output is correct
57 Correct 172 ms 295800 KB Output is correct
58 Correct 167 ms 295416 KB Output is correct
59 Correct 170 ms 295672 KB Output is correct
60 Correct 168 ms 295416 KB Output is correct
61 Correct 935 ms 392896 KB Output is correct
62 Correct 1848 ms 496760 KB Output is correct
63 Correct 1901 ms 497752 KB Output is correct
64 Correct 1836 ms 497384 KB Output is correct
65 Correct 322 ms 336120 KB Output is correct
66 Correct 443 ms 368668 KB Output is correct
67 Correct 470 ms 371744 KB Output is correct
68 Correct 2176 ms 642524 KB Output is correct
69 Correct 2310 ms 642276 KB Output is correct
70 Correct 1814 ms 642168 KB Output is correct
71 Correct 1762 ms 642040 KB Output is correct
72 Correct 4793 ms 886524 KB Output is correct
73 Correct 3604 ms 650232 KB Output is correct
74 Correct 4002 ms 721096 KB Output is correct
75 Execution timed out 5129 ms 901276 KB Time limit exceeded
76 Halted 0 ms 0 KB -