oj.uz

Submission #296346

# Submission time Handle Problem Language Result Execution time Memory
296346 2020-09-10T13:47:49 Z Fasho Vision Program (IOI19_vision) C++14
44 / 100
 167 ms 1524 KB 
#include <algorithm>
#include <iostream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cstdio>
#include <string>
#include <vector>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <unistd.h>
#include <cassert>
#include <string>
#include <set>
#define SZ(x) (int)x.size()
using namespace std;
#define NN 500005
#define ll long long int
#define fo(i,x,y) for(int i=x;i<=y;i++)
#define fs(ar,n) fo(i,1,n) cin>>ar[i]
#define sp " "
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll> 
#define fast2 freopen ("in.txt","r",stdin);freopen ("out.txt","w",stdout);
#define inf 1000000000
#define MP make_pair
#include "vision.h"

using namespace std;

vector<int> A;
vector<int> fail;

// vector<int> v;
void construct_network(int H, int W, int K) {
	int cur=H*W;
 
	for(int i=0;i<H;++i)for(int k=0;k<W;++k){
		fail.pb(i*W+k);
		vector<int> X;
		for(int j=0;j<H;++j)for(int l=0;l<W;++l){
			if(abs(i-j) + abs(k-l) != K)continue;
			if(i<j)continue;
			X.pb(j*W+l);
		}
		if(!SZ(X))continue;
		add_or(X);
		vector<int> Y;
		Y.pb(cur);++cur;
		Y.pb(i*W+k);
 
		add_and(Y);
		A.pb(cur);
		++cur;
	}
 
	if(SZ(A))add_or(A);
	else add_xor(fail);
	return;
}
// #include <cstdio>
// #include <cassert>
// #include <string>
// #include "vector<int>sion.h"

// using namespace std;

// static const int MAX_INSTRUCTIONS = 10000;
// static const int MAX_INPUTS = 1000000;

// static const int _AND = 0;
// static const int _OR = 1;
// static const int _XOR = 2;
// static const int _NOT = 3;

// static inline bool increasing(int a, int b, int c) {
// 	return a <= b && b <= c;
// }

// [[noreturn]] static inline void error(string message) {
// 	printf("%s\n", message.c_str());
// 	exit(0);
// }

// class InstructionNetwork {

// 	struct Instruction {
// 		int type;
// 		vector<int> input_indexes;

// 		inline Instruction(int _type, const vector<int>& _input_indexes):
// 				type(_type), input_indexes(_input_indexes) {
// 		}

// 		inline int apply(int a, int b) const {
// 			switch (type) {
// 				case _AND:
// 					return a & b;
// 				case _OR:
// 					return a | b;
// 				case _XOR:
// 					return a ^ b;
// 				default:
// 					return 0;
// 			}
// 		}

// 		inline int compute(const vector<int>& memory_cells) const {
// 			int r = memory_cells[input_indexes[0]];
// 			if (type == _NOT)
// 				return 1 - r;
// 			for (int j = 1; j < (int)input_indexes.size(); j++)
// 				r = apply(r, memory_cells[input_indexes[j]]);
// 			return r;
// 		}
// 	};

// 	int input_size;
// 	int total_inputs;
// 	vector<Instruction> instructions;

// public:

// 	inline void init(int _input_size) {
// 		this->input_size = _input_size;
// 		this->total_inputs = 0;
// 		this->instructions.clear();
// 	}

// 	inline int add_instruction(int type, const vector<int>& input_indexes) {
// 		if (input_indexes.size() == 0)
// 			error("Instruction with no inputs");

// 		if (instructions.size() + 1 > MAX_INSTRUCTIONS)
// 			error("Too many instructions");

// 		if (total_inputs + input_indexes.size() > MAX_INPUTS)
// 			error("Too many inputs");

// 		instructions.emplace_back(type, input_indexes);
// 		total_inputs += input_indexes.size();
// 		int new_index = input_size + (int)instructions.size() - 1;

// 		for (int input_index : input_indexes)
// 			if (!increasing(0, input_index, new_index-1))
// 				error("Invalid index");

// 		return new_index;
// 	}

// 	inline int compute(vector<int> &memory_cells) const {
// 		for (auto &instruction : instructions)
// 			memory_cells.push_back(instruction.compute(memory_cells));
// 		return memory_cells.back();
// 	}
// };


// static InstructionNetwork instructionNetwork;

// int main() {
// 	int H, W, K;
// 	assert(3 == scanf("%d%d%d", &H, &W, &K));

// 	FILE *log_file = fopen("log.txt","w");

// 	instructionNetwork.init(H * W);
// 	construct_network(H, W, K);

// 	while (true) {
// 		int rowA, colA, rowB, colB;
// 		assert(1 == scanf("%d", &rowA));
// 		if (rowA == -1)
// 			break;
// 		assert(3 == scanf("%d%d%d", &colA, &rowB, &colB));

// 		if ((!increasing(0, rowA, H-1)) ||
// 			(!increasing(0, colA, W-1)) ||
// 			(!increasing(0, rowB, H-1)) ||
// 			(!increasing(0, colB, W-1)) ||
// 			(rowA == rowB && colA == colB)) {
// 			printf("-1\n");
// 			fprintf(log_file, "-1\n");
// 			fflush(stdout);
// 			fflush(log_file);
// 			continue;
// 		}

// 		vector<int> memory_cells;
// 		for (int row = 0; row < H; row++)
// 			for (int col = 0; col < W; col++) {
// 				bool active = (row == rowA && col == colA) || (row == rowB && col == colB);
// 				memory_cells.push_back(active ? 1 : 0);
// 			}
// 		int computation_result = instructionNetwork.compute(memory_cells);

// 		printf("%d\n", computation_result);
// 		fflush(stdout);

// 		for(int i = 0; i < (int)memory_cells.size(); i++)
// 			fprintf(log_file, (i ? " %d" : "%d"), memory_cells[i]);
// 		fprintf(log_file, "\n");
// 		fflush(log_file);
// 	}
// 	fclose(stdin);
// }

// int add_and(vector<int> Ns) {
// 	return instructionNetwork.add_instruction(_AND, Ns);
// }

// int add_or(vector<int> Ns) {
// 	return instructionNetwork.add_instruction(_OR, Ns);
// }

// int add_xor(vector<int> Ns) {
// 	return instructionNetwork.add_instruction(_XOR, Ns);
// }

// int add_not(int N) {
// 	vector<int> Ns = {N};
// 	return instructionNetwork.add_instruction(_NOT, Ns);
// }

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 376 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 256 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 376 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 3 ms 512 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 4 ms 512 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 1 ms 256 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 376 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 3 ms 512 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 4 ms 512 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 1 ms 256 KB Output is correct
38 Incorrect 55 ms 1524 KB WA in grader: Too many instructions
39 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 16 ms 892 KB Output is correct
4 Correct 23 ms 1268 KB Output is correct
5 Correct 18 ms 896 KB Output is correct
6 Correct 14 ms 512 KB Output is correct
7 Correct 13 ms 384 KB Output is correct
8 Incorrect 29 ms 1152 KB WA in grader: Too many instructions
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 167 ms 1116 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 376 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 3 ms 512 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 4 ms 512 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 1 ms 256 KB Output is correct
38 Incorrect 55 ms 1524 KB WA in grader: Too many instructions
39 Halted 0 ms 0 KB -