oj.uz

답안 #267241

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
267241 2020-08-16T02:04:48 Z hamerin Vision Program (IOI19_vision) C++17
100 / 100
 33 ms 2968 KB 
#include "vision.h"

#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;

using i64 = long long;
using d64 = long double;
using pi = pair<int, int>;
using pli = pair<i64, i64>;
using ti = tuple<int, int, int>;
using tli = tuple<i64, i64, i64>;

#define iterall(cont) cont.begin(), cont.end()
#define prec(n) setprecision(n) << fixed

void construct_network(int H, int W, int K) {
    auto valid = [H, W](int x, int y) {
        return 0 <= x && x < H && 0 <= y && y < W;
    };

    auto getNum = [W](int x, int y) { return x * W + y; };

    int c = H * W;

    vector<int> idx1;
    for (int s = 0; s < H + W - 1; s++) {
        vector<int> tmp;
        for (int x = 0; x < H; x++) {
            int y = s - x;
            if (valid(x, y)) tmp.emplace_back(getNum(x, y));
        }
        add_or(tmp);
        idx1.emplace_back(c++);
    }

    vector<int> idx2;
    for (int s = W - 1; s >= -(H - 1); --s) {
        vector<int> tmp;
        for (int x = 0; x < H; x++) {
            int y = x + s;
            if (valid(x, y)) tmp.emplace_back(getNum(x, y));
        }
        add_or(tmp);
        idx2.emplace_back(c++);
    }

    if (K == 1) {
        vector<int> idx4;
        for (int i = 0; i < idx1.size() - K; i++) {
            add_and({idx1[i], idx1[i + K]});
            idx4.emplace_back(c++);
        }
        vector<int> idx5;
        for (int i = 0; i < idx2.size() - K; i++) {
            add_and({idx2[i], idx2[i + K]});
            idx5.emplace_back(c++);
        }
        add_or(idx4);
        add_or(idx5);
        add_and({c, c + 1});
        return;
    }

    // K - 1 연속 (False여야 함)
    vector<int> idx3_1;
    for (int i = 0; i <= idx1.size() - K + 1; i++) {
        vector<int> tmp;
        copy(idx1.begin() + i, idx1.begin() + i + K - 1, back_inserter(tmp));
        add_or(tmp);
        add_xor(tmp);
        add_xor({c, c + 1});
        idx3_1.emplace_back(c + 2);
        c += 3;
    }

    vector<int> idx3_2;
    for (int i = 0; i <= idx2.size() - K + 1; i++) {
        vector<int> tmp;
        copy(idx2.begin() + i, idx2.begin() + i + K - 1, back_inserter(tmp));
        add_or(tmp);
        add_xor(tmp);
        add_xor({c, c + 1});
        idx3_2.emplace_back(c + 2);
        c += 3;
    }

    // K 연속 (True여야 함)
    vector<int> idx4;
    for (int i = 0; i < idx1.size() - K; i++) {
        add_and({idx1[i], idx1[i + K]});
        idx4.emplace_back(c++);
    }
    vector<int> idx5;
    for (int i = 0; i < idx2.size() - K; i++) {
        add_and({idx2[i], idx2[i + K]});
        idx5.emplace_back(c++);
    }

    add_xor(idx1);
    add_or(idx3_1);
    add_or({c, c + 1});

    add_xor(idx2);
    add_or(idx3_2);
    add_or({c + 3, c + 4});

    add_or(idx4);
    add_or(idx5);

    add_and({c + 2, c + 7});
    add_and({c + 5, c + 6});
    add_and({c + 6, c + 7});
    add_or({c + 8, c + 9, c + 10});
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:53:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         for (int i = 0; i < idx1.size() - K; i++) {
      |                         ~~^~~~~~~~~~~~~~~~~
vision.cpp:58:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for (int i = 0; i < idx2.size() - K; i++) {
      |                         ~~^~~~~~~~~~~~~~~~~
vision.cpp:70:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     for (int i = 0; i <= idx1.size() - K + 1; i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~
vision.cpp:81:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for (int i = 0; i <= idx2.size() - K + 1; i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~
vision.cpp:93:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     for (int i = 0; i < idx1.size() - K; i++) {
      |                     ~~^~~~~~~~~~~~~~~~~
vision.cpp:98:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |     for (int i = 0; i < idx2.size() - K; i++) {
      |                     ~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 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 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 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 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 7 ms 896 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 7 ms 896 KB Output is correct
45 Correct 8 ms 1024 KB Output is correct
46 Correct 7 ms 896 KB Output is correct
47 Correct 4 ms 512 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 6 ms 768 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 6 ms 768 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 16 ms 1664 KB Output is correct
22 Correct 15 ms 1536 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 9 ms 768 KB Output is correct
25 Correct 17 ms 1664 KB Output is correct
26 Correct 6 ms 896 KB Output is correct
27 Correct 11 ms 1280 KB Output is correct
28 Correct 26 ms 2552 KB Output is correct
29 Correct 29 ms 2936 KB Output is correct
30 Correct 28 ms 2552 KB Output is correct
31 Correct 11 ms 1152 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1280 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 6 ms 768 KB Output is correct
8 Correct 6 ms 768 KB Output is correct
9 Correct 11 ms 1280 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 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 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 7 ms 896 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 7 ms 896 KB Output is correct
45 Correct 8 ms 1024 KB Output is correct
46 Correct 7 ms 896 KB Output is correct
47 Correct 4 ms 512 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 5 ms 768 KB Output is correct
50 Correct 5 ms 768 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 2 ms 512 KB Output is correct
53 Correct 7 ms 640 KB Output is correct
54 Correct 6 ms 640 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 5 ms 640 KB Output is correct
58 Correct 6 ms 768 KB Output is correct
59 Correct 7 ms 768 KB Output is correct
60 Correct 5 ms 640 KB Output is correct
61 Correct 1 ms 416 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 5 ms 640 KB Output is correct
64 Correct 6 ms 768 KB Output is correct
65 Correct 6 ms 768 KB Output is correct
66 Correct 4 ms 640 KB Output is correct
67 Correct 1 ms 384 KB Output is correct
68 Correct 1 ms 256 KB Output is correct
69 Correct 0 ms 256 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 4 ms 512 KB Output is correct
74 Correct 4 ms 512 KB Output is correct
75 Correct 3 ms 512 KB Output is correct
76 Correct 1 ms 384 KB Output is correct
77 Correct 2 ms 512 KB Output is correct
78 Correct 6 ms 768 KB Output is correct
79 Correct 6 ms 768 KB Output is correct
80 Correct 5 ms 640 KB Output is correct
81 Correct 3 ms 512 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 6 ms 640 KB Output is correct
84 Correct 5 ms 640 KB Output is correct
85 Correct 1 ms 384 KB Output is correct
86 Correct 1 ms 384 KB Output is correct
87 Correct 6 ms 768 KB Output is correct
88 Correct 1 ms 384 KB Output is correct
89 Correct 6 ms 768 KB Output is correct
90 Correct 16 ms 1664 KB Output is correct
91 Correct 15 ms 1536 KB Output is correct
92 Correct 6 ms 768 KB Output is correct
93 Correct 9 ms 768 KB Output is correct
94 Correct 17 ms 1664 KB Output is correct
95 Correct 6 ms 896 KB Output is correct
96 Correct 11 ms 1280 KB Output is correct
97 Correct 26 ms 2552 KB Output is correct
98 Correct 29 ms 2936 KB Output is correct
99 Correct 28 ms 2552 KB Output is correct
100 Correct 11 ms 1152 KB Output is correct
101 Correct 0 ms 256 KB Output is correct
102 Correct 0 ms 256 KB Output is correct
103 Correct 11 ms 1280 KB Output is correct
104 Correct 1 ms 256 KB Output is correct
105 Correct 1 ms 384 KB Output is correct
106 Correct 2 ms 512 KB Output is correct
107 Correct 1 ms 384 KB Output is correct
108 Correct 1 ms 384 KB Output is correct
109 Correct 6 ms 768 KB Output is correct
110 Correct 6 ms 768 KB Output is correct
111 Correct 11 ms 1280 KB Output is correct
112 Correct 1 ms 256 KB Output is correct
113 Correct 0 ms 256 KB Output is correct
114 Correct 25 ms 2540 KB Output is correct
115 Correct 1 ms 384 KB Output is correct
116 Correct 2 ms 512 KB Output is correct
117 Correct 16 ms 1272 KB Output is correct
118 Correct 13 ms 1408 KB Output is correct
119 Correct 30 ms 2968 KB Output is correct
120 Correct 29 ms 2808 KB Output is correct
121 Correct 29 ms 2936 KB Output is correct
122 Correct 33 ms 2936 KB Output is correct
123 Correct 11 ms 1280 KB Output is correct
124 Correct 26 ms 2560 KB Output is correct
125 Correct 31 ms 2936 KB Output is correct
126 Correct 30 ms 2936 KB Output is correct
127 Correct 25 ms 2432 KB Output is correct
128 Correct 11 ms 1152 KB Output is correct