Submission #658883

#	Time	Username	Problem	Language	Result	Execution time	Memory
658883		jiahng	Vision Program (IOI19_vision)	C++14	44 / 100	21 ms	2996 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 200010
#define INF (ll)1e9
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;

int H,W;
bool valid(int x,int y){
    return (x >= 0 && x < H && y >= 0 && y < W);
}
void construct_network(int H, int W, int K) {
    vi ans;
    ::H = H; ::W = W;
    FOR(i,0,H-1) FOR(j,0,W-1){
        vi v;
        for (int x=i-K,y=j; x <= i; x++,y--) if (valid(x,y)) v.pb(x*W+y);
        for (int x=i-K,y=j; x <= i; x++,y++) if (valid(x,y)) v.pb(x*W+y);
        for (int x=i+K,y=j; x >= i; x--,y--) if (valid(x,y)) v.pb(x*W+y);
        for (int x=i+K,y=j; x >= i; x--,y++) if (valid(x,y)) v.pb(x*W+y);
        sort(all(v)); v.erase(unique(all(v)), v.end());
        if (v.empty()) continue;
        int idx = add_xor(v);
        ans.pb(add_and({i*W+j, idx}));
    }
    add_or(ans);


}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19