제출 #144235

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
144235		icypiggy	Vision Program (IOI19_vision)	C++14	100 / 100	29 ms	3452 KiB

vision

#include "vision.h"
#include <vector>
using namespace std;
void construct_network(int H, int W, int K) {
    if(K==H+W-2) {
        add_or({add_and({0,H*W-1}),add_and({W-1,(H-1)*W})});
        return;
    }
    vector<int> vdiag[H+W-1];
    vector<int> vdiag2[H+W-1];
    int idx_diag[H+W-1];
    int idx_diag2[H+W-1];
    for(int i=0; i<H; i++) {
        for(int j=0; j<W; j++) {
            vdiag[i+j].push_back(i*W+j);
            vdiag2[H-1-i+j].push_back(i*W+j);
            //cout << "vdiag: " << i*W+j << " " << i+j << " " << H-1-i+j << "\n";
        }
    }
    for(int i=0; i<H+W-1; i++) {
        idx_diag[i] = add_or(vdiag[i]);
    }

    for(int i=0; i<H+W-1; i++) {
        idx_diag2[i] = add_or(vdiag2[i]);
    }
    vector<int> tmp;
    for(int i=0; i+K<H+W-1; i++) {
        tmp.push_back(add_and({idx_diag[i], idx_diag[i+K]}));
        tmp.push_back(add_and({idx_diag2[i], idx_diag2[i+K]}));
    }
    vector<int> tmp2; // if any fail, we fail
    vector<int> vtmp;
    vector<int> vtmp2;
    for(int i=H+W-2; i>K; i--) {
        vtmp.push_back(idx_diag[i]);
        vtmp2.push_back(idx_diag2[i]);
        //cout << idx_diag[i] << "!!!\n";
    }
    for(int i=0; i+K<H+W-2; i++) {
        /*cout << i << ": ";
        for(int i: vtmp) {
            cout << i << " ";
        }
        cout << "\n";*/
        tmp2.push_back(add_and({idx_diag[i], add_or(vtmp)}));
        tmp2.push_back(add_and({idx_diag2[i], add_or(vtmp2)}));
        vtmp.pop_back();
        vtmp2.pop_back();
    }
    //add_or(tmp);
    add_and({add_or(tmp), add_not(add_or(tmp2))});
}

• 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