Submission #464677

#	Time	Username	Problem	Language	Result	Execution time	Memory
464677		Blobo2_Blobo2	Strah (COCI18_strah)	C++14	22 / 110	1093 ms	4812 KiB

strah

/*
Editor: Abdelrahman Hossam
Nickname: Blobo2_Blobo2
IOI next year isA :)
*/
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define endl "\n"
#define all(v)  v.begin(),v.end()
#define gen(arr,n,nxt)  generate(arr,arr+n,nxt)
#define Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty ios_base::sync_with_stdio(false);cin.tie(0);

const int mo=1e9+7,INF=1e18;
int nxt(){int x;cin>>x;return x;}
signed main(){
    Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty
    int n=nxt(),m=nxt();
    string grid[n];
    for(int i=0;i<n;i++)cin>>grid[i];
    int cnt=0;
    for(int topX=0;topX<n;topX++){
        for(int topY=0;topY<m;topY++){
            if(grid[topX][topY] == '#')continue;
            for(int bottomX=topX;bottomX<n;bottomX++){
                for(int bottomY=topY;bottomY<m;bottomY++){
                    if(grid[bottomX][bottomY] == '#')continue;
                    bool ok=0;
                    for(int i=topX;i<=bottomX;i++){
                        for(int j=topY;j<=bottomY;j++){
                            ok|=grid[i][j]=='#';
                        }
                    }
                    cnt+=(ok?0ll:(abs(topX-bottomX)+1)*(abs(topY-bottomY)+1));
                }
            }
        }
    }
    cout<<cnt<<endl;
    return 0;
}

Compilation message (stderr)

strah.cpp:19:24: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 | const int mo=1e9+7,INF=1e18;
      |                        ^~~~

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11