Submission #383092

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
383092	2021-03-28T19:53:59 Z	MODDI	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	61 ms	2156 KB

joi2019_ho_t1

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define mp make_pair
#define pb push_back
using namespace std;
int n, m, rez = 0;
char mat[3030][3030];
int main(){
	cin>>n>>m;
	for(int i = 0; i < n; i++){
		string a;
		cin>>a;
		for(int j = 0; j < m; j++){
			mat[i][j] = a[j];	
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			if(mat[i][j] == 'J'){
				int lcnt = 0, kcnt = 0;
				for(int l = j + 1; l < m; l++){
					if(mat[i][l] == 'O'){
						lcnt++;
					}
					else
						continue;
				}
				for(int k = i + 1; k < n; k++){
					if(mat[k][j] == 'I'){
						kcnt++;
					}
					else
						continue;
				}
					rez += (kcnt * lcnt);
			}
			else
				continue;
		}
	}
	cout<<rez<<endl; 
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	376 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	620 KB	Output is correct
6	Correct	2 ms	640 KB	Output is correct
7	Correct	2 ms	620 KB	Output is correct
8	Correct	2 ms	620 KB	Output is correct
9	Correct	2 ms	620 KB	Output is correct
10	Correct	2 ms	620 KB	Output is correct
11	Correct	3 ms	620 KB	Output is correct
12	Correct	2 ms	620 KB	Output is correct
13	Correct	2 ms	620 KB	Output is correct

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	376 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	620 KB	Output is correct
6	Correct	2 ms	640 KB	Output is correct
7	Correct	2 ms	620 KB	Output is correct
8	Correct	2 ms	620 KB	Output is correct
9	Correct	2 ms	620 KB	Output is correct
10	Correct	2 ms	620 KB	Output is correct
11	Correct	3 ms	620 KB	Output is correct
12	Correct	2 ms	620 KB	Output is correct
13	Correct	2 ms	620 KB	Output is correct
14	Correct	36 ms	2156 KB	Output is correct
15	Correct	3 ms	1516 KB	Output is correct
16	Correct	23 ms	1260 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	52 ms	2028 KB	Output is correct
19	Correct	21 ms	2156 KB	Output is correct
20	Incorrect	61 ms	2028 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	376 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	620 KB	Output is correct
6	Correct	2 ms	640 KB	Output is correct
7	Correct	2 ms	620 KB	Output is correct
8	Correct	2 ms	620 KB	Output is correct
9	Correct	2 ms	620 KB	Output is correct
10	Correct	2 ms	620 KB	Output is correct
11	Correct	3 ms	620 KB	Output is correct
12	Correct	2 ms	620 KB	Output is correct
13	Correct	2 ms	620 KB	Output is correct
14	Correct	36 ms	2156 KB	Output is correct
15	Correct	3 ms	1516 KB	Output is correct
16	Correct	23 ms	1260 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	52 ms	2028 KB	Output is correct
19	Correct	21 ms	2156 KB	Output is correct
20	Incorrect	61 ms	2028 KB	Output isn't correct
21	Halted	0 ms	0 KB	-