Submission #415664

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
415664	2021-06-01 10:47:33	AmineTrabelsi	Vision Program (IOI19_vision)	C++14	33 / 100	431 ms	1112 KiB

vision

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
  // add_and(vector);
  // add_or(vector);
  // add_xor(vector);
  // add_not(int);
  auto cell = [&](int x,int y) -> int {
    return x*W+y;
  };
  cerr << cell(0,1) << " "<<cell(1,0) << '\n';
  vector<int> que;
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      for(int x=0;x<=K ;x++){
        cerr<<i<<" "<<j<<" "<<x<<'\n';
        int a = x,b = K-x;
        if(i+a < H && j+b < W){
          int ni = i+a, nj = j+b;
          cerr<<cell(i,j)<<"::"<<cell(ni,nj)<<'\n';
          que.push_back(add_and({cell(i,j),cell(ni,nj)}));
        }
        if(i+a < H && j-b >= 0){
          int ni = i+a, nj = j-b;
          cerr<<cell(i,j)<<"::"<<cell(ni,nj)<<'\n';
          que.push_back(add_and({cell(i,j),cell(ni,nj)}));
        }
        if(i-a >= 0 && j+b < W){
          int ni = i-a, nj = j+b;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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