제출 #1214723

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1214723		arkanefury	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	280 ms	150244 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define in insert
#define lb lower_bound
#define F first
#define S second
#define sz size()
#define int long long
#define all(v) v.begin(),v.end()
#define FOR(x, n, m, d) for(int x = n; x <= m; x += d)
#define FORR(x, n, m, d) for(int x = n; x >= m; x -= d)
#define nikita ios_base::sync_with_stdio(0), cin.tie(0);
const int N =  3000+5;
int a[N][N], b[N][N], pref[N], dp[N];
int n,m,sum=0,x,y, ans, r, cnt, l, mod = 998244353, inf = -1e18, k;
string str, ss;
bool used[N];
char s[N][N];
void solve(){
    nikita
    cin >> n >> m;
    FOR(i, 0, n-1, 1){
        FOR(j, 0, m-1, 1)cin >> s[i][j];
    }
    FOR(i, 0, m-1, 1){
        sum = 0;
        FORR(j, n-1, 0, 1){
            sum += (s[j][i] == 'I');
            a[j][i] = sum;
        }
    }
    FOR(i, 0, n-1, 1){
        sum = 0;
        FORR(j, m-1, 0, 1){
            sum += (s[i][j] == 'O');
            b[i][j] = sum;
        }
    }
    ans = 0;
    FOR(i, 0, n-1, 1){
        FOR(j, 0, m-1, 1){
            if(s[i][j] == 'J')ans += a[i][j] * b[i][j];
        }
    }
    cout << ans;
}
signed main(){
    nikita
    // freopen("cowpatibility.in", "r", stdin);
    // freopen("cowpatibility.out", "w", stdout);
    int tt = 1;
    if(!tt)cin >> tt;
    FOR(i, 1, tt, 1){
        solve();
    }
}

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