oj.uz

답안 #335810

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335810 2020-12-14T03:33:03 Z talant117408 Bomb (IZhO17_bomb) C++17
90 / 100
 646 ms 129200 KB 
/*
    Code written by Talant I.D.
*/
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>

//using namespace __gnu_pbds;
using namespace std;

//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int main(){
    do_not_disturb
    
    int n, m, i, j;
    cin >> n >> m;
    int grid[n+1][m+1], pref[n+2][m+2], suff[n+2][m+2], up[n+2][m+2], down[n+2][m+2];
    
    for(i = 1; i <= n; i++){
        pref[i][0] = 0;
        suff[i][m+1] = m+1;
        for(j = 1; j <= m; j++){
            up[0][j] = 0;
            down[n+1][j] = n+1;
            char ch;
            cin >> ch;
            grid[i][j] = ch-'0';
        }
    }
    
    for(i = 1; i <= n; i++){
        for(j = 1; j <= m; j++){
            if(grid[i][j]) pref[i][j] = pref[i][j-1];
            else pref[i][j] = j;
        }
        for(j = m; j; j--){
            if(grid[i][j]) suff[i][j] = suff[i][j+1];
            else suff[i][j] = j;
        }
    }
    
    for(j = 1; j <= m; j++){
        for(i = 1; i <= n; i++){
            if(grid[i][j]) up[i][j] = up[i-1][j];
            else up[i][j] = i;
        }
        for(i = n; i; i--){
            if(grid[i][j]) down[i][j] = down[i+1][j];
            else down[i][j] = i;
        }
    }
    
    vector <int> res(m+1, 2e9);
    
    for(i = 1; i <= n; i++){
        int mnu = 2e9, mnd = 2e9;
        for(j = 1; j <= m; j++){
            if(grid[i][j]){
                mnu = min(mnu, i-up[i][j]);
                mnd = min(mnd, down[i][j]-i);
                res[j-pref[i][j]] = min(res[j-pref[i][j]], (mnu+mnd-1));
            }
            else{
                mnu = mnd = 2e9;
            }
        }
        mnu = mnd = 2e9;
        for(j = m; j; j--){
            if(grid[i][j]){
                mnu = min(mnu, i-up[i][j]);
                mnd = min(mnd, down[i][j]-i);
                res[suff[i][j]-j] = min(res[suff[i][j]-j], (mnu+mnd-1));
            }
            else{
                mnu = mnd = 2e9;
            }
        }
    }
    
    int to_consider = 2e9;
    for(i = 1; i <= n; i++){
        for(j = 1; j <= m; j++){
            if(grid[i][j]){
                to_consider = min(to_consider, suff[i][j]-pref[i][j]-1);
            }
        }
    }
    
    int ans = 0;
    for(j = 1; j <= to_consider; j++){
        ans = max(ans, res[j]*j);
    }
    cout << ans;
    
    return 0;
}

Subtask #1
90.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Incorrect 1 ms 492 KB Output isn't correct
27 Incorrect 5 ms 2028 KB Output isn't correct
28 Correct 5 ms 2668 KB Output is correct
29 Correct 8 ms 2924 KB Output is correct
30 Correct 9 ms 4204 KB Output is correct
31 Correct 10 ms 3436 KB Output is correct
32 Correct 44 ms 3564 KB Output is correct
33 Correct 10 ms 4460 KB Output is correct
34 Correct 5 ms 2028 KB Output is correct
35 Correct 9 ms 4460 KB Output is correct
36 Incorrect 13 ms 4460 KB Output isn't correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 580 ms 129004 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 65 ms 16236 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 492 KB Output is correct
43 Correct 582 ms 129132 KB Output is correct
44 Correct 11 ms 4460 KB Output is correct
45 Correct 547 ms 128876 KB Output is correct
46 Correct 549 ms 128876 KB Output is correct
47 Correct 580 ms 129008 KB Output is correct
48 Correct 552 ms 129004 KB Output is correct
49 Incorrect 642 ms 129132 KB Output isn't correct
50 Correct 558 ms 129004 KB Output is correct
51 Correct 575 ms 128876 KB Output is correct
52 Correct 554 ms 129004 KB Output is correct
53 Correct 541 ms 128960 KB Output is correct
54 Correct 556 ms 129036 KB Output is correct
55 Correct 550 ms 129004 KB Output is correct
56 Correct 570 ms 128876 KB Output is correct
57 Correct 523 ms 129000 KB Output is correct
58 Correct 544 ms 128924 KB Output is correct
59 Correct 524 ms 128924 KB Output is correct
60 Incorrect 530 ms 129004 KB Output isn't correct
61 Incorrect 646 ms 128876 KB Output isn't correct
62 Incorrect 578 ms 129024 KB Output isn't correct
63 Incorrect 575 ms 129132 KB Output isn't correct
64 Incorrect 511 ms 128876 KB Output isn't correct
65 Correct 538 ms 129052 KB Output is correct
66 Correct 534 ms 129004 KB Output is correct
67 Correct 550 ms 129004 KB Output is correct
68 Correct 565 ms 128964 KB Output is correct
69 Correct 502 ms 128876 KB Output is correct
70 Correct 333 ms 82796 KB Output is correct
71 Correct 520 ms 129108 KB Output is correct
72 Correct 551 ms 128996 KB Output is correct
73 Correct 537 ms 129020 KB Output is correct
74 Correct 513 ms 129016 KB Output is correct
75 Correct 514 ms 129128 KB Output is correct
76 Correct 507 ms 128816 KB Output is correct
77 Correct 519 ms 129004 KB Output is correct
78 Correct 510 ms 128984 KB Output is correct
79 Correct 487 ms 128908 KB Output is correct
80 Correct 510 ms 128848 KB Output is correct
81 Correct 506 ms 128936 KB Output is correct
82 Correct 527 ms 128876 KB Output is correct
83 Correct 519 ms 128976 KB Output is correct
84 Correct 497 ms 128896 KB Output is correct
85 Correct 512 ms 128872 KB Output is correct
86 Correct 567 ms 128952 KB Output is correct
87 Correct 508 ms 128988 KB Output is correct
88 Correct 523 ms 128868 KB Output is correct
89 Correct 538 ms 128924 KB Output is correct
90 Correct 320 ms 82668 KB Output is correct
91 Correct 518 ms 129004 KB Output is correct
92 Correct 554 ms 129116 KB Output is correct
93 Correct 577 ms 128960 KB Output is correct
94 Correct 530 ms 129040 KB Output is correct
95 Correct 519 ms 128988 KB Output is correct
96 Correct 547 ms 129200 KB Output is correct
97 Correct 565 ms 128980 KB Output is correct
98 Correct 522 ms 128836 KB Output is correct
99 Correct 527 ms 128876 KB Output is correct
100 Correct 565 ms 129056 KB Output is correct