Submission #298181

#	Time	Username	Problem	Language	Result	Execution time	Memory
298181		A02	Vision Program (IOI19_vision)	C++14	100 / 100	17 ms	1692 KiB

vision

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

using  namespace std;

int current_index;

void add_bit (vector<int> &current_sum, int to_add){

    vector<int> result_p;

//    cout << current_index << endl;
//    cout << 't' << to_add << endl;
//
//    for (int i = 0; i < current_sum.size(); i++){
//        cout << current_sum[i] << ' ';
//    }


    for (int b = 0; b < current_sum.size(); b++){
        vector<int> Ns;
        Ns.push_back(current_sum[b]);
        Ns.push_back(to_add);
        add_xor(Ns);
        current_index++;
        result_p.push_back(current_index);
        add_and(Ns);
        current_index++;
        to_add = current_index;
    }
//
//    cout << endl;
//    for (int i = 0; i < current_sum.size(); i++){
//        cout << result_p[i] << ' ';
//    }
//    cout << endl << endl;

    current_sum = result_p;
}

void construct_network(int H, int W, int K) {
    current_index = 0;

	//Store in cell HW + i the parity of the number of 1s in rows 0 to i.

	vector<int> Ns_row_0;
	for (int i = 0; i < W; i++){
        Ns_row_0.push_back(i);
	}

	add_xor(Ns_row_0);

	for (int row = 1; row < H; row++){
        vector<int> Ns_row_k;
        for (int i = 0; i < W; i++){
            Ns_row_k.push_back(row * W + i);
        }
        Ns_row_k.push_back(H * W + row - 1);
        add_xor(Ns_row_k);
	}

	vector<int> Ns_column0;

	for (int i = 0; i < H; i++){
        Ns_column0.push_back(i * W);
	}

	add_xor(Ns_column0);

	for (int column = 1; column < W; column++){
        vector<int> Ns_column_k;
        for (int i = 0; i < H; i++){
            Ns_column_k.push_back(i * W + column);
        }
        Ns_column_k.push_back(H * W + H + column - 1);
        add_xor(Ns_column_k);
	}

	//Want to sum cells H * W to H * W + H + W - 1.

	add_not(0);
	vector<int> t;
	t.push_back(0);
	t.push_back(H * W + H + W - 1);
	add_and(t);
	add_not(H * W + H + W + 1);

	int ZERO = H * W + H + W + 1;
	int ONE = H * W + H + W + 2;

	current_index = H * W + H + W + 2;

	vector<int> empty_9_bit_sum;

	for (int i = 0; i < 9; i++){
        add_not(ONE);
        current_index++;
        empty_9_bit_sum.push_back(current_index);
	}

	for (int i = H * W; i < H * W + H + W; i++){
        add_bit(empty_9_bit_sum, i);
	}


    add_not(ZERO);
    current_index++;

	for (int i = 0; i < empty_9_bit_sum.size(); i++){
        //cout << i << endl;
        if (K & (1 << i)){
            vector<int> Ns;
            Ns.push_back(current_index);
            Ns.push_back(empty_9_bit_sum[i]);
            add_and(Ns);
            current_index++;
        } else {
            vector<int> Ns;
            add_not(empty_9_bit_sum[i]);
            current_index++;
            Ns.push_back(current_index);
            Ns.push_back(current_index - 1);
            add_and(Ns);
            current_index++;
        }
	}

    return;
}

Compilation message (stderr)

vision.cpp: In function 'void add_bit(std::vector<int>&, int)':
vision.cpp:20:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for (int b = 0; b < current_sum.size(); b++){
      |                     ~~^~~~~~~~~~~~~~~~~~~~
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:109:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |  for (int i = 0; i < empty_9_bit_sum.size(); i++){
      |                  ~~^~~~~~~~~~~~~~~~~~~~~~~~

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