oj.uz

답안 #1020778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1020778 2024-07-12T09:45:06 Z c2zi6 Vision Program (IOI19_vision) C++14
100 / 100
 38 ms 6200 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "vision.h"

void construct_network(int H, int W, int K) {
    VVI left, right;
    int dsize = H+W-1;
    left = right = VVI(dsize);
    rep(i, H) rep(j, W) {
        left[j-i+H-1].pb(i*W + j);
        right[i+j].pb(i*W + j);
    }
    int start = H*W;
    auto addgate1 = [&](VVI side) {
        int d[4];
        // d[0] or 
        // d[1] xor
        // d[2] not xor
        // d[3] (not xor) and (or)
        d[0] = start;
        d[1] = d[0] + dsize;
        d[2] = d[1] + dsize;
        d[3] = d[2] + dsize;
        rep(i, dsize) {
            add_or(side[i]);
        }
        rep(i, dsize) {
            add_xor(side[i]);
        }
        rep(i, dsize) {
            add_not(d[1] + i);
        }
        rep(i, dsize) {
            add_and({d[2]+i, d[0]+i});
        }
        start = d[3] + dsize;
        return PII{d[0], d[3]};
    };
    auto addgate2 = [&](int L, int dor) {
        int groupsize = dsize-L+1;
        int group[4];
        // group[0] or 
        // group[1] xor
        // group[2] not xor
        // group[3] (not xor) and (or)
        group[0] = start;
        group[1] = group[0] + groupsize;
        group[2] = group[1] + groupsize;
        group[3] = group[2] + groupsize;
        rep(i, groupsize) {
            VI tmp;
            replr(j, i, i+L-1) tmp.pb(dor+j);
            add_or(tmp);
        }
        rep(i, groupsize) {
            VI tmp;
            replr(j, i, i+L-1) tmp.pb(dor+j);
            add_xor(tmp);
        }
        rep(i, groupsize) {
            add_not(group[1] + i);
        }
        rep(i, groupsize) {
            add_and({group[0] + i, group[2] + i});
        }
        start = group[3] + groupsize;
        return group[3];
    };
    auto[d1or, d1both] = addgate1(left);
    auto[d2or, d2both] = addgate1(right);
    auto addgate3 = [&](int L) {
        int d1group = addgate2(L, d1or);
        int d2group = addgate2(L, d2or);
        VI tmp;
        tmp = VI();
        replr(i, d1both, d1both + dsize-1) tmp.pb(i);
        replr(i, d1group, d1group + (dsize-L+1) - 1) tmp.pb(i);
        add_or(tmp);
        start++;
        tmp = VI();
        replr(i, d2both, d2both + dsize-1) tmp.pb(i);
        replr(i, d2group, d2group + (dsize-L+1) - 1) tmp.pb(i);
        add_or(tmp);
        start++;
        add_and({start-1, start-2});
        return start++;
    };
    int g1 = addgate3(K+1); // must be true
    int g2 = addgate3(K); // must be false
    int g2not = add_not(g2);
    add_and({g1, g2not});
}

/*
 * add_not
 * add_and
 * add_or
 * add_xor
*/

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:98:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   98 |     auto[d1or, d1both] = addgate1(left);
      |         ^
vision.cpp:99:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   99 |     auto[d2or, d2both] = addgate1(right);
      |         ^

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 372 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 440 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 436 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 432 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 7 ms 1628 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 600 KB Output is correct
41 Correct 3 ms 856 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 4 ms 1240 KB Output is correct
44 Correct 7 ms 1628 KB Output is correct
45 Correct 8 ms 1880 KB Output is correct
46 Correct 7 ms 1624 KB Output is correct
47 Correct 4 ms 860 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 6 ms 1268 KB Output is correct
3 Correct 5 ms 1296 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 7 ms 1112 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 5 ms 1116 KB Output is correct
11 Correct 7 ms 1372 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 3 ms 860 KB Output is correct
16 Correct 5 ms 1116 KB Output is correct
17 Correct 6 ms 1372 KB Output is correct
18 Correct 6 ms 1372 KB Output is correct
19 Correct 5 ms 1112 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 3 ms 856 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 3 ms 980 KB Output is correct
9 Correct 6 ms 1368 KB Output is correct
10 Correct 7 ms 1372 KB Output is correct
11 Correct 5 ms 1368 KB Output is correct
12 Correct 2 ms 856 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 5 ms 1112 KB Output is correct
15 Correct 5 ms 1116 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 5 ms 1116 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 10 ms 2008 KB Output is correct
21 Correct 24 ms 3280 KB Output is correct
22 Correct 15 ms 3164 KB Output is correct
23 Correct 6 ms 1628 KB Output is correct
24 Correct 8 ms 1948 KB Output is correct
25 Correct 18 ms 3544 KB Output is correct
26 Correct 6 ms 1628 KB Output is correct
27 Correct 12 ms 3284 KB Output is correct
28 Correct 27 ms 5328 KB Output is correct
29 Correct 31 ms 6200 KB Output is correct
30 Correct 24 ms 5240 KB Output is correct
31 Correct 12 ms 2904 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 3280 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 3 ms 1240 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 7 ms 2000 KB Output is correct
8 Correct 7 ms 2008 KB Output is correct
9 Correct 13 ms 3280 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 372 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 440 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 436 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 432 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 7 ms 1628 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 600 KB Output is correct
41 Correct 3 ms 856 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 4 ms 1240 KB Output is correct
44 Correct 7 ms 1628 KB Output is correct
45 Correct 8 ms 1880 KB Output is correct
46 Correct 7 ms 1624 KB Output is correct
47 Correct 4 ms 860 KB Output is correct
48 Correct 2 ms 860 KB Output is correct
49 Correct 6 ms 1268 KB Output is correct
50 Correct 5 ms 1296 KB Output is correct
51 Correct 1 ms 600 KB Output is correct
52 Correct 2 ms 860 KB Output is correct
53 Correct 5 ms 1116 KB Output is correct
54 Correct 7 ms 1112 KB Output is correct
55 Correct 1 ms 600 KB Output is correct
56 Correct 2 ms 860 KB Output is correct
57 Correct 5 ms 1116 KB Output is correct
58 Correct 7 ms 1372 KB Output is correct
59 Correct 6 ms 1372 KB Output is correct
60 Correct 4 ms 1116 KB Output is correct
61 Correct 1 ms 604 KB Output is correct
62 Correct 3 ms 860 KB Output is correct
63 Correct 5 ms 1116 KB Output is correct
64 Correct 6 ms 1372 KB Output is correct
65 Correct 6 ms 1372 KB Output is correct
66 Correct 5 ms 1112 KB Output is correct
67 Correct 1 ms 600 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 1 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 604 KB Output is correct
72 Correct 2 ms 604 KB Output is correct
73 Correct 3 ms 860 KB Output is correct
74 Correct 4 ms 860 KB Output is correct
75 Correct 3 ms 856 KB Output is correct
76 Correct 2 ms 604 KB Output is correct
77 Correct 3 ms 980 KB Output is correct
78 Correct 6 ms 1368 KB Output is correct
79 Correct 7 ms 1372 KB Output is correct
80 Correct 5 ms 1368 KB Output is correct
81 Correct 2 ms 856 KB Output is correct
82 Correct 2 ms 860 KB Output is correct
83 Correct 5 ms 1112 KB Output is correct
84 Correct 5 ms 1116 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 2 ms 860 KB Output is correct
87 Correct 5 ms 1116 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 10 ms 2008 KB Output is correct
90 Correct 24 ms 3280 KB Output is correct
91 Correct 15 ms 3164 KB Output is correct
92 Correct 6 ms 1628 KB Output is correct
93 Correct 8 ms 1948 KB Output is correct
94 Correct 18 ms 3544 KB Output is correct
95 Correct 6 ms 1628 KB Output is correct
96 Correct 12 ms 3284 KB Output is correct
97 Correct 27 ms 5328 KB Output is correct
98 Correct 31 ms 6200 KB Output is correct
99 Correct 24 ms 5240 KB Output is correct
100 Correct 12 ms 2904 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 12 ms 3280 KB Output is correct
104 Correct 1 ms 344 KB Output is correct
105 Correct 2 ms 600 KB Output is correct
106 Correct 3 ms 1240 KB Output is correct
107 Correct 1 ms 860 KB Output is correct
108 Correct 2 ms 860 KB Output is correct
109 Correct 7 ms 2000 KB Output is correct
110 Correct 7 ms 2008 KB Output is correct
111 Correct 13 ms 3280 KB Output is correct
112 Correct 1 ms 348 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 33 ms 5328 KB Output is correct
115 Correct 1 ms 600 KB Output is correct
116 Correct 2 ms 856 KB Output is correct
117 Correct 11 ms 2540 KB Output is correct
118 Correct 12 ms 2772 KB Output is correct
119 Correct 30 ms 6096 KB Output is correct
120 Correct 30 ms 6092 KB Output is correct
121 Correct 29 ms 6092 KB Output is correct
122 Correct 30 ms 6100 KB Output is correct
123 Correct 12 ms 3284 KB Output is correct
124 Correct 25 ms 5328 KB Output is correct
125 Correct 29 ms 6096 KB Output is correct
126 Correct 33 ms 6096 KB Output is correct
127 Correct 38 ms 5328 KB Output is correct
128 Correct 11 ms 2908 KB Output is correct