oj.uz

Submission #906131

# Submission time Handle Problem Language Result Execution time Memory
906131 2024-01-13T14:29:41 Z JakobZorz Quality Of Living (IOI10_quality) C++17
100 / 100
 1355 ms 140144 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);
    
    int cube=0;
    
    for(int y=0;y<=h2-h;y++){
        if(y==0){
            for(int x2=0;x2<w-1;x2++)
                for(int y2=0;y2<h;y2++)
                    cube+=(mat[x2][y2]<=val);
            
            for(int x=0;x<w2;x++)
                for(int y2=0;y2<h;y2++)
                    cols[x]+=(mat[x][y2]<=val);
        }else{
            for(int x2=0;x2<w-1;x2++){
                cube-=(mat[x2][y-1]<=val);
                cube+=(mat[x2][y+h-1]<=val);
            }
            
            for(int x=0;x<w2;x++){
                cols[x]-=(mat[x][y-1]<=val);
                cols[x]+=(mat[x][y+h-1]<=val);
            }
        }
        
        int low=cube;
        
        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){
                return true;
            }
        }
    }
    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 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 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4440 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 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4440 KB Output is correct
7 Correct 10 ms 8540 KB Output is correct
8 Correct 10 ms 8720 KB Output is correct
9 Correct 17 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 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4440 KB Output is correct
7 Correct 10 ms 8540 KB Output is correct
8 Correct 10 ms 8720 KB Output is correct
9 Correct 17 ms 8540 KB Output is correct
10 Correct 112 ms 25160 KB Output is correct
11 Correct 107 ms 25004 KB Output is correct
12 Correct 60 ms 25132 KB Output is correct

Subtask #5
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 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4440 KB Output is correct
7 Correct 10 ms 8540 KB Output is correct
8 Correct 10 ms 8720 KB Output is correct
9 Correct 17 ms 8540 KB Output is correct
10 Correct 112 ms 25160 KB Output is correct
11 Correct 107 ms 25004 KB Output is correct
12 Correct 60 ms 25132 KB Output is correct
13 Correct 1355 ms 70888 KB Output is correct
14 Correct 1020 ms 140144 KB Output is correct
15 Correct 1284 ms 133196 KB Output is correct