oj.uz

답안 #546377

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
546377 2022-04-07T12:01:58 Z tmn2005 Bitaro the Brave (JOI19_ho_t1) C++17
20 / 100
 575 ms 27100 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 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[3009][3009];
multiset<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].insert(arr[i][j]); 
		}
	}
	for(int j=1; j<=m; j++){
		for(int i=1; i<=n; i++){	
			s[j].insert(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].count(2) * s[j].count(3));
			}
			else if(g[i].count(2) > 0 && arr[i][j] == 2){
				g[i].erase(g[i].find(2));
			}
			else if(s[j].count(3) > 0 && arr[i][j] == 3){
				s[j].erase(s[j].find(3));
			}
		}
	}
	cout<<res<<"\n";
}
main(){
	NeedForSpeed;
	int T = 1;
//	cin >> T;
	while(T--){
		solve();
	}
	return 0;
}

Compilation message

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

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 5 ms 1876 KB Output is correct
6 Correct 5 ms 1748 KB Output is correct
7 Correct 5 ms 1748 KB Output is correct
8 Correct 6 ms 1876 KB Output is correct
9 Correct 4 ms 1748 KB Output is correct
10 Correct 5 ms 1748 KB Output is correct
11 Correct 6 ms 1876 KB Output is correct
12 Correct 5 ms 1748 KB Output is correct
13 Correct 7 ms 1748 KB Output is correct
14 Correct 285 ms 21324 KB Output is correct
15 Correct 5 ms 2644 KB Output is correct
16 Correct 122 ms 14288 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 575 ms 27100 KB Output is correct
19 Correct 432 ms 26172 KB Output is correct
20 Incorrect 424 ms 26528 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 5 ms 1876 KB Output is correct
6 Correct 5 ms 1748 KB Output is correct
7 Correct 5 ms 1748 KB Output is correct
8 Correct 6 ms 1876 KB Output is correct
9 Correct 4 ms 1748 KB Output is correct
10 Correct 5 ms 1748 KB Output is correct
11 Correct 6 ms 1876 KB Output is correct
12 Correct 5 ms 1748 KB Output is correct
13 Correct 7 ms 1748 KB Output is correct
14 Correct 285 ms 21324 KB Output is correct
15 Correct 5 ms 2644 KB Output is correct
16 Correct 122 ms 14288 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 575 ms 27100 KB Output is correct
19 Correct 432 ms 26172 KB Output is correct
20 Incorrect 424 ms 26528 KB Output isn't correct
21 Halted 0 ms 0 KB -