oj.uz

Submission #154563

# Submission time Handle Problem Language Result Execution time Memory
154563 2019-09-22T17:52:38 Z crackersamdjam Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 1023960 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4,popcnt,abm,mmx,tune=native")

#include <bits/stdc++.h>

#define INT_INF 0x3f3f3f3f
#define mp std::make_pair

#define MAXN 2501

typedef long long ll;
typedef std::pair<int,int> pii;

int num_rows,num_cols,arr[MAXN][MAXN],bit[MAXN],cnt[MAXN][MAXN],ans,l,r,lst[MAXN],pp;
std::vector<pii> row_dp[MAXN][MAXN],col_dp[MAXN][MAXN];
std::vector<std::pair<pii,int>> dep[MAXN];
pii dq[MAXN];

inline void update(int i, int val, int curr){
    for(; i<=num_cols; i+=i&-i){
        if(lst[i] != curr) bit[i] = val, lst[i] = curr;
        else bit[i]+=val;
    }
}

inline int query(int i, int curr){
    int res = 0;
    for(; i>0; i-=i&-i)
        if(lst[i] == curr)
            res+=bit[i];
    return res;
}

inline void init_rows(){
//	memset(cnt,0,sizeof cnt);
    for(int i=2; i<num_rows; i++){
        l = 1, r = 0;
        for(int k=1; k<=num_cols; k++){
            while(r-l+1 > 0 && dq[r].first < arr[i][k]) r--;
            int lft = (r-l+1>0?dq[r].second:INT_INF);
            if(lft < k-1 && (row_dp[lft+1][k-1].empty() || row_dp[lft+1][k-1].back().first != i))
                row_dp[lft+1][k-1].emplace_back(i,i), cnt[lft+1][k-1]++; //rows[i].pb(mp(lft+1,k-1));
            while(r-l+1 > 0 && dq[r].first == arr[i][k]) r--;
            dq[++r] = mp(arr[i][k],k);
        }
        l = 1, r = 0;
        for(int k=num_cols; k>=1; k--){
            while(r-l+1 > 0 && dq[r].first < arr[i][k]) r--;
            int rgt = (r-l+1>0?dq[r].second:-INT_INF);
            if(rgt > k+1 && (row_dp[k+1][rgt-1].empty() || row_dp[k+1][rgt-1].back().first != i))
                row_dp[k+1][rgt-1].emplace_back(i,i), cnt[k+1][rgt-1]++; //rows[i].pb(mp(k+1,rgt-1));
            while(r-l+1 > 0 && dq[r].first == arr[i][k]) r--;
            dq[++r] = mp(arr[i][k],k);
        }
    }
}

inline void init_cols(){
    memset(cnt,0,sizeof cnt);
    for(int i=2; i<num_cols; i++){
        l = 1, r = 0;
        for(int k=1; k<=num_rows; k++){
            while(r-l+1 > 0 && dq[r].first < arr[k][i]) r--;
            int lft = (r-l+1>0?dq[r].second:INT_INF);
            if(lft < k-1 && (col_dp[lft+1][k-1].empty() || col_dp[lft+1][k-1].back().first != i))
                col_dp[lft+1][k-1].emplace_back(i,i), cnt[lft+1][k-1]++; //cols[i].pb(mp(lft+1,k-1));
            while(r-l+1 > 0 && dq[r].first == arr[k][i]) r--;
            dq[++r] = mp(arr[k][i],k);
        }
        l = 1, r = 0;
        for(int k=num_rows; k>=1; k--){
            while(r-l+1 > 0 && dq[r].first < arr[k][i]) r--;
            int rgt = (r-l+1>0?dq[r].second:-INT_INF);
            if(rgt > k+1 && (col_dp[k+1][rgt-1].empty() || col_dp[k+1][rgt-1].back().first != i))
                col_dp[k+1][rgt-1].emplace_back(i,i), cnt[k+1][rgt-1]++; //cols[i].pb(mp(k+1,rgt-1));
            while(r-l+1 > 0 && dq[r].first == arr[k][i]) r--;
            dq[++r] = mp(arr[k][i],k);
        }
    }
}

#define nums row_dp[l][r]
inline void calc_hor_dp(){
    for(int l=2; l<=num_cols-1; l++){
        for(int r=l; r<=num_cols-1; r++){
            if(cnt[l][r] == 0) continue;
            int lst = 0;
            for(int i=1; i<cnt[l][r]; i++){
                if(nums[i].first == nums[i-1].first+1) continue;
                for(int k=nums[lst].first; k<=nums[i-1].first; k++)
                    dep[nums[i-1].first-k+1].emplace_back(mp(k,l),r);
                lst = i;
            }
            for(int k=nums[lst].first; k<=nums[cnt[l][r]-1].first; k++)
                dep[nums[cnt[l][r]-1].first-k+1].emplace_back(mp(k,l),r);
            nums.clear();
        }
    }
    for(int i=1; i<=num_rows; i++){
        for(auto &check:dep[i])
            row_dp[check.first.first][check.first.second].emplace_back(i,check.second);
    }
}

#define nums col_dp[l][r]

inline void calc_col_dp(){
    for(int l=2; l<=num_rows-1; l++){
        for(int r=l; r<=num_rows-1; r++){
            if(cnt[l][r] == 0) continue;
            int lst = 0;
            for(int i=1; i<cnt[l][r]; i++){
                if(nums[i].first == nums[i-1].first+1) continue;
                for(int k=nums[lst].first; k<=nums[i-1].first; k++)
                    col_dp[l][k].emplace_back(r,nums[i-1].first);
                lst = i;
            }
            for(int k=nums[lst].first; k<=nums[cnt[l][r]-1].first; k++)
                col_dp[l][k].emplace_back(r,nums[cnt[l][r]-1].first);
        }
    }
}

ll count_rectangles(std::vector<std::vector<int>> a){
    ans = 0, num_rows = (int)a.size(), num_cols = (int)a[0].size();
    for(int i=0; i<a.size(); i++)
        for(int k=0; k<a[i].size(); k++)
            arr[i+1][k+1] = a[i][k];
    init_rows(); calc_hor_dp();
    init_cols(); calc_col_dp();
    for(int i=num_rows-1; i>=2; i--){
        for(int k=num_cols-1; k>=2; k--){
            int ptr = cnt[i][k], res = 0, cc = 0; ++pp;
            for(int v=0; v<row_dp[i][k].size(); v++){
                while(ptr < col_dp[i][k].size() && col_dp[i][k][ptr].first-i+1 <= row_dp[i][k][v].first){
                    update(col_dp[i][k][ptr].second-k+1,1,pp);
                    ptr++, cc++;
                }
                res+=cc-query(row_dp[i][k][v].second-k,pp);
            }
            ans+=res;
        }
    }
    return ans;
}

Compilation message

rect.cpp:106:0: warning: "nums" redefined
 #define nums col_dp[l][r]
 
rect.cpp:83:0: note: this is the location of the previous definition
 #define nums row_dp[l][r]
 
rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:127:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a.size(); i++)
                  ~^~~~~~~~~
rect.cpp:128:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int k=0; k<a[i].size(); k++)
                      ~^~~~~~~~~~~~
rect.cpp:135:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int v=0; v<row_dp[i][k].size(); v++){
                          ~^~~~~~~~~~~~~~~~~~~~
rect.cpp:136:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 while(ptr < col_dp[i][k].size() && col_dp[i][k][ptr].first-i+1 <= row_dp[i][k][v].first){
                       ~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 318712 KB Output is correct
2 Correct 312 ms 318840 KB Output is correct
3 Correct 309 ms 318836 KB Output is correct
4 Correct 312 ms 319076 KB Output is correct
5 Correct 309 ms 318712 KB Output is correct
6 Correct 315 ms 318844 KB Output is correct
7 Correct 310 ms 318968 KB Output is correct
8 Correct 310 ms 318712 KB Output is correct
9 Correct 315 ms 318840 KB Output is correct
10 Correct 311 ms 318928 KB Output is correct
11 Correct 312 ms 318788 KB Output is correct
12 Correct 310 ms 318968 KB Output is correct
13 Correct 344 ms 318712 KB Output is correct
14 Correct 330 ms 318684 KB Output is correct
15 Correct 344 ms 318716 KB Output is correct
16 Correct 309 ms 318716 KB Output is correct
17 Correct 313 ms 318812 KB Output is correct
18 Correct 315 ms 318712 KB Output is correct
19 Correct 309 ms 318812 KB Output is correct
20 Correct 309 ms 318840 KB Output is correct
21 Correct 312 ms 318812 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 318712 KB Output is correct
2 Correct 312 ms 318840 KB Output is correct
3 Correct 309 ms 318836 KB Output is correct
4 Correct 312 ms 319076 KB Output is correct
5 Correct 309 ms 318712 KB Output is correct
6 Correct 315 ms 318844 KB Output is correct
7 Correct 310 ms 318968 KB Output is correct
8 Correct 310 ms 318712 KB Output is correct
9 Correct 315 ms 318840 KB Output is correct
10 Correct 311 ms 318928 KB Output is correct
11 Correct 312 ms 318788 KB Output is correct
12 Correct 310 ms 318968 KB Output is correct
13 Correct 344 ms 318712 KB Output is correct
14 Correct 330 ms 318684 KB Output is correct
15 Correct 344 ms 318716 KB Output is correct
16 Correct 309 ms 318716 KB Output is correct
17 Correct 313 ms 319896 KB Output is correct
18 Correct 314 ms 319800 KB Output is correct
19 Correct 311 ms 319736 KB Output is correct
20 Correct 312 ms 319308 KB Output is correct
21 Correct 314 ms 319492 KB Output is correct
22 Correct 313 ms 319592 KB Output is correct
23 Correct 313 ms 319484 KB Output is correct
24 Correct 309 ms 319248 KB Output is correct
25 Correct 313 ms 318812 KB Output is correct
26 Correct 315 ms 318712 KB Output is correct
27 Correct 309 ms 318812 KB Output is correct
28 Correct 309 ms 318840 KB Output is correct
29 Correct 312 ms 318812 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 318712 KB Output is correct
2 Correct 312 ms 318840 KB Output is correct
3 Correct 309 ms 318836 KB Output is correct
4 Correct 312 ms 319076 KB Output is correct
5 Correct 309 ms 318712 KB Output is correct
6 Correct 315 ms 318844 KB Output is correct
7 Correct 310 ms 318968 KB Output is correct
8 Correct 310 ms 318712 KB Output is correct
9 Correct 315 ms 318840 KB Output is correct
10 Correct 311 ms 318928 KB Output is correct
11 Correct 312 ms 318788 KB Output is correct
12 Correct 310 ms 318968 KB Output is correct
13 Correct 344 ms 318712 KB Output is correct
14 Correct 330 ms 318684 KB Output is correct
15 Correct 344 ms 318716 KB Output is correct
16 Correct 309 ms 318716 KB Output is correct
17 Correct 313 ms 319896 KB Output is correct
18 Correct 314 ms 319800 KB Output is correct
19 Correct 311 ms 319736 KB Output is correct
20 Correct 312 ms 319308 KB Output is correct
21 Correct 314 ms 319492 KB Output is correct
22 Correct 313 ms 319592 KB Output is correct
23 Correct 313 ms 319484 KB Output is correct
24 Correct 309 ms 319248 KB Output is correct
25 Correct 323 ms 324192 KB Output is correct
26 Correct 323 ms 324060 KB Output is correct
27 Correct 346 ms 324092 KB Output is correct
28 Correct 321 ms 321424 KB Output is correct
29 Correct 342 ms 322800 KB Output is correct
30 Correct 333 ms 323120 KB Output is correct
31 Correct 332 ms 322836 KB Output is correct
32 Correct 331 ms 322904 KB Output is correct
33 Correct 313 ms 318812 KB Output is correct
34 Correct 315 ms 318712 KB Output is correct
35 Correct 309 ms 318812 KB Output is correct
36 Correct 309 ms 318840 KB Output is correct
37 Correct 312 ms 318812 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 318712 KB Output is correct
2 Correct 312 ms 318840 KB Output is correct
3 Correct 309 ms 318836 KB Output is correct
4 Correct 312 ms 319076 KB Output is correct
5 Correct 309 ms 318712 KB Output is correct
6 Correct 315 ms 318844 KB Output is correct
7 Correct 310 ms 318968 KB Output is correct
8 Correct 310 ms 318712 KB Output is correct
9 Correct 315 ms 318840 KB Output is correct
10 Correct 311 ms 318928 KB Output is correct
11 Correct 312 ms 318788 KB Output is correct
12 Correct 310 ms 318968 KB Output is correct
13 Correct 344 ms 318712 KB Output is correct
14 Correct 330 ms 318684 KB Output is correct
15 Correct 344 ms 318716 KB Output is correct
16 Correct 309 ms 318716 KB Output is correct
17 Correct 313 ms 319896 KB Output is correct
18 Correct 314 ms 319800 KB Output is correct
19 Correct 311 ms 319736 KB Output is correct
20 Correct 312 ms 319308 KB Output is correct
21 Correct 314 ms 319492 KB Output is correct
22 Correct 313 ms 319592 KB Output is correct
23 Correct 313 ms 319484 KB Output is correct
24 Correct 309 ms 319248 KB Output is correct
25 Correct 323 ms 324192 KB Output is correct
26 Correct 323 ms 324060 KB Output is correct
27 Correct 346 ms 324092 KB Output is correct
28 Correct 321 ms 321424 KB Output is correct
29 Correct 342 ms 322800 KB Output is correct
30 Correct 333 ms 323120 KB Output is correct
31 Correct 332 ms 322836 KB Output is correct
32 Correct 331 ms 322904 KB Output is correct
33 Correct 490 ms 355724 KB Output is correct
34 Correct 504 ms 354852 KB Output is correct
35 Correct 457 ms 354664 KB Output is correct
36 Correct 420 ms 353952 KB Output is correct
37 Correct 521 ms 379972 KB Output is correct
38 Correct 519 ms 380004 KB Output is correct
39 Correct 520 ms 380828 KB Output is correct
40 Correct 503 ms 377132 KB Output is correct
41 Correct 435 ms 340300 KB Output is correct
42 Correct 487 ms 344952 KB Output is correct
43 Correct 665 ms 362588 KB Output is correct
44 Correct 663 ms 363912 KB Output is correct
45 Correct 479 ms 343412 KB Output is correct
46 Correct 476 ms 342076 KB Output is correct
47 Correct 622 ms 361140 KB Output is correct
48 Correct 624 ms 361856 KB Output is correct
49 Correct 313 ms 318812 KB Output is correct
50 Correct 315 ms 318712 KB Output is correct
51 Correct 309 ms 318812 KB Output is correct
52 Correct 309 ms 318840 KB Output is correct
53 Correct 312 ms 318812 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 319240 KB Output is correct
2 Correct 319 ms 319176 KB Output is correct
3 Correct 323 ms 318820 KB Output is correct
4 Correct 328 ms 318680 KB Output is correct
5 Correct 323 ms 318968 KB Output is correct
6 Correct 324 ms 319224 KB Output is correct
7 Correct 324 ms 319084 KB Output is correct
8 Correct 322 ms 318980 KB Output is correct
9 Correct 322 ms 318968 KB Output is correct
10 Correct 322 ms 318712 KB Output is correct
11 Correct 324 ms 318728 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 311 ms 318624 KB Output is correct
2 Correct 1180 ms 429308 KB Output is correct
3 Correct 2280 ms 551112 KB Output is correct
4 Correct 2338 ms 552080 KB Output is correct
5 Correct 2285 ms 552636 KB Output is correct
6 Correct 463 ms 359780 KB Output is correct
7 Correct 616 ms 393248 KB Output is correct
8 Correct 642 ms 396272 KB Output is correct
9 Correct 313 ms 318812 KB Output is correct
10 Correct 315 ms 318712 KB Output is correct
11 Correct 309 ms 318812 KB Output is correct
12 Correct 309 ms 318840 KB Output is correct
13 Correct 312 ms 318812 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 318712 KB Output is correct
2 Correct 312 ms 318840 KB Output is correct
3 Correct 309 ms 318836 KB Output is correct
4 Correct 312 ms 319076 KB Output is correct
5 Correct 309 ms 318712 KB Output is correct
6 Correct 315 ms 318844 KB Output is correct
7 Correct 310 ms 318968 KB Output is correct
8 Correct 310 ms 318712 KB Output is correct
9 Correct 315 ms 318840 KB Output is correct
10 Correct 311 ms 318928 KB Output is correct
11 Correct 312 ms 318788 KB Output is correct
12 Correct 310 ms 318968 KB Output is correct
13 Correct 344 ms 318712 KB Output is correct
14 Correct 330 ms 318684 KB Output is correct
15 Correct 344 ms 318716 KB Output is correct
16 Correct 309 ms 318716 KB Output is correct
17 Correct 313 ms 319896 KB Output is correct
18 Correct 314 ms 319800 KB Output is correct
19 Correct 311 ms 319736 KB Output is correct
20 Correct 312 ms 319308 KB Output is correct
21 Correct 314 ms 319492 KB Output is correct
22 Correct 313 ms 319592 KB Output is correct
23 Correct 313 ms 319484 KB Output is correct
24 Correct 309 ms 319248 KB Output is correct
25 Correct 323 ms 324192 KB Output is correct
26 Correct 323 ms 324060 KB Output is correct
27 Correct 346 ms 324092 KB Output is correct
28 Correct 321 ms 321424 KB Output is correct
29 Correct 342 ms 322800 KB Output is correct
30 Correct 333 ms 323120 KB Output is correct
31 Correct 332 ms 322836 KB Output is correct
32 Correct 331 ms 322904 KB Output is correct
33 Correct 490 ms 355724 KB Output is correct
34 Correct 504 ms 354852 KB Output is correct
35 Correct 457 ms 354664 KB Output is correct
36 Correct 420 ms 353952 KB Output is correct
37 Correct 521 ms 379972 KB Output is correct
38 Correct 519 ms 380004 KB Output is correct
39 Correct 520 ms 380828 KB Output is correct
40 Correct 503 ms 377132 KB Output is correct
41 Correct 435 ms 340300 KB Output is correct
42 Correct 487 ms 344952 KB Output is correct
43 Correct 665 ms 362588 KB Output is correct
44 Correct 663 ms 363912 KB Output is correct
45 Correct 479 ms 343412 KB Output is correct
46 Correct 476 ms 342076 KB Output is correct
47 Correct 622 ms 361140 KB Output is correct
48 Correct 624 ms 361856 KB Output is correct
49 Correct 321 ms 319240 KB Output is correct
50 Correct 319 ms 319176 KB Output is correct
51 Correct 323 ms 318820 KB Output is correct
52 Correct 328 ms 318680 KB Output is correct
53 Correct 323 ms 318968 KB Output is correct
54 Correct 324 ms 319224 KB Output is correct
55 Correct 324 ms 319084 KB Output is correct
56 Correct 322 ms 318980 KB Output is correct
57 Correct 322 ms 318968 KB Output is correct
58 Correct 322 ms 318712 KB Output is correct
59 Correct 324 ms 318728 KB Output is correct
60 Correct 311 ms 318624 KB Output is correct
61 Correct 1180 ms 429308 KB Output is correct
62 Correct 2280 ms 551112 KB Output is correct
63 Correct 2338 ms 552080 KB Output is correct
64 Correct 2285 ms 552636 KB Output is correct
65 Correct 463 ms 359780 KB Output is correct
66 Correct 616 ms 393248 KB Output is correct
67 Correct 642 ms 396272 KB Output is correct
68 Correct 3263 ms 723252 KB Output is correct
69 Correct 2633 ms 705208 KB Output is correct
70 Correct 2616 ms 705104 KB Output is correct
71 Correct 1570 ms 686940 KB Output is correct
72 Correct 3448 ms 1023960 KB Output is correct
73 Correct 3424 ms 627596 KB Output is correct
74 Correct 3586 ms 658968 KB Output is correct
75 Execution timed out 5129 ms 824952 KB Time limit exceeded
76 Halted 0 ms 0 KB -