oj.uz

Submission #952260

# Submission time Handle Problem Language Result Execution time Memory
952260 2024-03-23T12:21:19 Z Doncho_Bonboncho Quality Of Living (IOI10_quality) C++14
40 / 100
 5000 ms 5720 KB 
#include <bits/stdc++.h>
#include "quality.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;


template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
 
#ifndef LOCAL
#define cerr if(false) cerr
#define endl "\n"
#endif

#define out(x) #x << "=" << x << " "

int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {

	int nas = R * C +1;
	for( int i=0 ; i + H <= R ; i ++ ){

		std::set< int > S;
		for( int I = i; I < i + H ; I++ ){
			int j = 0;
			for( int J = j ; J < j + W ; J++ ){
				S.insert( Q[I][J] );
			}
		}

		for( int j=0 ; j + W <= C ; j++ ){
			if( j ){
				for( int I = i ; I < i + H ; I++ ){
					S.erase( Q[I][j-1] );
					S.insert( Q[I][j+W-1] );
				}
			}
			auto it = S.begin();
			std::advance( it, S.size()/2 );

			cerr << out( *it ) << endl;
			chkmin( nas, *it );

		}
	}

	return nas;

}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 2564 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 51 ms 2652 KB Output is correct
5 Correct 48 ms 2648 KB Output is correct
6 Correct 43 ms 2652 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 2564 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 51 ms 2652 KB Output is correct
5 Correct 48 ms 2648 KB Output is correct
6 Correct 43 ms 2652 KB Output is correct
7 Execution timed out 5015 ms 5720 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 2564 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 51 ms 2652 KB Output is correct
5 Correct 48 ms 2648 KB Output is correct
6 Correct 43 ms 2652 KB Output is correct
7 Execution timed out 5015 ms 5720 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 2564 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 51 ms 2652 KB Output is correct
5 Correct 48 ms 2648 KB Output is correct
6 Correct 43 ms 2652 KB Output is correct
7 Execution timed out 5015 ms 5720 KB Time limit exceeded
8 Halted 0 ms 0 KB -