oj.uz

Submission #244108

# Submission time Handle Problem Language Result Execution time Memory
244108 2020-07-02T15:34:32 Z kevlee Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 359 ms 85112 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a));
#define all(x) (x).begin(), (x).end()
#define flush fflush(stdout)
#define debug printf("Hello\n")
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
//priority_queue <int, vector <int>, greater <int> > pq;
int n, m, k, x, y, sum, cnt, h, w, orb[3005][3005], ingot[3005][3005];
ll ans;
string s[3005];
int main () {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> h >> w;
  FOR(i, 0, h-1) {
    cin >> s[i];
  }
  FOR(i, 0, h-1) {
    FOR(j, 0, w-1) {
      orb[i+1][j+1] = orb[i+1][j];
      if (s[i][j] == 'O') orb[i+1][j+1]++;
    }
  }
  FOR(j, 0, w-1) {
    FOR(i, 0, h-1) {
      ingot[i+1][j+1] = ingot[i][j+1];
      if (s[i][j] == 'I') ingot[i+1][j+1]++;
    }
  }
  FOR(i, 0, h-1) {
    FOR(j, 0, w-1) {
      if (s[i][j] == 'J') {
        ans += 1LL * (orb[i+1][w] - orb[i+1][j+1]) * (ingot[h][j+1] - ingot[i+1][j+1]);
      }
    }
  }
  cout << ans << endl;
  return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 1280 KB Output is correct
6 Correct 5 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 6 ms 1408 KB Output is correct
9 Correct 5 ms 1280 KB Output is correct
10 Correct 5 ms 1280 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 5 ms 1280 KB Output is correct
13 Correct 5 ms 1280 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 1280 KB Output is correct
6 Correct 5 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 6 ms 1408 KB Output is correct
9 Correct 5 ms 1280 KB Output is correct
10 Correct 5 ms 1280 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 5 ms 1280 KB Output is correct
13 Correct 5 ms 1280 KB Output is correct
14 Correct 12 ms 6272 KB Output is correct
15 Correct 7 ms 3840 KB Output is correct
16 Correct 8 ms 3840 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 13 ms 6912 KB Output is correct
19 Correct 11 ms 6784 KB Output is correct
20 Correct 10 ms 6784 KB Output is correct
21 Correct 12 ms 6912 KB Output is correct
22 Correct 10 ms 6784 KB Output is correct
23 Correct 11 ms 6784 KB Output is correct
24 Correct 13 ms 6912 KB Output is correct
25 Correct 10 ms 6784 KB Output is correct
26 Correct 11 ms 6784 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 1280 KB Output is correct
6 Correct 5 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 6 ms 1408 KB Output is correct
9 Correct 5 ms 1280 KB Output is correct
10 Correct 5 ms 1280 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 5 ms 1280 KB Output is correct
13 Correct 5 ms 1280 KB Output is correct
14 Correct 12 ms 6272 KB Output is correct
15 Correct 7 ms 3840 KB Output is correct
16 Correct 8 ms 3840 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 13 ms 6912 KB Output is correct
19 Correct 11 ms 6784 KB Output is correct
20 Correct 10 ms 6784 KB Output is correct
21 Correct 12 ms 6912 KB Output is correct
22 Correct 10 ms 6784 KB Output is correct
23 Correct 11 ms 6784 KB Output is correct
24 Correct 13 ms 6912 KB Output is correct
25 Correct 10 ms 6784 KB Output is correct
26 Correct 11 ms 6784 KB Output is correct
27 Correct 339 ms 84576 KB Output is correct
28 Correct 17 ms 19328 KB Output is correct
29 Correct 15 ms 7808 KB Output is correct
30 Correct 5 ms 768 KB Output is correct
31 Correct 234 ms 70264 KB Output is correct
32 Correct 291 ms 84984 KB Output is correct
33 Correct 285 ms 84984 KB Output is correct
34 Correct 275 ms 80632 KB Output is correct
35 Correct 293 ms 84984 KB Output is correct
36 Correct 295 ms 84856 KB Output is correct
37 Correct 359 ms 85112 KB Output is correct
38 Correct 207 ms 70264 KB Output is correct
39 Correct 195 ms 70008 KB Output is correct