Submission #856409

#	Time	Username	Problem	Language	Result	Execution time	Memory
856409		Trisanu_Das	Vision Program (IOI19_vision)	C++17	58 / 100	1037 ms	6156 KiB

vision

#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), ans;
	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 j = 0; j < w; j++) {
		vector<int> res;
		for (int i = 0; i < h; i++) res.push_back(i * w + j);
		c[j] = add_or(res);
	}
	int xr = add_xor(r), xc = add_xor(c);
	for (int i = 1; i < h; i++) ans.push_back(add_and({r[i - 1], r[i], xc}));
	for (int i = 1; i < w; i++) ans.push_back(add_and({c[i - 1], c[i], xr}));
    add_or(ans);
  }else{
    int ques = 9999;
    vector<int> ans;
    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 = (i == h ? j : 0); y < w; y++) if(abs(i - x) + abs(j - y) == k && ques > 1) res.push_back(x * w + y);
        if(!res.empty()) {
          ques -= 2;
          ans.push_back(add_and({add_or(res), i * w + j}));
        }
      }
    }
    add_or(ans);
  }
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 14 / 14
• Subtask 8: 0 / 19