Submission #1021545

#	Time	Username	Problem	Language	Result	Execution time	Memory
1021545		vjudge1	Vision Program (IOI19_vision)	C++17	8 / 100	1 ms	372 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;

void construct_network (int h, int w, int K) {
    vi th;
    auto toLine = [&](ll i, ll j) { return 0 <= i && i < h && 0 <= j && j < w ? i*w+j : -16; };
    auto getNeigh = [&](ll i, ll j) -> vi {
        vi ans;
        for (ll k = 0; k <= K; k++) {
            ans.push_back(toLine(i-K+k, j+k));
            ans.push_back(toLine(i+k, j+K-k));
        }
        sort(ans.begin(), ans.end());
        ans.resize(unique(ans.begin(), ans.end()) - ans.begin());
        if (ans.empty()) return ans;
        if (ans[0] == -16) ans.erase(ans.begin());
        return ans;
    };
    add_or(getNeigh(0, 0));
}

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