Submission #258635

#	Time	Username	Problem	Language	Result	Execution time	Memory
258635		uacoder123	Quality Of Living (IOI10_quality)	C++14	80 / 100	5074 ms	210760 KiB

quality

#include <bits/stdc++.h>
#include "quality.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))

typedef int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
typedef tree<pair<lli,int>,null_type,less<pair<lli,int>>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
int r,c,h,w,arr[3001][3001],pr[3001],p[3001][3001],ms[3001][3001];
int check(int m)
{
  memset(pr,0,sizeof(pr));
  memset(p,0,sizeof(p));
  memset(ms,0,sizeof(ms));
  int ch=0;
  for(int i=0;i<r;++i)
  {
    for(int j=0;j<c;++j)
    {
      if(arr[i][j]>m)
        p[i+1][j+1]=1;
      else if(arr[i][j]<m)
        p[i+1][j+1]=-1;
    }
  }
  int s=0;
  for(int i=0;i<r;++i)
  {
    for(int j=c-w;j<c;++j)
    {
      pr[i]+=p[i+1][j+1];
    }
    if(i>=h)
      s-=pr[i-h];
    s+=pr[i];
    if(i>=h-1)
    {
      ms[i][c-w]=s;
      if(s<=0)
        ch=1;
    }
  }
  for(int j=0;j<c;++j)
    for(int i=0;i<r;++i)
      p[i+1][j+1]+=p[i][j+1];
  for(int i=h-1;i<r;++i)
  {
    for(int j=c-w-1;j>=0;--j)
    {
      ms[i][j]=ms[i][j+1]-(p[i+1][j+w+1]-p[i-h+1][j+w+1])+p[i+1][j+1]-p[i+1-h][j+1];
      if(ms[i][j]<=0)
        ch=1;
    }
  }
  return(ch);
}
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) 
{
  r=R;
  c=C;
  h=H;
  w=W;
  for(int i=0;i<r;++i)
    for(int j=0;j<c;++j)
      arr[i][j]=Q[i][j];
  int le=1,ri=r*c,ans=r*c;
  while(le<=ri)
  {
    int mi=(le+ri)/2;
    if(check(mi))
    {
      ri=mi-1;
      ans=mi;
    }
    else
    {
      le=mi+1;
    }
  }
  return(ans);
}

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