oj.uz

Submission #657867

# Submission time Handle Problem Language Result Execution time Memory
657867 2022-11-11T15:37:16 Z benjaminkleyn Vision Program (IOI19_vision) C++17
12 / 100
 23 ms 2492 KB 
#include <bits/stdc++.h>
#include "vision.h"
using namespace std;
typedef long long ll;

void construct_network(int h, int w, int k)
{
    vector<int> rd1(h + w - 1), rd2(h + w - 1);
    vector<int> ld1(h + w - 1), ld2(h + w - 1);
    for (int d = 0; d <= h + w - 2; d++)
    {
        // right-diagonal of (i, j) = i + j
        vector<int> idxR;
        for (int i = 0; i < h; i++)
            if (0 <= d - i && d - i < w)
                idxR.push_back(i * w + d - i);
        rd1[d] = add_or(idxR);
        rd2[d] = add_xor({add_xor(idxR), rd1[d]});

        // left-diagonal of (i, j) = i - j + (w - 1)
        vector<int> idxL;
        for (int i = 0; i < h; i++)
            if (0 <= i - d + w - 1 && i - d + w - 1 < w)
                idxL.push_back(i * w + i - d + w - 1);
        ld1[d] = add_or(idxL);
        ld2[d] = add_xor({add_xor(idxL), rd1[d]});
    }
    vector<int> A, B, C, D;
    for (int d = 0; d + k <= h + w - 2; d++)
    {
        vector<int> idxR1, idxR2, idxL1, idxL2;
        for (int i = d; i <= d + k; i++)
        {
            idxR1.push_back(rd1[i]);
            idxR2.push_back(rd2[i]);
            idxL1.push_back(ld1[i]);
            idxL2.push_back(ld2[i]);
        }
        A.push_back(add_xor({add_or(idxR1),add_xor(idxR1),add_xor(idxR2)}));
        B.push_back(add_xor({add_or(idxL1),add_xor(idxL1),add_xor(idxL2)}));
    }
    for (int d = 0; d + k - 1 <= h + w - 2; d++)
    {
        vector<int> idxR1, idxR2, idxL1, idxL2;
        for (int i = d; i <= d + k - 1; i++)
        {
            idxR1.push_back(rd1[i]);
            idxR2.push_back(rd2[i]);
            idxL1.push_back(ld1[i]);
            idxL2.push_back(ld2[i]);
        }
        C.push_back(add_xor({add_or(idxR1),add_xor(idxR1),add_xor(idxR2)}));
        D.push_back(add_xor({add_or(idxL1),add_xor(idxL1),add_xor(idxL2)}));
    }
    int x = add_and({add_or(A), add_or(B)});
    int y = add_and({add_or(C), add_or(D)});

    add_and({x, add_not(y)});
}

Subtask #1
0 / 10.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 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 Incorrect 0 ms 212 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 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 0 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 Incorrect 0 ms 212 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 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 0 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 Incorrect 0 ms 212 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 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 0 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 Incorrect 0 ms 212 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 13 ms 1484 KB Output is correct
3 Correct 12 ms 1396 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 16 ms 1364 KB Output is correct
7 Correct 11 ms 1236 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 10 ms 1228 KB Output is correct
11 Correct 12 ms 1480 KB Output is correct
12 Correct 12 ms 1424 KB Output is correct
13 Correct 12 ms 1092 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 10 ms 1272 KB Output is correct
17 Correct 12 ms 1492 KB Output is correct
18 Correct 12 ms 1456 KB Output is correct
19 Correct 12 ms 1084 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 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 Incorrect 1 ms 212 KB on inputs (0, 0), (1, 1), expected 1, but computed 0
3 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 2492 KB on inputs (96, 130), (143, 84), 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 0 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 Incorrect 0 ms 212 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -