oj.uz

Submission #288855

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

using namespace std;

#define ll int
#define endl '\n'
const int N = 2e5 + 5;
char a[3005][3005];
ll col[3005][3005][3], row[3005][3005][3];
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;
        string s = "JOI";
        for (int i = 1; i <= n; i++){
                for (int j = 1; j <= m; j++){
                        cin >> a[i][j];
                        for (int k = 0; k < 3; k++){
                                col[i][j][k] = col[i - 1][j][k] + (a[i][j] == s[k]);
                                row[i][j][k] = row[i][j - 1][k] + (a[i][j] == s[k]);
                        }
                }
        }
        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][1] - row[i][j][1]) * (col[n][j][2] - col[i][j][2]);
                        }
                }
        }
        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 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 1 ms 1664 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct
8 Correct 2 ms 1664 KB Output is correct
9 Correct 1 ms 1664 KB Output is correct
10 Correct 1 ms 1536 KB Output is correct
11 Correct 2 ms 1664 KB Output is correct
12 Correct 1 ms 1664 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 1 ms 1664 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct
8 Correct 2 ms 1664 KB Output is correct
9 Correct 1 ms 1664 KB Output is correct
10 Correct 1 ms 1536 KB Output is correct
11 Correct 2 ms 1664 KB Output is correct
12 Correct 1 ms 1664 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct
14 Correct 11 ms 10368 KB Output is correct
15 Correct 3 ms 4992 KB Output is correct
16 Correct 8 ms 6272 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 14 ms 11776 KB Output is correct
19 Correct 13 ms 11520 KB Output is correct
20 Incorrect 13 ms 11520 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 1 ms 1664 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct
8 Correct 2 ms 1664 KB Output is correct
9 Correct 1 ms 1664 KB Output is correct
10 Correct 1 ms 1536 KB Output is correct
11 Correct 2 ms 1664 KB Output is correct
12 Correct 1 ms 1664 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct
14 Correct 11 ms 10368 KB Output is correct
15 Correct 3 ms 4992 KB Output is correct
16 Correct 8 ms 6272 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 14 ms 11776 KB Output is correct
19 Correct 13 ms 11520 KB Output is correct
20 Incorrect 13 ms 11520 KB Output isn't correct
21 Halted 0 ms 0 KB -