제출 #293698

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
293698		evpipis	Vision Program (IOI19_vision)	C++14	44 / 100	12 ms	2300 KiB

vision

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

#define pb push_back
int n, m, k, cnt;

bool exist(int i, int j){
    return (0 <= i && i < n && 0 <= j && j < m);
}

int match(int i, int j){
    return i*m + j;
}

void construct_network(int H, int W, int K) {
    n = H, m = W, k = K, cnt = n*m-1;
    //printf("k = %d\n", k);

    vector<int> fin;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++){
            vector<int> temp;
            for (int x = i, y = j+k; y > j; x++, y--)
                if (exist(x, y))
                    temp.pb(match(x, y));//, printf("x = %d, y = %d\n", x, y);
            for (int x = i+k, y = j; x > i; x--, y--)
                if (exist(x, y))
                    temp.pb(match(x, y));

            //printf("i = %d, j = %d\n", i, j);
            if (temp.empty()) continue;
            //printf("i = %d, j = %d, temp not empty\n", i, j);

            add_or(temp), ++cnt;
            add_and({cnt, match(i, j)});
            fin.pb(++cnt);
        }

    //if (fin.empty()) printf("it is empty\n");
    add_or(fin);
}

• 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