제출 #152130

#제출 시각아이디문제언어결과실행 시간메모리
152130stefdascaVision Program (IOI19_vision)C++14
33 / 100
257 ms1140 KiB
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K)
{
    /*
	vector<int> Ns;
	Ns = {0, 1};
	int a = add_and(Ns);
	Ns = {0, a};
	int b = add_or(Ns);
	Ns = {0, 1, b};
	int c = add_xor(Ns);
	add_not(c);
	*/
	int fi = H * W;
	int lst = H * W - 1;
	for(int i = 0; i < H; ++i)
        for(int j = 0; j < W; ++j)
            for(int q = 0; q < H; ++q)
                for(int z = 0; z < W; ++z)
                    if(abs(i - q) + abs(j - z) == K)
                    {
                        if(q > i || (q == i && z >= j))
                        {
                            add_and({i * W + j, q * W + z});
                            ++lst;
                        }
                    }
    vector<int>s;
    for(int i = fi; i <= lst; ++i)
        s.push_back(i);
    add_or(s);
}
#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...