Submission #478380

#	Time	Username	Problem	Language	Result	Execution time	Memory
478380		blue	Vision Program (IOI19_vision)	C++17	21 / 100	124 ms	2852 KiB

vision

#include "vision.h"
#include <vector>
using namespace std;

int checkifleq(int H, int W, int K_) //check if one diagonal is equal to K
{
    int K = K_;
    vector<int> diag_res;

    for(int V = 1; V <= 2; V++)
    {
        vector<int> diag1_list;

        if(V == 1)
        {
            for(int d1 = 0; d1 <= H-1 + W-1; d1++)
            {
                vector<int> op;
                for(int i = 0; i < H; i++)
                {
                    for(int j = 0; j < W; j++)
                    {
                        if(i+j == d1) op.push_back(W*i + j);
                    }
                }
                diag1_list.push_back(add_or(op));
            }
        }
        else
        {
            for(int d1 = 0-(W-1); d1 <= (H-1)-0; d1++)
            {
                vector<int> op;
                for(int i = 0; i < H; i++)
                {
                    for(int j = 0; j < W; j++)
                    {
                        if(i-j == d1) op.push_back(W*i + j);
                    }
                }
                diag1_list.push_back(add_or(op));
            }
        }

        vector<int> diag1_comp_list;
        for(int i = 0; i+K < (int)diag1_list.size(); i++)
        {
            diag1_comp_list.push_back(add_and(vector<int>{diag1_list[i], diag1_list[i+K]}));
        }

        diag_res.push_back(add_or(diag1_comp_list));
    }

    return add_or(diag_res);
}

void construct_network(int H, int W, int K)
{
    int Kexists = checkifleq(H, W, K);
    vector<int> gK{Kexists};
    for(int k = K+1; k <= H+W-2; k++)
    {
        gK.push_back(add_not(checkifleq(H, W, k)));
    }

    add_and(gK);
}

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