oj.uz

Submission #388747

# Submission time Handle Problem Language Result Execution time Memory
388747 2021-04-12T19:55:02 Z Pichon5 Quality Of Living (IOI10_quality) C++17
100 / 100
 2450 ms 140244 KB 
#include "quality.h"
#include <bits/stdc++.h>
#define vi vector<vi>
#define ll long long int
#define pb push_back
using namespace std;
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
    //R rows
    //C columns
    // H de hight
    //W de weihght

    int M[3001][3001];
    int b=1,e=C*R;
    int res;
    while(b<=e){
        int i=(b+e)/2;
        for(int j=0;j<R;j++){
            for(int k=0;k<C;k++){
                M[j][k]=0;
                if(Q[j][k]>i)M[j][k]=1;
                if(Q[j][k]<i)M[j][k]=-1;
            }
        }
        for(int j=0;j<R;j++){
            for(int k=0;k<C;k++){
                if(j)M[j][k]+=M[j-1][k];
                if(k)M[j][k]+=M[j][k-1];
                if(j>0 && k>0)M[j][k]-=M[j-1][k-1];
            }
        }
        bool ok=false;
        for(int j=0;j+H<=R;j++){
            for(int k=0;k+W<=C;k++){
                int sum=M[j+H-1][k+W-1];
                if(j)sum-=M[j-1][k+W-1];
                if(k)sum-=M[j+H-1][k-1];
                if(j>0 && k>0)sum+=M[j-1][k-1];
                if(sum<=0)ok=1;
            }
        }
        if(ok){
            res=i;
            e=i-1;
        }else{
            b=i+1;
        }
    }
    return res;
}

Compilation message

quality.cpp: In function 'int rectangle(int, int, int, int, int (*)[3001])':
quality.cpp:49:12: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   49 |     return res;
      |            ^~~

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 3 ms 1100 KB Output is correct
5 Correct 3 ms 1100 KB Output is correct
6 Correct 3 ms 1100 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 3 ms 1100 KB Output is correct
5 Correct 3 ms 1100 KB Output is correct
6 Correct 3 ms 1100 KB Output is correct
7 Correct 27 ms 3404 KB Output is correct
8 Correct 21 ms 3916 KB Output is correct
9 Correct 19 ms 3776 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 3 ms 1100 KB Output is correct
5 Correct 3 ms 1100 KB Output is correct
6 Correct 3 ms 1100 KB Output is correct
7 Correct 27 ms 3404 KB Output is correct
8 Correct 21 ms 3916 KB Output is correct
9 Correct 19 ms 3776 KB Output is correct
10 Correct 248 ms 22880 KB Output is correct
11 Correct 241 ms 22884 KB Output is correct
12 Correct 134 ms 15532 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 3 ms 1100 KB Output is correct
5 Correct 3 ms 1100 KB Output is correct
6 Correct 3 ms 1100 KB Output is correct
7 Correct 27 ms 3404 KB Output is correct
8 Correct 21 ms 3916 KB Output is correct
9 Correct 19 ms 3776 KB Output is correct
10 Correct 248 ms 22880 KB Output is correct
11 Correct 241 ms 22884 KB Output is correct
12 Correct 134 ms 15532 KB Output is correct
13 Correct 2450 ms 140244 KB Output is correct
14 Correct 2287 ms 140136 KB Output is correct
15 Correct 2172 ms 133128 KB Output is correct