답안 #39228 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
39228	2018-01-10T11:00:09 Z	yerkimbekov	Bomb (IZhO17_bomb)	C++14	24 / 100	166 ms	8308 KB

bomb

/*
ID: simpgoo1
TASK:
LANG: C++14
*/
// timus 219263UI
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <ctime>
#include <queue>
#include <vector>
#include <iomanip>
#include <cstdlib>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <unordered_map>
 
using namespace std;
 
typedef long long ll;
 
#define y1 needtrainharder
#define F first
#define S second
#define gg exit(0)
#define sz() size()
#define pb push_back
#define mp make_pair
#define skip continue
#define all(x) x.begin(), x.end()
#define boost ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL)
#define file(s,x) if(x == 1)freopen(s".in","r",stdin),freopen(s".out","w",stdout);
#define task "sorting"
 
const int INF = 1e9 + 100;  
const ll INFLL = 1e18 + 100;  
const double EPS = 1e-10;
const int MAXN = 5e5 + 100; 
const int P = 51;
const int mod = 1e9 + 7;
 
char a[2505][2505];
 
int main(){ 
 
  boost; 
 
  srand(time(NULL));
 
  if(fopen(task".in", "r")){  
    freopen(task".in", "r", stdin);
    freopen(task".out","w",stdout); 
  }
 
  int n, m;
  cin >> n >> m;
  bool tr = 0;
  for(int i = 1; i <= n; ++i){
    for(int j = 1; j <= m; ++j){
      cin >> a[i][j];
      if( a[i][j] == '1' )
        tr = 1;
    }
  }
  if(!tr){
    cout << 0;gg;
  }
 
  ll mnx = INFLL, mny = INFLL, cur = 0;
 
  for(int i = 1; i <= n; ++i){
    cur = 0;
    for(int j = 1; j <= m; ++j){
      if( a[i][j] == '1' )
        ++cur;
      else{
        if(cur != 0)
          mnx = min(mnx, cur);
        cur = 0;
      }
    }
    if(cur != 0)
      mnx = min(mnx, cur);
  }
 
  if(cur != 0)
    mnx = min(mnx, cur);
 
  cur = 0;
 
  for(int j = 1; j <= m; ++j){
    cur = 0;
    for(int i = 1; i <= n; ++i){
      if(a[i][j] == '1'){
        ++cur;
      }else{
        if(cur != 0)
          mny = min(mny, cur);
        cur = 0;
      }
    }
    if(cur != 0)
      mny = min(mny, cur);
  }

  if(cur != 0)
    mny = min(mny, cur);
 
  cout << mnx * 1ll * mny;
 
  return 0;
}

Compilation message

bomb.cpp: In function 'int main()':
bomb.cpp:55:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(task".in", "r", stdin);
                                   ^
bomb.cpp:56:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(task".out","w",stdout); 
                                   ^

Subtask #1
24.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	8308 KB	Output is correct
2	Correct	0 ms	8308 KB	Output is correct
3	Correct	0 ms	8308 KB	Output is correct
4	Correct	3 ms	8308 KB	Output is correct
5	Correct	0 ms	8308 KB	Output is correct
6	Correct	0 ms	8308 KB	Output is correct
7	Correct	0 ms	8308 KB	Output is correct
8	Incorrect	0 ms	8308 KB	Output isn't correct
9	Incorrect	0 ms	8308 KB	Output isn't correct
10	Incorrect	0 ms	8308 KB	Output isn't correct
11	Incorrect	0 ms	8308 KB	Output isn't correct
12	Incorrect	0 ms	8308 KB	Output isn't correct
13	Correct	0 ms	8308 KB	Output is correct
14	Correct	0 ms	8308 KB	Output is correct
15	Incorrect	0 ms	8308 KB	Output isn't correct
16	Correct	0 ms	8308 KB	Output is correct
17	Correct	0 ms	8308 KB	Output is correct
18	Incorrect	0 ms	8308 KB	Output isn't correct
19	Incorrect	0 ms	8308 KB	Output isn't correct
20	Incorrect	0 ms	8308 KB	Output isn't correct
21	Incorrect	0 ms	8308 KB	Output isn't correct
22	Incorrect	0 ms	8308 KB	Output isn't correct
23	Incorrect	0 ms	8308 KB	Output isn't correct
24	Incorrect	0 ms	8308 KB	Output isn't correct
25	Incorrect	0 ms	8308 KB	Output isn't correct
26	Correct	0 ms	8308 KB	Output is correct
27	Correct	0 ms	8308 KB	Output is correct
28	Incorrect	0 ms	8308 KB	Output isn't correct
29	Incorrect	0 ms	8308 KB	Output isn't correct
30	Incorrect	3 ms	8308 KB	Output isn't correct
31	Incorrect	0 ms	8308 KB	Output isn't correct
32	Incorrect	0 ms	8308 KB	Output isn't correct
33	Incorrect	3 ms	8308 KB	Output isn't correct
34	Incorrect	0 ms	8308 KB	Output isn't correct
35	Incorrect	3 ms	8308 KB	Output isn't correct
36	Correct	3 ms	8308 KB	Output is correct
37	Incorrect	0 ms	8308 KB	Output isn't correct
38	Correct	116 ms	8308 KB	Output is correct
39	Incorrect	0 ms	8308 KB	Output isn't correct
40	Incorrect	16 ms	8308 KB	Output isn't correct
41	Incorrect	0 ms	8308 KB	Output isn't correct
42	Incorrect	0 ms	8308 KB	Output isn't correct
43	Correct	123 ms	8308 KB	Output is correct
44	Incorrect	6 ms	8308 KB	Output isn't correct
45	Incorrect	136 ms	8308 KB	Output isn't correct
46	Correct	123 ms	8308 KB	Output is correct
47	Incorrect	123 ms	8308 KB	Output isn't correct
48	Incorrect	129 ms	8308 KB	Output isn't correct
49	Correct	106 ms	8308 KB	Output is correct
50	Incorrect	103 ms	8308 KB	Output isn't correct
51	Incorrect	99 ms	8308 KB	Output isn't correct
52	Incorrect	89 ms	8308 KB	Output isn't correct
53	Incorrect	119 ms	8308 KB	Output isn't correct
54	Incorrect	139 ms	8308 KB	Output isn't correct
55	Incorrect	109 ms	8308 KB	Output isn't correct
56	Correct	129 ms	8308 KB	Output is correct
57	Incorrect	126 ms	8308 KB	Output isn't correct
58	Incorrect	109 ms	8308 KB	Output isn't correct
59	Incorrect	129 ms	8308 KB	Output isn't correct
60	Correct	116 ms	8308 KB	Output is correct
61	Correct	126 ms	8308 KB	Output is correct
62	Correct	133 ms	8308 KB	Output is correct
63	Correct	113 ms	8308 KB	Output is correct
64	Correct	139 ms	8308 KB	Output is correct
65	Incorrect	129 ms	8308 KB	Output isn't correct
66	Incorrect	129 ms	8308 KB	Output isn't correct
67	Incorrect	116 ms	8308 KB	Output isn't correct
68	Incorrect	129 ms	8308 KB	Output isn't correct
69	Incorrect	143 ms	8308 KB	Output isn't correct
70	Incorrect	79 ms	8308 KB	Output isn't correct
71	Incorrect	136 ms	8308 KB	Output isn't correct
72	Incorrect	126 ms	8308 KB	Output isn't correct
73	Incorrect	163 ms	8308 KB	Output isn't correct
74	Incorrect	126 ms	8308 KB	Output isn't correct
75	Incorrect	113 ms	8308 KB	Output isn't correct
76	Incorrect	123 ms	8308 KB	Output isn't correct
77	Incorrect	136 ms	8308 KB	Output isn't correct
78	Incorrect	119 ms	8308 KB	Output isn't correct
79	Incorrect	149 ms	8308 KB	Output isn't correct
80	Incorrect	133 ms	8308 KB	Output isn't correct
81	Incorrect	123 ms	8308 KB	Output isn't correct
82	Incorrect	109 ms	8308 KB	Output isn't correct
83	Incorrect	139 ms	8308 KB	Output isn't correct
84	Incorrect	109 ms	8308 KB	Output isn't correct
85	Incorrect	146 ms	8308 KB	Output isn't correct
86	Incorrect	143 ms	8308 KB	Output isn't correct
87	Incorrect	143 ms	8308 KB	Output isn't correct
88	Incorrect	146 ms	8308 KB	Output isn't correct
89	Incorrect	123 ms	8308 KB	Output isn't correct
90	Incorrect	93 ms	8308 KB	Output isn't correct
91	Incorrect	113 ms	8308 KB	Output isn't correct
92	Incorrect	106 ms	8308 KB	Output isn't correct
93	Incorrect	166 ms	8308 KB	Output isn't correct
94	Incorrect	129 ms	8308 KB	Output isn't correct
95	Incorrect	153 ms	8308 KB	Output isn't correct
96	Incorrect	109 ms	8308 KB	Output isn't correct
97	Incorrect	123 ms	8308 KB	Output isn't correct
98	Incorrect	129 ms	8308 KB	Output isn't correct
99	Incorrect	156 ms	8308 KB	Output isn't correct
100	Incorrect	133 ms	8308 KB	Output isn't correct

답안 #39228

Compilation message

Subtask #1 24.0 / 100.0

Subtask #1
24.0 / 100.0