제출 #1070873

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1070873		dosts	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	105 ms	18000 KiB

joi2019_ho_t1

//Dost SEFEROĞLU
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<    
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int MOD = 1e9+7,inf = 2e18;
const int N = 1e5+50;

void solve() { 
    int n,m;
    cin >> n >> m;
    char grid[n+1][m+1];
    for (int i=1;i<=n;i++) {
        string s;
        cin >> s;
        for (int j=1;j<=m;j++) grid[i][j] = s[j-1]; 
    }
    int ans = 0;
    vi stuff(m+1,0);
    for (int i=n;i>=1;i--) {
        for (int j=1;j<=m;j++) {
            if (grid[i][j] == 'I') stuff[j]++;
        }
        int os = 0;
        for (int j=m;j>=1;j--) {
            if (grid[i][j] == 'O') os++;
            else if (grid[i][j] == 'J') ans+=os*stuff[j];
        }
    }
    cout << ans << endl;
}
 
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef Dodi
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t; 
    while (t --> 0) solve();
}

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