oj.uz

Submission #1065523

# Submission time Handle Problem Language Result Execution time Memory
1065523 2024-08-19T08:55:38 Z CodeLakVN Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 135 ms 88916 KB 
#include <bits/stdc++.h>

#define no "NO"
#define yes "YES"
#define F first
#define S second
#define vec vector
#define task "main"
#define ll long long
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maximize(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool minimize(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)3e3 + 9;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;

int numRow, numCol;
string a[N];
int cntO[N][N], cntI[N][N];

void main_code() {
    cin >> numRow >> numCol;
    FOR(i, 1, numRow) {
        cin >> a[i];
        a[i] = " " + a[i];
    }

    FOR(i, 1, numRow) FOD(j, numCol, 1) cntO[i][j] = cntO[i][j + 1] + (a[i][j] == 'O');
    FOR(j, 1, numCol) FOD(i, numRow, 1) cntI[i][j] = cntI[i + 1][j] + (a[i][j] == 'I');

    ll ans = 0;
    FOR(i, 1, numRow) FOR(j, 1, numCol) if (a[i][j] == 'J')
        ans += 1LL * cntO[i][j + 1] * cntI[i + 1][j];
    cout << ans;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0;
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); cout << "\n"; }
}

/* Lak lu theo dieu nhac */

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:55:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:56:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1324 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1324 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 4716 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 5 ms 8848 KB Output is correct
19 Correct 4 ms 8796 KB Output is correct
20 Correct 5 ms 8796 KB Output is correct
21 Correct 5 ms 9052 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 5 ms 8796 KB Output is correct
24 Correct 5 ms 9052 KB Output is correct
25 Correct 4 ms 9052 KB Output is correct
26 Correct 4 ms 8756 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1324 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 4716 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 5 ms 8848 KB Output is correct
19 Correct 4 ms 8796 KB Output is correct
20 Correct 5 ms 8796 KB Output is correct
21 Correct 5 ms 9052 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 5 ms 8796 KB Output is correct
24 Correct 5 ms 9052 KB Output is correct
25 Correct 4 ms 9052 KB Output is correct
26 Correct 4 ms 8756 KB Output is correct
27 Correct 113 ms 87888 KB Output is correct
28 Correct 6 ms 36700 KB Output is correct
29 Correct 7 ms 7956 KB Output is correct
30 Correct 1 ms 856 KB Output is correct
31 Correct 85 ms 71488 KB Output is correct
32 Correct 99 ms 88656 KB Output is correct
33 Correct 99 ms 88404 KB Output is correct
34 Correct 101 ms 82872 KB Output is correct
35 Correct 102 ms 88616 KB Output is correct
36 Correct 101 ms 88404 KB Output is correct
37 Correct 135 ms 88916 KB Output is correct
38 Correct 69 ms 71472 KB Output is correct
39 Correct 72 ms 71296 KB Output is correct