Submission #152180

#	Time	Username	Problem	Language	Result	Execution time	Memory
152180		stefdasca	Vision Program (IOI19_vision)	C++14	12 / 100	11 ms	1272 KiB

vision

#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K)
{
    int query_number = H * W - 1;
    for(int i = H - 1; i >= 0; --i)
    {
        vector<int>pz;
        for(int a = i, b = 0; a < H && b < W; ++a, ++b)
            pz.push_back(a * W + b);
        add_xor(pz);
        ++query_number;
    }
    for(int i = 1; i < W; ++i)
    {
        vector<int>pz;
        for(int a = 0, b = i; a < H && b < W; ++a, ++b)
            pz.push_back(a * W + b);
        add_xor(pz);
        ++query_number;
    }
    int q3 = query_number;
    for(int i = 0; i < W; ++i)
    {
        vector<int>pz;
        for(int a = 0, b = i; a < H && b >= 0; ++a, --b)
            pz.push_back(a * W + b);
        add_xor(pz);
        ++q3;
    }
    for(int i = 1; i < H; ++i)
    {
        vector<int>pz;
        for(int a = i, b = W - 1; a < H && b >= 0; ++a, --b)
            pz.push_back(a * W + b);
        add_xor(pz);
        ++q3;
    }
    int total = q3;
    vector<int>lst;
    while(q3 - K > query_number)
    {
        ++total;
        lst.push_back(total);
        add_and({q3, q3 - K});
        --q3;
    }
    while(query_number - K >= H * W)
    {
        ++total;
        lst.push_back(total);
        add_and({query_number, query_number - K});
        --query_number;
    }
    add_or(lst);
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 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