oj.uz

Submission #1027175

# Submission time Handle Problem Language Result Execution time Memory
1027175 2024-07-19T01:38:36 Z vjudge1 Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 119 ms 18112 KB 
#include <bits/stdc++.h>
#define int long long
#define INF LLONG_MAX
#define pii pair<int, int>
using namespace std;

int32_t main()
{
     ios_base::sync_with_stdio(false);
     cin.tie(NULL);
     cout.tie(NULL);

     int h, w;
     cin >> h >> w;
     vector<vector<char>> grid(h, vector<char>(w));
     vector<int> rowcnt(h, 0), colcnt(w, 0);
     for (int i = 0; i < h; i++)
     {
          string s;
          cin >> s;
          for (int j = 0; j < w; j++)
          {
               if (s[j] == 'O')
                    rowcnt[i]++;
               else if (s[j] == 'I')
                    colcnt[j]++;
               grid[i][j] = s[j];
          }
     }
     int ans = 0;
     for (int i = 0; i < h; i++)
     {
          for (int j = 0; j < w; j++)
          {
               if (grid[i][j] == 'J')
                    ans += (rowcnt[i] * colcnt[j]);
               else if (grid[i][j] == 'O')
                    rowcnt[i]--;
               else
                    colcnt[j]--;
          }
     }
     cout << ans << endl;

     return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 372 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 3 ms 604 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 4 ms 740 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 1 ms 832 KB Output is correct
21 Correct 4 ms 840 KB Output is correct
22 Correct 2 ms 856 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 372 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 3 ms 604 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 4 ms 740 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 1 ms 832 KB Output is correct
21 Correct 4 ms 840 KB Output is correct
22 Correct 2 ms 856 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 112 ms 17128 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 3 ms 1628 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 86 ms 12608 KB Output is correct
32 Correct 42 ms 18108 KB Output is correct
33 Correct 37 ms 18080 KB Output is correct
34 Correct 96 ms 14604 KB Output is correct
35 Correct 38 ms 18112 KB Output is correct
36 Correct 36 ms 18000 KB Output is correct
37 Correct 119 ms 18108 KB Output is correct
38 Correct 32 ms 12624 KB Output is correct
39 Correct 25 ms 12560 KB Output is correct