oj.uz

답안 #915553

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915553 2024-01-24T06:58:59 Z vjudge1 Bomb (IZhO17_bomb) C++17
30 / 100
 1000 ms 1884 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <iostream>
#include <vector>
#define pb push_back
#define str string
using namespace std;

int pp[501][501];
int u[501][501];

void solve(){
    int n,m;
    cin>>n>>m;
    if(n==1){
        str s;
        cin>>s;
        vector<int >v;
        int k=0;
        for(int i=0;i<m;i++){
            if(s[i]=='1')k++;
            else{
                if(k>0){
                    v.pb(k);
                    k=0;
                }
            }
        }
        if(k>0){
            v.pb(k);
        }
        int ans=1;
        if(v.size()==0){
            cout<<0;
            return;
        }
        for(int i=2;i<=m;i++){
            k=1;
            for(int j=0;j<(int)v.size();j++){
                if(v[j]<i){
                    k=0;
                    break;
                }
            }
            if(k==1){
                ans=i;
            }
        }
        cout<<ans;
    }
    else if(m==1){
        char s;
        vector<int >v;
        int k=0;
        for(int i=0;i<n;i++){
            cin>>s;
            if(s=='1')k++;
            else{
                if(k>0){
                    v.pb(k);
                    k=0;
                }
            }
        }
        if(k>0){
            v.pb(k);
        }
        int ans=1;
        if(v.size()==0){
            cout<<0;
            return;
        }
        for(int i=2;i<=n;i++){
            k=1;
            for(int j=0;j<(int)v.size();j++){
                if(v[j]<i){
                    k=0;
                    break;
                }
            }
            if(k==1){
                ans=i;
            }
        }
        cout<<ans;
    }
    else if(n<=300 && m<=300){
        str s[n+3];
        int a[n+3][m+3];
        int o=0;
        for(int i=1;i<=n;i++){
            cin>>s[i];
            for(int j=0;j<m;j++){
                a[i][j+1]=s[i][j]-'0';
                o+=(a[i][j]==1);
                pp[i][j+1]=a[i][j+1]+pp[i][j]+pp[i-1][j+1]-pp[i-1][j];
            }
        }
        if(o==0){
            cout<<0;
            return;
        }
        int ans=0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(i*j<=ans){
                    continue;
                }
                for(int i1=1;i1<=n;i1++){
                    for(int j1=1;j1<=m;j1++){
                        u[i1][j1]=0;
                    }
                }
                for(int i1=1;i1<=n;i1++){
                    for(int j1=1;j1<=m;j1++){
                        if(i1+i-1>n || j1+j-1>m)continue;
                        if(pp[i1+i-1][j1+j-1]+pp[i1-1][j1-1]-pp[i1+i-1][j1-1]-pp[i1-1][j1+j-1]==i*j){
                            for(int i2=i1;i2<=i1+i-1;i2++){
                                for(int j2=j1;j2<=j1+j-1;j2++){
                                    u[i2][j2]=1;
                                }
                            }
                        }
                    }
                }
                int k=1;
                for(int i1=1;i1<=n;i1++){
                    for(int j1=1;j1<=m;j1++){
                        if(u[i1][j1]!=a[i1][j1]){
                            k=0;
                            break;
                        }
                    }
                }
                if(k==1){
                    /*cout<<i<<" "<<j<<"\n";
                    for(int i1=1;i1<=n;i1++){
                        for(int j1=1;j1<=m;j1++){
                            cout<<u[i1][j1];
                        }
                        cout<<"\n";
                    }//*/
                    ans=max(ans,i*j);
                }
            }
        }
        cout<<ans;
    }
    else {
        cout<<n*m;
    }
}

signed main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	//srand( time(0));
	//rand()
	//freopen("sum.in", "r", stdin);
	//freopen("sum.out", "w", stdout);
    int tests=1;
    //cin>>tests;
    for(int i=1;i<=tests;i++){
		//cout<<"TEST CASE : "<<i<<"\n";
		solve();
	}
}

Compilation message

bomb.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization("unroll-loops")
      |

Subtask #1
30.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 472 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 1 ms 544 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 15 ms 756 KB Output is correct
18 Correct 17 ms 772 KB Output is correct
19 Correct 47 ms 860 KB Output is correct
20 Correct 50 ms 860 KB Output is correct
21 Correct 20 ms 604 KB Output is correct
22 Correct 41 ms 600 KB Output is correct
23 Correct 80 ms 860 KB Output is correct
24 Correct 33 ms 600 KB Output is correct
25 Correct 112 ms 896 KB Output is correct
26 Execution timed out 1047 ms 1112 KB Time limit exceeded
27 Execution timed out 1052 ms 1884 KB Time limit exceeded
28 Incorrect 1 ms 348 KB Output isn't correct
29 Incorrect 0 ms 348 KB Output isn't correct
30 Incorrect 0 ms 348 KB Output isn't correct
31 Incorrect 1 ms 348 KB Output isn't correct
32 Incorrect 1 ms 348 KB Output isn't correct
33 Incorrect 1 ms 348 KB Output isn't correct
34 Incorrect 0 ms 480 KB Output isn't correct
35 Incorrect 1 ms 344 KB Output isn't correct
36 Incorrect 1 ms 348 KB Output isn't correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Incorrect 0 ms 348 KB Output isn't correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 220 ms 900 KB Output is correct
43 Incorrect 1 ms 348 KB Output isn't correct
44 Incorrect 0 ms 348 KB Output isn't correct
45 Incorrect 0 ms 348 KB Output isn't correct
46 Incorrect 1 ms 348 KB Output isn't correct
47 Incorrect 0 ms 348 KB Output isn't correct
48 Incorrect 0 ms 348 KB Output isn't correct
49 Incorrect 0 ms 348 KB Output isn't correct
50 Incorrect 0 ms 348 KB Output isn't correct
51 Incorrect 0 ms 348 KB Output isn't correct
52 Incorrect 1 ms 344 KB Output isn't correct
53 Incorrect 0 ms 344 KB Output isn't correct
54 Incorrect 1 ms 604 KB Output isn't correct
55 Incorrect 0 ms 348 KB Output isn't correct
56 Incorrect 1 ms 348 KB Output isn't correct
57 Incorrect 0 ms 348 KB Output isn't correct
58 Incorrect 1 ms 348 KB Output isn't correct
59 Incorrect 0 ms 348 KB Output isn't correct
60 Incorrect 1 ms 348 KB Output isn't correct
61 Incorrect 0 ms 348 KB Output isn't correct
62 Incorrect 0 ms 344 KB Output isn't correct
63 Incorrect 1 ms 348 KB Output isn't correct
64 Incorrect 0 ms 348 KB Output isn't correct
65 Incorrect 0 ms 476 KB Output isn't correct
66 Incorrect 0 ms 348 KB Output isn't correct
67 Incorrect 0 ms 348 KB Output isn't correct
68 Incorrect 1 ms 348 KB Output isn't correct
69 Incorrect 0 ms 348 KB Output isn't correct
70 Incorrect 0 ms 348 KB Output isn't correct
71 Incorrect 0 ms 344 KB Output isn't correct
72 Incorrect 0 ms 476 KB Output isn't correct
73 Incorrect 0 ms 348 KB Output isn't correct
74 Incorrect 0 ms 348 KB Output isn't correct
75 Incorrect 0 ms 420 KB Output isn't correct
76 Incorrect 0 ms 600 KB Output isn't correct
77 Incorrect 0 ms 356 KB Output isn't correct
78 Incorrect 0 ms 348 KB Output isn't correct
79 Incorrect 1 ms 348 KB Output isn't correct
80 Incorrect 1 ms 600 KB Output isn't correct
81 Incorrect 0 ms 348 KB Output isn't correct
82 Incorrect 1 ms 344 KB Output isn't correct
83 Incorrect 1 ms 348 KB Output isn't correct
84 Incorrect 0 ms 344 KB Output isn't correct
85 Incorrect 0 ms 348 KB Output isn't correct
86 Incorrect 0 ms 348 KB Output isn't correct
87 Incorrect 1 ms 348 KB Output isn't correct
88 Incorrect 1 ms 344 KB Output isn't correct
89 Incorrect 0 ms 348 KB Output isn't correct
90 Incorrect 1 ms 344 KB Output isn't correct
91 Incorrect 0 ms 600 KB Output isn't correct
92 Incorrect 0 ms 348 KB Output isn't correct
93 Incorrect 0 ms 348 KB Output isn't correct
94 Incorrect 0 ms 348 KB Output isn't correct
95 Incorrect 0 ms 472 KB Output isn't correct
96 Incorrect 0 ms 348 KB Output isn't correct
97 Incorrect 1 ms 344 KB Output isn't correct
98 Incorrect 0 ms 348 KB Output isn't correct
99 Incorrect 0 ms 348 KB Output isn't correct
100 Incorrect 1 ms 348 KB Output isn't correct