oj.uz

Submission #596461

# Submission time Handle Problem Language Result Execution time Memory
596461 2022-07-14T19:00:39 Z keta_tsimakuridze Rectangles (IOI19_rect) C++14
100 / 100
 2364 ms 576064 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define s second
#define f first
const int N = 2500 + 5;
struct xx {
    int l, U;
};
struct yy {
    int u, L;
};
int t[N], n, m;
vector<vector<xx> > x[N];
vector<vector<yy> > y[N];
void upd(int id, int v) {
    ++id;
    for(id; id <= m + 1; id += id & (-id)) t[id] += v;
}
int get(int id) {
    int ans = 0;
    ++id;
    for(id; id >= 1; id -= id & (-id)) ans += t[id];
    return ans;
}
bool cmp1(xx a, xx b) {
    return (a.l < b.l);
}
bool cmp(yy a, yy b) {
    return (a.u < b.u);
}
long long count_rectangles(std::vector<std::vector<int> > a) {
	 n = a.size(), m = a[0].size();

	for(int i = 0; i < n; i++) {
        stack<int> st; x[i].resize(m); y[i].resize(m);
        for(int j = 0; j < m; j++) {
            int f = 0;
            while(st.size() && a[i][st.top()] <= a[i][j]) {
                f |= (a[i][st.top()] == a[i][j]);
                if(j && st.top() + 1 <= j - 1)
                x[i][j - 1].push_back({st.top() + 1, 0});
                st.pop();
            }
            if(!f && st.size() && st.top() + 1 <= j - 1) x[i][j - 1].push_back({st.top() + 1, 0});
            st.push(j);
        }
	}
	for(int j = 0; j < m; j++) {
        stack<int> st;
        for(int i = 0; i < n; i++) {
            int f = 0;
            while(st.size() && a[st.top()][j] <= a[i][j]) {
                f |= (a[st.top()][j] == a[i][j]);
                if(i && st.top() + 1 <= i - 1)
                y[i - 1][j].push_back({st.top() + 1, 0});
                st.pop();
            }
            if(!f && st.size() && st.top() + 1 <= i - 1) y[i- 1][j].push_back({st.top() + 1, 0});
            st.push(i);
        }
    }
    //long long ans = 0;
    long long ans = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            int l = 0;
            vector<pii> v;
            reverse(x[i][j].begin(), x[i][j].end());
            reverse(y[i][j].begin(), y[i][j].end());
            for(int k = 0; k < x[i][j].size(); k++) {

                while(i && l < x[i - 1][j].size() && x[i - 1][j][l].l < x[i][j][k].l) ++l;
                if(!i || l == x[i - 1][j].size() || x[i - 1][j][l].l != x[i][j][k].l) x[i][j][k].U = i;
                else x[i][j][k].U = x[i - 1][j][l].U;
                v.push_back({x[i][j][k].U, x[i][j][k].l});
            }

            l = 0;
            for(int k = 0; k < y[i][j].size(); k++) {
                while(j && l < y[i][j - 1].size() && y[i][j - 1][l].u < y[i][j][k].u) ++l;
                if(!j || l == y[i][j - 1].size() || y[i][j - 1][l].u != y[i][j][k].u) y[i][j][k].L = j;
                else y[i][j][k].L = y[i][j - 1][l].L;
            }
            vector <yy> Y = y[i][j];
            vector<int> rem;
            sort(v.begin(), v.end());
            for(int k = (int)v.size() - 1; k >= 0; k--) {
                //  (l, r) -- U ebi da (u, d) ebi -- L
                // ramdenia u >= U da L <= l
                int U = v[k].f, l = v[k].s;
                while(Y.size() && Y.back().u >= v[k].f) {
                    upd(Y.back().L, 1);
                    rem.push_back(Y.back().L);
                    Y.pop_back();
                }
                ans += get(l);
            }
            while(rem.size()) upd(rem.back(), -1), rem.pop_back();
        }
    }
    return ans;
}

Compilation message

rect.cpp: In function 'void upd(int, int)':
rect.cpp:19:9: warning: statement has no effect [-Wunused-value]
   19 |     for(id; id <= m + 1; id += id & (-id)) t[id] += v;
      |         ^~
rect.cpp: In function 'int get(int)':
rect.cpp:24:9: warning: statement has no effect [-Wunused-value]
   24 |     for(id; id >= 1; id -= id & (-id)) ans += t[id];
      |         ^~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:72:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<xx>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             for(int k = 0; k < x[i][j].size(); k++) {
      |                            ~~^~~~~~~~~~~~~~~~
rect.cpp:74:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<xx>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |                 while(i && l < x[i - 1][j].size() && x[i - 1][j][l].l < x[i][j][k].l) ++l;
      |                            ~~^~~~~~~~~~~~~~~~~~~~
rect.cpp:75:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<xx>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |                 if(!i || l == x[i - 1][j].size() || x[i - 1][j][l].l != x[i][j][k].l) x[i][j][k].U = i;
      |                          ~~^~~~~~~~~~~~~~~~~~~~~
rect.cpp:81:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<yy>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |             for(int k = 0; k < y[i][j].size(); k++) {
      |                            ~~^~~~~~~~~~~~~~~~
rect.cpp:82:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<yy>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |                 while(j && l < y[i][j - 1].size() && y[i][j - 1][l].u < y[i][j][k].u) ++l;
      |                            ~~^~~~~~~~~~~~~~~~~~~~
rect.cpp:83:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<yy>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |                 if(!j || l == y[i][j - 1].size() || y[i][j - 1][l].u != y[i][j][k].u) y[i][j][k].L = j;
      |                          ~~^~~~~~~~~~~~~~~~~~~~~
rect.cpp:92:21: warning: unused variable 'U' [-Wunused-variable]
   92 |                 int U = v[k].f, l = v[k].s;
      |                     ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 420 KB Output is correct
12 Correct 1 ms 420 KB Output is correct
13 Correct 1 ms 416 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 412 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 420 KB Output is correct
12 Correct 1 ms 420 KB Output is correct
13 Correct 1 ms 416 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 412 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 2 ms 980 KB Output is correct
24 Correct 1 ms 852 KB Output is correct
25 Correct 2 ms 852 KB Output is correct
26 Correct 3 ms 980 KB Output is correct
27 Correct 2 ms 980 KB Output is correct
28 Correct 3 ms 980 KB Output is correct
29 Correct 2 ms 724 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 420 KB Output is correct
12 Correct 1 ms 420 KB Output is correct
13 Correct 1 ms 416 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 412 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 2 ms 980 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 2 ms 852 KB Output is correct
21 Correct 3 ms 980 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 3 ms 980 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 7 ms 3560 KB Output is correct
31 Correct 6 ms 3668 KB Output is correct
32 Correct 6 ms 3540 KB Output is correct
33 Correct 7 ms 3412 KB Output is correct
34 Correct 12 ms 4104 KB Output is correct
35 Correct 14 ms 4180 KB Output is correct
36 Correct 13 ms 4032 KB Output is correct
37 Correct 12 ms 4044 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 420 KB Output is correct
12 Correct 1 ms 420 KB Output is correct
13 Correct 1 ms 416 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 412 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 2 ms 980 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 2 ms 852 KB Output is correct
21 Correct 3 ms 980 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 3 ms 980 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 7 ms 3560 KB Output is correct
26 Correct 6 ms 3668 KB Output is correct
27 Correct 6 ms 3540 KB Output is correct
28 Correct 7 ms 3412 KB Output is correct
29 Correct 12 ms 4104 KB Output is correct
30 Correct 14 ms 4180 KB Output is correct
31 Correct 13 ms 4032 KB Output is correct
32 Correct 12 ms 4044 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 50 ms 33160 KB Output is correct
39 Correct 56 ms 37904 KB Output is correct
40 Correct 70 ms 37856 KB Output is correct
41 Correct 82 ms 42728 KB Output is correct
42 Correct 71 ms 38696 KB Output is correct
43 Correct 72 ms 38600 KB Output is correct
44 Correct 69 ms 38692 KB Output is correct
45 Correct 66 ms 36532 KB Output is correct
46 Correct 67 ms 34996 KB Output is correct
47 Correct 84 ms 37608 KB Output is correct
48 Correct 150 ms 45432 KB Output is correct
49 Correct 158 ms 45712 KB Output is correct
50 Correct 81 ms 23008 KB Output is correct
51 Correct 80 ms 22996 KB Output is correct
52 Correct 153 ms 44000 KB Output is correct
53 Correct 153 ms 44204 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1064 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 1 ms 812 KB Output is correct
4 Correct 1 ms 416 KB Output is correct
5 Correct 3 ms 964 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 2 ms 1108 KB Output is correct
8 Correct 2 ms 940 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 724 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 416 KB Output is correct
7 Correct 493 ms 202628 KB Output is correct
8 Correct 1075 ms 439072 KB Output is correct
9 Correct 1091 ms 441240 KB Output is correct
10 Correct 1082 ms 441252 KB Output is correct
11 Correct 174 ms 169960 KB Output is correct
12 Correct 349 ms 322212 KB Output is correct
13 Correct 367 ms 343664 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 420 KB Output is correct
12 Correct 1 ms 420 KB Output is correct
13 Correct 1 ms 416 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 412 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 2 ms 980 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 2 ms 852 KB Output is correct
21 Correct 3 ms 980 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 3 ms 980 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 7 ms 3560 KB Output is correct
26 Correct 6 ms 3668 KB Output is correct
27 Correct 6 ms 3540 KB Output is correct
28 Correct 7 ms 3412 KB Output is correct
29 Correct 12 ms 4104 KB Output is correct
30 Correct 14 ms 4180 KB Output is correct
31 Correct 13 ms 4032 KB Output is correct
32 Correct 12 ms 4044 KB Output is correct
33 Correct 50 ms 33160 KB Output is correct
34 Correct 56 ms 37904 KB Output is correct
35 Correct 70 ms 37856 KB Output is correct
36 Correct 82 ms 42728 KB Output is correct
37 Correct 71 ms 38696 KB Output is correct
38 Correct 72 ms 38600 KB Output is correct
39 Correct 69 ms 38692 KB Output is correct
40 Correct 66 ms 36532 KB Output is correct
41 Correct 67 ms 34996 KB Output is correct
42 Correct 84 ms 37608 KB Output is correct
43 Correct 150 ms 45432 KB Output is correct
44 Correct 158 ms 45712 KB Output is correct
45 Correct 81 ms 23008 KB Output is correct
46 Correct 80 ms 22996 KB Output is correct
47 Correct 153 ms 44000 KB Output is correct
48 Correct 153 ms 44204 KB Output is correct
49 Correct 2 ms 1064 KB Output is correct
50 Correct 2 ms 888 KB Output is correct
51 Correct 1 ms 812 KB Output is correct
52 Correct 1 ms 416 KB Output is correct
53 Correct 3 ms 964 KB Output is correct
54 Correct 2 ms 980 KB Output is correct
55 Correct 2 ms 1108 KB Output is correct
56 Correct 2 ms 940 KB Output is correct
57 Correct 2 ms 980 KB Output is correct
58 Correct 1 ms 596 KB Output is correct
59 Correct 2 ms 724 KB Output is correct
60 Correct 0 ms 416 KB Output is correct
61 Correct 493 ms 202628 KB Output is correct
62 Correct 1075 ms 439072 KB Output is correct
63 Correct 1091 ms 441240 KB Output is correct
64 Correct 1082 ms 441252 KB Output is correct
65 Correct 174 ms 169960 KB Output is correct
66 Correct 349 ms 322212 KB Output is correct
67 Correct 367 ms 343664 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 468 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 684 ms 404676 KB Output is correct
74 Correct 776 ms 471628 KB Output is correct
75 Correct 1230 ms 471856 KB Output is correct
76 Correct 1322 ms 538612 KB Output is correct
77 Correct 899 ms 461132 KB Output is correct
78 Correct 1391 ms 344652 KB Output is correct
79 Correct 1434 ms 363680 KB Output is correct
80 Correct 2310 ms 574036 KB Output is correct
81 Correct 1411 ms 345752 KB Output is correct
82 Correct 1852 ms 460984 KB Output is correct
83 Correct 2364 ms 576064 KB Output is correct
84 Correct 1300 ms 334896 KB Output is correct
85 Correct 2257 ms 559972 KB Output is correct
86 Correct 2199 ms 543672 KB Output is correct
87 Correct 518 ms 280940 KB Output is correct
88 Correct 879 ms 460700 KB Output is correct
89 Correct 883 ms 461132 KB Output is correct
90 Correct 877 ms 461076 KB Output is correct