oj.uz

Submission #75976

# Submission time Handle Problem Language Result Execution time Memory
75976 2018-09-11T18:03:38 Z Vardanyan Luxury burrow (IZhO13_burrow) C++14
0 / 100
 2000 ms 40408 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
//int t[N][4*N];
int b[N][N];
int a[N][N];
int L[N];
int R[N];
/*
void build(int row,int v,int l,int r){
    if(l == r){
        t[row][v] = a[row][l];
        return;
    }
    int m = (l+r)/2;
    build(row,v*2,l,m);
    build(row,v*2+1,m+1,r);
    t[row][v] = min(t[row][v*2],t[row][v*2+1]);
}
int query(int row,int v,int s,int e,int l,int r){
    if(l>r) return 1000*1000*1000+5;
    if(s == l && e == r) return t[row][v];
    int m = (s+e)/2;
    return min(query(row,v*2,s,m,l,min(m,r)),query(row,v*2+1,m+1,e,max(l,m+1),r));
}*/
int n,m,k;
int get(int x){
    int mxs = 0;
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=m;j++){
            if(b[i][j] >= x) a[i][j] = a[i-1][j]+1;
            else a[i][j] = 0;
        }
    }
    for(int i = 1;i<=n;i++){
        memset(L,0,sizeof(L));
        memset(R,0,sizeof(R));
        for(int j = 1;j<=m;j++){
            int u = a[i][j];
            int l = j,r = j;
            while(r<m){
                    if(R[r]>r) r = R[r];
                    else r++;
                    if(a[i][r]<u){
                        r--;
                        break;
                    }
            }
            while(l>1){
                if(L[l]<l && L[l]) l = L[l];
                else l--;
                if(a[i][l]<u){
                    l++;
                    break;
                }
            }
            u*=(r-l+1);
            mxs = max(mxs,u);
            L[j] = l;
            R[j] = r;
        }
    }
    return mxs;
}
int main(){
    scanf("%d%d%d",&n,&m,&k);
    vector<int> all;
    map<int,int> mp;
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=m;j++){
                scanf("%d",&b[i][j]);
              if(!mp[b[i][j]]){  all.push_back(b[i][j]);
                mp[b[i][j]] = 1;
                }
        }
    }
    sort(all.begin(),all.end());
    int l = 0;
    int r = all.size()-1;
    int ans = 0;
    int mxs = k;
    while(l<=r){
        int m = (l+r)/2;
        int y = get(all[m]);
        if(y>=k){
            ans = m;
            mxs = y;
            l = m+1;
        }
        else r = m-1;
    }
    cout<<all[ans]<<" "<<mxs<<endl;
    return 0;
}

Compilation message

burrow.cpp: In function 'int main()':
burrow.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&m,&k);
     ~~~~~^~~~~~~~~~~~~~~~~~~
burrow.cpp:71:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf("%d",&b[i][j]);
                 ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 560 KB Output is correct
3 Correct 2 ms 740 KB Output is correct
4 Correct 2 ms 740 KB Output is correct
5 Correct 3 ms 752 KB Output is correct
6 Correct 3 ms 752 KB Output is correct
7 Correct 5 ms 752 KB Output is correct
8 Correct 9 ms 1264 KB Output is correct
9 Correct 17 ms 1996 KB Output is correct
10 Correct 204 ms 4204 KB Output is correct
11 Correct 121 ms 5652 KB Output is correct
12 Correct 35 ms 5652 KB Output is correct
13 Correct 555 ms 5652 KB Output is correct
14 Correct 186 ms 5652 KB Output is correct
15 Correct 210 ms 5652 KB Output is correct
16 Correct 387 ms 12208 KB Output is correct
17 Correct 682 ms 12208 KB Output is correct
18 Correct 1102 ms 24352 KB Output is correct
19 Correct 898 ms 24352 KB Output is correct
20 Execution timed out 2048 ms 40408 KB Time limit exceeded
21 Halted 0 ms 0 KB -