oj.uz

Submission #288856

# Submission time Handle Problem Language Result Execution time Memory
288856 2020-09-02T02:09:25 Z BeanZ Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 268 ms 159096 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl '\n'
const int N = 2e5 + 5;
char a[3005][3005];
ll col[3005][3005], row[3005][3005];
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("VietCT.INP", "r")){
                freopen("VietCT.INP", "r", stdin);
                freopen("VietCT.OUT", "w", stdout);
        }
        ll n, m;
        cin >> n >> m;
        for (int i = 1; i <= n; i++){
                for (int j = 1; j <= m; j++){
                        cin >> a[i][j];
                        col[i][j] = col[i - 1][j] + (a[i][j] == 'I');
                        row[i][j] = row[i][j - 1] + (a[i][j] == 'O');
                }
        }
        ll ans = 0;
        for (int i = 1; i <= n; i++){
                for (int j = 1; j <= m; j++){
                        if (a[i][j] == 'J'){
                                ans = ans + (row[i][m] - row[i][j]) * (col[n][j] - col[i][j]);
                        }
                }
        }
        cout << ans;
}
/*
*/

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:14:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   14 |                 freopen("VietCT.INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:15:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   15 |                 freopen("VietCT.OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 512 KB Output is correct
5 Correct 1 ms 1664 KB Output is correct
6 Correct 1 ms 1536 KB Output is correct
7 Correct 1 ms 1408 KB Output is correct
8 Correct 1 ms 1536 KB Output is correct
9 Correct 1 ms 1536 KB Output is correct
10 Correct 1 ms 1408 KB Output is correct
11 Correct 1 ms 1536 KB Output is correct
12 Correct 1 ms 1536 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct
14 Correct 9 ms 8832 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 5 ms 5248 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 11 ms 9728 KB Output is correct
19 Correct 10 ms 9600 KB Output is correct
20 Correct 10 ms 9600 KB Output is correct
21 Correct 11 ms 9728 KB Output is correct
22 Correct 11 ms 9600 KB Output is correct
23 Correct 10 ms 9728 KB Output is correct
24 Correct 13 ms 9728 KB Output is correct
25 Correct 10 ms 9600 KB Output is correct
26 Correct 10 ms 9600 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 512 KB Output is correct
5 Correct 1 ms 1664 KB Output is correct
6 Correct 1 ms 1536 KB Output is correct
7 Correct 1 ms 1408 KB Output is correct
8 Correct 1 ms 1536 KB Output is correct
9 Correct 1 ms 1536 KB Output is correct
10 Correct 1 ms 1408 KB Output is correct
11 Correct 1 ms 1536 KB Output is correct
12 Correct 1 ms 1536 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct
14 Correct 9 ms 8832 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 5 ms 5248 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 11 ms 9728 KB Output is correct
19 Correct 10 ms 9600 KB Output is correct
20 Correct 10 ms 9600 KB Output is correct
21 Correct 11 ms 9728 KB Output is correct
22 Correct 11 ms 9600 KB Output is correct
23 Correct 10 ms 9728 KB Output is correct
24 Correct 13 ms 9728 KB Output is correct
25 Correct 10 ms 9600 KB Output is correct
26 Correct 10 ms 9600 KB Output is correct
27 Correct 260 ms 158712 KB Output is correct
28 Correct 16 ms 26368 KB Output is correct
29 Correct 20 ms 13952 KB Output is correct
30 Correct 1 ms 896 KB Output is correct
31 Correct 198 ms 131448 KB Output is correct
32 Correct 236 ms 159096 KB Output is correct
33 Correct 232 ms 158584 KB Output is correct
34 Correct 230 ms 152440 KB Output is correct
35 Correct 233 ms 159096 KB Output is correct
36 Correct 227 ms 158584 KB Output is correct
37 Correct 268 ms 159096 KB Output is correct
38 Correct 179 ms 130936 KB Output is correct
39 Correct 176 ms 130936 KB Output is correct