Submission #865856

# Submission time Handle Problem Language Result Execution time Memory
865856 2023-10-25T00:36:00 Z phoenix0423 Bitaro the Brave (JOI19_ho_t1) C++17
50 / 100
7 ms 8028 KB
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
// #pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
const int maxn = 1000 + 5;
const int INF = 1e9;
const double eps = 1e-7;
string s[maxn];
int r[maxn][maxn], d[maxn][maxn];

int main(void){
	fastio;
	int h, w;
	cin>>h>>w;
	for(int i = 0; i < h; i++) cin>>s[i];
	for(int i = 0; i < h; i++){
		int cnt = 0;
		for(int j = w - 1; j >= 0; j--){
			if(s[i][j] == 'O') cnt++;
			if(s[i][j] == 'J') r[i][j] = cnt;
		}
	}
	for(int j = 0; j < w; j++){
		int cnt = 0;
		for(int i = h - 1; i >= 0; i--){
			if(s[i][j] == 'I') cnt++;
			if(s[i][j] == 'J') d[i][j] = cnt;
		}
	}
	ll ans = 0;
	for(int i = 0; i < h; i++){
		for(int j = 0; j < w; j++){
			if(s[i][j] == 'J') ans += r[i][j] * d[i][j];
		}
	}
	cout<<ans<<"\n";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6648 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6648 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 4 ms 7000 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 5 ms 7084 KB Output is correct
19 Correct 2 ms 7004 KB Output is correct
20 Correct 2 ms 7000 KB Output is correct
21 Correct 5 ms 7000 KB Output is correct
22 Correct 2 ms 7004 KB Output is correct
23 Correct 2 ms 7004 KB Output is correct
24 Correct 5 ms 7004 KB Output is correct
25 Correct 2 ms 7004 KB Output is correct
26 Correct 2 ms 7004 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6648 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 4 ms 7000 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 5 ms 7084 KB Output is correct
19 Correct 2 ms 7004 KB Output is correct
20 Correct 2 ms 7000 KB Output is correct
21 Correct 5 ms 7000 KB Output is correct
22 Correct 2 ms 7004 KB Output is correct
23 Correct 2 ms 7004 KB Output is correct
24 Correct 5 ms 7004 KB Output is correct
25 Correct 2 ms 7004 KB Output is correct
26 Correct 2 ms 7004 KB Output is correct
27 Runtime error 7 ms 8028 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -