Submission #957390

#	Time	Username	Problem	Language	Result	Execution time	Memory
957390		yeediot	Luxury burrow (IZhO13_burrow)	C++14	100 / 100	573 ms	18020 KiB

burrow

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=1005;
int a[mxn][mxn];
int cur[mxn];
int n,m;
int calc(int mm){
    memset(cur,0,sizeof(cur));
    int temp=0;
    for(int i=0;i<n;i++){
        vector<int>st;
        vector<int>l(m),r(m);
        for(int j=0;j<m;j++){
            if(a[i][j]>=mm){
                cur[j]++;
            }
            else{
                cur[j]=0;
            }
            while(sz(st) and cur[st.back()]>=cur[j]){
                st.pop_back();
            }
            l[j]=(sz(st)?st.back()+1:0);
            st.pb(j);
        }
        st.clear();
        for(int j=m-1;j>=0;j--){
            while(sz(st) and cur[st.back()]>=cur[j]){
                st.pop_back();
            }
            r[j]=sz(st)?st.back()-1:m-1;
            temp=max(temp,(r[j]-l[j]+1)*cur[j]);
            st.pb(j);
        }
    }
    return temp;
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int k;
    cin>>n>>m>>k;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>a[i][j];
        }
    }
    int l=0,r=1e18;
    while(l<r){
        int mm=l+r+1>>1;
        memset(cur,0,sizeof(cur));
        if(calc(mm)<k){
            r=mm-1;
        }
        else{
            l=mm;
        }
    }
    cout<<l<<' '<<calc(l)<<'\n';
}
 /*
 input:
 
 */















 

Compilation message (stderr)

burrow.cpp: In function 'int main()':
burrow.cpp:102:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  102 |         int mm=l+r+1>>1;
      |                ~~~^~
burrow.cpp: In function 'void setIO(std::string)':
burrow.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
burrow.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 100 / 100