Submission #906118

# Submission time Handle Problem Language Result Execution time Memory
906118 2024-01-13T14:14:24 Z JakobZorz Quality Of Living (IOI10_quality) C++17
60 / 100
5000 ms 31828 KB
#include"quality.h"
#include<iostream>
using namespace std;

int w2,h2,w,h;
int mat[3000][3000];

bool check(int val){
    for(int y=0;y<=h2-h;y++){
        for(int x=0;x<=w2-w;x++){
            int low=0;
            for(int x2=x;x2<x+w;x2++)
                for(int y2=y;y2<y+h;y2++)
                    low+=(mat[x2][y2]<=val);
            if(low>=(w*h+1)/2){
                //cout<<val<<" "<<low<<" "<<(w*h+1)/2<<" false\n";
                return true;
            }
        }
    }
    //cout<<val<<" true\n";
    return false;
}

int rectangle(int R,int C,int H,int W,int Q[3001][3001]){
    w2=R;
    h2=C;
    w=H;
    h=W;
    for(int x=0;x<w2;x++)
        for(int y=0;y<h2;y++)
            mat[x][y]=Q[x][y];
            
    int bl=0,br=w2*h2;
    while(bl<br-1){
        int mid=(bl+br)/2;
        if(check(mid))
            br=mid;
        else
            bl=mid;
    }
    
	return br;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 47 ms 4444 KB Output is correct
5 Correct 31 ms 4552 KB Output is correct
6 Correct 26 ms 4444 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 47 ms 4444 KB Output is correct
5 Correct 31 ms 4552 KB Output is correct
6 Correct 26 ms 4444 KB Output is correct
7 Correct 3231 ms 9228 KB Output is correct
8 Correct 245 ms 9220 KB Output is correct
9 Correct 3372 ms 9168 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 47 ms 4444 KB Output is correct
5 Correct 31 ms 4552 KB Output is correct
6 Correct 26 ms 4444 KB Output is correct
7 Correct 3231 ms 9228 KB Output is correct
8 Correct 245 ms 9220 KB Output is correct
9 Correct 3372 ms 9168 KB Output is correct
10 Execution timed out 5012 ms 31828 KB Time limit exceeded
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 47 ms 4444 KB Output is correct
5 Correct 31 ms 4552 KB Output is correct
6 Correct 26 ms 4444 KB Output is correct
7 Correct 3231 ms 9228 KB Output is correct
8 Correct 245 ms 9220 KB Output is correct
9 Correct 3372 ms 9168 KB Output is correct
10 Execution timed out 5012 ms 31828 KB Time limit exceeded
11 Halted 0 ms 0 KB -