oj.uz

답안 #1070844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070844 2024-08-22T19:32:34 Z ArthuroWich Vision Program (IOI19_vision) C++17
59 / 100
 25 ms 4340 KB 
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
int h, w, k;
int calc(int i, int j) {
    return i*w+j;
}
bool isvalid(int i, int j) {
    if (i < 0 || j < 0 || i >= h || j >= w) {
        return 0;
    } else {
        return 1;
    }
}
void construct_network(int H, int W, int K) {
    h = H, w = W, k = K;
    int n = h+w-1;
    vector<vector<int>> diag1(n), diag2(n);
    for (int j = 0; j < n; j++) {
        int i = j-(h-1);
        for (int x = 0; x < h; x++) {
            if (isvalid(x, i+x)) {
                diag1[j].push_back(calc(x, i+x));
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int x = 0; x < h; x++) {
            if (isvalid(x, i-x)) {
                diag2[i].push_back(calc(x, i-x));
            }
        }
    }
    vector<int> diag1or(n), diag1xor(n), diag1orxor(n), diag2or(n), diag2xor(n), diag2orxor(n);
    for (int i = 0; i < n; i++) {
        diag1or[i] = add_or(diag1[i]);
        diag1xor[i] = add_xor(diag1[i]);
        diag1orxor[i] = add_xor({diag1or[i], diag1xor[i]});
        diag2or[i] = add_or(diag2[i]);
        diag2xor[i] = add_xor(diag2[i]);
        diag2orxor[i] = add_xor({diag2or[i], diag2xor[i]});
    }
    vector<int> ans1k1, ans2k1, ans1k, ans2k;
    for (int i = 0; i < n; i++) {
        if (i+k >= n) {
            break;
        }
        vector<int> one, two;
        for (int j = i; j <= i+k; j++) {
            one.push_back(diag1orxor[j]);
        }
        for (int j = i; j <= i+k; j++) {
            two.push_back(diag1or[j]);
        }
        int a = add_or(one), b = add_or(two), c = add_xor(two);
        ans1k1.push_back(add_or({a, add_xor({b, c})}));
    }
    for (int i = 0; i < n; i++) {
        if (i+k >= n) {
            break;
        }
        vector<int> one, two;
        for (int j = i; j <= i+k; j++) {
            one.push_back(diag2orxor[j]);
        }
        for (int j = i; j <= i+k; j++) {
            two.push_back(diag2or[j]);
        }
        int a = add_or(one), b = add_or(two), c = add_xor(two);
        ans2k1.push_back(add_or({a, add_xor({b, c})}));
    }
    for (int i = 0; i < n; i++) {
        if (i+k-1 >= n) {
            break;
        }
        vector<int> one, two;
        for (int j = i; j <= i+k-1; j++) {
            one.push_back(diag1orxor[j]);
        }
        for (int j = i; j <= i+k-1; j++) {
            two.push_back(diag1or[j]);
        }
        int a = add_or(one), b = add_or(two), c = add_xor(two);
        ans1k.push_back(add_or({a, add_xor({b, c})}));
    }
    for (int i = 0; i < n; i++) {
        if (i+k-1 >= n) {
            break;
        }
        vector<int> one, two;
        for (int j = i; j <= i+k-1; j++) {
            one.push_back(diag2orxor[j]);
        }
        for (int j = i; j <= i+k-1; j++) {
            two.push_back(diag2or[j]);
        }
        int a = add_or(one), b = add_or(two), c = add_xor(two);
        ans2k.push_back(add_or({a, add_xor({b, c})}));
    }
    add_and({add_and({add_or(ans1k1), add_or(ans2k1)}), add_not({add_and({add_or(ans1k), add_or(ans2k)})})});
}

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 380 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 440 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 436 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 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 348 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 1 ms 604 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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 380 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 440 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 436 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 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 348 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 10 ms 2008 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 3 ms 860 KB Output is correct
42 Correct 2 ms 780 KB Output is correct
43 Correct 5 ms 1308 KB Output is correct
44 Correct 9 ms 2092 KB Output is correct
45 Correct 10 ms 2140 KB Output is correct
46 Correct 8 ms 1884 KB Output is correct
47 Correct 5 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 9 ms 1560 KB Output is correct
3 Correct 7 ms 1440 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 9 ms 1556 KB Output is correct
7 Correct 7 ms 1372 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 2 ms 856 KB Output is correct
10 Correct 7 ms 1496 KB Output is correct
11 Correct 8 ms 1660 KB Output is correct
12 Correct 9 ms 1628 KB Output is correct
13 Correct 6 ms 1372 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 12 ms 1476 KB Output is correct
17 Correct 8 ms 1676 KB Output is correct
18 Correct 8 ms 1624 KB Output is correct
19 Correct 6 ms 1372 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 4 ms 856 KB Output is correct
5 Correct 4 ms 1116 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 3 ms 1024 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 8 ms 1624 KB Output is correct
11 Correct 6 ms 1368 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 7 ms 1528 KB Output is correct
15 Correct 6 ms 1372 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 7 ms 1628 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 7 ms 1900 KB Output is correct
21 Correct 19 ms 4056 KB Output is correct
22 Correct 19 ms 3932 KB Output is correct
23 Correct 6 ms 1372 KB Output is correct
24 Correct 7 ms 2004 KB Output is correct
25 Correct 25 ms 4340 KB Output is correct
26 Correct 6 ms 1368 KB Output is correct
27 Incorrect 2 ms 2096 KB WA in grader: Too many instructions
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2264 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 380 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 440 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 436 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 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 348 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 10 ms 2008 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 3 ms 860 KB Output is correct
42 Correct 2 ms 780 KB Output is correct
43 Correct 5 ms 1308 KB Output is correct
44 Correct 9 ms 2092 KB Output is correct
45 Correct 10 ms 2140 KB Output is correct
46 Correct 8 ms 1884 KB Output is correct
47 Correct 5 ms 860 KB Output is correct
48 Correct 2 ms 860 KB Output is correct
49 Correct 9 ms 1560 KB Output is correct
50 Correct 7 ms 1440 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 2 ms 860 KB Output is correct
53 Correct 9 ms 1556 KB Output is correct
54 Correct 7 ms 1372 KB Output is correct
55 Correct 1 ms 600 KB Output is correct
56 Correct 2 ms 856 KB Output is correct
57 Correct 7 ms 1496 KB Output is correct
58 Correct 8 ms 1660 KB Output is correct
59 Correct 9 ms 1628 KB Output is correct
60 Correct 6 ms 1372 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 2 ms 860 KB Output is correct
63 Correct 12 ms 1476 KB Output is correct
64 Correct 8 ms 1676 KB Output is correct
65 Correct 8 ms 1624 KB Output is correct
66 Correct 6 ms 1372 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 2 ms 604 KB Output is correct
73 Correct 4 ms 856 KB Output is correct
74 Correct 4 ms 1116 KB Output is correct
75 Correct 4 ms 860 KB Output is correct
76 Correct 1 ms 604 KB Output is correct
77 Correct 3 ms 1024 KB Output is correct
78 Correct 6 ms 1372 KB Output is correct
79 Correct 8 ms 1624 KB Output is correct
80 Correct 6 ms 1368 KB Output is correct
81 Correct 3 ms 604 KB Output is correct
82 Correct 2 ms 860 KB Output is correct
83 Correct 7 ms 1528 KB Output is correct
84 Correct 6 ms 1372 KB Output is correct
85 Correct 1 ms 348 KB Output is correct
86 Correct 2 ms 860 KB Output is correct
87 Correct 7 ms 1628 KB Output is correct
88 Correct 1 ms 348 KB Output is correct
89 Correct 7 ms 1900 KB Output is correct
90 Correct 19 ms 4056 KB Output is correct
91 Correct 19 ms 3932 KB Output is correct
92 Correct 6 ms 1372 KB Output is correct
93 Correct 7 ms 2004 KB Output is correct
94 Correct 25 ms 4340 KB Output is correct
95 Correct 6 ms 1368 KB Output is correct
96 Incorrect 2 ms 2096 KB WA in grader: Too many instructions
97 Halted 0 ms 0 KB -