제출 #865640

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
865640		Lib	Vision Program (IOI19_vision)	C++14	0 / 100	6 ms	1112 KiB

vision

#include <bits/stdc++.h>
#include "vision.h"
using namespace std;
vector <int> RowHasBlack;
vector <int> ColumnHasBlack;
vector <int> temp;

int OutputAns_BothRowColumnDifferent(int K){
		return ( ((RowHasBlack[1]-RowHasBlack[0])  + (ColumnHasBlack[1]-ColumnHasBlack[0]) == K) );
		//return RowHasBlack[1];
}
int OutputAns_OnSameRowColumn(int K){
	return 0;
}
void construct_network(int H, int W, int K){
	RowHasBlack.clear();
	ColumnHasBlack.clear();
	for(int i=0;i<H;i++){
		temp.clear();
		for(int k=0;k<W;k++){
			temp.push_back(i*W+k);
		}
		if(add_or(temp)){
			RowHasBlack.push_back(i);
		}
	}
	for(int i=0;i<W;i++){
		temp.clear();
		for(int k=0;k<H;k++){
			temp.push_back(k*W+i);
		}
		if(add_or(temp)){
			ColumnHasBlack.push_back(i);
		}
	}
	if(RowHasBlack.size()==2&&ColumnHasBlack.size()==2){
		OutputAns_BothRowColumnDifferent(K);
	}else{
		if(RowHasBlack.size()==1){
			RowHasBlack.push_back(RowHasBlack[0]);
		}else{
			ColumnHasBlack.push_back(ColumnHasBlack[0]);
		}
		OutputAns_BothRowColumnDifferent(K);
	}
}

• Subtask 1: 0 / 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