oj.uz

Submission #800929

# Submission time Handle Problem Language Result Execution time Memory
800929 2023-08-02T01:42:11 Z GoldLight Quality Of Living (IOI10_quality) C++17
100 / 100
 983 ms 70888 KB 
#include <bits/stdc++.h>
using namespace std;
void fast(){ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.tie(0);}

const int N=3e3;
int pref[N+1][N+1];
int rectangle(int r, int c, int h, int w, int q[3001][3001]){
    fast();
	int n=r*c, m=h*w;
    int ans=n, ki=1, ka=n;
    while(ki<=ka){
        int mid=(ki+ka)/2;
        bool cek=false;
        //count qij<=mid
        for(int i=0; i<r; i++){
            for(int j=0; j<c; j++){
                pref[i+1][j+1]=(q[i][j]<=mid)+pref[i][j+1]+pref[i+1][j]-pref[i][j];
                if(i>=h-1 && j>=w-1 && pref[i+1][j+1]-pref[i-h+1][j+1]-pref[i+1][j-w+1]+pref[i-h+1][j-w+1]>=m/2+1){
                    cek=true;
                    break;
                }
            }
        }
        if(cek){
            ans=mid;
            ka=mid-1;
        }
        else ki=mid+1;
    }
    return ans;
}
// int main(){
//     int r, c, h, w; cin>>r>>c>>h>>w;
//     for(int i=0; i<r; i++){
//         for(int j=0; j<c; j++){
//             cin>>q[i][j];
//         }
//     }
//     cout<<rectangle(r, c, h, w);
// }

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 2 ms 1108 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 2 ms 1108 KB Output is correct
7 Correct 10 ms 3412 KB Output is correct
8 Correct 9 ms 3440 KB Output is correct
9 Correct 9 ms 3356 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 2 ms 1108 KB Output is correct
7 Correct 10 ms 3412 KB Output is correct
8 Correct 9 ms 3440 KB Output is correct
9 Correct 9 ms 3356 KB Output is correct
10 Correct 105 ms 16060 KB Output is correct
11 Correct 100 ms 16072 KB Output is correct
12 Correct 55 ms 12156 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 2 ms 1108 KB Output is correct
7 Correct 10 ms 3412 KB Output is correct
8 Correct 9 ms 3440 KB Output is correct
9 Correct 9 ms 3356 KB Output is correct
10 Correct 105 ms 16060 KB Output is correct
11 Correct 100 ms 16072 KB Output is correct
12 Correct 55 ms 12156 KB Output is correct
13 Correct 983 ms 70740 KB Output is correct
14 Correct 963 ms 70888 KB Output is correct
15 Correct 910 ms 70864 KB Output is correct