oj.uz

Submission #740001

# Submission time Handle Problem Language Result Execution time Memory
740001 2023-05-11T22:27:21 Z fractlpaca Quality Of Living (IOI10_quality) C++17
40 / 100
 5000 ms 2892 KB 
#include "quality.h"

#include <vector>
#include <algorithm>

#define v vector

using namespace std;

// Subtask 1: Brute Force

int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
	int median = R*C;
	for (int i=0; i<R-H+1; i++) {
		for (int j=0; j<C-W+1; j++) {
			v<int> blocks;
			for (int s=i; s<i+H; s++) {
				for (int t=j; t<j+W; t++) {
					blocks.push_back(Q[s][t]);
				}
			}
			sort(blocks.begin(), blocks.end());
			median = min(median, blocks[(H*W)/2]);
		}
	}
	return median;
}

//

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 1 ms 424 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 1 ms 424 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 246 ms 792 KB Output is correct
5 Correct 204 ms 768 KB Output is correct
6 Correct 141 ms 836 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 1 ms 424 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 246 ms 792 KB Output is correct
5 Correct 204 ms 768 KB Output is correct
6 Correct 141 ms 836 KB Output is correct
7 Execution timed out 5033 ms 2892 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 1 ms 424 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 246 ms 792 KB Output is correct
5 Correct 204 ms 768 KB Output is correct
6 Correct 141 ms 836 KB Output is correct
7 Execution timed out 5033 ms 2892 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 1 ms 424 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 246 ms 792 KB Output is correct
5 Correct 204 ms 768 KB Output is correct
6 Correct 141 ms 836 KB Output is correct
7 Execution timed out 5033 ms 2892 KB Time limit exceeded
8 Halted 0 ms 0 KB -