oj.uz

Submission #887220

# Submission time Handle Problem Language Result Execution time Memory
887220 2023-12-14T05:36:02 Z Muhammad_Aneeq Quality Of Living (IOI10_quality) C++17
60 / 100
 5000 ms 25940 KB 
#include <set>
#include <algorithm>
using namespace std;
int rectangle(int R,int C,int H,int W,int Q[3001][3001])
{	int ans=1e9+10;
	for (int i=0;i<=R-H;i++)
	{
		set<int>s;
		for (int j=i;j<i+H;j++)
			for (int k=0;k<W;k++)
			{
				s.insert(Q[j][k]);
				if (s.size()>(H*W)/2+1)
					s.erase(*--end(s));
			}
		auto z=--end(s);
		ans=min(ans,*z);
		// print(s);
		for (int j=W;j<C;j++)
		{
			for (int k=i;k<i+H;k++)
				s.erase(Q[k][j-W]);
			for (int k=i;k<i+H;k++)
			{
				s.insert(Q[k][j]);
				if (s.size()>(H*W)/2+1)
					s.erase(*--end(s));	
			}
			// print(s);
			auto z=--end(s);
			ans=min(ans,*z);
		}
	}
	return ans;
}

Compilation message

quality.cpp: In function 'int rectangle(int, int, int, int, int (*)[3001])':
quality.cpp:13:17: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   13 |     if (s.size()>(H*W)/2+1)
      |         ~~~~~~~~^~~~~~~~~~
quality.cpp:26:17: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |     if (s.size()>(H*W)/2+1)
      |         ~~~~~~~~^~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 31 ms 2908 KB Output is correct
5 Correct 28 ms 2908 KB Output is correct
6 Correct 26 ms 2904 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 31 ms 2908 KB Output is correct
5 Correct 28 ms 2908 KB Output is correct
6 Correct 26 ms 2904 KB Output is correct
7 Correct 1165 ms 6132 KB Output is correct
8 Correct 1035 ms 6488 KB Output is correct
9 Correct 971 ms 5840 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 31 ms 2908 KB Output is correct
5 Correct 28 ms 2908 KB Output is correct
6 Correct 26 ms 2904 KB Output is correct
7 Correct 1165 ms 6132 KB Output is correct
8 Correct 1035 ms 6488 KB Output is correct
9 Correct 971 ms 5840 KB Output is correct
10 Execution timed out 5058 ms 25940 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 31 ms 2908 KB Output is correct
5 Correct 28 ms 2908 KB Output is correct
6 Correct 26 ms 2904 KB Output is correct
7 Correct 1165 ms 6132 KB Output is correct
8 Correct 1035 ms 6488 KB Output is correct
9 Correct 971 ms 5840 KB Output is correct
10 Execution timed out 5058 ms 25940 KB Time limit exceeded
11 Halted 0 ms 0 KB -