제출 #423961

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423961		aymanrs	Vision Program (IOI19_vision)	C++14	0 / 100	19 ms	1928 KiB

vision

    #include <bits/stdc++.h> 
    #include "vision.h"
    using namespace std;
    void construct_network(int H, int W, int K){
        vector<int> ow, xw, ad, oc, xc;
        int f = -1, l = -1;
        for(int i = H-1;i > 0;i--){
            vector<int> o;
            for(int j = i;j < H;j++){
                o.push_back(j * W + j - i);
            }
            ow.push_back(add_or(o));
            xw.push_back(add_xor(o));
        }
        for(int i = 0;i < W;i++){
            vector<int> o;
            for(int j = i;j < W;j++){
                o.push_back((j - i) * W + j);
            }
            ow.push_back(add_or(o));
            xw.push_back(add_xor(o));
        }
        for(int i = 0;i < W;i++){
            vector<int> o;
            for(int j = i;j >= 0;j--){
                o.push_back((i - j) * W + j);
            }
            oc.push_back(add_or(o));
            xc.push_back(add_xor(o));
        }
        for(int i = 1;i < H;i++){
            vector<int> o;
            for(int j = i;j < H;j++){
                o.push_back(j * W + W - 1 - j + i);
            }
            oc.push_back(add_or(o));
            xc.push_back(add_xor(o));
        }
        for(int i = 0;i < H-K;i++){
            ad.push_back(add_and({ow[i], ow[i+K]}));
        }
        f = add_and({add_not(add_or(xc)), add_or(ad)});
        ad.clear();
        for(int i = 0;i < W-K;i++){
            ad.push_back(add_and({oc[i], oc[i+K]}));
        }
        l = add_and({add_not(add_or(xw)), add_or(ad)});
        add_or({f, l});
    }

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