제출 #1187086

#제출 시각아이디문제언어결과실행 시간메모리
1187086origabaiVision Program (IOI19_vision)C++20
44 / 100
11 ms3008 KiB
#include<bits/stdc++.h>
using namespace std;
#include"vision.h"

void construct_network(int H, int W, int K){
    vector<int> all;
    for (int i=0;i<H;i++){
        for (int j=0;j<W;j++){
            vector<int> curr;
            for (int l=-K;l<=K;l++){
                if (i+l >= 0 && i+l < H && j-K+abs(l) >= 0 && j-K+abs(l) < W){
                    curr.push_back((i+l) * W + (j-K+abs(l)));
                }
                if (i+l >= 0 && i+l < H && j+K-abs(l) >= 0 && j+K-abs(l) < W){
                    curr.push_back((i+l) * W + (j+K-abs(l)));
                }
            }
            if (curr.size()==0)continue;
            int a = add_or(curr);
            all.push_back(add_and({a, i*W+j}));
        }
    }
    add_or(all);
}
#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...