oj.uz

Submission #767739

# Submission time Handle Problem Language Result Execution time Memory
767739 2023-06-27T06:26:27 Z t6twotwo Vision Program (IOI19_vision) C++17
12 / 100
 8 ms 1276 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
    vector<int> A(H + W - 1);
    for (int i = 0; i < H + W - 1; i++) {
        int x = max(0, H - i - 1);
        int y = max(0, i - H + 1);
        vector<int> v;
        while (x < H && y < W) {
            v.push_back(x * W + y);
            x++;
            y++;
        }
        A[i] = add_or(v);
    }
    vector<int> B(H + W - 1);
    for (int i = 0; i < H + W - 1; i++) {
        int x = max(0, H - i - 1);
        int y = min(W - 1, H + W - 2 - i);
        vector<int> v;
        while (x < H && y >= 0) {
            v.push_back(x * W + y);
            x++;
            y--;
        }
        B[i] = add_or(v);
    }
    vector<int> p, q;
    for (int i = 0; i + K < H + W - 1; i++) {
        p.push_back(add_and({A[i], A[i + K]}));
    }
    for (int i = 0; i < H + W - 1; i++) {
        vector<int> v;
        for (int j = 0; j <= K && i + j < H + W - 1; j++) {
            v.push_back(B[i + j]);
        }
        q.push_back(add_and({B[i], add_or(v)}));
    }
    vector<int> r, s;
    for (int i = 0; i + K < H + W - 1; i++) {
        r.push_back(add_and({B[i], B[i + K]}));
    }
    for (int i = 0; i < H + W - 1; i++) {
        vector<int> v;
        for (int j = 0; j <= K && i + j < H + W - 1; j++) {
            v.push_back(A[i + j]);
        }
        s.push_back(add_and({A[i], add_or(v)}));
    }
    add_or({add_and({add_or(p), add_or(q)}), add_and({add_or(r), add_or(s)})});
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

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

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 3 ms 572 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 5 ms 852 KB Output is correct
21 Incorrect 8 ms 1276 KB on inputs (0, 0), (199, 99), expected 0, but computed 1
22 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1264 KB on inputs (126, 120), (176, 169), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -