Submission #611705

#	Time	Username	Problem	Language	Result	Execution time	Memory
611705		Hanksburger	Vision Program (IOI19_vision)	C++17	26 / 100	10 ms	1364 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> l, r, a, b, c, d, tmp;
void construct_network(int n, int m, int k)
{
    for (int i=0; i<=n+m-2; i++)
    {
        tmp.clear();
        for (int j=0; j<n; j++)
            if (i-j>=0 && i-j<m)
                tmp.push_back(j*m+i-j);
        l.push_back(add_or(tmp));
    }
    for (int i=-n+1; i<=m-1; i++)
    {
        tmp.clear();
        for (int j=0; j<n; j++)
            if (i+j>=0 && i+j<m)
                tmp.push_back(j*m+i+j);
        r.push_back(add_or(tmp));
    }
    for (int i=0; i<n+m-2; i++)
    {
        tmp.clear();
        for (int j=i+1; j<=min(i+k, n+m-2); j++)
            tmp.push_back(l[j]);
        int x=add_or(tmp);
        tmp.clear();
        tmp.push_back(l[i]);
        tmp.push_back(x);
        a.push_back(add_and(tmp));
        if (i+k<=n+m-2)
        {
            tmp.clear();
            tmp.push_back(l[i]);
            tmp.push_back(l[i+k]);
            b.push_back(add_and(tmp));
        }
    }
    for (int i=0; i<n+m-2; i++)
    {
        tmp.clear();
        for (int j=i+1; j<=min(i+k, n+m-2); j++)
            tmp.push_back(r[j]);
        int x=add_or(tmp);
        tmp.clear();
        tmp.push_back(r[i]);
        tmp.push_back(x);
        c.push_back(add_and(tmp));
        if (i+k<=n+m-2)
        {
            tmp.clear();
            tmp.push_back(r[i]);
            tmp.push_back(r[i+k]);
            d.push_back(add_and(tmp));
        }
    }
    tmp.clear();
    tmp.push_back(add_or(a));
    tmp.push_back(add_or(d));
    int x=add_and(tmp);
    tmp.clear();
    tmp.push_back(add_or(b));
    tmp.push_back(add_or(c));
    int y=add_and(tmp);
    tmp.clear();
    tmp.push_back(x);
    tmp.push_back(y);
    add_or(tmp);
}

• 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: 14 / 14
• Subtask 8: 0 / 19