oj.uz

Submission #976432

# Submission time Handle Problem Language Result Execution time Memory
976432 2024-05-06T14:51:37 Z salmon Vision Program (IOI19_vision) C++14
10 / 100
 8 ms 1496 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K) {
    if(H * W == 2){
        add_and({0,1});
        return;
    }

	vector<int> Ns;

	Ns = {0, 1, 2};

    int troo;
    int untroo;

    untroo = add_and(Ns);
    troo = add_not(untroo);

    vector<int> column;

    for(int i = 0; i < H; i++){
        column.push_back(i * W);
    }

    vector<int> cond;

    for(int i = 0; i < W; i++){
        cond.push_back(add_xor(column));

        for(int j = 0; j < H; j++){
            column[j]++;
        }
    }

    for(int i = 1; i < W; i++){
        cond[i] = add_xor({cond[i], cond[i - 1]});
    }

    vector<int> digit1,digit2;

    for(int i = 0; i < 3; i++){
        digit1.push_back(add_xor(cond));

        vector<int> temp = {cond[0]};
        for(int j = 1; j < W; j++){
            temp.push_back(add_and({cond[j], add_xor({cond[j], temp[j - 1]})}) );
        }

        for(int j = 0; j < W; j++){
            temp[j] = add_xor({temp[j],cond[j]});
        }

        for(int j = 0; j < W/2; j++){
            cond[j] = temp[j * 2 + 1];
        }

        for(int j = 0; j < W/2 + 1; j++){
            cond[j + W/2] = temp[j * 2];
        }
    }

    vector<int> row;

    for(int i = 0; i < W; i++){
        row.push_back(i);
    }

    cond.clear();

    for(int i = 0; i < H; i++){
        cond.push_back(add_xor(row));

        for(int j = 0; j < W; j++){
            row[j] += W;
        }
    }

    for(int i = 1; i < H; i++){
        cond[i] = add_xor({cond[i], cond[i - 1]});
    }

    for(int i = 0; i < 3; i++){
        digit2.push_back(add_xor(cond));

        vector<int> temp = {cond[0]};
        for(int j = 1; j < H; j++){
            temp.push_back(add_and({cond[j], add_xor({cond[j], temp[j - 1]})}) );
        }

        for(int j = 0; j < H; j++){
            temp[j] = add_xor({temp[j],cond[j]});
        }

        for(int j = 0; j < H/2; j++){
            cond[j] = temp[j * 2 + 1];
        }

        for(int j = 0; j < H/2 + 1; j++){
            cond[j + H/2] = temp[j * 2];
        }
    }

    vector<int> digit;
    int carry = untroo;

    for(int i = 0; i < 3; i++){
        digit.push_back(add_xor({carry, digit1[i], digit2[i]}));
        carry = add_or({add_and({carry, digit1[i]}), add_and({digit2[i], digit1[i]}), add_and({carry, digit2[i]})    });
    }

    vector<int> compare;
    for(int i = 0; i < 3; i++){
        if(K%2 == 1) compare.push_back(add_not(add_xor({digit[i],troo})) );
        else compare.push_back(add_not(add_xor({digit[i],untroo})) );
        K/=2;
    }

    add_and(compare);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 436 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 436 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 1 ms 348 KB on inputs (0, 4), (6, 0), expected 0, but computed 1
22 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 436 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 1 ms 348 KB on inputs (0, 4), (6, 0), expected 0, but computed 1
22 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 436 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 1 ms 348 KB on inputs (0, 4), (6, 0), expected 0, but computed 1
22 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 604 KB on inputs (0, 0), (0, 9), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Incorrect 2 ms 436 KB on inputs (0, 0), (100, 28), expected 0, but computed 1
6 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1496 KB on inputs (59, 80), (127, 11), 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 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 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 436 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 1 ms 348 KB on inputs (0, 4), (6, 0), expected 0, but computed 1
22 Halted 0 ms 0 KB -