Submission #289832

#	Time	Username	Problem	Language	Result	Execution time	Memory
289832		arman_ferdous	Vision Program (IOI19_vision)	C++17	12 / 100	15 ms	1664 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 401;

int H, W, K;

vector<int> getdia1(int r, int c) {
    vector<int> cells;
    for(;;) {
        cells.push_back(r * W + c);
        r--, c++;
        if(r < 0 || c >= W) break;
    }
    return cells;
}

int dia1[N + N], dia2[N + N];
int prefix1[N + N], prefix2[N + N];

void construct_network(int h, int w, int k) {
    H = h, W = w, K = k;

    for(int i = 0; i < h; i++) {
        vector<int> cells = getdia1(i, 1);
        dia1[i + 1] = add_xor(cells);
    }
    for(int j = 1; j < w; j++) {
        vector<int> cells = getdia1(h - 1, j);
        dia1[h - 1 + j] = add_xor(cells);
    }
    for(int i = 0; i < h + w - 1; i++) {
        vector<int> tmp;
        for(int j = 0; j <= i; j++) tmp.push_back(dia1[j]);
        prefix1[i] = add_xor(tmp);
    }
    vector<int> KKdifres, Kdifres;
    for(int i = 0; i + K < h + w - 1; i++) {
        vector<int> tmp(2); 
        tmp[0] = prefix1[i];
        tmp[1] = prefix1[i + K];
        KKdifres.push_back(add_and(tmp));
    }
    for(int i = 0; i + K - 1 < h + w - 1; i++) {
        vector<int> tmp(2);
        tmp[0] = prefix1[i];
        tmp[1] = prefix1[i + K - 1];
        Kdifres.push_back(add_and(tmp));
    }
    int greaterthanK = add_or(Kdifres);
    int greaterthanKK = add_or(KKdifres);

    vector<int> tmp(2); 
    tmp[0] = greaterthanK;
    tmp[1] = greaterthanKK;
    int result1 = add_xor(tmp);
}

Compilation message (stderr)

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:57:9: warning: unused variable 'result1' [-Wunused-variable]
   57 |     int result1 = add_xor(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: 0 / 14
• Subtask 8: 0 / 19