제출 #222559

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
222559		VEGAnn	Vision Program (IOI19_vision)	C++14	40 / 100	9 ms	640 KiB

vision

#include <bits/stdc++.h>
#include "vision.h"
#define sz(x) ((int)x.size())
#define pii pair<int,int>
#define ft first
#define sd second
#define MP make_pair
#define PB push_back
using namespace std;
const int N = 100100;
vector<int> vc, res;
int n, m;

bool ok(int x, int y){
    return (x >= 0 && y >= 0 && x < n && y < m);
}

void construct_network(int H, int W, int K) {
    n = H; m = W;
    res.clear();

    int bdh = H, bdw = W;

    if (max(H, W) > 30){
        bdh = 1;
        bdw = 1;
    }

    for (int i = 0; i < bdh; i++)
    for (int j = 0; j < bdw; j++){
        vc.clear();

        int x = i, y = j - K;

        while (x != i - K){
            if (ok(x, y))
                vc.PB(x * m + y);

            x--; y++;
        }

        while (x != i){
            if (ok(x, y))
                vc.PB(x * m + y);

            x++; y++;
        }

        while (x != i + K){
            if (ok(x, y))
                vc.PB(x * m + y);

            x++; y--;
        }

        while (x != i){
            if (ok(x, y))
                vc.PB(x * m + y);

            x--; y--;
        }

        if (!sz(vc)) continue;

        int id = add_or(vc);
        res.PB(add_and({id, i * m + j}));
    }

    add_or(res);
}

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