Submission #164460

#	Time	Username	Problem	Language	Result	Execution time	Memory
164460		Runtime_error_	Vision Program (IOI19_vision)	C++14	100 / 100	68 ms	5952 KiB

vision

#include "vision.h"
using namespace std;
const int inf = 1e3+9;

int solve(int n, int m, int K){

    vector<int> Right_Diagonals[inf];//i-j it's shape is //
	vector<int> Left_Diagonals[inf];//i+j it's shape is \\

	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			Left_Diagonals[i+j].push_back(i*m+j);
			Right_Diagonals[i+m-1-j].push_back(i*m+j);
		}
	}
	vector<int> Left_Diagonals_Or, Right_Diagonals_Or, Left_Diagonals_Prefix_Or, Right_Diagonals_Prefix_Or;
	vector<int> GetAns;

	for(int i=0; i<=n+m-2; i++){
		Left_Diagonals_Or.push_back( add_or( Left_Diagonals[i] ) );
		Right_Diagonals_Or.push_back (add_or( Right_Diagonals[i] ) );

		Left_Diagonals_Prefix_Or.push_back( add_or( Left_Diagonals_Or ) );
		Right_Diagonals_Prefix_Or.push_back( add_or( Right_Diagonals_Or ) );

		if(i >= K){
			GetAns.push_back( add_and( { Left_Diagonals_Or[i] , Left_Diagonals_Prefix_Or[i-K] } ) );
			GetAns.push_back( add_and( { Right_Diagonals_Or[i] , Right_Diagonals_Prefix_Or[i-K] } ) );
		}
	}
	return add_or( GetAns );
}

void construct_network(int n, int m, int k) {
	if(n+m-2 == k)
        solve(n, m, k);
	else
        add_xor( {solve(n, m, k), solve(n, m, k + 1) } );

}

Compilation message (stderr)

vision.cpp:10:34: warning: multi-line comment [-Wcomment]
  vector<int> Left_Diagonals[inf];//i+j it's shape is \\
                                  ^

• 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