Submission #431533

#	Time	Username	Problem	Language	Result	Execution time	Memory
431533		pure_mem	Vision Program (IOI19_vision)	C++14	10 / 100	32 ms	2864 KiB

vision

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

#define X first
#define Y second
#define MP make_pair
#define ll long long

using namespace std;

const int N = 300;

int ptr;

void build(int n, int (&arr)[N], const int (&mem)[N]){
	for(int it = 0;(1 << it) < n;it++){
		vector< int > fin;
		for(int i1 = 0;i1 + 1 < n;i1++){
			vector<int> tmp;
			for(int i2 = i1 + 1;i2 < n;i2++){
				if(((i2 - i1) >> it) & 1){
					tmp.push_back(mem[i2]);
				}
			}
			if(tmp.empty()) continue;
			add_xor(tmp);
 			add_and({mem[i1], ptr});
			fin.push_back(ptr + 1);
			ptr += 2;
		}
		arr[it] = ptr++, add_or(fin);
	}
}

int prep(int len, int n, const int (&arr)[N]){
	if(len == 0){
		vector<int> tmp;
		for(int i = 0;i < n;i++){
			tmp.push_back(arr[i]);
		}
		add_xor(tmp), ptr++;
	}
	else{
		vector<int> tmp;
		for(int i = 0;(1 << i) < n;i++){
			if((len >> i) & 1) tmp.push_back(arr[i]);
		}
		add_and(tmp), ptr++;
	}
	return ptr - 1;
}

int isRow[N], isCol[N];
int bRow[N], bCol[N];

void construct_network(int H, int W, int K) {
	ptr = H * W;
	for(int i = 0;i < H;i++){
		vector<int> tmp;
		for(int j = 0;j < W;j++){
			tmp.push_back(W * i + j);
		}
		isRow[i] = ptr++, add_or(tmp);
	}
	for(int j = 0;j < W;j++){
		vector<int> tmp;
		for(int i = 0;i < H;i++){
			tmp.push_back(W * i + j);
		}
		isCol[j] = ptr++, add_or(tmp);
	}
	build(H, bRow, isRow);	

	build(W, bCol, isCol);
	vector< int > fin;
	for(int i = 0;i < H;i++){
		for(int j = 0;j < W;j++){
			if(i + j == K){
				int x = prep(i, H, i == 0 ? isRow: bRow);
				int y = prep(j, W, j == 0 ? isCol: bCol);
				add_and({x, y});
				fin.push_back(ptr++);
			}
		}
	}
	add_or(fin);
}

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