Submission #298169

#	Time	Username	Problem	Language	Result	Execution time	Memory
298169		shayan_p	Vision Program (IOI19_vision)	C++17	44 / 100	224 ms	3056 KiB

vision

#include<bits/stdc++.h>
#include "vision.h"

#define F first
#define S second
#define PB push_back
#define sz(s) (int(s.size()))
#define bit(n, k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;


void construct_network(int H, int W, int K){
    /*
    vector<int> Ns;
    Ns = {0, 1};
    int a = add_and(Ns);
    Ns = {0, a};
    int b = add_or(Ns);
    Ns = {0, 1, b};
    int c = add_xor(Ns);
    add_not(c);*/

    auto to = [&](int x, int y){
		  return x * W + y;
	      };
    vector<int> toOr;
    int cnt = H * W;
    for(int a = 0; a < H; a++){
	for(int b = 0; b < W; b++){
	    vector<int> vec;
	    vector<int> vec2;
	    for(int c = 0; c < H; c++){
		for(int d = 0; d < W; d++){
		    if(abs(a-c) + abs(b-d) == K){
			vec2.PB(to(c, d));
		    }
		}
	    }
	    if(vec2.empty())
		continue;
	    vec.PB(to(a, b));
	    vec.PB(cnt);	    
	    add_or(vec2);
	    cnt++;

	    toOr.PB(cnt);
	    add_and(vec);
	    cnt++;
	}	
    }
    add_or(toOr);
}

• 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: 0 / 14
• Subtask 8: 0 / 19