Submission #169273

#	Time	Username	Problem	Language	Result	Execution time	Memory
169273		Osama_Alkhodairy	Vision Program (IOI19_vision)	C++17	100 / 100	16 ms	1908 KiB

vision

#include <bits/stdc++.h>
#include "vision.h"
//~ #include "grader.cpp"
using namespace std;

int H, W, K;
vector <int> kb(9);

int id(int i, int j){
    return i * W + j;
}
void add(int c){
    for(auto &i : kb){
        int old = i;
        i = add_xor({c, i});
        c = add_and({c, old});
    }
}
void construct_network(int h, int w, int k) {
    H = h; W = w; K = k;
    if(H * W == 2){
        add_or({0});
        return;
    }
    int zero = add_and({0, 1, 2});
    int one = add_not(zero);
    for(auto &i : kb){
        i = add_not(one);
    }
    int c = add_not(one);
    for(int i = 0 ; i < H ; i++){
        vector <int> Ns;
        Ns.push_back(c);
        for(int j = 0 ; j < W ; j++){
            Ns.push_back(id(i, j));
        }
        c = add_xor(Ns);
        add(c);
    }
    for(int j = 0 ; j < W ; j++){
        vector <int> Ns;
        Ns.push_back(c);
        for(int i = 0 ; i < H ; i++){
            Ns.push_back(id(i, j));
        }
        c = add_xor(Ns);
        add(c);
    }
    vector <int> f;
    for(int i = 0 ; i < 9 ; i++){
        int cur;
        if((k >> i) & 1) cur = one;
        else cur = zero;
        cur = add_xor({cur, kb[i]});
        cur = add_not(cur);
        f.push_back(cur);
    }
    add_and(f);
}

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