Submission #1233784

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233784		veehj	Vision Program (IOI19_vision)	C++17	33 / 100	1 ms	964 KiB

vision

#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<w; currw++){
        Ns={currh*w+currw, (currh+(k-rw))*w+(currw+rw)};
        add_and(Ns);
        swap(Ns[0], Ns[1]);
        add_and(Ns);
        Ns={(currh+(k-rw))*w+currw, currh*w+(currw+rw)};
        add_and(Ns);
        swap(Ns[0], Ns[1]);
        add_and(Ns);
        r+=4;
      }
    }
  }
  Ns={};
  rep(i, l, r){
    Ns.pb(i);
  }
  add_or(Ns);
}

• 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