Submission #408763

#	Time	Username	Problem	Language	Result	Execution time	Memory
408763		rumen_m	Vision Program (IOI19_vision)	C++17	0 / 100	14 ms	1732 KiB

vision

#include "vision.h"
using namespace std;
int bits[11];
int rows[205],col[205];
vector <int> mv(int a, int b=-1)
{
    vector <int> w;
    w.push_back(a);
    w.push_back(b);
    return w;
}
void add(int delta)
{
    int ost = delta;
    for(int i=0;i<10;i++)
    {
        int newid = add_xor(mv(ost,bits[i]));
        ost = add_and(mv(ost,bits[i]));
        bits[i] = newid;
    }
}
void construct_network(int H, int W, int K) {
	vector<int> w;
	int i;
	int zero = add_and(mv(add_not(0),0));
	for(i=0;i<10;i++)bits[i] = add_and(mv(zero,0));
	int curr = zero;
	for(i=0;i<H;i++)
    {
        w.clear();
        w.push_back(curr);
        for(int j=0;j<W;j++)
        {
            w.push_back(i*W+j);
        }
        curr = add_xor(w);
        add(curr);
    }
    curr = zero;
    for(i=0;i<W;i++)
    {
        w.clear();
        w.push_back(curr);
        for(int j=0;j<H;j++)
        {
            w.push_back(j*W+i);
        }
        curr = add_xor(w);
        add(curr);
    }
    curr = zero;
    w.clear();
    w.push_back(curr);
    for(i=0;i<10;i++)
    {
        if((1<<i)&K)
        {
            w.push_back(bits[i]);
        }
        else
            w.push_back(add_not(bits[i]));
    }
    add_and(w);
    return ;

}

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