제출 #856398

#제출 시각아이디문제언어결과실행 시간메모리
856398Trisanu_DasVision Program (IOI19_vision)C++17
0 / 100
7 ms1116 KiB
#include "vision.h"
#include <bits/stdc++.h>
using namespace std; 
void construct_network(int h, int w, int k){
  vector<int> ans;
  if(k == 1){
    vector<int> r(h), c(w);
    for(int i = 0; i < h; i++){
      vector<int> res;
      for(int j = 0; j < w; j++) res.push_back(i * w + j);
      r[i] = add_or(res);
    }
    for(int i = 0; i < w; i++){
      vector<int> res;
      for(int j = 0; j < h; j++) res.push_back(i * h + j);
      c[i] = add_or(res);
    }
    int xr = add_xor(r), xc = add_xor(c);
    for(int i = 0; i < h; i++) ans.push_back(add_and({r[i - 1], r[i], xr}));
    for(int i = 0; i < w; i++) ans.push_back(add_and({c[i - 1], c[i], xc}));
  }else{
    for(int i = 0; i < h; i++){
      for(int j = 0; j < w; j++){
        vector<int> res;
        for(int x = 0; x < h; x++) for(int y = 0; y < w; y++) if(abs(i - x) + abs(j - y) == k) res.push_back(x * w + y);
        if(!res.empty()) ans.push_back(add_and({add_or(res), i * w + j}));
      }
    }
  }
  add_or(ans);
}
#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...