oj.uz

Submission #610096

# Submission time Handle Problem Language Result Execution time Memory
610096 2022-07-28T04:55:47 Z jophyyjh Vision Program (IOI19_vision) C++14
100 / 100
 42 ms 4516 KB 
/**
 * Wow. Idk how to express my shock when i saw that interactive problems can be like
 * this! So we basically have to write a program that outputs the correct 0/1 across
 * all images. First thought: we can't do compare each pair of rows, this takes about
 * 19900 (>10000) calls.
 * We don't have "for" or "if" statements... Hmm. I don't wanna do int addition /
 * subtraction using logic gates too... Well, in general we don't have much calls
 * available, so perhaps in a lot of calls the num of input isn't small. Nah...
 * 
 * I'd like to note down my final thought. Suppose that c_1, c_2, ..., c_m are 0/1
 * bits representing whether column i has a black cell. Let's put away the case of
 * only one 1. Let d_i := c_1 ^ c_2 ^ ... ^ c_i, so the number of 1s in (d_i) is 
 * the horizontal dist. Similarly we can do this for the vertical direction, then 
 * it suffices to count the num of 1s in some cells and check if it's K.
 * Unfortunately, the only sol i have is to do a dp which requires an additional
 * K(H+W) cells. Too much... (I'll submit a brute-force version in impl1)
 * 
 * This think this is a problem where scoring partials is easy, but getting full is
 * hard. Tinjyu gave a hint during our IOI 2022 training: consider diagonals. Take
 * K=1 as an example. We know that if num of calls is O(HW) we definitely fail, but
 * if it's O(HW) we have a large const. factor to play with (since num of calls is
 * the bottleneck). So, take OR on each diagonal and take AND on adjacent diagonals.
 * Notice that if two cells' Manhattan dist. is 1, exactly 2 pairs of adjacent
 * diagonals have 1 in their ANDs.
 * 
 * We can generalize this approach. Assume that the two cells are u, v. We draw two
 * diagonals through u and two diagonals through v; since in each direction there
 * are exactly 2 diagonals, the max of dist. between diagonals in the same direction
 * would be their Manhattan dist. I guess this may be inspired by the fact that cells
 * whose dist. to a fixed cell form the border of a rotated square.
 * This is so beautiful (!), though i can hardly believe that I would be able to come
 * up with sth like this! In some way, it's like rotating the grid by 45deg,
 * transforming Manhattan into Chebyschef.
 * 
 * Number of calls: 5(H+W)      (idk if 5 is correct, but it must be O(H+W))
 * Number of reads: (idk, but not too many)
 * Implementation 2         (Full solution)
*/

#include <bits/stdc++.h>
#include "vision.h"

typedef std::vector<int>    vec;


void construct_network(int h, int w, int K) {
    vec d1s, d2s;
    for (int d = 0; d <= h + w - 2; d++) {
        vec diag_cells;
        for (int i = 0; i < h; i++) {
            int j = d - i;
            if (0 <= j && j < w)
                diag_cells.push_back(i * w + j);
        }
        assert(!diag_cells.empty());
        d1s.push_back(add_or(diag_cells));
    }
    for (int d = -w + 1; d <= h - 1; d++) {
        vec diag_cells;
        for (int i = 0; i < h; i++) {
            int j = i - d;
            if (0 <= j && j < w)
                diag_cells.push_back(i * w + j);
        }
        assert(!diag_cells.empty());
        d2s.push_back(add_or(diag_cells));
    }
    int diags = h + w - 1;

    // We proceed in two parts. First checking whether the pairs in d1s and d2s
    // have dist. <= K, then we check whether there's one = K.
    vec greater_check;      // should be all 0
    for (int i = 0; i < diags; i++) {
        vec neighb1, neighb2;
        for (int j = 0; j < diags; j++) {
            int dist = std::abs(i - j);
            if (dist > K) {
                neighb1.push_back(d1s[j]);
                neighb2.push_back(d2s[j]);
            }
        }
        if (!neighb1.empty())
            greater_check.push_back(add_and({add_or(neighb1), d1s[i]}));
        if (!neighb2.empty())
            greater_check.push_back(add_and({add_or(neighb2), d2s[i]}));
    }
    int part1_flag;
    if (!greater_check.empty())
        part1_flag = add_not(add_or(greater_check));
    else
        part1_flag = -1;

    vec equal_check;
    for (int i = 0; i < diags; i++) {
        vec neighb1, neighb2;
        if (i + K < diags) {
            neighb1.push_back(d1s[i + K]);
            neighb2.push_back(d2s[i + K]);
        }
        if (i - K >= 0) {
            neighb1.push_back(d1s[i - K]);
            neighb2.push_back(d2s[i - K]);
        }
        if (!neighb1.empty())
            equal_check.push_back(add_and({add_or(neighb1), d1s[i]}));
        if (!neighb2.empty())
            equal_check.push_back(add_and({add_or(neighb2), d2s[i]}));
    }
    assert(!equal_check.empty());
    int part2_flag = add_or(equal_check);       // if part1_flag is -1 this is the ans
    if (part1_flag != -1)
        add_and({part1_flag, part2_flag});      // ans
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 8 ms 980 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 8 ms 808 KB Output is correct
42 Correct 3 ms 340 KB Output is correct
43 Correct 11 ms 1364 KB Output is correct
44 Correct 8 ms 980 KB Output is correct
45 Correct 5 ms 724 KB Output is correct
46 Correct 5 ms 596 KB Output is correct
47 Correct 3 ms 468 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1036 KB Output is correct
2 Correct 4 ms 596 KB Output is correct
3 Correct 4 ms 596 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 9 ms 980 KB Output is correct
6 Correct 6 ms 724 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 11 ms 980 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 4 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 9 ms 980 KB Output is correct
16 Correct 9 ms 724 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 724 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 8 ms 980 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 8 ms 980 KB Output is correct
14 Correct 8 ms 724 KB Output is correct
15 Correct 3 ms 468 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 10 ms 980 KB Output is correct
18 Correct 4 ms 556 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 26 ms 2676 KB Output is correct
21 Correct 17 ms 1620 KB Output is correct
22 Correct 8 ms 1036 KB Output is correct
23 Correct 4 ms 596 KB Output is correct
24 Correct 22 ms 2660 KB Output is correct
25 Correct 10 ms 1364 KB Output is correct
26 Correct 4 ms 596 KB Output is correct
27 Correct 38 ms 4516 KB Output is correct
28 Correct 28 ms 3148 KB Output is correct
29 Correct 17 ms 2176 KB Output is correct
30 Correct 10 ms 1492 KB Output is correct
31 Correct 8 ms 1148 KB Output is correct
32 Correct 0 ms 300 KB Output is correct
33 Correct 0 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 4492 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 724 KB Output is correct
4 Correct 9 ms 980 KB Output is correct
5 Correct 9 ms 980 KB Output is correct
6 Correct 8 ms 980 KB Output is correct
7 Correct 22 ms 2644 KB Output is correct
8 Correct 22 ms 2628 KB Output is correct
9 Correct 41 ms 4416 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 8 ms 980 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 8 ms 808 KB Output is correct
42 Correct 3 ms 340 KB Output is correct
43 Correct 11 ms 1364 KB Output is correct
44 Correct 8 ms 980 KB Output is correct
45 Correct 5 ms 724 KB Output is correct
46 Correct 5 ms 596 KB Output is correct
47 Correct 3 ms 468 KB Output is correct
48 Correct 8 ms 1036 KB Output is correct
49 Correct 4 ms 596 KB Output is correct
50 Correct 4 ms 596 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 9 ms 980 KB Output is correct
53 Correct 6 ms 724 KB Output is correct
54 Correct 2 ms 468 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 11 ms 980 KB Output is correct
57 Correct 5 ms 724 KB Output is correct
58 Correct 4 ms 596 KB Output is correct
59 Correct 3 ms 596 KB Output is correct
60 Correct 2 ms 340 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 9 ms 980 KB Output is correct
63 Correct 9 ms 724 KB Output is correct
64 Correct 4 ms 596 KB Output is correct
65 Correct 3 ms 596 KB Output is correct
66 Correct 2 ms 340 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 6 ms 724 KB Output is correct
73 Correct 5 ms 596 KB Output is correct
74 Correct 3 ms 468 KB Output is correct
75 Correct 2 ms 340 KB Output is correct
76 Correct 2 ms 364 KB Output is correct
77 Correct 8 ms 980 KB Output is correct
78 Correct 6 ms 852 KB Output is correct
79 Correct 4 ms 596 KB Output is correct
80 Correct 2 ms 468 KB Output is correct
81 Correct 3 ms 340 KB Output is correct
82 Correct 8 ms 980 KB Output is correct
83 Correct 8 ms 724 KB Output is correct
84 Correct 3 ms 468 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 10 ms 980 KB Output is correct
87 Correct 4 ms 556 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 26 ms 2676 KB Output is correct
90 Correct 17 ms 1620 KB Output is correct
91 Correct 8 ms 1036 KB Output is correct
92 Correct 4 ms 596 KB Output is correct
93 Correct 22 ms 2660 KB Output is correct
94 Correct 10 ms 1364 KB Output is correct
95 Correct 4 ms 596 KB Output is correct
96 Correct 38 ms 4516 KB Output is correct
97 Correct 28 ms 3148 KB Output is correct
98 Correct 17 ms 2176 KB Output is correct
99 Correct 10 ms 1492 KB Output is correct
100 Correct 8 ms 1148 KB Output is correct
101 Correct 0 ms 300 KB Output is correct
102 Correct 0 ms 212 KB Output is correct
103 Correct 39 ms 4492 KB Output is correct
104 Correct 0 ms 212 KB Output is correct
105 Correct 6 ms 724 KB Output is correct
106 Correct 9 ms 980 KB Output is correct
107 Correct 9 ms 980 KB Output is correct
108 Correct 8 ms 980 KB Output is correct
109 Correct 22 ms 2644 KB Output is correct
110 Correct 22 ms 2628 KB Output is correct
111 Correct 41 ms 4416 KB Output is correct
112 Correct 0 ms 212 KB Output is correct
113 Correct 0 ms 212 KB Output is correct
114 Correct 30 ms 3148 KB Output is correct
115 Correct 1 ms 212 KB Output is correct
116 Correct 8 ms 980 KB Output is correct
117 Correct 5 ms 724 KB Output is correct
118 Correct 18 ms 2164 KB Output is correct
119 Correct 18 ms 2076 KB Output is correct
120 Correct 17 ms 2092 KB Output is correct
121 Correct 17 ms 2132 KB Output is correct
122 Correct 18 ms 2060 KB Output is correct
123 Correct 42 ms 4408 KB Output is correct
124 Correct 25 ms 3044 KB Output is correct
125 Correct 21 ms 2192 KB Output is correct
126 Correct 17 ms 2132 KB Output is correct
127 Correct 11 ms 1492 KB Output is correct
128 Correct 8 ms 1108 KB Output is correct