| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 234932 | anubhavdhar | 삶의 질 (IOI10_quality) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#include "quality.h"
#define ll long long int
#define pb push_back
#define mp make_pair
#define FOR(i,n) for(i=0;i<(n);++i)
#define FORe(i,n) for(i=1;i<=(n);++i)
#define FORr(i,a,b) for(i=(a);i<(b);++i)
#define FORrev(i,n) for(i=(n);i>=0;--i)
#define F0R(i,n) for(int i=0;i<(n);++i)
#define F0Re(i,n) for(int i=1;i<=(n);++i)
#define F0Rr(i,a,b) for(ll i=(a);i<(b);++i)
#define F0Rrev(i,n) for(int i=(n);i>=0;--i)
#define ii pair<ll,ll>
#define vi vector<ll>
#define vii vector<ii>
#define ff first
#define ss second
#define cd complex<double>
#define vcd vector<cd>
#define ldd long double
#define dbgLine cout<<"Line : "<<__LINE__<<'\n'
#define all(x) (x).begin(),(x).end()
using namespace std;
const short int __PRECISION = 10;
/*
const ll MOD = 1e9+7;
const ll INF = 1e17 + 1101;
const ll LOGN = 17;
const ll MAXN = 2e5+5;
const ll ROOTN = 320;
const ldd PI = acos(-1);
const ldd EPS = 1e-7;
*/
int rect[3000][3000], pre[3000][3000];
pair<int, int> Lookup[9000000];
#define in(t) (Lookup[t].ff > i-H && Lookup[t].ff <= i && Lookup[t].ss > j-W && Lookup[t].ss <= j)
inline bool bs(int R, int C, int H, int W, int target)
{
if(target < (H*W)/2)
return false;
F0R(i, R)
F0R(j ,C)
{
pre[i][j] = (rect[i][j] == target ? 0 : (rect[i][j] < target ? -1 : 1)) + (i==0 ? 0 : pre[i-1][j]) + (j==0 ? 0 : pre[i][j-1])
- ((i==0||j==0) ? 0 : pre[i-1][j-1]);
// }
// cout<<"target = "<<target<<'\n';
// F0R(i, R)
// {
// F0R(j, C)
// cout<<pre[i][j]<<' ';
// cout<<endl;
// }
// F0R(i, R)
// F0R(j, C)
// {
if(i >= H-1 && j >= W-1)
{
int tmp = pre[i][j] - (i==H-1 ? 0 : pre[i-H][j]) - (j==W-1 ? 0 : pre[i][j-W]) + ((i==H-1||j==W-1) ? 0 : pre[i-H][j-W]);
if((tmp < 0) || (tmp == 0 && in(target)))
{
// cout<<"found target = "<<target<<" at "<<i<<","<<j<<endl;
return true;
}
}
}
return false;
}
int rectangle(int R, int C, int H, int W, vector<vector<int>> Q)
{
F0R(i, R)
F0R(j, C)
rect[i][j] = Q[i][j]-1;
F0R(i, R)
F0R(j, C)
Lookup[rect[i][j]] = mp(i, j);
int lo = 0, hi = R*C - 1, mid;
while(hi > lo + 1)
{
// cout<<"lo = "<<lo<<", hi = "<<hi<<endl;
mid = (hi + lo)/2;
if(bs(R, C, H, W, mid))
hi = mid;
else
lo = mid;
}
return hi+1;
}
/*
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int R, C, H, W;
cin>>R>>C>>H>>W;
vector<vector<int>> Q(R, vector<int> (C));
F0R(i, R)
F0R(j, C)
cin>>Q[i][j];
cout<<rectangle(R, C, H, W, Q);
return 0;
}
5 5 3 3
5 11 12 16 25
17 18 2 7 10
4 23 20 3 1
24 21 19 14 9
6 22 8 13 15
*/