Submission #1118550

#	Time	Username	Problem	Language	Result	Execution time	Memory
1118550		adaawf	Vision Program (IOI19_vision)	C++17	12 / 100	36 ms	6152 KiB

vision

#include <bits/stdc++.h>
#include "vision.h"
using namespace std;
void construct_network(int h, int w, int k) {
    if (min(h, w) == 1) {
        vector<int> va;
        for (int i = 0; i < max(h, w) - k; i++) {
            vector<int> vv;
            vv.push_back(i);
            vv.push_back(i + k);
            va.push_back(add_and(vv));
        }
        add_or(va);
        return;
    }
    int x = 0, y = 0;
    vector<int> va;
    for (int i = 0; i <= 15; i++) {
        vector<int> v;
        for (int j = 0; j < h * w; j++) {
            if (j & (1 << i)) {
                v.push_back(j);
            }
        }
        if (v.empty()) continue;
        if (add_or(v)) {
            if (add_xor(v)) va.push_back(i);
            else {
                x += (1 << i);
                y += (1 << i);
            }
        }
    }
    for (int i = 0; i < (1 << va.size()); i++) {
        int z = x, t = y;
        for (int j = 0; j < va.size(); j++) {
            if (i & (1 << j)) z += (1 << va[j]);
            else t += (1 << va[j]);
        }
        if (z < 0 || t < 0 || z >= h * w || t >= h * w || z > t) continue;
        int u = z / w, v = z % w, uu = t / w, vv = t % w;
        if (abs(uu - u) + abs(vv - v) != k) continue;
        vector<int> vva;
        vva.push_back(z);
        vva.push_back(t);
        if (add_and(vva)) {
            return;
        }
    }
    vector<int> vva;
    vva.push_back(0);
    vva.push_back(1);
    add_or(vva);
}

Compilation message (stderr)

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:36:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |         for (int j = 0; j < va.size(); j++) {
      |                         ~~^~~~~~~~~~~

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