제출 #1289178

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289178		ghammazhassan	Bitaro the Brave (JOI19_ho_t1)	C++20	0 / 100	1 ms	576 KiB

joi2019_ho_t1

// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=1e9+7;
// const int inf = 1e14;
const int LOG=18;
const int N=1e6+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
void solve(){
    cin >> n >> m;
    vector<string>s(n);
    for (int i=0;i<n;i++){
        cin >> s[i];
    }
    c=0;
    vector<int>a(m);
    vector<int>b(n);
    for (int i=0;i<n;i++){
        for (int j=0;j<m;j++){
            if (s[i][j]=='I'){
                a[j]++;
            }
            if (s[i][j]=='O'){
                b[i]++;
            }
        }
    }
    for (int i=0;i<n;i++){
        for (int j=0;j<n;j++){
            if (s[i][j]=='I'){
                a[j]--;
            }
            else if (s[i][j]=='O'){
                b[i]--;
            }
            else{
                c+=a[j]*b[i];
            }
        }
    }
    cout << c << endl;
}
signed main()    
{   

    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
    cout << fixed << setprecision(9);
    srand(time(0));
    // int t=1;
    // cin >> t;
    for (int _=1;_<=t;_++){
        solve();
        q++;
    }
} 

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