제출 #1042121

#제출 시각아이디문제언어결과실행 시간메모리
1042121LaMatematica14Vision Program (IOI19_vision)C++17
12 / 100
1 ms424 KiB
#include <vector>
#include <string>
using namespace std;

int add_and(std::vector<int> Ns);

int add_or(std::vector<int> Ns);

int add_xor(std::vector<int> Ns);

int add_not(int N);

void construct_network(int H, int W, int K) {
    if (W == 1) swap(W, H); 
    for (int i = 0; i < W-K; i++) {
        vector<int> ta = {i, i+K};
        add_and(ta);
    }
    vector<int> t;
    for (int i = 0; i < W-K; i++) t.push_back(W+i);
    add_or(t);
}
#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...