oj.uz

답안 #261340

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
261340 2020-08-11T16:21:27 Z caoash Vision Program (IOI19_vision) C++14
100 / 100
 51 ms 3828 KB 
#include <bits/stdc++.h> 
#include "vision.h"

using namespace std;

using ll = long long;

using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

void construct_network(int H, int W, int K) {
    vi ups;
    for (int y = 0; y < W; y++) {
        pi st = mp(0, y);
        vi diag;
        while (st.f < H && st.s < W) {
            diag.pb(W * st.f + st.s);
            // cout << st.f << " " << st.s << '\n';
            ++st.f, ++st.s;
        }
        ups.pb(add_and({add_or(diag), add_xor(diag)})); 
    }
    reverse(all(ups));
    for (int x = 1; x < H; x++) {
        pi st = mp(x, 0);
        vi diag;
        while (st.f < H && st.s < W) {
            diag.pb(W * st.f + st.s);
            // cout << st.f << " " << st.s << '\n';
            ++st.f, ++st.s;
        }
        ups.pb(add_and({add_or(diag), add_xor(diag)}));
    }
    vi downs;
    for (int y = 0; y < W; y++) {
        pi st = mp(0, y);
        vi diag;
        while (st.f >= 0 && st.s >= 0 && st.f < H && st.s < W) {
            diag.pb(W * st.f + st.s);
            // cout << st.f << " " << st.s << '\n';
            ++st.f, --st.s;
        }
        downs.pb(add_and({add_or(diag), add_xor(diag)}));
    }
    for (int x = 1; x < H; x++) {
        pi st = mp(x, W - 1);
        vi diag;
        while (st.f >= 0 && st.s >= 0 && st.f < H && st.s < W) {
            diag.pb(W * st.f + st.s);
            // cout << st.f << " " << st.s << '\n';
            ++st.f, --st.s;
        }
        downs.pb(add_and({add_or(diag), add_xor(diag)}));
    }
    vi psup(sz(ups));
    for (int i = 0; i < sz(ups); i++) {
        if (i == 0) {
            psup[i] = add_xor({ups[i]}); 
        }
        else {
            psup[i] = add_xor({ups[i], psup[i - 1]});
        }
    }
    vi pdown(sz(downs));
    for (int i = 0; i < sz(downs); i++) {
        if (i == 0) {
            pdown[i] = add_xor({downs[i]});
        }
        else {
            pdown[i] = add_xor({downs[i], pdown[i - 1]});
        }
    }
    int upok = -1, downok = -1;
    for (int i = 0; i < sz(ups) - K; i++) {
        vi curr;
        for (int j = i; j < i + K; j++) {
            curr.pb(psup[j]);
        } 
        if (i == 0) upok = add_and(curr);
        else upok = add_or({upok, add_and(curr)});
    }
    for (int i = 0; i < sz(downs) - K; i++) {
        vi curr;
        for (int j = i; j < i + K; j++) {
            curr.pb(pdown[j]);
        } 
        if (i == 0) downok = add_and(curr);
        else downok = add_or({downok, add_and(curr)});
    }
    int NK = K + 1;
    int upok2 = -1, downok2 = -1;
    for (int i = 0; i < sz(ups) - NK; i++) {
        vi curr;
        for (int j = i; j < i + NK; j++) {
            curr.pb(psup[j]);
        } 
        if (i == 0) upok2 = add_and(curr);
        else upok2 = add_or({upok2, add_and(curr)});
    }
    for (int i = 0; i < sz(downs) - NK; i++) {
        vi curr;
        for (int j = i; j < i + NK; j++) {
            curr.pb(pdown[j]);
        } 
        if (i == 0) downok2 = add_and(curr);
        else downok2 = add_or({downok2, add_and(curr)});
    }
    if (W + H - 2 == K) {
        add_or({upok, downok});
    }
    else {
        add_and({add_or({upok, downok}), add_not(add_or({upok2, downok2}))});
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 288 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 288 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 288 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 288 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 10 ms 1152 KB Output is correct
39 Correct 2 ms 512 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 4 ms 768 KB Output is correct
42 Correct 4 ms 640 KB Output is correct
43 Correct 8 ms 896 KB Output is correct
44 Correct 10 ms 1152 KB Output is correct
45 Correct 12 ms 1280 KB Output is correct
46 Correct 10 ms 1152 KB Output is correct
47 Correct 6 ms 800 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 7 ms 896 KB Output is correct
3 Correct 8 ms 896 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 6 ms 768 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 6 ms 768 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 6 ms 896 KB Output is correct
13 Correct 5 ms 768 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 640 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 6 ms 896 KB Output is correct
18 Correct 6 ms 896 KB Output is correct
19 Correct 5 ms 768 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 5 ms 768 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 6 ms 768 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 8 ms 1024 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 7 ms 768 KB Output is correct
15 Correct 6 ms 896 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 3 ms 640 KB Output is correct
18 Correct 7 ms 896 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 12 ms 1404 KB Output is correct
21 Correct 21 ms 2176 KB Output is correct
22 Correct 20 ms 2048 KB Output is correct
23 Correct 12 ms 1280 KB Output is correct
24 Correct 13 ms 1404 KB Output is correct
25 Correct 22 ms 2176 KB Output is correct
26 Correct 17 ms 1280 KB Output is correct
27 Correct 22 ms 2300 KB Output is correct
28 Correct 36 ms 3452 KB Output is correct
29 Correct 39 ms 3828 KB Output is correct
30 Correct 38 ms 3320 KB Output is correct
31 Correct 21 ms 2048 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 2300 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 8 ms 768 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 21 ms 1404 KB Output is correct
8 Correct 20 ms 1404 KB Output is correct
9 Correct 30 ms 2300 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 288 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 10 ms 1152 KB Output is correct
39 Correct 2 ms 512 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 4 ms 768 KB Output is correct
42 Correct 4 ms 640 KB Output is correct
43 Correct 8 ms 896 KB Output is correct
44 Correct 10 ms 1152 KB Output is correct
45 Correct 12 ms 1280 KB Output is correct
46 Correct 10 ms 1152 KB Output is correct
47 Correct 6 ms 800 KB Output is correct
48 Correct 3 ms 640 KB Output is correct
49 Correct 7 ms 896 KB Output is correct
50 Correct 8 ms 896 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 3 ms 640 KB Output is correct
53 Correct 6 ms 768 KB Output is correct
54 Correct 6 ms 768 KB Output is correct
55 Correct 2 ms 512 KB Output is correct
56 Correct 2 ms 640 KB Output is correct
57 Correct 6 ms 768 KB Output is correct
58 Correct 7 ms 896 KB Output is correct
59 Correct 6 ms 896 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 2 ms 384 KB Output is correct
62 Correct 3 ms 640 KB Output is correct
63 Correct 6 ms 768 KB Output is correct
64 Correct 6 ms 896 KB Output is correct
65 Correct 6 ms 896 KB Output is correct
66 Correct 5 ms 768 KB Output is correct
67 Correct 1 ms 384 KB Output is correct
68 Correct 1 ms 256 KB Output is correct
69 Correct 1 ms 256 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 3 ms 640 KB Output is correct
73 Correct 4 ms 640 KB Output is correct
74 Correct 5 ms 768 KB Output is correct
75 Correct 5 ms 640 KB Output is correct
76 Correct 3 ms 512 KB Output is correct
77 Correct 6 ms 768 KB Output is correct
78 Correct 7 ms 896 KB Output is correct
79 Correct 8 ms 1024 KB Output is correct
80 Correct 7 ms 896 KB Output is correct
81 Correct 4 ms 640 KB Output is correct
82 Correct 2 ms 640 KB Output is correct
83 Correct 7 ms 768 KB Output is correct
84 Correct 6 ms 896 KB Output is correct
85 Correct 2 ms 512 KB Output is correct
86 Correct 3 ms 640 KB Output is correct
87 Correct 7 ms 896 KB Output is correct
88 Correct 2 ms 384 KB Output is correct
89 Correct 12 ms 1404 KB Output is correct
90 Correct 21 ms 2176 KB Output is correct
91 Correct 20 ms 2048 KB Output is correct
92 Correct 12 ms 1280 KB Output is correct
93 Correct 13 ms 1404 KB Output is correct
94 Correct 22 ms 2176 KB Output is correct
95 Correct 17 ms 1280 KB Output is correct
96 Correct 22 ms 2300 KB Output is correct
97 Correct 36 ms 3452 KB Output is correct
98 Correct 39 ms 3828 KB Output is correct
99 Correct 38 ms 3320 KB Output is correct
100 Correct 21 ms 2048 KB Output is correct
101 Correct 1 ms 256 KB Output is correct
102 Correct 1 ms 256 KB Output is correct
103 Correct 23 ms 2300 KB Output is correct
104 Correct 1 ms 256 KB Output is correct
105 Correct 3 ms 640 KB Output is correct
106 Correct 8 ms 768 KB Output is correct
107 Correct 4 ms 640 KB Output is correct
108 Correct 3 ms 640 KB Output is correct
109 Correct 21 ms 1404 KB Output is correct
110 Correct 20 ms 1404 KB Output is correct
111 Correct 30 ms 2300 KB Output is correct
112 Correct 1 ms 256 KB Output is correct
113 Correct 1 ms 256 KB Output is correct
114 Correct 35 ms 3444 KB Output is correct
115 Correct 2 ms 512 KB Output is correct
116 Correct 3 ms 640 KB Output is correct
117 Correct 17 ms 1792 KB Output is correct
118 Correct 19 ms 1968 KB Output is correct
119 Correct 41 ms 3700 KB Output is correct
120 Correct 41 ms 3824 KB Output is correct
121 Correct 42 ms 3700 KB Output is correct
122 Correct 46 ms 3704 KB Output is correct
123 Correct 28 ms 2300 KB Output is correct
124 Correct 41 ms 3444 KB Output is correct
125 Correct 51 ms 3804 KB Output is correct
126 Correct 41 ms 3736 KB Output is correct
127 Correct 37 ms 3320 KB Output is correct
128 Correct 24 ms 2048 KB Output is correct