oj.uz

Submission #906123

# Submission time Handle Problem Language Result Execution time Memory
906123 2024-01-13T14:23:27 Z JakobZorz Quality Of Living (IOI10_quality) C++17
80 / 100
 5000 ms 70860 KB 
#include"quality.h"
#include<iostream>
#include<vector>
using namespace std;

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

bool check(int val){
    vector<int>cols(w2);
    
    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);
        
        if(y==0){
            for(int x=0;x<w2;x++)
                for(int y2=0;y2<h;y2++)
                    cols[x]+=(mat[x][y2]<=val);
        }else{
            for(int x=0;x<w2;x++){
                cols[x]-=(mat[x][y-1]<=val);
                cols[x]+=(mat[x][y+h-1]<=val);
            }
        }
        
        for(int x=0;x<=w2-w;x++){
            
            if(x)
                low-=cols[x-1];
            low+=cols[x+w-1];
            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 2 ms 4444 KB Output is correct
3 Correct 1 ms 4440 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 2 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 3 ms 4444 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 2 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 39 ms 8540 KB Output is correct
8 Correct 11 ms 8536 KB Output is correct
9 Correct 28 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 2 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 39 ms 8540 KB Output is correct
8 Correct 11 ms 8536 KB Output is correct
9 Correct 28 ms 8540 KB Output is correct
10 Correct 1370 ms 25160 KB Output is correct
11 Correct 764 ms 25156 KB Output is correct
12 Correct 245 ms 25132 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 2 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 39 ms 8540 KB Output is correct
8 Correct 11 ms 8536 KB Output is correct
9 Correct 28 ms 8540 KB Output is correct
10 Correct 1370 ms 25160 KB Output is correct
11 Correct 764 ms 25156 KB Output is correct
12 Correct 245 ms 25132 KB Output is correct
13 Execution timed out 5053 ms 70860 KB Time limit exceeded
14 Halted 0 ms 0 KB -