Submission #1026744

#	Time	Username	Problem	Language	Result	Execution time	Memory
1026744		ach00	Vision Program (IOI19_vision)	C++14	44 / 100	9 ms	3024 KiB

vision

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

int h,w,k;

bool bounds(int y, int x) {
	if(y >= 0 && x >= 0 && y < h && x < w) return true;
	return false;
}

void construct_network(int H, int W, int K) {
    h = H; w = W; k = K;
    int index = H*W;
    vector<int> and_indices;

    for(int y = 0; y < H; y++) {
        for(int x = 0; x < W; x++) {
            vector<int> P;
            for(int i = 0; i <= K; i++) {
                int fdir = i;
                int sdir = K-i;
                if(bounds(y+fdir, x+sdir)) P.push_back((y+fdir)*W + x+sdir);
                if(bounds(y+fdir, x-sdir)) P.push_back((y+fdir)*W + x-sdir);
                if(bounds(y-fdir, x+sdir)) P.push_back((y-fdir)*W + x+sdir);
                if(bounds(y-fdir, x-sdir)) P.push_back((y-fdir)*W + x-sdir);
            }
            if(P.size()) {
                add_or(P);
                index++;
                and_indices.push_back(index);
                add_and({y*W + x, index-1});
                index++;
            }
        }
    }

    add_or(and_indices);
}

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