oj.uz

Submission #906120

# Submission time Handle Problem Language Result Execution time Memory
906120 2024-01-13T14:17:28 Z JakobZorz Quality Of Living (IOI10_quality) C++17
80 / 100
 5000 ms 140116 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++){
        int low=0;
        for(int x2=0;x2<w-1;x2++)
            for(int y2=y;y2<y+h;y2++)
                low+=(mat[x2][y2]<=val);
        
        for(int x=0;x<=w2-w;x++){
            
            if(x)
                for(int y2=y;y2<y+h;y2++)
                    low-=(mat[x-1][y2]<=val);
            for(int y2=y;y2<y+h;y2++)
                low+=(mat[x+w-1][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;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 4 ms 4444 KB Output is correct
5 Correct 4 ms 4608 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 4 ms 4444 KB Output is correct
5 Correct 4 ms 4608 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 70 ms 8540 KB Output is correct
8 Correct 13 ms 8540 KB Output is correct
9 Correct 80 ms 8540 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 4 ms 4444 KB Output is correct
5 Correct 4 ms 4608 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 70 ms 8540 KB Output is correct
8 Correct 13 ms 8540 KB Output is correct
9 Correct 80 ms 8540 KB Output is correct
10 Correct 3920 ms 25152 KB Output is correct
11 Correct 897 ms 31900 KB Output is correct
12 Correct 1166 ms 28448 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 4 ms 4444 KB Output is correct
5 Correct 4 ms 4608 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 70 ms 8540 KB Output is correct
8 Correct 13 ms 8540 KB Output is correct
9 Correct 80 ms 8540 KB Output is correct
10 Correct 3920 ms 25152 KB Output is correct
11 Correct 897 ms 31900 KB Output is correct
12 Correct 1166 ms 28448 KB Output is correct
13 Execution timed out 5072 ms 140116 KB Time limit exceeded
14 Halted 0 ms 0 KB -