oj.uz

답안 #735230

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
735230 2023-05-03T18:14:32 Z Nelt Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 265 ms 159180 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    ll n, m;
    cin >> n >> m;
    str s[n + 1];
    for (ll i = 1; i <= n; i++)
        cin >> s[i], s[i] = ' ' + s[i];
    ll suf[n + 2][m + 2], suf1[n + 2][m + 2], ans = 0;
    for (ll i = 0; i <= n + 1; i++)
    for (ll j = 0; j <= m + 1; j++)
        suf[i][j] = suf1[i][j] = 0;
    for (ll i = 1; i <= n; i++)
        for (ll j = m; j >= 1; j--)
            suf[i][j] = suf[i][j + 1] + (s[i][j] == 'O');
    for (ll j = 1; j <= m; j++)
    for (ll i = n; i >= 1; i--)
        suf1[i][j] = suf1[i + 1][j] + (s[i][j] == 'I');
    for (ll i = 1; i <= n; i++)
    for (ll j = 1; j <= m; j++)
        if (s[i][j] == 'J')
            ans += suf[i][j] * suf1[i][j];
    cout << ans << endl;
}
/*

*/
int main()
{
    sync
        // precomp();
        ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 4 ms 3644 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 3 ms 2648 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 4 ms 4684 KB Output is correct
19 Correct 5 ms 4560 KB Output is correct
20 Correct 5 ms 4684 KB Output is correct
21 Correct 4 ms 4692 KB Output is correct
22 Correct 5 ms 4524 KB Output is correct
23 Correct 4 ms 4692 KB Output is correct
24 Correct 5 ms 4692 KB Output is correct
25 Correct 4 ms 4524 KB Output is correct
26 Correct 5 ms 4692 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 4 ms 3644 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 3 ms 2648 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 4 ms 4684 KB Output is correct
19 Correct 5 ms 4560 KB Output is correct
20 Correct 5 ms 4684 KB Output is correct
21 Correct 4 ms 4692 KB Output is correct
22 Correct 5 ms 4524 KB Output is correct
23 Correct 4 ms 4692 KB Output is correct
24 Correct 5 ms 4692 KB Output is correct
25 Correct 4 ms 4524 KB Output is correct
26 Correct 5 ms 4692 KB Output is correct
27 Correct 246 ms 150340 KB Output is correct
28 Correct 1 ms 852 KB Output is correct
29 Correct 14 ms 11860 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 175 ms 110672 KB Output is correct
32 Correct 257 ms 158180 KB Output is correct
33 Correct 265 ms 158664 KB Output is correct
34 Correct 199 ms 128320 KB Output is correct
35 Correct 254 ms 158116 KB Output is correct
36 Correct 250 ms 158660 KB Output is correct
37 Correct 249 ms 159180 KB Output is correct
38 Correct 181 ms 109812 KB Output is correct
39 Correct 164 ms 110240 KB Output is correct