oj.uz

답안 #818683

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
818683 2023-08-10T06:19:08 Z vjudge1 Bitaro the Brave (JOI19_ho_t1) C++17
50 / 100
 1000 ms 9428 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define el cout<<endl;
#define fr(n,m) for(int i=n;i<m;i++)
#define frj(n,m) for(int j=n;j<m;j++)
#define frl(n,m) for(int l=n;l<m;l++)
#define frd(n,m) for(int d=n;d<m;d++)
#define mii map<int,int>
#define mci map<char,int>
#define vi vector<int>
#define vc vector<char>
const int mod = 1e9 + 7;
// const int mod=998
int i = 0, j = 0, k = 0, l = 0, h = 0, w = 0, a = 0, b = 0, c = 0, d = 0;
int num = 0, ans = 0, sum = 0;
const int N = 1e3 + 5;
void solve() {
	cin >> h >> w;
	vector<string>v(h);
	fr(0, h) {
		cin >> v[i];
	}
	fr(0, h) {
		frj(0, w) {
			// cout << v[i][j] << " ";
			if (v[i][j] == 'J') {
				a = 0; b = 0;
				frl(j + 1, w) {
					if (v[i][l] == 'O') {
						a++;
					}
				}
				frl(i + 1, h) {
					if (v[l][j] == 'I') {
						b++;
					}
				}
				// cout << a << " " << b; el;
				ans += a * b;
			}
		}
		// el;
	}
	cout << ans;
}
signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int T = 1;
	// cin >> T;
	while (T--) {
		cout << fixed << setprecision(12); solve();
		el;
	} return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 82 ms 512 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 14 ms 464 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 111 ms 576 KB Output is correct
19 Correct 10 ms 468 KB Output is correct
20 Correct 42 ms 468 KB Output is correct
21 Correct 116 ms 596 KB Output is correct
22 Correct 37 ms 560 KB Output is correct
23 Correct 51 ms 468 KB Output is correct
24 Correct 101 ms 588 KB Output is correct
25 Correct 10 ms 468 KB Output is correct
26 Correct 48 ms 568 KB Output is correct

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 82 ms 512 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 14 ms 464 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 111 ms 576 KB Output is correct
19 Correct 10 ms 468 KB Output is correct
20 Correct 42 ms 468 KB Output is correct
21 Correct 116 ms 596 KB Output is correct
22 Correct 37 ms 560 KB Output is correct
23 Correct 51 ms 468 KB Output is correct
24 Correct 101 ms 588 KB Output is correct
25 Correct 10 ms 468 KB Output is correct
26 Correct 48 ms 568 KB Output is correct
27 Execution timed out 1062 ms 9428 KB Time limit exceeded
28 Halted 0 ms 0 KB -