제출 #403082

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
403082		rocks03	Vision Program (IOI19_vision)	C++14	33 / 100	91 ms	1148 KiB

vision

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int add_and(vector<int> Ns);

int add_or(vector<int> Ns);

int add_xor(vector<int> Ns);

int add_not(int N);

void construct_network(int H, int W, int K){
    int cnt = 0;
    auto dist = [&](int x, int y, int x2, int y2){
        return abs(x - x2) + abs(y - y2);
    };
    auto cell = [&](int x, int y){
        return x * W + y;
    };
    rep(h, 0, H){
        rep(w, 0, W){
            rep(h2, 0, H){
                rep(w2, 0, W){
                    if(dist(h, w, h2, w2) == K){
                        add_and({cell(h, w), cell(h2, w2)}); cnt++;
                    }
                }
            }
        }
    }
    vector<int> v;
    rep(i, 0, cnt){
        v.pb(H * W + i);
    }
    add_or(v);
}

• 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