Submission #472404

#	Time	Username	Problem	Language	Result	Execution time	Memory
472404		Mr_Ph	Strah (COCI18_strah)	C++14	22 / 110	1098 ms	8108 KiB

strah

///made by : Mr_Ph :D
#include<bits/stdc++.h>
#include<unordered_map>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
const double PI=acos(-1.0);
const ll mod=(ll)1e9+7;
//int a1[4] = {0, 0, 1, -1};
//int b1[4] = {1, -1, 0, 0};
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define lower(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define upper(s) transform(s.begin(),s.end(),s.begin(),::toupper)
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
///the end of the defines ;)
void solve()
{
    int n,m;
    cin>>n>>m;
    vector<vector<char>>arr(n,vector<char>(m));
    for(int i=0; i<n; i++)
        for(int k=0; k<m; k++)
            cin>>arr[i][k];
    ll sum=0;
    for(int i=0; i<n; i++)
    {
        for(int k=0; k<m; k++)
        {
            for(int e=i; e<n; e++)
            {
                for(int w=k; w<m; w++)
                {
                    ll ans=0;
                    bool valid=true;
                    for(int f=i; f<=e; f++)
                    {
                        for(int g=k; g<=w; g++)
                        {
                            if(arr[f][g]=='.')
                                ans++;
                            else
                            {
                                //ans=0;
                                valid=false;
                                //break;
                            }
                        }
                    }
                    if(valid)
                        sum+=ans;
                }
            }
        }
    }
    cout<<sum<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(0);
    //freopen("window.in","r",stdin);
    //freopen("output.txt","w",stdout);
    int t=1;//int st;
    //cin>>t;//cin>>st;
    while(t--)
        solve();
}

• 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