답안 #381625

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381625	2021-03-25T11:23:54 Z	Iwanttobreakfree	Bitaro the Brave (JOI19_ho_t1)	C++17	20 / 100	73 ms	1636 KB

joi2019_ho_t1

#include <iostream>
#include <vector>
using namespace std;
int main(){
	int h,w;
	cin>>h>>w;
	char grid[h][w];
	vector<pair<int,int> > v;
	for(int i=0;i<h;i++){
		for(int j=0;j<w;j++){
			cin>>grid[i][j];
			if(grid[i][j]=='J')v.push_back(make_pair(i,j));
		}
	}
	int n=v.size();
	int sol=0;
	for(int j=0;j<n;j++){
		//cout<<sol<<' ';
		int x=v[j].first;
		int y=v[j].second;
		//cout<<x<<' '<<y<<' ';
		int co=0,ci=0;
		for(int i=x;i<h;i++){
			if(grid[i][y]=='I')co++;
			//cout<<grid[i][y]<<' ';
		}
		for(int i=y;i<w;i++){
			if(grid[x][i]=='O')ci++;
			// cout<<grid[x][i]<<' ';
		}
		//cout<<co<<' '<<ci<<' ';
		sol+=co*ci;
	}
	cout<<sol<<'\n';
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	2 ms	364 KB	Output is correct
6	Correct	2 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	2 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct

Subtask #2

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	2 ms	364 KB	Output is correct
6	Correct	2 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	2 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct
14	Correct	45 ms	1124 KB	Output is correct
15	Correct	2 ms	364 KB	Output is correct
16	Correct	27 ms	1000 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	65 ms	1636 KB	Output is correct
19	Correct	26 ms	876 KB	Output is correct
20	Incorrect	73 ms	1636 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	2 ms	364 KB	Output is correct
6	Correct	2 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	2 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct
14	Correct	45 ms	1124 KB	Output is correct
15	Correct	2 ms	364 KB	Output is correct
16	Correct	27 ms	1000 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	65 ms	1636 KB	Output is correct
19	Correct	26 ms	876 KB	Output is correct
20	Incorrect	73 ms	1636 KB	Output isn't correct
21	Halted	0 ms	0 KB	-