oj.uz

Submission #993500

# Submission time Handle Problem Language Result Execution time Memory
993500 2024-06-05T20:57:19 Z mariaclara Vision Program (IOI19_vision) C++17
0 / 100
 2 ms 1240 KB 
#include "vision.h"
#include<bits/stdc++.h>

using namespace std;

#define pb push_back

int n, m;
void construct_network(int H, int W, int K) {
	n = H;
	m = W;

	int qtd_space = n*m-1;
	vector<int> QQ;
	for(int i = 0; i < n; i++) { 
		for(int j = 0; j < m; j++) {
			// escolhe uma celula

			vector<int> q;

			//cout << "caras com distancia k para " << i << " " << j << ":\n";
			for(int x = i; x < n and x <= i+K; x++) {
				// escolhe outra celula em uma linha maior ou igual a i
				int y1 = j + i + K - x, y2 = j - i - K + x;
				//cout << x << " " << y1 << "\n" << x << " " << y2 << "\n";
				if(0 <= y1 and y1 < m and (x > i or y1 > j)) q.pb(m*x + y1);
				if(0 <= y2 and y2 < m and (x > i or y2 > j)) q.pb(m*x + y2);
			} 
			// y = k + i + j - x

			// for(int it : q) cout << it << " ";
			// cout << "\n";

			if(!q.empty()) {
				add_and(q);
				qtd_space++;
				add_and({n*i + j, qtd_space});
				qtd_space++;
				QQ.pb(qtd_space);
			}
		}
	}

	add_or(QQ);
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 1 ms 344 KB WA in grader: Invalid index
6 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1240 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
6 Halted 0 ms 0 KB -