답안 #944802

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
944802	2024-03-13T05:39:31 Z	ezzzay	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	1000 ms	2760 KB

joi2019_ho_t1

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=2e3+2;
char a[N][N];
signed main(){
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>a[i][j];
        }
    }
    int cnt=0;
    for(int i=1;i<=n;i++){
        for(int k=i+1;k<=n;k++){
            for(int j=1;j<=m;j++){
                for(int l=j+1;l<=m;l++){
                    if(a[i][j]=='J' and a[i][l]=='O' and a[k][j]=='I')cnt++;
                }
            }
        }
    }
    cout<<cnt;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 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	23 ms	2684 KB	Output is correct
6	Correct	10 ms	2652 KB	Output is correct
7	Correct	20 ms	632 KB	Output is correct
8	Correct	22 ms	2652 KB	Output is correct
9	Correct	12 ms	2496 KB	Output is correct
10	Correct	20 ms	604 KB	Output is correct
11	Correct	25 ms	2652 KB	Output is correct
12	Correct	16 ms	2668 KB	Output is correct
13	Correct	23 ms	604 KB	Output is correct

Subtask #2

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 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	23 ms	2684 KB	Output is correct
6	Correct	10 ms	2652 KB	Output is correct
7	Correct	20 ms	632 KB	Output is correct
8	Correct	22 ms	2652 KB	Output is correct
9	Correct	12 ms	2496 KB	Output is correct
10	Correct	20 ms	604 KB	Output is correct
11	Correct	25 ms	2652 KB	Output is correct
12	Correct	16 ms	2668 KB	Output is correct
13	Correct	23 ms	604 KB	Output is correct
14	Execution timed out	1054 ms	2760 KB	Time limit exceeded
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 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	23 ms	2684 KB	Output is correct
6	Correct	10 ms	2652 KB	Output is correct
7	Correct	20 ms	632 KB	Output is correct
8	Correct	22 ms	2652 KB	Output is correct
9	Correct	12 ms	2496 KB	Output is correct
10	Correct	20 ms	604 KB	Output is correct
11	Correct	25 ms	2652 KB	Output is correct
12	Correct	16 ms	2668 KB	Output is correct
13	Correct	23 ms	604 KB	Output is correct
14	Execution timed out	1054 ms	2760 KB	Time limit exceeded
15	Halted	0 ms	0 KB	-