Submission #298869

#	Time	Username	Problem	Language	Result	Execution time	Memory
298869		kevlee	Vision Program (IOI19_vision)	C++17	12 / 100	21 ms	2560 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define inf 1000000000
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
vi diag[500], diag2[500];
void construct_network(int h, int w, int k) {
  FOR(i, 0, h-1) {
    FOR(j, 0, w-1) {
      diag[i+j].pb(i*w+j);
      diag2[i+w-1-j].pb(i*w+j);
    }
  }
  vi final_query;
  FOR(i, 0, k-1) {
    for (int j = i; j + k <= h + w - 2; j += k) {
      final_query.pb(add_and({add_xor(diag[j]), add_xor(diag[j + k])}));
      final_query.pb(add_and({add_xor(diag2[j]), add_xor(diag2[j + k])}));
    }
  }
  add_or(final_query);
}

• 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