oj.uz

Submission #207649

# Submission time Handle Problem Language Result Execution time Memory
207649 2020-03-08T09:17:59 Z ToMmyDong Rectangles (IOI19_rect) C++14
27 / 100
 243 ms 70804 KB 
#include "rect.h"
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#ifdef tmd
#define debug(...) fprintf(stderr,"%d (%s) = ",__LINE__,#__VA_ARGS__);_do(__VA_ARGS__);
template<typename T> void _do (T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do (T &&x, S &&...y) {cerr<<x<<",";_do(y...);}
template<typename IT> ostream &printRng (IT bg, IT ed, ostream &os) {
    os<<"{";
    for (IT it=bg; it!=ed; it++) {
        if (it!=bg) {
            os<<",";
        }
        os<<(*it);
    }
    return os<<"}";
}
template<typename T> ostream &operator << (ostream &os, vector<T> &vec) {
    return printRng(vec.begin(), vec.end(), os);
}
template<typename T> ostream &operator << (ostream &os, pair<T,T> &vec) {
    return os<<"{"<<vec.first<<","<<vec.second<<"}";
}
template<typename T> void pary (T bg, T ed) {
    printRng(bg,ed,cerr);
    cerr<<endl;
}
#else
#define debug(...)
#define pary(...)
#endif // tmd

const int MAXN = 202;
int h[MAXN], g[MAXN], szh, szg, n, m;
short dw[MAXN][MAXN][MAXN], ri[MAXN][MAXN][MAXN];

int bit[MAXN];

void add (int x, int y) {
    for (x++;x<MAXN;x+=-x&x) {
        bit[x] += y;
    }
}

int sqry (int x) {
    int ret = 0;
    for (x++;x>0; x-=-x&x) {
        ret += bit[x];
    }
    return ret;
}

int solve () {
    vector<pair<int,int> > qry;
    for (int i=0; i<szg; i++) {
        qry.emplace_back(g[i], i+1);
    }
    sort(qry.begin(), qry.end());
    memset(bit, 0, sizeof(bit));

    debug(qry);
    int res = 0, sum = 0;
    for (int i=szh-1; i>=0; i--) {
        res += h[i];

        add(h[i], 1);
        sum++;

        while (qry.size() && qry.back().first>=i) {
            res -= sum - sqry(qry.back().second-1);
            debug(sqry(qry.back().second-1));
            qry.pop_back();
        }

    }

    if (res) {
        pary(h, h+szh);
        pary(g, g+szg);
        debug(res)
    }

    return res;
}

vector<vector<int> > G;
void build () {
    int mx[MAXN] = {};

    for (int l=0; l<m; l++) {
        memset(mx, 0, sizeof(mx));
        for (int r=l+2; r<m; r++) {
            for (int i=0; i<n; i++) {
                mx[i] = max(mx[i], G[i][r-1]);
            }
            int lst = n;
            for (int i=n-1; i>=0; i--) {
                dw[i][l][r-1] = lst - i - 1;
                if (mx[i] >= min(G[i][l], G[i][r])) {
                    lst = i;
                }
            }
        }
    }

    for (int u=0; u<n; u++) {
        memset(mx, 0, sizeof(mx));
        for (int d=u+2; d<n; d++) {
            for (int i=0; i<m; i++) {
                mx[i] = max(mx[i], G[d-1][i]);
            }
            int lst = m;
            for (int i=m-1; i>=0; i--) {
                ri[u][i][d-1] = lst - i - 1;
                if (mx[i] >= min(G[u][i], G[d][i])) {
                    lst = i;
                }
            }
        }
    }
}

long long count_rectangles(std::vector<std::vector<int> > a) {
    G = a;
	n = a.size();
	m = a[0].size();
	build();
    ll res = 0;
    for (int i=0; i<n; i++) {
        for (int j=0; j<m; j++) {
            szh = 0, szg = 0;
            for (int k=j+1; k<m; k++) {
                h[szh++] = dw[i][j][k];
            }
            for (int k=i+1; k<n; k++) {
                g[szg++] = ri[i][j][k];
            }

            debug(i, j);
            res += solve();
        }
    }
    return res;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 1272 KB Output is correct
3 Correct 6 ms 1272 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 6 ms 1272 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 6 ms 1272 KB Output is correct
10 Correct 6 ms 1272 KB Output is correct
11 Correct 6 ms 1272 KB Output is correct
12 Correct 6 ms 1272 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 396 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 6 ms 1276 KB Output is correct
20 Correct 6 ms 888 KB Output is correct
21 Correct 5 ms 376 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 1272 KB Output is correct
3 Correct 6 ms 1272 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 6 ms 1272 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 6 ms 1272 KB Output is correct
10 Correct 6 ms 1272 KB Output is correct
11 Correct 6 ms 1272 KB Output is correct
12 Correct 6 ms 1272 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 396 KB Output is correct
17 Correct 20 ms 6008 KB Output is correct
18 Correct 20 ms 6008 KB Output is correct
19 Correct 20 ms 6008 KB Output is correct
20 Correct 21 ms 5880 KB Output is correct
21 Correct 21 ms 5880 KB Output is correct
22 Correct 22 ms 5880 KB Output is correct
23 Correct 22 ms 6008 KB Output is correct
24 Correct 12 ms 3448 KB Output is correct
25 Correct 5 ms 256 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 6 ms 1276 KB Output is correct
28 Correct 6 ms 888 KB Output is correct
29 Correct 5 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 1272 KB Output is correct
3 Correct 6 ms 1272 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 6 ms 1272 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 6 ms 1272 KB Output is correct
10 Correct 6 ms 1272 KB Output is correct
11 Correct 6 ms 1272 KB Output is correct
12 Correct 6 ms 1272 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 396 KB Output is correct
17 Correct 20 ms 6008 KB Output is correct
18 Correct 20 ms 6008 KB Output is correct
19 Correct 20 ms 6008 KB Output is correct
20 Correct 21 ms 5880 KB Output is correct
21 Correct 21 ms 5880 KB Output is correct
22 Correct 22 ms 5880 KB Output is correct
23 Correct 22 ms 6008 KB Output is correct
24 Correct 12 ms 3448 KB Output is correct
25 Correct 214 ms 32892 KB Output is correct
26 Correct 216 ms 32888 KB Output is correct
27 Correct 221 ms 32888 KB Output is correct
28 Correct 216 ms 32632 KB Output is correct
29 Correct 241 ms 32760 KB Output is correct
30 Correct 240 ms 33016 KB Output is correct
31 Correct 243 ms 33016 KB Output is correct
32 Correct 231 ms 32760 KB Output is correct
33 Correct 5 ms 256 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 6 ms 1276 KB Output is correct
36 Correct 6 ms 888 KB Output is correct
37 Correct 5 ms 376 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 1272 KB Output is correct
3 Correct 6 ms 1272 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 6 ms 1272 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 6 ms 1272 KB Output is correct
10 Correct 6 ms 1272 KB Output is correct
11 Correct 6 ms 1272 KB Output is correct
12 Correct 6 ms 1272 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 396 KB Output is correct
17 Correct 20 ms 6008 KB Output is correct
18 Correct 20 ms 6008 KB Output is correct
19 Correct 20 ms 6008 KB Output is correct
20 Correct 21 ms 5880 KB Output is correct
21 Correct 21 ms 5880 KB Output is correct
22 Correct 22 ms 5880 KB Output is correct
23 Correct 22 ms 6008 KB Output is correct
24 Correct 12 ms 3448 KB Output is correct
25 Correct 214 ms 32892 KB Output is correct
26 Correct 216 ms 32888 KB Output is correct
27 Correct 221 ms 32888 KB Output is correct
28 Correct 216 ms 32632 KB Output is correct
29 Correct 241 ms 32760 KB Output is correct
30 Correct 240 ms 33016 KB Output is correct
31 Correct 243 ms 33016 KB Output is correct
32 Correct 231 ms 32760 KB Output is correct
33 Runtime error 31 ms 14456 KB Execution killed with signal 11 (could be triggered by violating memory limits)
34 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 68 ms 4984 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Runtime error 93 ms 70804 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 5 ms 376 KB Output is correct
2 Correct 6 ms 1272 KB Output is correct
3 Correct 6 ms 1272 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 6 ms 1272 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 6 ms 1272 KB Output is correct
10 Correct 6 ms 1272 KB Output is correct
11 Correct 6 ms 1272 KB Output is correct
12 Correct 6 ms 1272 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 396 KB Output is correct
17 Correct 20 ms 6008 KB Output is correct
18 Correct 20 ms 6008 KB Output is correct
19 Correct 20 ms 6008 KB Output is correct
20 Correct 21 ms 5880 KB Output is correct
21 Correct 21 ms 5880 KB Output is correct
22 Correct 22 ms 5880 KB Output is correct
23 Correct 22 ms 6008 KB Output is correct
24 Correct 12 ms 3448 KB Output is correct
25 Correct 214 ms 32892 KB Output is correct
26 Correct 216 ms 32888 KB Output is correct
27 Correct 221 ms 32888 KB Output is correct
28 Correct 216 ms 32632 KB Output is correct
29 Correct 241 ms 32760 KB Output is correct
30 Correct 240 ms 33016 KB Output is correct
31 Correct 243 ms 33016 KB Output is correct
32 Correct 231 ms 32760 KB Output is correct
33 Runtime error 31 ms 14456 KB Execution killed with signal 11 (could be triggered by violating memory limits)
34 Halted 0 ms 0 KB -