Submission #293200

#	Time	Username	Problem	Language	Result	Execution time	Memory
293200		Hehehe	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	410 ms	103412 KiB

joi2019_ho_t1

#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define sz(x) (int)((x).size())
#define int long long

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int N = 4e3 + 11;
const int X = 1e6;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);

//ifstream in(".in");
//ofstream out(".out");

int n, m, I[N][N];
char a[N][N];

void solve(){

    cin >> n >> m;

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> a[i][j];
        }
    }

    for(int j = 1; j <= m; j++){
        for(int i = n; i >= 1; i--){
            I[i][j] = I[i + 1][j] + (a[i][j] == 'I');
        }
    }

    int ans = 0;

    for(int i = 1; i <= n; i++){
        int J = 0;
        for(int j = 1; j <= m; j++){
            if(a[i][j] == 'J')J += I[i][j];
            if(a[i][j] == 'O')ans += J;
        }
    }

    cout << ans << '\n';
}

int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);

    //cout << setprecision(6) << fixed;

    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
}

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