제출 #581853

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
581853		Mr_Husanboy	Vision Program (IOI19_vision)	C++14	100 / 100	16 ms	1736 KiB

vision

#include "vision.h"
#include<bits/stdc++.h>

using namespace std;

int dist(int i, int j, int a, int b){
    return abs(i-a)+abs(j-b);
}

void construct_network(int n, int m, int d) {
	vector<int> ones;
	vector<int> v;
	for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            v.push_back(i*m+j);
        }
        ones.push_back(add_xor(v));
        v.clear(); v.push_back(ones.back());
	}v.clear();
	for(int i=0;i<m;i++){
        for(int j=0;j<n;j++){
            v.push_back(j*m+i);
        }
        ones.push_back(add_xor(v));
        v.clear(); v.push_back(ones.back());
	}
	int sz=ones.size(); int LOG=0;
	while(sz){
        sz/=2; LOG++;
	}
	vector<int> num(LOG);
	for(int i=0;i<LOG;i++){
        num[i]=add_xor(ones);
        if(!(d&(1<<i))) num[i]=add_not(num[i]);
        int last=ones.back();
        vector<int> temp;
        for(auto i:ones){
            temp.push_back(add_and({last,i}));
            last=add_xor({last,i});
        }
        ones=temp;
	}
    add_and(num);
    return;
}

• 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