Submission #947002

#	Time	Username	Problem	Language	Result	Execution time	Memory
947002		sleepntsheep	Vision Program (IOI19_vision)	C++17	100 / 100	15 ms	2008 KiB

vision

#include "vision.h"
#include<vector>

using namespace std;
using V=std::vector<int>;

int F,T,KK;

int adder(int x,int c)
{
    for(int i=0;i<9;++i)
    {
        add_xor(V{x+2*i,c});
        c=add_and(V{x+2*i,c});
    }
    return c-17;
}

int alloc()
{
    int c=add_not(F)+1;
    for(int i=0;i<18;++i)
        add_not(T);
    return c;
}

void construct_network(int H, int W, int K)
{
    add_not(0);
    F=add_and(V{0,H*W});
    T=add_not(F);
    KK=alloc();
    int run=alloc();

    for(int i=0;i<H;++i)
    {
        V e;
        for(int j=0;j<W;++j)e.push_back(i*W+j);
        int rr=add_xor(e);
        run=add_xor(V{run,rr});
        KK=adder(KK,run);
    }

    for(int i=0;i<W;++i)
    {
        V e;
        for(int j=0;j<H;++j)e.push_back(j*W+i);
        int rr=add_xor(e);
        run=add_xor(V{run,rr});
        KK=adder(KK,run);
    }

    V ans;
    for(int i=0;i<9;++i)
        ans.push_back(add_not(add_xor(V{KK+2*i,(K&(1<<i))?T:F})));
    add_and(ans);
}

• 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