oj.uz

답안 #273954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
273954 2020-08-19T07:59:24 Z ne4eHbKa Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 540912 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

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

#pragma GCC optimize("Ofast,O3")

namespace S {

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vv;

const int N = 2505;

int n, m;
list<int> l[N][N], u[N][N];
int p[N], length[N], la[N];
map<int, int> fl[N];
vector<bool> mk;

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

ll solve() {
    ll ans = 0;
    map<int, int> cl, fu, cu;
    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();
            for(const auto &a : fl[j]) {
                for(const auto &b : fu) {
                    if(a.ft <= b.sd && b.ft <= a.sd)
                        ++ans;
                }
            }
        }
        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);
        mk.assign(m, false);
        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]];
            list<int> f;
            for(; t < m && a[i][p[t]] == v; ++t) {
                int j = p[t];
                mk[j] = true;
                length[j] = 1;
                f.push_back(j);
                if(j + 1 < m && mk[j + 1]) unite(j, j + 1);
                if(j && mk[j - 1]) unite(j - 1, j);
            }
            for(int i : f) mk[last(i)] = false;
            for(int j : f) {
                j = last(j);
                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_back(length[j]);
            }
        }
    }
    for(int j = 0; j < m; ++j) {
        iota(p, p + n, 0);
        iota(la, la + n, 0);
        mk.assign(n, false);
        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];
            list<int> f;
            for(; t < n && a[p[t]][j] == v; ++t) {
                int i = p[t];
                mk[i] = true;
                length[i] = 1;
                f.push_back(i);
                if(i + 1 < n && mk[i + 1]) unite(i, i + 1);
                if(i && mk[i - 1]) unite(i - 1, i);
            }
            for(int j : f) mk[last(j)] = false;
            for(int i : f) {
                i = last(i);
                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_back(length[i]);
            }
        }
    }
    return solve();
}

#undef ft
#undef sd
#undef _

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 295092 KB Output is correct
2 Correct 200 ms 295276 KB Output is correct
3 Correct 196 ms 295232 KB Output is correct
4 Correct 186 ms 295160 KB Output is correct
5 Correct 196 ms 295160 KB Output is correct
6 Correct 187 ms 295160 KB Output is correct
7 Correct 195 ms 295160 KB Output is correct
8 Correct 194 ms 295152 KB Output is correct
9 Correct 200 ms 295288 KB Output is correct
10 Correct 209 ms 295160 KB Output is correct
11 Correct 198 ms 295160 KB Output is correct
12 Correct 205 ms 295160 KB Output is correct
13 Correct 206 ms 295160 KB Output is correct
14 Correct 191 ms 295160 KB Output is correct
15 Correct 200 ms 295160 KB Output is correct
16 Correct 192 ms 295164 KB Output is correct
17 Correct 205 ms 295160 KB Output is correct
18 Correct 221 ms 295160 KB Output is correct
19 Correct 205 ms 295160 KB Output is correct
20 Correct 203 ms 295160 KB Output is correct
21 Correct 202 ms 295108 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 295092 KB Output is correct
2 Correct 200 ms 295276 KB Output is correct
3 Correct 196 ms 295232 KB Output is correct
4 Correct 186 ms 295160 KB Output is correct
5 Correct 196 ms 295160 KB Output is correct
6 Correct 187 ms 295160 KB Output is correct
7 Correct 195 ms 295160 KB Output is correct
8 Correct 194 ms 295152 KB Output is correct
9 Correct 200 ms 295288 KB Output is correct
10 Correct 209 ms 295160 KB Output is correct
11 Correct 198 ms 295160 KB Output is correct
12 Correct 205 ms 295160 KB Output is correct
13 Correct 206 ms 295160 KB Output is correct
14 Correct 191 ms 295160 KB Output is correct
15 Correct 200 ms 295160 KB Output is correct
16 Correct 192 ms 295164 KB Output is correct
17 Correct 227 ms 295632 KB Output is correct
18 Correct 195 ms 295544 KB Output is correct
19 Correct 212 ms 295560 KB Output is correct
20 Correct 242 ms 295416 KB Output is correct
21 Correct 193 ms 295544 KB Output is correct
22 Correct 196 ms 295532 KB Output is correct
23 Correct 194 ms 295628 KB Output is correct
24 Correct 202 ms 295288 KB Output is correct
25 Correct 205 ms 295160 KB Output is correct
26 Correct 221 ms 295160 KB Output is correct
27 Correct 205 ms 295160 KB Output is correct
28 Correct 203 ms 295160 KB Output is correct
29 Correct 202 ms 295108 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 295092 KB Output is correct
2 Correct 200 ms 295276 KB Output is correct
3 Correct 196 ms 295232 KB Output is correct
4 Correct 186 ms 295160 KB Output is correct
5 Correct 196 ms 295160 KB Output is correct
6 Correct 187 ms 295160 KB Output is correct
7 Correct 195 ms 295160 KB Output is correct
8 Correct 194 ms 295152 KB Output is correct
9 Correct 200 ms 295288 KB Output is correct
10 Correct 209 ms 295160 KB Output is correct
11 Correct 198 ms 295160 KB Output is correct
12 Correct 205 ms 295160 KB Output is correct
13 Correct 206 ms 295160 KB Output is correct
14 Correct 191 ms 295160 KB Output is correct
15 Correct 200 ms 295160 KB Output is correct
16 Correct 192 ms 295164 KB Output is correct
17 Correct 227 ms 295632 KB Output is correct
18 Correct 195 ms 295544 KB Output is correct
19 Correct 212 ms 295560 KB Output is correct
20 Correct 242 ms 295416 KB Output is correct
21 Correct 193 ms 295544 KB Output is correct
22 Correct 196 ms 295532 KB Output is correct
23 Correct 194 ms 295628 KB Output is correct
24 Correct 202 ms 295288 KB Output is correct
25 Correct 223 ms 297976 KB Output is correct
26 Correct 254 ms 298000 KB Output is correct
27 Correct 227 ms 298096 KB Output is correct
28 Correct 210 ms 296440 KB Output is correct
29 Correct 223 ms 297848 KB Output is correct
30 Correct 233 ms 297848 KB Output is correct
31 Correct 275 ms 297720 KB Output is correct
32 Correct 233 ms 297592 KB Output is correct
33 Correct 205 ms 295160 KB Output is correct
34 Correct 221 ms 295160 KB Output is correct
35 Correct 205 ms 295160 KB Output is correct
36 Correct 203 ms 295160 KB Output is correct
37 Correct 202 ms 295108 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 295092 KB Output is correct
2 Correct 200 ms 295276 KB Output is correct
3 Correct 196 ms 295232 KB Output is correct
4 Correct 186 ms 295160 KB Output is correct
5 Correct 196 ms 295160 KB Output is correct
6 Correct 187 ms 295160 KB Output is correct
7 Correct 195 ms 295160 KB Output is correct
8 Correct 194 ms 295152 KB Output is correct
9 Correct 200 ms 295288 KB Output is correct
10 Correct 209 ms 295160 KB Output is correct
11 Correct 198 ms 295160 KB Output is correct
12 Correct 205 ms 295160 KB Output is correct
13 Correct 206 ms 295160 KB Output is correct
14 Correct 191 ms 295160 KB Output is correct
15 Correct 200 ms 295160 KB Output is correct
16 Correct 192 ms 295164 KB Output is correct
17 Correct 227 ms 295632 KB Output is correct
18 Correct 195 ms 295544 KB Output is correct
19 Correct 212 ms 295560 KB Output is correct
20 Correct 242 ms 295416 KB Output is correct
21 Correct 193 ms 295544 KB Output is correct
22 Correct 196 ms 295532 KB Output is correct
23 Correct 194 ms 295628 KB Output is correct
24 Correct 202 ms 295288 KB Output is correct
25 Correct 223 ms 297976 KB Output is correct
26 Correct 254 ms 298000 KB Output is correct
27 Correct 227 ms 298096 KB Output is correct
28 Correct 210 ms 296440 KB Output is correct
29 Correct 223 ms 297848 KB Output is correct
30 Correct 233 ms 297848 KB Output is correct
31 Correct 275 ms 297720 KB Output is correct
32 Correct 233 ms 297592 KB Output is correct
33 Correct 1219 ms 314676 KB Output is correct
34 Correct 458 ms 314640 KB Output is correct
35 Correct 542 ms 314616 KB Output is correct
36 Correct 418 ms 314616 KB Output is correct
37 Correct 723 ms 330268 KB Output is correct
38 Correct 715 ms 330508 KB Output is correct
39 Correct 665 ms 330440 KB Output is correct
40 Correct 575 ms 328188 KB Output is correct
41 Correct 411 ms 307452 KB Output is correct
42 Correct 434 ms 311672 KB Output is correct
43 Correct 722 ms 329604 KB Output is correct
44 Correct 699 ms 330128 KB Output is correct
45 Correct 445 ms 313080 KB Output is correct
46 Correct 426 ms 313080 KB Output is correct
47 Correct 687 ms 327660 KB Output is correct
48 Correct 671 ms 327796 KB Output is correct
49 Correct 205 ms 295160 KB Output is correct
50 Correct 221 ms 295160 KB Output is correct
51 Correct 205 ms 295160 KB Output is correct
52 Correct 203 ms 295160 KB Output is correct
53 Correct 202 ms 295108 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 208 ms 295520 KB Output is correct
2 Correct 215 ms 295464 KB Output is correct
3 Correct 189 ms 295276 KB Output is correct
4 Correct 196 ms 295164 KB Output is correct
5 Correct 192 ms 295544 KB Output is correct
6 Correct 204 ms 295544 KB Output is correct
7 Correct 201 ms 295484 KB Output is correct
8 Correct 200 ms 295416 KB Output is correct
9 Correct 187 ms 295416 KB Output is correct
10 Correct 189 ms 295156 KB Output is correct
11 Correct 194 ms 295288 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 191 ms 295160 KB Output is correct
2 Correct 1529 ms 363456 KB Output is correct
3 Correct 3396 ms 442160 KB Output is correct
4 Correct 3165 ms 442852 KB Output is correct
5 Correct 3269 ms 442912 KB Output is correct
6 Correct 985 ms 320644 KB Output is correct
7 Correct 1895 ms 342268 KB Output is correct
8 Correct 2048 ms 345448 KB Output is correct
9 Correct 205 ms 295160 KB Output is correct
10 Correct 221 ms 295160 KB Output is correct
11 Correct 205 ms 295160 KB Output is correct
12 Correct 203 ms 295160 KB Output is correct
13 Correct 202 ms 295108 KB Output is correct

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 295092 KB Output is correct
2 Correct 200 ms 295276 KB Output is correct
3 Correct 196 ms 295232 KB Output is correct
4 Correct 186 ms 295160 KB Output is correct
5 Correct 196 ms 295160 KB Output is correct
6 Correct 187 ms 295160 KB Output is correct
7 Correct 195 ms 295160 KB Output is correct
8 Correct 194 ms 295152 KB Output is correct
9 Correct 200 ms 295288 KB Output is correct
10 Correct 209 ms 295160 KB Output is correct
11 Correct 198 ms 295160 KB Output is correct
12 Correct 205 ms 295160 KB Output is correct
13 Correct 206 ms 295160 KB Output is correct
14 Correct 191 ms 295160 KB Output is correct
15 Correct 200 ms 295160 KB Output is correct
16 Correct 192 ms 295164 KB Output is correct
17 Correct 227 ms 295632 KB Output is correct
18 Correct 195 ms 295544 KB Output is correct
19 Correct 212 ms 295560 KB Output is correct
20 Correct 242 ms 295416 KB Output is correct
21 Correct 193 ms 295544 KB Output is correct
22 Correct 196 ms 295532 KB Output is correct
23 Correct 194 ms 295628 KB Output is correct
24 Correct 202 ms 295288 KB Output is correct
25 Correct 223 ms 297976 KB Output is correct
26 Correct 254 ms 298000 KB Output is correct
27 Correct 227 ms 298096 KB Output is correct
28 Correct 210 ms 296440 KB Output is correct
29 Correct 223 ms 297848 KB Output is correct
30 Correct 233 ms 297848 KB Output is correct
31 Correct 275 ms 297720 KB Output is correct
32 Correct 233 ms 297592 KB Output is correct
33 Correct 1219 ms 314676 KB Output is correct
34 Correct 458 ms 314640 KB Output is correct
35 Correct 542 ms 314616 KB Output is correct
36 Correct 418 ms 314616 KB Output is correct
37 Correct 723 ms 330268 KB Output is correct
38 Correct 715 ms 330508 KB Output is correct
39 Correct 665 ms 330440 KB Output is correct
40 Correct 575 ms 328188 KB Output is correct
41 Correct 411 ms 307452 KB Output is correct
42 Correct 434 ms 311672 KB Output is correct
43 Correct 722 ms 329604 KB Output is correct
44 Correct 699 ms 330128 KB Output is correct
45 Correct 445 ms 313080 KB Output is correct
46 Correct 426 ms 313080 KB Output is correct
47 Correct 687 ms 327660 KB Output is correct
48 Correct 671 ms 327796 KB Output is correct
49 Correct 208 ms 295520 KB Output is correct
50 Correct 215 ms 295464 KB Output is correct
51 Correct 189 ms 295276 KB Output is correct
52 Correct 196 ms 295164 KB Output is correct
53 Correct 192 ms 295544 KB Output is correct
54 Correct 204 ms 295544 KB Output is correct
55 Correct 201 ms 295484 KB Output is correct
56 Correct 200 ms 295416 KB Output is correct
57 Correct 187 ms 295416 KB Output is correct
58 Correct 189 ms 295156 KB Output is correct
59 Correct 194 ms 295288 KB Output is correct
60 Correct 191 ms 295160 KB Output is correct
61 Correct 1529 ms 363456 KB Output is correct
62 Correct 3396 ms 442160 KB Output is correct
63 Correct 3165 ms 442852 KB Output is correct
64 Correct 3269 ms 442912 KB Output is correct
65 Correct 985 ms 320644 KB Output is correct
66 Correct 1895 ms 342268 KB Output is correct
67 Correct 2048 ms 345448 KB Output is correct
68 Execution timed out 5137 ms 540912 KB Time limit exceeded
69 Halted 0 ms 0 KB -