제출 #976824

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
976824		hmm789	Vision Program (IOI19_vision)	C++14	58 / 100	8 ms	1372 KiB

vision

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

void construct_network(int H, int W, int K) {
    int a[H][W], rows[H], cols[W];
    for(int i = 0; i < H; i++) {
        for(int j = 0; j < W; j++) {
            a[i][j] = i*W+j;
        }
    }
    for(int i = 0; i < H; i++) {
        vector<int> v;
        for(int j = 0; j < W; j++) v.push_back(a[i][j]);
        rows[i] = add_xor(v);
    }
    for(int j = 0; j < W; j++) {
        vector<int> v;
        for(int i = 0; i < H; i++) v.push_back(a[i][j]);
        cols[j] = add_xor(v);
    }
    vector<int> res;
    for(int i = 1; i < K; i++) {
        int x = i, y = K-i;
        if(x >= H || y >= W) continue;
        vector<int> v;
        for(int j = 0; j < H-x; j++) v.push_back(add_and({rows[j], rows[j+x]}));
        int tmp = add_or(v);
        v.clear();
        for(int j = 0; j < W-y; j++) v.push_back(add_and({cols[j], cols[j+y]}));
        res.push_back(add_and({tmp, add_or(v)}));
    }
    if(H > K) {
        vector<int> v;
        for(int j = 0; j < H-K; j++) v.push_back(add_and({rows[j], rows[j+K]}));
        int tmp = add_or(v);
        v.clear();
        for(int j = 0; j < W; j++) v.push_back(cols[j]);
        res.push_back(add_and({tmp, add_not(add_or(v))}));
    }
    if(W > K) {
        vector<int> v;
        for(int j = 0; j < W-K; j++) v.push_back(add_and({cols[j], cols[j+K]}));
        int tmp = add_or(v);
        v.clear();
        for(int j = 0; j < H; j++) v.push_back(rows[j]);
        res.push_back(add_and({tmp, add_not(add_or(v))}));
    }
    add_or(res);
}

• 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: 14 / 14
• Subtask 8: 0 / 19