Submission #1237130

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237130		Geforgs	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	180 ms	150500 KiB

joi2019_ho_t1

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void solve(){
    ll n, m, i, j, res=0;
    cin>>n>>m;
    vector<vector<char>> a(n, vector<char>(m));
    vector<vector<ll>> b(n, vector<ll>(m));
    vector<vector<ll>> c(n, vector<ll>(m));
    for(i=0;i<n;++i){
        for(j=0;j<m;++j){
            cin>>a[i][j];
        }
    }
    for(i=n-1;i>=0;--i){
        for(j=m-1;j>=0;--j){
            if(i < n-1){
                b[i][j] = b[i+1][j];
            }
            if(j < m-1){
                c[i][j] = c[i][j+1];
            }
            if(a[i][j] == 'I'){
                ++b[i][j];
            }else if(a[i][j] == 'O'){
                ++c[i][j];
            }else{
                res += c[i][j]*b[i][j];
            }
        }
    }
    cout<<res<<endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50