oj.uz

Submission #219828

# Submission time Handle Problem Language Result Execution time Memory
219828 2020-04-06T13:17:19 Z VEGAnn Rectangles (IOI19_rect) C++14
49 / 100
 583 ms 54136 KB 
#include <bits/stdc++.h>
#include "rect.h"
#define all(x) x.begin(),x.end()
#define PB push_back
#define sz(x) ((int)x.size())
#define pii pair<int,int>
#define MP make_pair
#define ft first
#define sd second
using namespace std;
typedef long long ll;
const int N = 710;
const int oo = 2e9;
const int PW = 10;
vector<pii> qr;
stack<int> stk;
int n, m, kol = 0, mx, my, Mx, My, lf[N][N], rt[N][N], up[N][N], down[N][N], spar[2][N][N][PW], po[N];
int fen[N];
ll ans = 0, big = 0;

int get(int tp, int i, int l, int r){
    int len = r - l + 1;
    int pw = po[len];

    if (tp == 1)
        return min(spar[tp][i][l][pw], spar[tp][i][r - (1 << pw) + 1][pw]);
    else return max(spar[tp][i][l][pw], spar[tp][i][r - (1 << pw) + 1][pw]);
}

int upd(int x, int vl){
    for (; x < n; x = (x | (x + 1)))
        fen[x] += vl;
}

int sum(int x){
    int res = 0;
    for (; x >= 0; x = (x & (x + 1)) - 1)
        res += fen[x];
    return res;
}

long long count_rectangles(std::vector<std::vector<int> > a) {
    n = sz(a);
    m = sz(a[0]);

    if (n < 3 || m < 3) return 0;

    for (int i = 0; i < n; i++){
        while (sz(stk)) stk.pop();
        stk.push(-1);

        for (int j = 0; j < m; j++){
            while (sz(stk) > 1 && a[i][stk.top()] < a[i][j])
                stk.pop();

            lf[i][j] = stk.top();
            stk.push(j);
        }

        while (sz(stk)) stk.pop();
        stk.push(m);

        for (int j = m - 1; j >= 0; j--){
            while (sz(stk) > 1 && a[i][stk.top()] < a[i][j])
                stk.pop();

            rt[i][j] = stk.top();
            stk.push(j);
        }
    }

    for (int j = 0; j < m; j++){
        while (sz(stk)) stk.pop();
        stk.push(-1);

        for (int i = 0; i < n; i++){
            while (sz(stk) > 1 && a[stk.top()][j] < a[i][j])
                stk.pop();

            up[i][j] = stk.top();
            stk.push(i);
        }

        while (sz(stk)) stk.pop();
        stk.push(n);

        for (int i = n - 1; i >= 0; i--){
            while (sz(stk) > 1 && a[stk.top()][j] < a[i][j])
                stk.pop();

            down[i][j] = stk.top();
            stk.push(i);
        }
    }

    po[0] = -1;
    for (int i = 1; i <= max(n, m); i++)
        po[i] = po[i >> 1] + 1;

    for (int i = 1; i < n - 1; i++){
        for (int j = 0; j < m; j++){
            spar[0][i][j][0] = up[i + 1][j];
            spar[1][i][j][0] = down[i - 1][j];
        }

        for (int pw = 1; pw < PW; pw++)
        for (int j = 0; j + (1 << pw) - 1 < m; j++){
            spar[0][i][j][pw] = max(spar[0][i][j][pw - 1], spar[0][i][j + (1 << (pw - 1))][pw - 1]);
            spar[1][i][j][pw] = min(spar[1][i][j][pw - 1], spar[1][i][j + (1 << (pw - 1))][pw - 1]);
        }
    }

    for (int c1 = 1; c1 < m - 1; c1++)
    for (int c2 = c1; c2 < m - 1; c2++){

        for (int r1 = 1; r1 < n - 1; ){
            int i = r1;

            while (i < n - 1 && (rt[i][c1 - 1] > c2 && lf[i][c2 + 1] < c1))
                i++;

            qr.clear();

            for (int r2 = r1; r2 < i; r2++){
                qr.PB({get(0, r2, c1, c2), r2});

                int bd = min(n - 1, get(1, r2, c1, c2));

                qr.PB({r2, -bd});
            }

            sort(all(qr));

            for (pii cr : qr)
                if (cr.sd > 0)
                    upd(cr.sd, 1);
                else ans += sum(-cr.sd - 1) - sum(cr.ft - 1);

            for (pii cr : qr)
                if (cr.sd > 0)
                    upd(cr.sd, -1);

            r1 = i + 1;
        }
    }

	return ans;
}

Compilation message

rect.cpp: In function 'int upd(int, int)':
rect.cpp:33:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 896 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 5 ms 1024 KB Output is correct
12 Correct 5 ms 1024 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 2432 KB Output is correct
18 Correct 7 ms 2432 KB Output is correct
19 Correct 7 ms 2432 KB Output is correct
20 Correct 7 ms 2432 KB Output is correct
21 Correct 7 ms 2304 KB Output is correct
22 Correct 7 ms 2304 KB Output is correct
23 Correct 7 ms 2432 KB Output is correct
24 Correct 6 ms 2176 KB Output is correct
25 Correct 24 ms 7552 KB Output is correct
26 Correct 23 ms 7552 KB Output is correct
27 Correct 24 ms 7552 KB Output is correct
28 Correct 18 ms 7552 KB Output is correct
29 Correct 24 ms 7552 KB Output is correct
30 Correct 25 ms 7552 KB Output is correct
31 Correct 23 ms 7552 KB Output is correct
32 Correct 23 ms 7552 KB Output is correct
33 Correct 5 ms 256 KB Output is correct
34 Correct 4 ms 256 KB Output is correct
35 Correct 5 ms 1024 KB Output is correct
36 Correct 5 ms 1024 KB Output is correct
37 Correct 5 ms 384 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 896 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 5 ms 1024 KB Output is correct
12 Correct 5 ms 1024 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 2432 KB Output is correct
18 Correct 7 ms 2432 KB Output is correct
19 Correct 7 ms 2432 KB Output is correct
20 Correct 7 ms 2432 KB Output is correct
21 Correct 7 ms 2304 KB Output is correct
22 Correct 7 ms 2304 KB Output is correct
23 Correct 7 ms 2432 KB Output is correct
24 Correct 6 ms 2176 KB Output is correct
25 Correct 24 ms 7552 KB Output is correct
26 Correct 23 ms 7552 KB Output is correct
27 Correct 24 ms 7552 KB Output is correct
28 Correct 18 ms 7552 KB Output is correct
29 Correct 24 ms 7552 KB Output is correct
30 Correct 25 ms 7552 KB Output is correct
31 Correct 23 ms 7552 KB Output is correct
32 Correct 23 ms 7552 KB Output is correct
33 Correct 406 ms 50936 KB Output is correct
34 Correct 446 ms 50808 KB Output is correct
35 Correct 439 ms 50808 KB Output is correct
36 Correct 449 ms 50912 KB Output is correct
37 Correct 543 ms 50808 KB Output is correct
38 Correct 583 ms 50936 KB Output is correct
39 Correct 574 ms 50936 KB Output is correct
40 Correct 516 ms 47480 KB Output is correct
41 Correct 371 ms 50936 KB Output is correct
42 Correct 384 ms 50808 KB Output is correct
43 Correct 445 ms 50936 KB Output is correct
44 Correct 477 ms 50808 KB Output is correct
45 Correct 184 ms 34936 KB Output is correct
46 Correct 234 ms 25464 KB Output is correct
47 Correct 430 ms 50936 KB Output is correct
48 Correct 421 ms 50844 KB Output is correct
49 Correct 5 ms 256 KB Output is correct
50 Correct 4 ms 256 KB Output is correct
51 Correct 5 ms 1024 KB Output is correct
52 Correct 5 ms 1024 KB Output is correct
53 Correct 5 ms 384 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 60 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Runtime error 116 ms 54136 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 896 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 5 ms 1024 KB Output is correct
12 Correct 5 ms 1024 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 2432 KB Output is correct
18 Correct 7 ms 2432 KB Output is correct
19 Correct 7 ms 2432 KB Output is correct
20 Correct 7 ms 2432 KB Output is correct
21 Correct 7 ms 2304 KB Output is correct
22 Correct 7 ms 2304 KB Output is correct
23 Correct 7 ms 2432 KB Output is correct
24 Correct 6 ms 2176 KB Output is correct
25 Correct 24 ms 7552 KB Output is correct
26 Correct 23 ms 7552 KB Output is correct
27 Correct 24 ms 7552 KB Output is correct
28 Correct 18 ms 7552 KB Output is correct
29 Correct 24 ms 7552 KB Output is correct
30 Correct 25 ms 7552 KB Output is correct
31 Correct 23 ms 7552 KB Output is correct
32 Correct 23 ms 7552 KB Output is correct
33 Correct 406 ms 50936 KB Output is correct
34 Correct 446 ms 50808 KB Output is correct
35 Correct 439 ms 50808 KB Output is correct
36 Correct 449 ms 50912 KB Output is correct
37 Correct 543 ms 50808 KB Output is correct
38 Correct 583 ms 50936 KB Output is correct
39 Correct 574 ms 50936 KB Output is correct
40 Correct 516 ms 47480 KB Output is correct
41 Correct 371 ms 50936 KB Output is correct
42 Correct 384 ms 50808 KB Output is correct
43 Correct 445 ms 50936 KB Output is correct
44 Correct 477 ms 50808 KB Output is correct
45 Correct 184 ms 34936 KB Output is correct
46 Correct 234 ms 25464 KB Output is correct
47 Correct 430 ms 50936 KB Output is correct
48 Correct 421 ms 50844 KB Output is correct
49 Incorrect 60 ms 640 KB Output isn't correct
50 Halted 0 ms 0 KB -