# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1233800 | veehj | Vision Program (IOI19_vision) | C++17 | 0 ms | 0 KiB |
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
#define sz(a) (ll) a.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, a, b) for(ll i=(ll)(a); i<(ll)(b); i++)
#define rrep(i, a, b) for(ll i=(ll)(a); i>=(ll)(b); i--)
#define vl vector<ll>
#define vpll vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define pll pair<ll, ll>
void construct_network(int h, int w, int k) {
ll l=h*w, r=h*w;
vector<int> Ns;
set<int> st;
for(int rw=0; rw<=k; rw++){
int currh=0; currw=0;
st.insert(currh*w+currw);
st.insert((currh+(k-rw))*w+(currw+rw));
st.insert((currh+(k-rw))*w+currw);
st.insert(currh*w+(currw+rw));
}
Ns={};
for(auto& u : st) Ns.pb(u);
add_xor(Ns);
}