oj.uz

답안 #154394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154394 2019-09-21T16:28:17 Z bruce_test Rectangles (IOI19_rect) C++14
100 / 100
 4105 ms 807804 KB 
#pragma GCC optimize "Ofast"
#pragma GCC optimize "unroll-loops"
#pragma GCC target "sse,sse2,sse3,sse4,abm,avx,mmx,popcnt,tune=native"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
typedef long long ll;
#define f first
#define s second
const int MM = 2505;
int N, M, a[MM][MM], st[MM], top, l[MM], r[MM], u[MM], d[MM], toclear[MM], cnt; ll bit[MM], ans;
vector<pi> h[MM][MM], v[MM][MM];
bool cmp(pi x, pi y){ return x.s < y.s; }
void upd(int x, int val){
    for(int i=x; i<MM; i+=i&-i) bit[i] += val;
}
ll qry(int x){
    ll sum = 0;
    for(int i=x; i; i-=i&-i) sum += bit[i];
    return sum;
}
long long count_rectangles(std::vector<std::vector<int>> x){
    N = x.size(); M = x[0].size();
    for(int i=1; i<=N; i++){
        top = 0;
        for(int j=1; j<=M; j++){
            a[i][j] = x[i-1][j-1];
            while(top > 0 && a[i][st[top]] < a[i][j]) top--;
            l[j] = st[top]; st[++top] = j;
        }
        top = 0;
        for(int j=M; j>=1; j--){
            while(top > 0 && a[i][st[top]] <= a[i][j]) top--;
            r[j] = st[top]; st[++top] = j;
            if(l[j] && r[j] && a[i][l[j]] > a[i][j]) h[i][l[j]+1].push_back({r[j]-l[j]-1, 1});
        }
    }
    for(int j=1; j<=M; j++){
        top = 0;
        for(int i=1; i<=N; i++){
            while(top > 0 && a[st[top]][j] < a[i][j]) top--;
            u[i] = st[top]; st[++top] = i;
        }
        top = 0 ;
        for(int i=N; i>=1; i--){
            while(top > 0 && a[st[top]][j] <= a[i][j]) top--;
            d[i] = st[top]; st[++top] = i;
            if(u[i] && d[i] && a[u[i]][j] > a[i][j]) v[u[i]+1][j].push_back({d[i]-u[i]-1, 1});
        }
    }
    for(int i=N; i>=1; i--){
        for(int j=M; j>=1; j--){
            if(!h[i][j].empty()){
                sort(h[i][j].begin(), h[i][j].end());
                for(int p=0, q=0; p<h[i][j].size(); p++){
                    while(q < h[i+1][j].size() && h[i+1][j][q].f < h[i][j][p].f) q++;
                    if(q < h[i+1][j].size() && h[i+1][j][q].f == h[i][j][p].f) h[i][j][p].s = h[i+1][j][q].s+1;
                }
            }
            if(!v[i][j].empty()){
                sort(v[i][j].begin(), v[i][j].end());
                for(int p=0, q=0; p<v[i][j].size(); p++){
                    while(q<v[i][j+1].size() && v[i][j+1][q].f < v[i][j][p].f) q++;
                    if(q<v[i][j+1].size() && v[i][j+1][q].f == v[i][j][p].f) v[i][j][p].s = v[i][j+1][q].s+1;
                }
            }
        }
    }
    for(int i=1; i<=N; i++){
        for(int j=1; j<=M; j++){
            if(h[i][j].empty() || v[i][j].empty()) continue;
            cnt = 0;
            sort(v[i][j].begin(), v[i][j].end(), cmp);
            for(int p=(int)h[i][j].size()-1, q=(int)v[i][j].size()-1; p>=0; p--){
                for( ;q>=0 && v[i][j][q].s >= h[i][j][p].f; q--) {
                    upd(v[i][j][q].f, 1); toclear[cnt++] = v[i][j][q].f;
                }
                ans += qry(h[i][j][p].s);
            }
            for(int p=0; p<cnt; p++) upd(toclear[p], -1);
        }
    }
    return ans;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:55:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int p=0, q=0; p<h[i][j].size(); p++){
                                   ~^~~~~~~~~~~~~~~
rect.cpp:56:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     while(q < h[i+1][j].size() && h[i+1][j][q].f < h[i][j][p].f) q++;
                           ~~^~~~~~~~~~~~~~~~~~
rect.cpp:57:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     if(q < h[i+1][j].size() && h[i+1][j][q].f == h[i][j][p].f) h[i][j][p].s = h[i+1][j][q].s+1;
                        ~~^~~~~~~~~~~~~~~~~~
rect.cpp:62:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int p=0, q=0; p<v[i][j].size(); p++){
                                   ~^~~~~~~~~~~~~~~
rect.cpp:63:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     while(q<v[i][j+1].size() && v[i][j+1][q].f < v[i][j][p].f) q++;
                           ~^~~~~~~~~~~~~~~~~
rect.cpp:64:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     if(q<v[i][j+1].size() && v[i][j+1][q].f == v[i][j][p].f) v[i][j][p].s = v[i][j+1][q].s+1;
                        ~^~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 295112 KB Output is correct
2 Correct 296 ms 295512 KB Output is correct
3 Correct 329 ms 295292 KB Output is correct
4 Correct 330 ms 295376 KB Output is correct
5 Correct 303 ms 295288 KB Output is correct
6 Correct 300 ms 295316 KB Output is correct
7 Correct 301 ms 295368 KB Output is correct
8 Correct 295 ms 295160 KB Output is correct
9 Correct 298 ms 295288 KB Output is correct
10 Correct 301 ms 295452 KB Output is correct
11 Correct 353 ms 295260 KB Output is correct
12 Correct 318 ms 295336 KB Output is correct
13 Correct 314 ms 295028 KB Output is correct
14 Correct 296 ms 295100 KB Output is correct
15 Correct 300 ms 295148 KB Output is correct
16 Correct 593 ms 295160 KB Output is correct
17 Correct 343 ms 295060 KB Output is correct
18 Correct 301 ms 295140 KB Output is correct
19 Correct 323 ms 295160 KB Output is correct
20 Correct 300 ms 295160 KB Output is correct
21 Correct 294 ms 295032 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 295112 KB Output is correct
2 Correct 296 ms 295512 KB Output is correct
3 Correct 329 ms 295292 KB Output is correct
4 Correct 330 ms 295376 KB Output is correct
5 Correct 303 ms 295288 KB Output is correct
6 Correct 300 ms 295316 KB Output is correct
7 Correct 301 ms 295368 KB Output is correct
8 Correct 295 ms 295160 KB Output is correct
9 Correct 298 ms 295288 KB Output is correct
10 Correct 301 ms 295452 KB Output is correct
11 Correct 353 ms 295260 KB Output is correct
12 Correct 318 ms 295336 KB Output is correct
13 Correct 314 ms 295028 KB Output is correct
14 Correct 296 ms 295100 KB Output is correct
15 Correct 300 ms 295148 KB Output is correct
16 Correct 593 ms 295160 KB Output is correct
17 Correct 298 ms 295880 KB Output is correct
18 Correct 297 ms 295900 KB Output is correct
19 Correct 299 ms 295928 KB Output is correct
20 Correct 299 ms 295672 KB Output is correct
21 Correct 302 ms 295736 KB Output is correct
22 Correct 317 ms 295800 KB Output is correct
23 Correct 343 ms 295824 KB Output is correct
24 Correct 321 ms 295524 KB Output is correct
25 Correct 343 ms 295060 KB Output is correct
26 Correct 301 ms 295140 KB Output is correct
27 Correct 323 ms 295160 KB Output is correct
28 Correct 300 ms 295160 KB Output is correct
29 Correct 294 ms 295032 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 295112 KB Output is correct
2 Correct 296 ms 295512 KB Output is correct
3 Correct 329 ms 295292 KB Output is correct
4 Correct 330 ms 295376 KB Output is correct
5 Correct 303 ms 295288 KB Output is correct
6 Correct 300 ms 295316 KB Output is correct
7 Correct 301 ms 295368 KB Output is correct
8 Correct 295 ms 295160 KB Output is correct
9 Correct 298 ms 295288 KB Output is correct
10 Correct 301 ms 295452 KB Output is correct
11 Correct 353 ms 295260 KB Output is correct
12 Correct 318 ms 295336 KB Output is correct
13 Correct 314 ms 295028 KB Output is correct
14 Correct 296 ms 295100 KB Output is correct
15 Correct 300 ms 295148 KB Output is correct
16 Correct 593 ms 295160 KB Output is correct
17 Correct 298 ms 295880 KB Output is correct
18 Correct 297 ms 295900 KB Output is correct
19 Correct 299 ms 295928 KB Output is correct
20 Correct 299 ms 295672 KB Output is correct
21 Correct 302 ms 295736 KB Output is correct
22 Correct 317 ms 295800 KB Output is correct
23 Correct 343 ms 295824 KB Output is correct
24 Correct 321 ms 295524 KB Output is correct
25 Correct 367 ms 299100 KB Output is correct
26 Correct 313 ms 299128 KB Output is correct
27 Correct 335 ms 299188 KB Output is correct
28 Correct 311 ms 297216 KB Output is correct
29 Correct 400 ms 297988 KB Output is correct
30 Correct 373 ms 298100 KB Output is correct
31 Correct 344 ms 297968 KB Output is correct
32 Correct 311 ms 297976 KB Output is correct
33 Correct 343 ms 295060 KB Output is correct
34 Correct 301 ms 295140 KB Output is correct
35 Correct 323 ms 295160 KB Output is correct
36 Correct 300 ms 295160 KB Output is correct
37 Correct 294 ms 295032 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 295112 KB Output is correct
2 Correct 296 ms 295512 KB Output is correct
3 Correct 329 ms 295292 KB Output is correct
4 Correct 330 ms 295376 KB Output is correct
5 Correct 303 ms 295288 KB Output is correct
6 Correct 300 ms 295316 KB Output is correct
7 Correct 301 ms 295368 KB Output is correct
8 Correct 295 ms 295160 KB Output is correct
9 Correct 298 ms 295288 KB Output is correct
10 Correct 301 ms 295452 KB Output is correct
11 Correct 353 ms 295260 KB Output is correct
12 Correct 318 ms 295336 KB Output is correct
13 Correct 314 ms 295028 KB Output is correct
14 Correct 296 ms 295100 KB Output is correct
15 Correct 300 ms 295148 KB Output is correct
16 Correct 593 ms 295160 KB Output is correct
17 Correct 298 ms 295880 KB Output is correct
18 Correct 297 ms 295900 KB Output is correct
19 Correct 299 ms 295928 KB Output is correct
20 Correct 299 ms 295672 KB Output is correct
21 Correct 302 ms 295736 KB Output is correct
22 Correct 317 ms 295800 KB Output is correct
23 Correct 343 ms 295824 KB Output is correct
24 Correct 321 ms 295524 KB Output is correct
25 Correct 367 ms 299100 KB Output is correct
26 Correct 313 ms 299128 KB Output is correct
27 Correct 335 ms 299188 KB Output is correct
28 Correct 311 ms 297216 KB Output is correct
29 Correct 400 ms 297988 KB Output is correct
30 Correct 373 ms 298100 KB Output is correct
31 Correct 344 ms 297968 KB Output is correct
32 Correct 311 ms 297976 KB Output is correct
33 Correct 420 ms 322196 KB Output is correct
34 Correct 404 ms 317336 KB Output is correct
35 Correct 385 ms 317344 KB Output is correct
36 Correct 391 ms 312568 KB Output is correct
37 Correct 516 ms 337692 KB Output is correct
38 Correct 513 ms 337524 KB Output is correct
39 Correct 528 ms 337832 KB Output is correct
40 Correct 501 ms 335224 KB Output is correct
41 Correct 399 ms 312284 KB Output is correct
42 Correct 434 ms 314900 KB Output is correct
43 Correct 521 ms 323488 KB Output is correct
44 Correct 553 ms 325660 KB Output is correct
45 Correct 478 ms 311644 KB Output is correct
46 Correct 401 ms 310192 KB Output is correct
47 Correct 583 ms 323192 KB Output is correct
48 Correct 553 ms 324088 KB Output is correct
49 Correct 343 ms 295060 KB Output is correct
50 Correct 301 ms 295140 KB Output is correct
51 Correct 323 ms 295160 KB Output is correct
52 Correct 300 ms 295160 KB Output is correct
53 Correct 294 ms 295032 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 295704 KB Output is correct
2 Correct 297 ms 295416 KB Output is correct
3 Correct 302 ms 295388 KB Output is correct
4 Correct 298 ms 295004 KB Output is correct
5 Correct 338 ms 295468 KB Output is correct
6 Correct 299 ms 295432 KB Output is correct
7 Correct 301 ms 295416 KB Output is correct
8 Correct 299 ms 295348 KB Output is correct
9 Correct 295 ms 295416 KB Output is correct
10 Correct 297 ms 295160 KB Output is correct
11 Correct 305 ms 295328 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 299 ms 295144 KB Output is correct
2 Correct 866 ms 380112 KB Output is correct
3 Correct 1612 ms 477708 KB Output is correct
4 Correct 1661 ms 478708 KB Output is correct
5 Correct 1777 ms 478856 KB Output is correct
6 Correct 441 ms 337604 KB Output is correct
7 Correct 597 ms 377208 KB Output is correct
8 Correct 617 ms 381008 KB Output is correct
9 Correct 343 ms 295060 KB Output is correct
10 Correct 301 ms 295140 KB Output is correct
11 Correct 323 ms 295160 KB Output is correct
12 Correct 300 ms 295160 KB Output is correct
13 Correct 294 ms 295032 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 295112 KB Output is correct
2 Correct 296 ms 295512 KB Output is correct
3 Correct 329 ms 295292 KB Output is correct
4 Correct 330 ms 295376 KB Output is correct
5 Correct 303 ms 295288 KB Output is correct
6 Correct 300 ms 295316 KB Output is correct
7 Correct 301 ms 295368 KB Output is correct
8 Correct 295 ms 295160 KB Output is correct
9 Correct 298 ms 295288 KB Output is correct
10 Correct 301 ms 295452 KB Output is correct
11 Correct 353 ms 295260 KB Output is correct
12 Correct 318 ms 295336 KB Output is correct
13 Correct 314 ms 295028 KB Output is correct
14 Correct 296 ms 295100 KB Output is correct
15 Correct 300 ms 295148 KB Output is correct
16 Correct 593 ms 295160 KB Output is correct
17 Correct 298 ms 295880 KB Output is correct
18 Correct 297 ms 295900 KB Output is correct
19 Correct 299 ms 295928 KB Output is correct
20 Correct 299 ms 295672 KB Output is correct
21 Correct 302 ms 295736 KB Output is correct
22 Correct 317 ms 295800 KB Output is correct
23 Correct 343 ms 295824 KB Output is correct
24 Correct 321 ms 295524 KB Output is correct
25 Correct 367 ms 299100 KB Output is correct
26 Correct 313 ms 299128 KB Output is correct
27 Correct 335 ms 299188 KB Output is correct
28 Correct 311 ms 297216 KB Output is correct
29 Correct 400 ms 297988 KB Output is correct
30 Correct 373 ms 298100 KB Output is correct
31 Correct 344 ms 297968 KB Output is correct
32 Correct 311 ms 297976 KB Output is correct
33 Correct 420 ms 322196 KB Output is correct
34 Correct 404 ms 317336 KB Output is correct
35 Correct 385 ms 317344 KB Output is correct
36 Correct 391 ms 312568 KB Output is correct
37 Correct 516 ms 337692 KB Output is correct
38 Correct 513 ms 337524 KB Output is correct
39 Correct 528 ms 337832 KB Output is correct
40 Correct 501 ms 335224 KB Output is correct
41 Correct 399 ms 312284 KB Output is correct
42 Correct 434 ms 314900 KB Output is correct
43 Correct 521 ms 323488 KB Output is correct
44 Correct 553 ms 325660 KB Output is correct
45 Correct 478 ms 311644 KB Output is correct
46 Correct 401 ms 310192 KB Output is correct
47 Correct 583 ms 323192 KB Output is correct
48 Correct 553 ms 324088 KB Output is correct
49 Correct 324 ms 295704 KB Output is correct
50 Correct 297 ms 295416 KB Output is correct
51 Correct 302 ms 295388 KB Output is correct
52 Correct 298 ms 295004 KB Output is correct
53 Correct 338 ms 295468 KB Output is correct
54 Correct 299 ms 295432 KB Output is correct
55 Correct 301 ms 295416 KB Output is correct
56 Correct 299 ms 295348 KB Output is correct
57 Correct 295 ms 295416 KB Output is correct
58 Correct 297 ms 295160 KB Output is correct
59 Correct 305 ms 295328 KB Output is correct
60 Correct 299 ms 295144 KB Output is correct
61 Correct 866 ms 380112 KB Output is correct
62 Correct 1612 ms 477708 KB Output is correct
63 Correct 1661 ms 478708 KB Output is correct
64 Correct 1777 ms 478856 KB Output is correct
65 Correct 441 ms 337604 KB Output is correct
66 Correct 597 ms 377208 KB Output is correct
67 Correct 617 ms 381008 KB Output is correct
68 Correct 1784 ms 610864 KB Output is correct
69 Correct 1954 ms 544036 KB Output is correct
70 Correct 1523 ms 543980 KB Output is correct
71 Correct 1412 ms 476856 KB Output is correct
72 Correct 4078 ms 807692 KB Output is correct
73 Correct 2036 ms 491368 KB Output is correct
74 Correct 2176 ms 519660 KB Output is correct
75 Correct 3505 ms 622400 KB Output is correct
76 Correct 2232 ms 507724 KB Output is correct
77 Correct 2791 ms 583640 KB Output is correct
78 Correct 3533 ms 649744 KB Output is correct
79 Correct 2037 ms 489824 KB Output is correct
80 Correct 3329 ms 633584 KB Output is correct
81 Correct 3430 ms 623284 KB Output is correct
82 Correct 2284 ms 612440 KB Output is correct
83 Correct 4034 ms 807240 KB Output is correct
84 Correct 4105 ms 807700 KB Output is correct
85 Correct 3966 ms 807804 KB Output is correct
86 Correct 343 ms 295060 KB Output is correct
87 Correct 301 ms 295140 KB Output is correct
88 Correct 323 ms 295160 KB Output is correct
89 Correct 300 ms 295160 KB Output is correct
90 Correct 294 ms 295032 KB Output is correct