Submission #238949

#	Time	Username	Problem	Language	Result	Execution time	Memory
238949		duality	Vision Program (IOI19_vision)	C++14	100 / 100	16 ms	1920 KiB

vision

#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "vision.h"

vi a[400],b[400];
void construct_network(int H,int W,int K) {
    int i,j;
    for (i = 0; i < H; i++) {
        for (j = 0; j < W; j++) a[i+j].pb(i*W+j),b[i+W-j-1].pb(i*W+j);
    }
    vi x,y,p,q;
    for (i = 0; i < H+W-1; i++) {
        if (i > 0) a[i].pb(x.back()),b[i].pb(y.back());
        x.pb(add_xor(a[i])),y.pb(add_xor(b[i]));
        if (i >= K-1) p.pb(add_and({x[i],x[i-K+1]})),p.pb(add_and({y[i],y[i-K+1]}));
        if (i >= K) q.pb(add_and({x[i],x[i-K]})),q.pb(add_and({y[i],y[i-K]}));
    }
    add_xor({add_or(p),add_or(q)});
}

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