Submission #602454

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
602454	2022-07-23 06:19:11	Johann	Vision Program (IOI19_vision)	C++14	44 / 100	9 ms	1868 KiB

vision

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "vision.h"
using namespace std;
typedef vector<int> vi;
#define sz(x) (int)(x).size()
int h, w, k;
int calc_pos(int x, int y) {
    return y * w + x;
}
void construct_network(int H, int W, int K) {
    h = H;
    w = W;
    k = K;
    vi all(0);
    for (int x = 0; x < W; ++x) {
        for (int y = 0; y < H; ++y) {
            vi neigs;
            for (int dx = -K; dx < K; ++dx) {
                int nx = x + dx, ny = y + min(abs(dx - K), abs(dx + K));
                if (0 <= nx && nx < W && 0 <= ny && ny < H)
                    neigs.push_back(calc_pos(nx, ny));
            }
            if (sz(neigs) > 0)
                all.push_back(add_and({calc_pos(x, y), add_or(neigs)}));
        }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19