Submission #915414

#	Time	Username	Problem	Language	Result	Execution time	Memory
915414		HorizonWest	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	216 ms	159680 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

void solve()
{
    int n, m; cin >> n >> m; 
    vector <vector<char>> c(n, vector <char> (m));
    for(auto& u : c) for(auto& j : u) cin >> j; 

    vector <vector<int>> s1(n + 2, vector <int> (m + 2)),
            s2(n + 2, vector <int> (m + 2));

    for(int i = n-1; i >= 0; i--)
    {
        for(int j = m-1; j >= 0; j--)
            s1[i][j] = s1[i][j+1] + (c[i][j] == 'O');
        
        for(int j = m-1; j >= 0; j--)
            s2[i][j] = s2[i+1][j] + (c[i][j] == 'I');
    }

    int ans = 0;

    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < m; j++) if(c[i][j] == 'J')
        {
            ans += s1[i][j] * s2[i][j];
        }
    }

    cout << ans << endl;
}

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

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

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