oj.uz

답안 #546419

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
546419 2022-04-07T13:38:45 Z tmn2005 Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 486 ms 81256 KB 
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>

using namespace __gnu_pbds;
using namespace std;
typedef long long ll;

#define fr first
#define sc second

#define mk make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front

#define int long long
#define pii pair<int,int>
#define piii pair<int,pii>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0), cin.tie(0)
#define ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
const int N = 3009;
int n, m, k, a, b, c, d, arr[N][N];
map<int, int>g[N], s[N];

void solve(){
	cin>>n>>m;
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			char ch;
			cin>>ch;
			if(ch == 'J')arr[i][j] = 1;
			if(ch == 'O')arr[i][j] = 2;
			if(ch == 'I')arr[i][j] = 3;
		}
	}
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			g[i][arr[i][j]]++; 
			s[j][arr[i][j]]++; 
		}
	}
	int res = 0;
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			if(arr[i][j] == 1){
				res += (g[i][2] * s[j][3]);
			}
			else if(g[i][2] > 0 && arr[i][j] == 2){
				g[i][2]--;
			}
			else if(s[j][3] > 0 && arr[i][j] == 3){
				s[j][3]--;
			}
		}
	}
	cout<<res<<"\n";
}
main(){
	NeedForSpeed;
	int T = 1;
//	cin >> T;
	while(T--){
		solve();
	}
	return 0;
}

Compilation message

joi2019_ho_t1.cpp:64:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   64 | main(){
      | ^~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 612 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 2 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1000 KB Output is correct
14 Correct 14 ms 4436 KB Output is correct
15 Correct 2 ms 2388 KB Output is correct
16 Correct 7 ms 2900 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 15 ms 4948 KB Output is correct
19 Correct 12 ms 4848 KB Output is correct
20 Correct 9 ms 4820 KB Output is correct
21 Correct 17 ms 4984 KB Output is correct
22 Correct 13 ms 4820 KB Output is correct
23 Correct 9 ms 4848 KB Output is correct
24 Correct 16 ms 4948 KB Output is correct
25 Correct 11 ms 4900 KB Output is correct
26 Correct 9 ms 4848 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 612 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 2 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1000 KB Output is correct
14 Correct 14 ms 4436 KB Output is correct
15 Correct 2 ms 2388 KB Output is correct
16 Correct 7 ms 2900 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 15 ms 4948 KB Output is correct
19 Correct 12 ms 4848 KB Output is correct
20 Correct 9 ms 4820 KB Output is correct
21 Correct 17 ms 4984 KB Output is correct
22 Correct 13 ms 4820 KB Output is correct
23 Correct 9 ms 4848 KB Output is correct
24 Correct 16 ms 4948 KB Output is correct
25 Correct 11 ms 4900 KB Output is correct
26 Correct 9 ms 4848 KB Output is correct
27 Correct 461 ms 80604 KB Output is correct
28 Correct 6 ms 10452 KB Output is correct
29 Correct 25 ms 7776 KB Output is correct
30 Correct 3 ms 1236 KB Output is correct
31 Correct 339 ms 66612 KB Output is correct
32 Correct 391 ms 81068 KB Output is correct
33 Correct 257 ms 80756 KB Output is correct
34 Correct 414 ms 76968 KB Output is correct
35 Correct 404 ms 81256 KB Output is correct
36 Correct 257 ms 80712 KB Output is correct
37 Correct 486 ms 81116 KB Output is correct
38 Correct 234 ms 66120 KB Output is correct
39 Correct 197 ms 66028 KB Output is correct