Submission #1291352

#	Time	Username	Problem	Language	Result	Execution time	Memory
1291352		MMihalev	Vision Program (IOI19_vision)	C++20	0 / 100	2 ms	956 KiB

vision

#include<iostream>
#include<algorithm>
#include<vector>
#include "vision.h"
using namespace std;
int n,m,k;
int tonum(int i,int j)
{
    return i*n+j;
}
void construct_network(int H, int W, int K)
{
    n=H;
    m=W;
    k=K;

    vector<int>positionscheck;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            vector<int>cells;
            for(int i2=i;i2<n;i2++)
            {
                if(i2==i && j+k<m)cells.push_back(tonum(i2,j+k));
                if(i2>i)
                {
                    int rem=k-(i2-i);
                    if(rem<0)break;

                    if(j-rem>=0)cells.push_back(tonum(i2,j-rem));
                    if(j+rem<m)cells.push_back(tonum(i2,j+rem));
                }
            }

            int pos=add_or(cells);
            positionscheck.push_back(add_and({pos,tonum(i,j)}));
        }
    }

    if(positionscheck.size()==0)while(1);

    add_or(positionscheck);
}

• 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