Submission #1082627

#	Time	Username	Problem	Language	Result	Execution time	Memory
1082627		modwwe	Quality Of Living (IOI10_quality)	C++17	100 / 100	1025 ms	175720 KiB

quality

#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while(c<'0'||c>'9')
    {
        c=getchar_unlocked();
    }
    while(c>='0'&&c<='9')
    {
        x=(x<<1)+(x<<3)+c-'0';
        c=getchar_unlocked();
    }
    return x;
}

void phongbeo();
const int inf=1e9;
const int mod2=1e9+9;
const int  mod1=998244353;
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c,d,e;

};

int n,m,s1,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,dem4,l,r,mid,l2,r2;
int  i,s10,s12;
int kk;
int el=29;
int a[3001][3001];
int b[3001][3001];
int get(int x,int y,int x2,int y2)
{
     return b[x][y]+b[x2][y2]-b[x][y2]-b[x2][y];
}
bool check(int x)
{

    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
       if(a[i][j]<=x)
        b[i][j]=1;
        else b[i][j]=0;
         for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
            b[i][j]+=b[i-1][j]+b[i][j-1]-b[i-1][j-1];
    for(int i=l;i<=n;i++)
        for(int j=r;j<=m;j++)
        if(get(i,j,i-l,j-r)*2-l*r>0){
            return 1;
            }
         return 0;
}

int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
n=R;
m=C;
l=H;
r=W;
     for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        a[i][j]=Q[i-1][j-1];
      l2=1;
      r2=n*m;
while(l2<=r2)
{
    int mid=l2+r2>>1;
     if(check(mid))r2=mid-1;
     else l2=mid+1;
}
return r2+1;
}

Compilation message (stderr)

quality.cpp: In function 'int rectangle(int, int, int, int, int (*)[3001])':
quality.cpp:104:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  104 |     int mid=l2+r2>>1;
      |             ~~^~~

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 20 / 20
• Subtask 5: 20 / 20