oj.uz

답안 #831245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831245 2023-08-20T02:22:03 Z vjudge1 Bomb (IZhO17_bomb) C++17
24 / 100
 87 ms 6528 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//turn on extra precision
//#pragma GCC target("fpmath=387")

using namespace std;
using namespace __gnu_pbds;

using str   = string;
using ll    = long long;
using pii   = pair <int,int>;
using pll   = pair <ll,ll>;
using vi    = vector <int>;
using vll   = vector <ll>;
using vpii  = vector <pii>;
using vpll  = vector <pll>;

template<class A, class B>
ostream& operator<<(ostream& os, const pair<A, B> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}

template<class T>
ostream& operator<<(ostream& os, const vector<T> &v) {
    bool van = 1; os << '{';
    for(auto &i : v) { if(!van) os << ", "; os << i; van = 0; }
    os << '}'; return os;
}

template<class T, size_t sz>
ostream& operator<<(ostream&os, const array<T,sz> &arr) {
    bool fs = 1; os << '{';
    for(auto &i : arr) { if(!fs) os << ", "; os << i; fs = 0; }
    os << '}'; return os;
}

#define mp make_pair
#define fi first
#define se second
#define fs first.second
#define ss second.second
#define ff first.first
#define sf second.first
#define newl '\n'
#define all(x) x.begin(), x.end()
#define watch(x) cerr << (#x) << " is : " << (x) << newl

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template <class T>
ll quickpow(ll num1, ll num2, const T MOD) {
    assert(num2 >= 0); ll ans = 1;
    for(; num2; num2>>=1, num1 = num1 * num1 % MOD) if(num2 & 1) ans = ans * num1 % MOD;
    return ans;
}
// end of Template

int main(){

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m;
    cin >> n >> m;

    vector<vector<char>> g(n, vector<char>(m));
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < m; ++j) {
            cin >> g[i][j];
        }
    }

    int ro = -1, co = -1;
    for(int i = 0; i < n; ++i) {
        int len = 0, mn = 1e9;
        for(int j = 0; j < m; ++j) {
            if(g[i][j] == '1') ++len;
            else {
                if(len) mn = min(mn, len);
                len = 0;
            }
        }
        if(len) mn = min(mn, len);
        if(mn == 1e9) continue;
        ro = (ro == -1 ? mn : min(ro, mn));
    }

    for(int j = 0; j < m; ++j) {
        int len = 0, mn = 1e9;
        for(int i = 0; i < n; ++i) {
            if(g[i][j] == '1') ++len;
            else {
                if(len) mn = min(mn, len);
                len = 0;
            }
        }
        if(len) mn = min(mn, len);
        if(mn == 1e9) continue;
        co = (co == -1 ? mn : min(co, mn));
    }

    if(ro == -1 || co == -1) return cout << 0 << newl, 0;
    cout << ro * co << newl;

    return 0;
}

Compilation message

bomb.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("O3")
      | 
bomb.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization ("unroll-loops")
      | 
bomb.cpp:8: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    8 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
24.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Incorrect 0 ms 212 KB Output isn't correct
11 Incorrect 0 ms 212 KB Output isn't correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Incorrect 1 ms 212 KB Output isn't correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Incorrect 0 ms 212 KB Output isn't correct
19 Incorrect 1 ms 212 KB Output isn't correct
20 Incorrect 0 ms 212 KB Output isn't correct
21 Incorrect 1 ms 212 KB Output isn't correct
22 Incorrect 0 ms 212 KB Output isn't correct
23 Incorrect 0 ms 212 KB Output isn't correct
24 Incorrect 1 ms 212 KB Output isn't correct
25 Incorrect 0 ms 212 KB Output isn't correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 2 ms 320 KB Output is correct
28 Incorrect 2 ms 340 KB Output isn't correct
29 Incorrect 2 ms 340 KB Output isn't correct
30 Incorrect 2 ms 468 KB Output isn't correct
31 Incorrect 2 ms 468 KB Output isn't correct
32 Incorrect 2 ms 468 KB Output isn't correct
33 Incorrect 3 ms 468 KB Output isn't correct
34 Incorrect 1 ms 340 KB Output isn't correct
35 Incorrect 3 ms 468 KB Output isn't correct
36 Correct 2 ms 468 KB Output is correct
37 Incorrect 0 ms 212 KB Output isn't correct
38 Correct 62 ms 6484 KB Output is correct
39 Incorrect 0 ms 212 KB Output isn't correct
40 Incorrect 8 ms 1108 KB Output isn't correct
41 Incorrect 0 ms 212 KB Output isn't correct
42 Incorrect 1 ms 212 KB Output isn't correct
43 Correct 66 ms 6508 KB Output is correct
44 Incorrect 2 ms 468 KB Output isn't correct
45 Incorrect 72 ms 6512 KB Output isn't correct
46 Correct 67 ms 6484 KB Output is correct
47 Incorrect 66 ms 6484 KB Output isn't correct
48 Incorrect 67 ms 6484 KB Output isn't correct
49 Correct 74 ms 6484 KB Output is correct
50 Incorrect 68 ms 6484 KB Output isn't correct
51 Incorrect 78 ms 6484 KB Output isn't correct
52 Incorrect 67 ms 6484 KB Output isn't correct
53 Incorrect 66 ms 6484 KB Output isn't correct
54 Incorrect 71 ms 6528 KB Output isn't correct
55 Incorrect 69 ms 6484 KB Output isn't correct
56 Correct 63 ms 6508 KB Output is correct
57 Incorrect 68 ms 6504 KB Output isn't correct
58 Incorrect 78 ms 6484 KB Output isn't correct
59 Incorrect 69 ms 6504 KB Output isn't correct
60 Correct 69 ms 6484 KB Output is correct
61 Correct 67 ms 6484 KB Output is correct
62 Correct 64 ms 6484 KB Output is correct
63 Correct 62 ms 6484 KB Output is correct
64 Correct 68 ms 6456 KB Output is correct
65 Incorrect 68 ms 6484 KB Output isn't correct
66 Incorrect 66 ms 6484 KB Output isn't correct
67 Incorrect 65 ms 6484 KB Output isn't correct
68 Incorrect 68 ms 6508 KB Output isn't correct
69 Incorrect 68 ms 6504 KB Output isn't correct
70 Incorrect 44 ms 4308 KB Output isn't correct
71 Incorrect 73 ms 6508 KB Output isn't correct
72 Incorrect 70 ms 6492 KB Output isn't correct
73 Incorrect 69 ms 6484 KB Output isn't correct
74 Incorrect 70 ms 6484 KB Output isn't correct
75 Incorrect 69 ms 6484 KB Output isn't correct
76 Incorrect 67 ms 6504 KB Output isn't correct
77 Incorrect 74 ms 6508 KB Output isn't correct
78 Incorrect 68 ms 6504 KB Output isn't correct
79 Incorrect 71 ms 6508 KB Output isn't correct
80 Incorrect 70 ms 6508 KB Output isn't correct
81 Incorrect 74 ms 6484 KB Output isn't correct
82 Incorrect 68 ms 6508 KB Output isn't correct
83 Incorrect 68 ms 6520 KB Output isn't correct
84 Incorrect 71 ms 6484 KB Output isn't correct
85 Incorrect 69 ms 6508 KB Output isn't correct
86 Incorrect 71 ms 6484 KB Output isn't correct
87 Incorrect 87 ms 6484 KB Output isn't correct
88 Incorrect 68 ms 6512 KB Output isn't correct
89 Incorrect 67 ms 6512 KB Output isn't correct
90 Incorrect 49 ms 4308 KB Output isn't correct
91 Incorrect 67 ms 6484 KB Output isn't correct
92 Incorrect 67 ms 6504 KB Output isn't correct
93 Incorrect 63 ms 6484 KB Output isn't correct
94 Incorrect 67 ms 6484 KB Output isn't correct
95 Incorrect 67 ms 6508 KB Output isn't correct
96 Incorrect 68 ms 6484 KB Output isn't correct
97 Incorrect 64 ms 6484 KB Output isn't correct
98 Incorrect 67 ms 6484 KB Output isn't correct
99 Incorrect 77 ms 6484 KB Output isn't correct
100 Incorrect 72 ms 6484 KB Output isn't correct