제출 #1019028

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1019028		ProtonDecay314	Vision Program (IOI19_vision)	C++17	33 / 100	76 ms	1236 KiB

vision

// AM+DG

/*

*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
#define L(i, varmn, varmx) for(ll i = varmn; i < varmx; i++)
#define LR(i, varmx, varmn) for(ll i = varmx; i > varmn; i--)
#define LI(i, varmn, varmx) for(int i = varmn; i < varmx; i++)
#define LIR(i, varmx, varmn) for(int i = varmx; i > varmn; i--)
#define pb push_back
#include "vision.h"

void construct_network(int h, int w, int k) {
    vi all_pairs;
    LI(x1, 0, w) {
        LI(y1, 0, h) {
            LI(x2, 0, w) {
                LI(y2, 0, h) {
                    if(abs(x1 - x2) + abs(y1 - y2) == k) {
                        vi cur_inps = {y1 * w + x1, y2 * w + x2};
                        all_pairs.pb(add_and(cur_inps));
                    }
                }
            }
        }
    }

    add_or(all_pairs);

    return;
}

• 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