oj.uz

Submission #258685

# Submission time Handle Problem Language Result Execution time Memory
258685 2020-08-06T11:09:43 Z uacoder123 Quality Of Living (IOI10_quality) C++14
100 / 100
 3388 ms 175480 KB 
    #include <bits/stdc++.h>
    using namespace std;
    #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;
    int r,c,h,w,arr[3001][3001],pr[3001],p[3001][3001];
    int check(int m)
    {
      int s=0,ch=0;
      for(int i=0;i<r;++i)
      {
        p[i+1][c-w+1]=0;
        for(int j=c-w;j<c;++j)
        {
          if(arr[i][j]<m)
            p[i+1][c-w+1]+=-1;
          else if(arr[i][j]>m)
            p[i+1][c-w+1]+=1;
        }
        if(i>=h)
          s-=p[i-h+1][c-w+1];
        s+=p[i+1][c-w+1];
        if(i>=h-1)
        {
          pr[i]=s;
          if(s<=0)
            ch=1;
        }
      }
      if(ch)
        return(ch);
      for(int i=0;i<r;++i)
      {
      for(int j=0;j<c;++j)
      {
          p[i+1][j+1]=p[i][j+1];
          if(arr[i][j]<m)
            p[i+1][j+1]+=-1;
          else if(arr[i][j]>m)
            p[i+1][j+1]+=1;
      }
    }
      for(int i=h-1;i<r;++i)
      {
        for(int j=c-w-1;j>=0;--j)
        {
          pr[i]=pr[i]-(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(pr[i]<=0)
            return ch=1;
        }
      }
      return(ch);
    }
    int rectangle(int R, int C, int H, int W, int Q[3001][3001]) 
    {
     
          ios_base::sync_with_stdio(false);
          cin.tie(NULL);
      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.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 3 ms 1664 KB Output is correct
5 Correct 3 ms 1664 KB Output is correct
6 Correct 3 ms 1664 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 3 ms 1664 KB Output is correct
5 Correct 3 ms 1664 KB Output is correct
6 Correct 3 ms 1664 KB Output is correct
7 Correct 28 ms 5120 KB Output is correct
8 Correct 30 ms 5112 KB Output is correct
9 Correct 24 ms 4992 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 3 ms 1664 KB Output is correct
5 Correct 3 ms 1664 KB Output is correct
6 Correct 3 ms 1664 KB Output is correct
7 Correct 28 ms 5120 KB Output is correct
8 Correct 30 ms 5112 KB Output is correct
9 Correct 24 ms 4992 KB Output is correct
10 Correct 333 ms 24364 KB Output is correct
11 Correct 346 ms 24312 KB Output is correct
12 Correct 165 ms 18424 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 3 ms 1664 KB Output is correct
5 Correct 3 ms 1664 KB Output is correct
6 Correct 3 ms 1664 KB Output is correct
7 Correct 28 ms 5120 KB Output is correct
8 Correct 30 ms 5112 KB Output is correct
9 Correct 24 ms 4992 KB Output is correct
10 Correct 333 ms 24364 KB Output is correct
11 Correct 346 ms 24312 KB Output is correct
12 Correct 165 ms 18424 KB Output is correct
13 Correct 3302 ms 106300 KB Output is correct
14 Correct 3388 ms 175480 KB Output is correct
15 Correct 3040 ms 168304 KB Output is correct