oj.uz

Submission #238794

# Submission time Handle Problem Language Result Execution time Memory
238794 2020-06-12T23:08:53 Z duality Rectangles (IOI19_rect) C++14
100 / 100
 1081 ms 164984 KB 
#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

vi row[2500],col[2500];
int pr[2500][2500],pc[2500][2500],cr[2500][2500],cc[2500][2500];
vpii x,y;
int bit[2500];
int getAns(int N) {
    int i,j = 0,k;
    int ans = 0;
    sort(x.begin(),x.end());
    for (i = 0; i < x.size(); i++) {
        while ((j < y.size()) && (y[j].first <= x[i].first)) {
            for (k = N-y[j].second; k < N; k += k & (-k)) bit[k]++;
            j++;
        }
        for (k = N-x[i].second; k > 0; k -= k & (-k)) ans += bit[k];
    }
    for (i = 0; i < j; i++) {
        for (k = N-y[i].second; k < N; k += k & (-k)) bit[k]--;
    }
    x.clear(),y.clear();
    return ans;
}
long long int count_rectangles(vector<vector<int> > a) {
    int i,j,ans = 0;
    int n = a.size(),m = a[0].size();
    for (i = 0; i < n; i++) row[i].pb(0);
    for (i = 0; i < m; i++) col[i].pb(0);
    for (i = 0; i < n-1; i++) {
        for (j = 0; j < m-1; j++) {
            int e = 0;
            while (!row[i].empty() && (a[i][row[i].back()] <= a[i][j+1])) {
                int u = row[i].back();
                if ((u < j) && !e) {
                    if (pr[u+1][j] == i-1) cr[u+1][j]++;
                    else cr[u+1][j] = 1;
                    pr[u+1][j] = i,x.pb(mp(cr[u+1][j],j-u));
                }
                if (a[i][u] == a[i][j+1]) e = 1;
                row[i].pop_back();
            }
            if (!row[i].empty() && (row[i].back() < j) && !e) {
                int u = row[i].back();
                if (pr[u+1][j] == i-1) cr[u+1][j]++;
                else cr[u+1][j] = 1;
                pr[u+1][j] = i,x.pb(mp(cr[u+1][j],j-u));
            }
            row[i].pb(j+1);
            e = 0;
            while (!col[j].empty() && (a[col[j].back()][j] <= a[i+1][j])) {
                int u = col[j].back();
                if ((u < i) && !e) {
                    if (pc[u+1][i] == j-1) cc[u+1][i]++;
                    else cc[u+1][i] = 1;
                    pc[u+1][i] = j,y.pb(mp(i-u,cc[u+1][i]));
                }
                if (a[u][j] == a[i+1][j]) e = 1;
                col[j].pop_back();
            }
            if (!col[j].empty() && (col[j].back() < i) && !e) {
                int u = col[j].back();
                if (pc[u+1][i] == j-1) cc[u+1][i]++;
                else cc[u+1][i] = 1;
                pc[u+1][i] = j,y.pb(mp(i-u,cc[u+1][i]));
            }
            col[j].pb(i+1);
            ans += getAns(m);
        }
    }
    return ans;
}

Compilation message

rect.cpp: In function 'int getAns(int)':
rect.cpp:66:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < x.size(); i++) {
                 ~~^~~~~~~~~~
rect.cpp:67:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while ((j < y.size()) && (y[j].first <= x[i].first)) {
                 ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 896 KB Output is correct
3 Correct 5 ms 896 KB Output is correct
4 Correct 5 ms 896 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 5 ms 896 KB Output is correct
11 Correct 5 ms 896 KB Output is correct
12 Correct 5 ms 896 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 896 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 512 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 896 KB Output is correct
3 Correct 5 ms 896 KB Output is correct
4 Correct 5 ms 896 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 5 ms 896 KB Output is correct
11 Correct 5 ms 896 KB Output is correct
12 Correct 5 ms 896 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 6 ms 1920 KB Output is correct
18 Correct 7 ms 1920 KB Output is correct
19 Correct 8 ms 1920 KB Output is correct
20 Correct 7 ms 1792 KB Output is correct
21 Correct 7 ms 1792 KB Output is correct
22 Correct 7 ms 1792 KB Output is correct
23 Correct 7 ms 1792 KB Output is correct
24 Correct 7 ms 1536 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 896 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 512 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 896 KB Output is correct
3 Correct 5 ms 896 KB Output is correct
4 Correct 5 ms 896 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 5 ms 896 KB Output is correct
11 Correct 5 ms 896 KB Output is correct
12 Correct 5 ms 896 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 6 ms 1920 KB Output is correct
18 Correct 7 ms 1920 KB Output is correct
19 Correct 8 ms 1920 KB Output is correct
20 Correct 7 ms 1792 KB Output is correct
21 Correct 7 ms 1792 KB Output is correct
22 Correct 7 ms 1792 KB Output is correct
23 Correct 7 ms 1792 KB Output is correct
24 Correct 7 ms 1536 KB Output is correct
25 Correct 11 ms 4608 KB Output is correct
26 Correct 12 ms 4608 KB Output is correct
27 Correct 12 ms 4608 KB Output is correct
28 Correct 10 ms 4096 KB Output is correct
29 Correct 12 ms 4480 KB Output is correct
30 Correct 12 ms 4608 KB Output is correct
31 Correct 13 ms 4352 KB Output is correct
32 Correct 12 ms 4352 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 896 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 512 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 896 KB Output is correct
3 Correct 5 ms 896 KB Output is correct
4 Correct 5 ms 896 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 5 ms 896 KB Output is correct
11 Correct 5 ms 896 KB Output is correct
12 Correct 5 ms 896 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 6 ms 1920 KB Output is correct
18 Correct 7 ms 1920 KB Output is correct
19 Correct 8 ms 1920 KB Output is correct
20 Correct 7 ms 1792 KB Output is correct
21 Correct 7 ms 1792 KB Output is correct
22 Correct 7 ms 1792 KB Output is correct
23 Correct 7 ms 1792 KB Output is correct
24 Correct 7 ms 1536 KB Output is correct
25 Correct 11 ms 4608 KB Output is correct
26 Correct 12 ms 4608 KB Output is correct
27 Correct 12 ms 4608 KB Output is correct
28 Correct 10 ms 4096 KB Output is correct
29 Correct 12 ms 4480 KB Output is correct
30 Correct 12 ms 4608 KB Output is correct
31 Correct 13 ms 4352 KB Output is correct
32 Correct 12 ms 4352 KB Output is correct
33 Correct 64 ms 23800 KB Output is correct
34 Correct 56 ms 23800 KB Output is correct
35 Correct 70 ms 23800 KB Output is correct
36 Correct 58 ms 23800 KB Output is correct
37 Correct 88 ms 22768 KB Output is correct
38 Correct 84 ms 22776 KB Output is correct
39 Correct 85 ms 22832 KB Output is correct
40 Correct 76 ms 22008 KB Output is correct
41 Correct 42 ms 16632 KB Output is correct
42 Correct 47 ms 16760 KB Output is correct
43 Correct 83 ms 19960 KB Output is correct
44 Correct 81 ms 20088 KB Output is correct
45 Correct 46 ms 14072 KB Output is correct
46 Correct 46 ms 14072 KB Output is correct
47 Correct 74 ms 17912 KB Output is correct
48 Correct 86 ms 17964 KB Output is correct
49 Correct 5 ms 512 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 5 ms 896 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 5 ms 512 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 20736 KB Output is correct
2 Correct 16 ms 17792 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 17 ms 16128 KB Output is correct
6 Correct 16 ms 15616 KB Output is correct
7 Correct 16 ms 16000 KB Output is correct
8 Correct 17 ms 14848 KB Output is correct
9 Correct 15 ms 14720 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 12 ms 10752 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 544 KB Output is correct
2 Correct 209 ms 53880 KB Output is correct
3 Correct 438 ms 93176 KB Output is correct
4 Correct 432 ms 92792 KB Output is correct
5 Correct 430 ms 92792 KB Output is correct
6 Correct 106 ms 26232 KB Output is correct
7 Correct 196 ms 49144 KB Output is correct
8 Correct 210 ms 52216 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 896 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 512 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 896 KB Output is correct
3 Correct 5 ms 896 KB Output is correct
4 Correct 5 ms 896 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 5 ms 896 KB Output is correct
11 Correct 5 ms 896 KB Output is correct
12 Correct 5 ms 896 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 6 ms 1920 KB Output is correct
18 Correct 7 ms 1920 KB Output is correct
19 Correct 8 ms 1920 KB Output is correct
20 Correct 7 ms 1792 KB Output is correct
21 Correct 7 ms 1792 KB Output is correct
22 Correct 7 ms 1792 KB Output is correct
23 Correct 7 ms 1792 KB Output is correct
24 Correct 7 ms 1536 KB Output is correct
25 Correct 11 ms 4608 KB Output is correct
26 Correct 12 ms 4608 KB Output is correct
27 Correct 12 ms 4608 KB Output is correct
28 Correct 10 ms 4096 KB Output is correct
29 Correct 12 ms 4480 KB Output is correct
30 Correct 12 ms 4608 KB Output is correct
31 Correct 13 ms 4352 KB Output is correct
32 Correct 12 ms 4352 KB Output is correct
33 Correct 64 ms 23800 KB Output is correct
34 Correct 56 ms 23800 KB Output is correct
35 Correct 70 ms 23800 KB Output is correct
36 Correct 58 ms 23800 KB Output is correct
37 Correct 88 ms 22768 KB Output is correct
38 Correct 84 ms 22776 KB Output is correct
39 Correct 85 ms 22832 KB Output is correct
40 Correct 76 ms 22008 KB Output is correct
41 Correct 42 ms 16632 KB Output is correct
42 Correct 47 ms 16760 KB Output is correct
43 Correct 83 ms 19960 KB Output is correct
44 Correct 81 ms 20088 KB Output is correct
45 Correct 46 ms 14072 KB Output is correct
46 Correct 46 ms 14072 KB Output is correct
47 Correct 74 ms 17912 KB Output is correct
48 Correct 86 ms 17964 KB Output is correct
49 Correct 21 ms 20736 KB Output is correct
50 Correct 16 ms 17792 KB Output is correct
51 Correct 5 ms 512 KB Output is correct
52 Correct 5 ms 512 KB Output is correct
53 Correct 17 ms 16128 KB Output is correct
54 Correct 16 ms 15616 KB Output is correct
55 Correct 16 ms 16000 KB Output is correct
56 Correct 17 ms 14848 KB Output is correct
57 Correct 15 ms 14720 KB Output is correct
58 Correct 5 ms 512 KB Output is correct
59 Correct 12 ms 10752 KB Output is correct
60 Correct 5 ms 544 KB Output is correct
61 Correct 209 ms 53880 KB Output is correct
62 Correct 438 ms 93176 KB Output is correct
63 Correct 432 ms 92792 KB Output is correct
64 Correct 430 ms 92792 KB Output is correct
65 Correct 106 ms 26232 KB Output is correct
66 Correct 196 ms 49144 KB Output is correct
67 Correct 210 ms 52216 KB Output is correct
68 Correct 765 ms 164984 KB Output is correct
69 Correct 711 ms 164344 KB Output is correct
70 Correct 849 ms 164756 KB Output is correct
71 Correct 742 ms 164856 KB Output is correct
72 Correct 1062 ms 161876 KB Output is correct
73 Correct 603 ms 80568 KB Output is correct
74 Correct 631 ms 88568 KB Output is correct
75 Correct 989 ms 117624 KB Output is correct
76 Correct 685 ms 85624 KB Output is correct
77 Correct 869 ms 105100 KB Output is correct
78 Correct 1081 ms 124792 KB Output is correct
79 Correct 613 ms 66040 KB Output is correct
80 Correct 986 ms 97368 KB Output is correct
81 Correct 983 ms 93816 KB Output is correct
82 Correct 640 ms 104696 KB Output is correct
83 Correct 1059 ms 161528 KB Output is correct
84 Correct 1051 ms 161528 KB Output is correct
85 Correct 1065 ms 161528 KB Output is correct
86 Correct 5 ms 512 KB Output is correct
87 Correct 5 ms 384 KB Output is correct
88 Correct 5 ms 896 KB Output is correct
89 Correct 5 ms 384 KB Output is correct
90 Correct 5 ms 512 KB Output is correct