제출 #1291206

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291206		Ludissey	Vision Program (IOI19_vision)	C++20	59 / 100	5 ms	1960 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
int h,w;
using namespace std;

const int LOG=24;

int conv(int i, int j){
	return (j+i*w);
}


void construct_network(int H, int W, int K) {
	h=H;
	w=W;
	vector<int> row;
	vector<int> col;
	for (int i = 0; i < H; i++)
	{
		vector<int> add;
		for (int j = 0; j < W; j++) add.push_back(conv(i,j));
		row.push_back(add_xor(add)); 
	}
	for (int j = 0; j < W; j++)
	{
		vector<int> add;
		for (int i = 0; i < H; i++) add.push_back(conv(i,j));
		col.push_back(add_xor(add));
	}
	int lst=-1;
	vector<int> distLOG(LOG,-1);
	for (int i = 0; i < H; i++)
	{
		int ex=0;
		if(lst==-1) lst=row[i];
		else lst=add_xor({lst,row[i]});
		ex=lst;
		for (int j = 0; j < LOG; j++)
		{
			int nex=-1;
			if(ex==-1) continue;
			if(distLOG[j]==-1) distLOG[j]=ex;
			else {
				nex=add_and({distLOG[j],ex});
				distLOG[j]=add_xor({ex,distLOG[j]});
			}
			ex=nex;
		}
		
	}
	lst=-1;
	for (int i = 0; i < W; i++)
	{
		int ex=0;
		if(lst==-1) lst=col[i];
		else lst=add_xor({lst,col[i]});
		ex=lst;
		for (int j = 0; j < LOG; j++)
		{
			int nex=-1;
			if(ex==-1) continue;
			if(distLOG[j]==-1) distLOG[j]=ex;
			else {
				nex=add_and({distLOG[j],ex});
				distLOG[j]=add_xor({ex,distLOG[j]});
			}
			ex=nex;
		}
	}
	vector<int> mst;
	vector<int> nt;
	for (int j = 0; j < LOG; j++)
	{
		if(K&(1<<j)) {
			if(distLOG[j]==-1) { add_and({0,add_not(0)}); return; }
			mst.push_back(distLOG[j]);
		}else{
			if(distLOG[j]==-1) continue;
			nt.push_back(distLOG[j]);
		}
	}
	add_and({add_and(mst), add_not({add_or(nt)})});
}

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