제출 #285339

#제출 시각아이디문제언어결과실행 시간메모리
285339CaroLindaVision Program (IOI19_vision)C++14
0 / 100
140 ms1104 KiB
#include <bits/stdc++.h>

#define lp(i,a,b) for(int i = a; i < b ; i++)
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define mk make_pair
#define sz(x) (int)(x.size())
#define pii pair<int,int>
#define mkt make_tuple
#define debug printf
#include "vision.h"

using namespace std ;

int N, M ;

int code(int i, int j) { return i * M + j ; }

void construct_network(int H, int W, int K) 
{
	N = H ;
	M = W ;
	int lastIdx = H*W - 1 ;
	vector<int> v ;

	for(int i = 0 ; i < H ; i++ )
		for(int j = 0 ; j < W ; j++ )
			for(int ii = i; ii < H ; ii++ )
				for(int jj = 0 ; jj < W ; jj++ )
					if( abs(i-ii) + abs(j-jj) == K ) 
					{
						v = { code(i,j) , code(ii,jj) } ;
						lastIdx = add_and(v) ;
					}

	v = {H*W, lastIdx } ;
	add_or( v ) ;

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...