제출 #1233779

#제출 시각아이디문제언어결과실행 시간메모리
1233779veehjVision Program (IOI19_vision)C++17
0 / 100
1 ms960 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;
  for(int rw=0; rw<=k; rw++){
    for(int currh=0; currh+(k-rw)<h; currh++){
      for(int currw=0; currw+rw<h; currw++){
        Ns={currh, currw};
        add_and(Ns);
        r++;
      }
    }
  }
  Ns={};
  rep(i, l, r){
    Ns.pb(i);
  }
  add_or(Ns);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...