Submission #1359754

#TimeUsernameProblemLanguageResultExecution timeMemory
1359754anangoVision Program (IOI19_vision)C++20
8 / 100
1 ms344 KiB
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K) {
    vector<int> diamonds;
    for (int i=0; i<H; i++) {
        for (int j=0; j<W; j++) {
            if (i>0 || j>0) continue;
            vector<int> indices;
            for (int k=0; k<H; k++) {
                for (int l=0; l<W; l++) {
                    if (abs(k-i) + abs(l-j) == K) {
                        indices.push_back(k*W+l);
                    }
                }
            }
            if (indices.size()==0) continue;
            int cell = add_or(indices);
            diamonds.push_back(add_and({i*W+j, cell}));
        }
    }
    int final_cell = add_or(diamonds);
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...