oj.uz

답안 #288081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288081 2020-09-01T08:36:10 Z dolijan 삶의 질 (IOI10_quality) C++14
40 / 100
 5000 ms 4968 KB 
#include <bits/stdc++.h>
#include <stdlib.h>
//#include "quality.h"
using namespace std;
const int mn=3001;
int f(set<int>s)
{
	int sredina=s.size()/2;
	set<int>::iterator it=s.begin();
	int sta=0;
	while(it!=s.end())
	{
		if(sta==sredina) return *it;
		sta++;
		it++;
	}
	return 1;
}
int rectangle1(int r,int c,int h,int w,int q[mn][mn])
{
	int mn=r*c;
	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]);
			}
		}
		mn=min(f(s),mn);
		for(int j=1;j<=c-w;j++)
		{
			for(int k=i;k<i+h;k++) s.erase(q[k][j-1]);
			for(int k=i;k<i+h;k++) s.insert(q[k][j+w-1]);
			mn=min(f(s),mn);
		}
	}
	return mn;
}
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
	return rectangle1(R,C,H,W,Q);
}
/*
static int R,C,H,W,Q[3001][3001],i,j,ans;
int main(){
   scanf("%d%d%d%d",&R,&C,&H,&W);
   for (i=0;i<R;i++) for (j=0;j<C;j++) scanf("%d",&Q[i][j]);
   ans = rectangle(R,C,H,W,Q);
   printf("%d\n",ans);
   return 0;
}*/

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 358 ms 1192 KB Output is correct
5 Correct 306 ms 896 KB Output is correct
6 Correct 216 ms 1420 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 358 ms 1192 KB Output is correct
5 Correct 306 ms 896 KB Output is correct
6 Correct 216 ms 1420 KB Output is correct
7 Execution timed out 5023 ms 4968 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 358 ms 1192 KB Output is correct
5 Correct 306 ms 896 KB Output is correct
6 Correct 216 ms 1420 KB Output is correct
7 Execution timed out 5023 ms 4968 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 358 ms 1192 KB Output is correct
5 Correct 306 ms 896 KB Output is correct
6 Correct 216 ms 1420 KB Output is correct
7 Execution timed out 5023 ms 4968 KB Time limit exceeded
8 Halted 0 ms 0 KB -