Submission #977713

#	Time	Username	Problem	Language	Result	Execution time	Memory
977713		opPO	Vision Program (IOI19_vision)	C++14	41 / 100	6 ms	1260 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>

using namespace std;

int h, w, k;

pair<int, int> get_by_index(int i) {
    return make_pair(i / w, i % w);
}

int dist(int x1, int y1, int x2, int y2) {
    return abs(x1 - x2) + abs(y1 - y2);
}

void construct_network(int H, int W, int K) {
    h = H; w = W; k = K;
    vector<int> cells;
    if (min(h, w) != 1 && max(h, w) > 30) {
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                if (dist(0, 0, i, j) == k) {
                    cells.push_back(add_and({0, i * w + j}));
                }
            }
        }
    } else {
        vector<pair<int, int>> order;
        for (int i1 = 0; i1 < h; i1++) {
            for (int j1 = 0; j1 < w; j1++) {
                for (int i2 = 0; i2 < h; i2++) {
                    for (int j2 = 0; j2 < w; j2++) {
                        if (dist(i1, j1, i2, j2) == k) {
                            order.push_back({i1 * w + j1, i2 * w + j2});
                        }
                    }
                }
            }
        }
        mt19937 gen(time(nullptr));
        shuffle(order.begin(), order.end(), gen);
        for (int i = 0; i < min((int)order.size(), 9998); i++) {
            cells.push_back(add_and({order[i].first, order[i].second}));
        }
    }
    add_or(cells);
}

/*
g++ -std=gnu++14 -O2 -Wall -pipe -static -o "vision" "grader.cpp" "vision.cpp"
*/

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