Submission #611651

#	Time	Username	Problem	Language	Result	Execution time	Memory
611651		Hanksburger	Vision Program (IOI19_vision)	C++17	52 / 100	10 ms	1232 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> vec, tmp;
void construct_network(int n, int m, int k)
{
    if (n*m*2<=10000)
    {
        for (int i=0; i<n; i++)
        {
            for (int j=0; j<m; j++)
            {
                tmp.clear();
                for (int l=0; l<k; l++)
                    if (i+l<n && j+k-l<m)
                        tmp.push_back((i+l)*m+j+k-l);
                for (int l=0; l<k; l++)
                    if (i+k-l<n && j-l>=0)
                        tmp.push_back((i+k-l)*m+j-l);
                if (tmp.size())
                {
                    if (tmp.size()>=2)
                    {
                        int x=add_or(tmp);
                        tmp.clear();
                        tmp.push_back(x);
                    }
                    tmp.push_back(i*m+j);
                    vec.push_back(add_and(tmp));
                }
            }
        }
        add_or(vec);
        return;
    }
    for (int i=0; i<1; i++)
    {
        for (int j=0; j<1; j++)
        {
            tmp.clear();
            for (int l=0; l<k; l++)
                if (i+l<n && j+k-l<m)
                    tmp.push_back((i+l)*m+j+k-l);
            for (int l=0; l<k; l++)
                if (i+k-l<n && j-l>=0)
                    tmp.push_back((i+k-l)*m+j-l);
            if (tmp.size())
            {
                if (tmp.size()>=2)
                {
                    int x=add_or(tmp);
                    tmp.clear();
                    tmp.push_back(x);
                }
                tmp.push_back(i*m+j);
                vec.push_back(add_and(tmp));
            }
        }
    }
}

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