oj.uz

Submission #416017

# Submission time Handle Problem Language Result Execution time Memory
416017 2021-06-01T20:01:17 Z bipartite_matching Vision Program (IOI19_vision) C++14
26 / 100
 13 ms 1356 KB 
#include <bits/stdc++.h>

#define forint(i, N) for (int i = 0; i < (N); i++)

using namespace std;

vector<int> v = {1, 0, 0, 0, 0, 1};


int add_not(int N);
int add_and(vector<int> N);
int add_or(vector<int> N);
int add_xor(vector<int> N);
 
void construct_network(int h, int w, int k) {
	
	vector<int> right;

	int vsize = h * w - 1;

	for (int i = h - 1; i >= 1; i--) {
		int a = i;
		int b = 0;

		vector<int> tmp;

		while (b < w && a < h) {
			tmp.push_back(a * w + b);

			a++;
			b++;
		}


		//cerr << "ja" << endl;

		

		vsize++;
		right.push_back(vsize);
		add_or(tmp);
	}
	
	for (int i = 0; i < w; i++) {
		int a = 0;
		int b = i;

		vector<int> tmp;

		while (b < w && a < h) {
			tmp.push_back(a * w + b);

			a++;
			b++;
		}

		

		vsize++;
		right.push_back(vsize);
		add_or(tmp);
	}

	//cerr << vsize << " right diagonal" << endl;

	//cerr << "ja" << endl;

	vector<int> left;

	for (int i = 0; i < h - 1; i++) {
		int a = i;
		int b = 0;

		vector<int> tmp;

		while (b < w && a >= 0) {
			tmp.push_back(a * w + b);

			a--;
			b++;
		}

		vsize++;
		left.push_back(vsize);
		add_or(tmp);
	}


	for (int i = 0; i < w; i++) {
		int a = h - 1;
		int b = i;

		vector<int> tmp;

		while (b < w && a >= 0) {
			tmp.push_back(a * w + b);

			a--;
			b++;
		}

		vsize++;
		left.push_back(vsize);
		add_or(tmp);
	}

	//cerr << vsize << " left diagonal" << endl;
	//cerr << "ja" << endl;
	vector<int> right_test;
	vector<int> left_test;

	forint(i, right.size() - k) {
		vsize++;
		right_test.push_back(vsize);
		add_and({right[i], right[i + k]});
		vsize++;
		left_test.push_back(vsize);
		add_and({left[i], left[i + k]});
	}
	//cerr << "ja" << endl;
	vector<int> right2;
	vector<int> left2; 

	forint(i, right.size() - k) {
		vector<int> tmp1;
		vector<int> tmp2;

		for (int j = i; j <= i + k; j++) {
			tmp1.push_back(right[j]);
			tmp2.push_back(left[j]);
		}
		//cerr << "ja " <<endl;
		vsize += 2;
		add_or(tmp1);

		add_xor(tmp1);

		add_xor({vsize - 1, vsize});

		vsize++;

		right2.push_back(vsize);

		vsize += 2;

		add_or(tmp2);

		add_xor(tmp2);

		add_xor({vsize - 1, vsize});

		vsize++;

		
		left2.push_back(vsize);
	}
	//cerr << "ja" << endl;
	vsize++;
	add_or(right2);

	//cerr << v[vsize] << endl;

	vsize++;
	add_or(left2);

	vsize++;
	add_or(right_test);

	vsize++;
	add_or(left_test);

	//cerr << v[vsize] << endl;

	vsize++;
	add_and({vsize - 4, vsize - 1});
	add_and({vsize - 3, vsize - 2});
	vsize++;

	add_or({vsize - 1, vsize});

	
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:3:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define forint(i, N) for (int i = 0; i < (N); i++)
      |                                        ^
vision.cpp:112:2: note: in expansion of macro 'forint'
  112 |  forint(i, right.size() - k) {
      |  ^~~~~~
vision.cpp:3:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define forint(i, N) for (int i = 0; i < (N); i++)
      |                                        ^
vision.cpp:124:2: note: in expansion of macro 'forint'
  124 |  forint(i, right.size() - k) {
      |  ^~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 6 ms 588 KB Output is correct
3 Correct 6 ms 588 KB Output is correct
4 Correct 1 ms 352 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 6 ms 724 KB Output is correct
7 Correct 5 ms 588 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 5 ms 588 KB Output is correct
11 Correct 7 ms 692 KB Output is correct
12 Correct 6 ms 680 KB Output is correct
13 Correct 5 ms 588 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 6 ms 552 KB Output is correct
17 Correct 7 ms 588 KB Output is correct
18 Correct 6 ms 672 KB Output is correct
19 Correct 5 ms 588 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB on inputs (0, 0), (1, 1), expected 1, but computed 0
3 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1316 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 3 ms 412 KB Output is correct
7 Correct 8 ms 844 KB Output is correct
8 Correct 8 ms 844 KB Output is correct
9 Correct 13 ms 1356 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -