oj.uz

Submission #274199

# Submission time Handle Problem Language Result Execution time Memory
274199 2020-08-19T09:41:04 Z ne4eHbKa Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 490108 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

#define ft first
#define sd second
#define _ <<' '<<

void* MEM = malloc(600 << 20);

void* operator new(const size_t f) {
    void* res = MEM;
    MEM += f;
    return res;
}

void operator delete(void*) {}

#pragma GCC optimize("Ofast,O3")

namespace S {

//#include <ext/pb_ds/assoc_container.hpp>

//typedef __gnu_pbds::cc_hash_table<int, int> ht;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vv;
typedef pair<int, int> pii;

const int N = 2505;

int n, m;
forward_list<short> l[N][N], u[N][N];
int p[N], length[N], la[N];
map<int, int> fl[N], cl, fu, cu;
bool mk[N];
int c[2 * N], cn, xn, yn, rc[2 * N];
pii x[N], y[N];
int f[N], fn;

int fw[2 * N], fmax;
inline void finit(const int n) { fmax = n; memset(fw, 0, n + 1 << 2); }
inline void fadd(int i) { for(i = fmax - i; i <= fmax; i += i & -i) fw[i]++; }
inline int fget(int i) { int v{}; for(i = fmax - i; i; i -= i & -i) v += fw[i]; return v; }

inline int get(const map<int, int> &a, const int &b) {
    const auto f = a.find(b);
    if(f == a.end()) return 0;
    return f->sd;
}

ll solve() {
    ll ans = 0;
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < m; ++j) {
            swap(cl, fl[j]);
            for(const int &t : l[i][j])
                fl[j][t] = get(cl, t) + 1;
            cl.clear();
            swap(cu, fu);
            for(const int &t : u[i][j])
                fu[t] = get(cu, t) + 1;
            cu.clear();
            const auto &a = fl[j], &b = fu;
//            if(a.size() * b.size() < 5) {
//                for(const auto &i : a)
//                    for(const auto &j : b)
//                        ans += i.ft <= j.sd && j.ft <= i.sd;
//                continue;
//            }
            cn = 0;
            for(const auto &i : a) c[cn++] = i.ft;
            for(const auto &i : b) c[cn++] = i.sd;
            sort(c, c + cn);
            cn = unique(c, c + cn) - c;
            xn = yn = 0;
            finit(cn);
            for(int i = 0; i < cn; ++i) rc[c[i]] = i;
            for(const auto &i : a) x[xn++] = {i.sd, rc[i.ft]};
            for(const auto &i : b) y[yn++] = {i.ft, rc[i.sd]};
            sort(x, x + xn);
            sort(y, y + yn);
            int it = 0;
            for(int i = 0; i < xn; ++i) {
                for(; it < yn && y[it].ft <= x[i].ft; ++it)
                    fadd(y[it].sd);
                ans += fget(x[i].sd);
            }
        }
        fu.clear();
    }
    return ans;
}

int last(int i) {
    return la[i] == i ? i : la[i] = last(la[i]);
}

void unite(int i, int j) {
    i = last(i), j = last(j);
    length[j] += length[i];
    la[i] = j;
}

}

S::ll count_rectangles(S::vv a) {
    using namespace S;
    n = a.size();
    m = a[0].size();
    for(int i = 0; i < n; ++i) {
        iota(p, p + m, 0);
        iota(la, la + m, 0);
        memset(mk, 0, m);
        sort(p, p + m, [&] (const int &fi, const int &se) {return a[i][fi] < a[i][se];});
        for(int t = 0; t < m; ) {
            int v = a[i][p[t]];
            fn = 0;
            for(; t < m && a[i][p[t]] == v; ++t) {
                int j = p[t];
                mk[j] = true;
                length[j] = 1;
                f[fn++] = j;
                if(j + 1 < m && mk[j + 1]) unite(j, j + 1);
                if(j && mk[j - 1]) unite(j - 1, j);
            }
            for(int it = 0; it < fn; ++it) mk[f[it] = last(f[it])] = false;
            for(int it = 0; it < fn; ++it) {
                int j = f[it];
                if(mk[j]) continue;
                mk[j] = true;
                if(i == 0 || i == n - 1) continue;
                if(j == m - 1 || length[j] == j + 1) continue;
                l[i][j].push_front(length[j]);
            }
        }
    }
    for(int j = 0; j < m; ++j) {
        iota(p, p + n, 0);
        iota(la, la + n, 0);
        memset(mk, 0, n);
        sort(p, p + n, [&] (const int &fi, const int &se) {return a[fi][j] < a[se][j];});
        for(int t = 0; t < n; ) {
            int v = a[p[t]][j];
            fn = 0;
            for(; t < n && a[p[t]][j] == v; ++t) {
                int i = p[t];
                mk[i] = true;
                length[i] = 1;
                f[fn++] = i;
                if(i + 1 < n && mk[i + 1]) unite(i, i + 1);
                if(i && mk[i - 1]) unite(i - 1, i);
            }
            for(int it = 0; it < fn; ++it) mk[f[it] = last(f[it])] = false;
            for(int it = 0; it < fn; ++it) {
                int i = f[it];
                if(mk[i]) continue;
                mk[i] = true;
                if(j == 0 || j == m - 1) continue;
                if(i == n - 1 || length[i] == i + 1) continue;
                u[i][j].push_front(length[i]);
            }
        }
    }
    return solve();
}

#undef ft
#undef sd
#undef _

Compilation message

rect.cpp: In function 'void* operator new(size_t)':
rect.cpp:13:9: warning: pointer of type 'void *' used in arithmetic [-Wpointer-arith]
   13 |     MEM += f;
      |     ~~~~^~~~
rect.cpp: In function 'void S::finit(int)':
rect.cpp:43:60: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   43 | inline void finit(const int n) { fmax = n; memset(fw, 0, n + 1 << 2); }
      |                                                          ~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 98680 KB Output is correct
2 Correct 79 ms 98808 KB Output is correct
3 Correct 81 ms 98808 KB Output is correct
4 Correct 83 ms 98808 KB Output is correct
5 Correct 84 ms 98680 KB Output is correct
6 Correct 81 ms 98808 KB Output is correct
7 Correct 81 ms 98680 KB Output is correct
8 Correct 85 ms 98680 KB Output is correct
9 Correct 82 ms 98716 KB Output is correct
10 Correct 81 ms 98808 KB Output is correct
11 Correct 80 ms 98760 KB Output is correct
12 Correct 83 ms 98760 KB Output is correct
13 Correct 82 ms 98680 KB Output is correct
14 Correct 88 ms 98712 KB Output is correct
15 Correct 80 ms 98808 KB Output is correct
16 Correct 82 ms 98680 KB Output is correct
17 Correct 81 ms 98700 KB Output is correct
18 Correct 81 ms 98636 KB Output is correct
19 Correct 84 ms 98740 KB Output is correct
20 Correct 80 ms 98636 KB Output is correct
21 Correct 82 ms 98728 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 98680 KB Output is correct
2 Correct 79 ms 98808 KB Output is correct
3 Correct 81 ms 98808 KB Output is correct
4 Correct 83 ms 98808 KB Output is correct
5 Correct 84 ms 98680 KB Output is correct
6 Correct 81 ms 98808 KB Output is correct
7 Correct 81 ms 98680 KB Output is correct
8 Correct 85 ms 98680 KB Output is correct
9 Correct 82 ms 98716 KB Output is correct
10 Correct 81 ms 98808 KB Output is correct
11 Correct 80 ms 98760 KB Output is correct
12 Correct 83 ms 98760 KB Output is correct
13 Correct 82 ms 98680 KB Output is correct
14 Correct 88 ms 98712 KB Output is correct
15 Correct 80 ms 98808 KB Output is correct
16 Correct 82 ms 98680 KB Output is correct
17 Correct 86 ms 99448 KB Output is correct
18 Correct 84 ms 99488 KB Output is correct
19 Correct 91 ms 99448 KB Output is correct
20 Correct 85 ms 99064 KB Output is correct
21 Correct 85 ms 99320 KB Output is correct
22 Correct 85 ms 99320 KB Output is correct
23 Correct 91 ms 99320 KB Output is correct
24 Correct 100 ms 98936 KB Output is correct
25 Correct 81 ms 98700 KB Output is correct
26 Correct 81 ms 98636 KB Output is correct
27 Correct 84 ms 98740 KB Output is correct
28 Correct 80 ms 98636 KB Output is correct
29 Correct 82 ms 98728 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 98680 KB Output is correct
2 Correct 79 ms 98808 KB Output is correct
3 Correct 81 ms 98808 KB Output is correct
4 Correct 83 ms 98808 KB Output is correct
5 Correct 84 ms 98680 KB Output is correct
6 Correct 81 ms 98808 KB Output is correct
7 Correct 81 ms 98680 KB Output is correct
8 Correct 85 ms 98680 KB Output is correct
9 Correct 82 ms 98716 KB Output is correct
10 Correct 81 ms 98808 KB Output is correct
11 Correct 80 ms 98760 KB Output is correct
12 Correct 83 ms 98760 KB Output is correct
13 Correct 82 ms 98680 KB Output is correct
14 Correct 88 ms 98712 KB Output is correct
15 Correct 80 ms 98808 KB Output is correct
16 Correct 82 ms 98680 KB Output is correct
17 Correct 86 ms 99448 KB Output is correct
18 Correct 84 ms 99488 KB Output is correct
19 Correct 91 ms 99448 KB Output is correct
20 Correct 85 ms 99064 KB Output is correct
21 Correct 85 ms 99320 KB Output is correct
22 Correct 85 ms 99320 KB Output is correct
23 Correct 91 ms 99320 KB Output is correct
24 Correct 100 ms 98936 KB Output is correct
25 Correct 102 ms 103288 KB Output is correct
26 Correct 105 ms 103292 KB Output is correct
27 Correct 115 ms 103288 KB Output is correct
28 Correct 97 ms 100728 KB Output is correct
29 Correct 101 ms 103032 KB Output is correct
30 Correct 102 ms 103160 KB Output is correct
31 Correct 101 ms 103032 KB Output is correct
32 Correct 99 ms 102904 KB Output is correct
33 Correct 81 ms 98700 KB Output is correct
34 Correct 81 ms 98636 KB Output is correct
35 Correct 84 ms 98740 KB Output is correct
36 Correct 80 ms 98636 KB Output is correct
37 Correct 82 ms 98728 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 98680 KB Output is correct
2 Correct 79 ms 98808 KB Output is correct
3 Correct 81 ms 98808 KB Output is correct
4 Correct 83 ms 98808 KB Output is correct
5 Correct 84 ms 98680 KB Output is correct
6 Correct 81 ms 98808 KB Output is correct
7 Correct 81 ms 98680 KB Output is correct
8 Correct 85 ms 98680 KB Output is correct
9 Correct 82 ms 98716 KB Output is correct
10 Correct 81 ms 98808 KB Output is correct
11 Correct 80 ms 98760 KB Output is correct
12 Correct 83 ms 98760 KB Output is correct
13 Correct 82 ms 98680 KB Output is correct
14 Correct 88 ms 98712 KB Output is correct
15 Correct 80 ms 98808 KB Output is correct
16 Correct 82 ms 98680 KB Output is correct
17 Correct 86 ms 99448 KB Output is correct
18 Correct 84 ms 99488 KB Output is correct
19 Correct 91 ms 99448 KB Output is correct
20 Correct 85 ms 99064 KB Output is correct
21 Correct 85 ms 99320 KB Output is correct
22 Correct 85 ms 99320 KB Output is correct
23 Correct 91 ms 99320 KB Output is correct
24 Correct 100 ms 98936 KB Output is correct
25 Correct 102 ms 103288 KB Output is correct
26 Correct 105 ms 103292 KB Output is correct
27 Correct 115 ms 103288 KB Output is correct
28 Correct 97 ms 100728 KB Output is correct
29 Correct 101 ms 103032 KB Output is correct
30 Correct 102 ms 103160 KB Output is correct
31 Correct 101 ms 103032 KB Output is correct
32 Correct 99 ms 102904 KB Output is correct
33 Correct 276 ms 129400 KB Output is correct
34 Correct 243 ms 129400 KB Output is correct
35 Correct 256 ms 129400 KB Output is correct
36 Correct 226 ms 129272 KB Output is correct
37 Correct 431 ms 156024 KB Output is correct
38 Correct 430 ms 155896 KB Output is correct
39 Correct 434 ms 156024 KB Output is correct
40 Correct 430 ms 152440 KB Output is correct
41 Correct 202 ms 115960 KB Output is correct
42 Correct 233 ms 123256 KB Output is correct
43 Correct 430 ms 154616 KB Output is correct
44 Correct 432 ms 155128 KB Output is correct
45 Correct 244 ms 126712 KB Output is correct
46 Correct 251 ms 126844 KB Output is correct
47 Correct 413 ms 150776 KB Output is correct
48 Correct 409 ms 150880 KB Output is correct
49 Correct 81 ms 98700 KB Output is correct
50 Correct 81 ms 98636 KB Output is correct
51 Correct 84 ms 98740 KB Output is correct
52 Correct 80 ms 98636 KB Output is correct
53 Correct 82 ms 98728 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 99060 KB Output is correct
2 Correct 83 ms 99064 KB Output is correct
3 Correct 89 ms 98808 KB Output is correct
4 Correct 79 ms 98680 KB Output is correct
5 Correct 80 ms 98952 KB Output is correct
6 Correct 81 ms 99064 KB Output is correct
7 Correct 80 ms 99064 KB Output is correct
8 Correct 87 ms 98936 KB Output is correct
9 Correct 86 ms 98936 KB Output is correct
10 Correct 82 ms 98680 KB Output is correct
11 Correct 80 ms 98708 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 98900 KB Output is correct
2 Correct 949 ms 199716 KB Output is correct
3 Correct 2048 ms 317500 KB Output is correct
4 Correct 2069 ms 318516 KB Output is correct
5 Correct 2051 ms 318864 KB Output is correct
6 Correct 589 ms 123000 KB Output is correct
7 Correct 1281 ms 144760 KB Output is correct
8 Correct 1327 ms 147832 KB Output is correct
9 Correct 81 ms 98700 KB Output is correct
10 Correct 81 ms 98636 KB Output is correct
11 Correct 84 ms 98740 KB Output is correct
12 Correct 80 ms 98636 KB Output is correct
13 Correct 82 ms 98728 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 98680 KB Output is correct
2 Correct 79 ms 98808 KB Output is correct
3 Correct 81 ms 98808 KB Output is correct
4 Correct 83 ms 98808 KB Output is correct
5 Correct 84 ms 98680 KB Output is correct
6 Correct 81 ms 98808 KB Output is correct
7 Correct 81 ms 98680 KB Output is correct
8 Correct 85 ms 98680 KB Output is correct
9 Correct 82 ms 98716 KB Output is correct
10 Correct 81 ms 98808 KB Output is correct
11 Correct 80 ms 98760 KB Output is correct
12 Correct 83 ms 98760 KB Output is correct
13 Correct 82 ms 98680 KB Output is correct
14 Correct 88 ms 98712 KB Output is correct
15 Correct 80 ms 98808 KB Output is correct
16 Correct 82 ms 98680 KB Output is correct
17 Correct 86 ms 99448 KB Output is correct
18 Correct 84 ms 99488 KB Output is correct
19 Correct 91 ms 99448 KB Output is correct
20 Correct 85 ms 99064 KB Output is correct
21 Correct 85 ms 99320 KB Output is correct
22 Correct 85 ms 99320 KB Output is correct
23 Correct 91 ms 99320 KB Output is correct
24 Correct 100 ms 98936 KB Output is correct
25 Correct 102 ms 103288 KB Output is correct
26 Correct 105 ms 103292 KB Output is correct
27 Correct 115 ms 103288 KB Output is correct
28 Correct 97 ms 100728 KB Output is correct
29 Correct 101 ms 103032 KB Output is correct
30 Correct 102 ms 103160 KB Output is correct
31 Correct 101 ms 103032 KB Output is correct
32 Correct 99 ms 102904 KB Output is correct
33 Correct 276 ms 129400 KB Output is correct
34 Correct 243 ms 129400 KB Output is correct
35 Correct 256 ms 129400 KB Output is correct
36 Correct 226 ms 129272 KB Output is correct
37 Correct 431 ms 156024 KB Output is correct
38 Correct 430 ms 155896 KB Output is correct
39 Correct 434 ms 156024 KB Output is correct
40 Correct 430 ms 152440 KB Output is correct
41 Correct 202 ms 115960 KB Output is correct
42 Correct 233 ms 123256 KB Output is correct
43 Correct 430 ms 154616 KB Output is correct
44 Correct 432 ms 155128 KB Output is correct
45 Correct 244 ms 126712 KB Output is correct
46 Correct 251 ms 126844 KB Output is correct
47 Correct 413 ms 150776 KB Output is correct
48 Correct 409 ms 150880 KB Output is correct
49 Correct 86 ms 99060 KB Output is correct
50 Correct 83 ms 99064 KB Output is correct
51 Correct 89 ms 98808 KB Output is correct
52 Correct 79 ms 98680 KB Output is correct
53 Correct 80 ms 98952 KB Output is correct
54 Correct 81 ms 99064 KB Output is correct
55 Correct 80 ms 99064 KB Output is correct
56 Correct 87 ms 98936 KB Output is correct
57 Correct 86 ms 98936 KB Output is correct
58 Correct 82 ms 98680 KB Output is correct
59 Correct 80 ms 98708 KB Output is correct
60 Correct 84 ms 98900 KB Output is correct
61 Correct 949 ms 199716 KB Output is correct
62 Correct 2048 ms 317500 KB Output is correct
63 Correct 2069 ms 318516 KB Output is correct
64 Correct 2051 ms 318864 KB Output is correct
65 Correct 589 ms 123000 KB Output is correct
66 Correct 1281 ms 144760 KB Output is correct
67 Correct 1327 ms 147832 KB Output is correct
68 Correct 3645 ms 490076 KB Output is correct
69 Correct 3157 ms 489984 KB Output is correct
70 Correct 3329 ms 490108 KB Output is correct
71 Correct 2658 ms 489956 KB Output is correct
72 Execution timed out 5076 ms 450100 KB Time limit exceeded
73 Halted 0 ms 0 KB -