답안 #963325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
963325 2024-04-14T20:51:55 Z Saul0906 Bitaro the Brave (JOI19_ho_t1) C++17
20 / 100
95 ms 2140 KB
#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=b; a<c; a++)

using namespace std;

int main(){
	int h, w;
	cin>>h>>w;
	string g[h];
	int ans=0, p[h][w];
	rep(i,0,h){
		cin>>g[i];
		rep(j,0,w){
			p[i][j]=(g[i][j]=='O');
			if(j) p[i][j]+=p[i][j-1];
		}
	}
	rep(i,0,h){
		rep(j,0,w){
			if(g[i][j]!='I') continue;
			rep(k,0,i){
				if(g[k][j]=='J') ans+=p[k][w-1]-p[k][j];
			}
		}
	}
	cout<<ans<<endl;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 484 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 484 KB Output is correct
14 Correct 75 ms 1600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 8 ms 1236 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 95 ms 2140 KB Output is correct
19 Correct 39 ms 1840 KB Output is correct
20 Incorrect 58 ms 1880 KB Output isn't correct
21 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 484 KB Output is correct
14 Correct 75 ms 1600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 8 ms 1236 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 95 ms 2140 KB Output is correct
19 Correct 39 ms 1840 KB Output is correct
20 Incorrect 58 ms 1880 KB Output isn't correct
21 Halted 0 ms 0 KB -