제출 #825291

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
825291		NhanBeoo	Bitaro the Brave (JOI19_ho_t1)	C++17	20 / 100	1073 ms	596 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;

// #define int ll
#define MAX LLONG_MAX
#define st first
#define nd second
#define endl '\n'
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(), x.end()
typedef long long ll;
typedef pair< int, int > ii;
typedef pair< int, ii > iii;
typedef vector< int > vi;
typedef vector< ii > vii;
typedef vector< iii > viii;
typedef vector< vi > vvi;
typedef vector< vii > vvii;
typedef vector< viii > vviii;

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int n, m; cin >> n >> m;
	char a[n][m];
	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			cin >> a[i][j];
		}
	}
	int ans = 0;
	for(int i=0; i<n; ++i){
		for(int j=0; j<m; ++j){
			for(int k=i+1; k<n; ++k){
				for(int l=j+1; l<m; ++l){
					if(a[i][j] == 'J' and a[i][l] == 'O' and a[k][j] == 'I'){
						++ans;
					}
				}
			}
		}
	}
	cout << ans;
} 

• Subtask 1: 20 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 50