Submission #652830

# Submission time Handle Problem Language Result Execution time Memory
652830 2022-10-24T18:26:27 Z Shin Bitaro the Brave (JOI19_ho_t1) C++14
20 / 100
9 ms 2004 KB
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair

using namespace std;
template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

const int N = 3e3 + 7;
char a[N][N];
int cnt[N];

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, m; cin >> n >> m;
  for (int i = 1; i <= n; i ++) {
    for (int j = 1; j <= m; j ++) {
      cin >> a[i][j];
    }
  }
  int res = 0;
  for (int i = n; i > 0; i --) {
    int cnt_o = 0;
    for (int j = m; j > 0; j --) {
      if (a[i][j] == 'J') {
        res += 1LL * cnt_o * cnt[j];
      }
      if (a[i][j] == 'O') {
        cnt_o ++;
      }
      if (a[i][j] == 'I') {
        cnt[j] ++;
      }
    }
  }
  cout << res;
  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 6 ms 1876 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 9 ms 2004 KB Output is correct
19 Correct 8 ms 2004 KB Output is correct
20 Incorrect 7 ms 1956 KB Output isn't correct
21 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 6 ms 1876 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 9 ms 2004 KB Output is correct
19 Correct 8 ms 2004 KB Output is correct
20 Incorrect 7 ms 1956 KB Output isn't correct
21 Halted 0 ms 0 KB -