oj.uz

답안 #896539

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896539 2024-01-01T16:09:04 Z Minbaev Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 355 ms 159056 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pii pair<int,int>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define f first
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const int mod= 1e9 +7;
const int N=1e5*4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}

void solve(){
	int n,m,k,q;
	
	cin>>n>>m;
	
	char arr[n+1][m+1];
	
	for(int i = 1;i<=n;i++){
		for(int j = 1;j<=m;j++){
			cin>>arr[i][j];
		}
	}
	
	int pref[n+2][m+2];
	int suff[n+2][m+2];
	
	memset(pref,0ll,sizeof(pref));
	memset(suff,0ll,sizeof(suff));
	
	for(int i = 1;i<=n;i++){
		for(int j = m;j>=1;j--){
			pref[i][j] = pref[i][j+1];
			if(arr[i][j]=='O')pref[i][j]++;
		}
	}
	
	for(int j = 1;j<=m;j++){
		for(int i = n;i>=1;i--){
			suff[i][j] = suff[i+1][j];
			if(arr[i][j]=='I')suff[i][j]++;
		}
	}
	
	int ans = 0;
	
	for(int i = 1;i<=n;i++){
		for(int j = 1;j<=m;j++){
			if(arr[i][j]=='J')	
				ans += (pref[i][j]*suff[i][j]);
		}
	}
	
	cout<<ans<<"\n";
		
	
}

 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();

}

Compilation message

joi2019_ho_t1.cpp: In function 'void solve()':
joi2019_ho_t1.cpp:33:10: warning: unused variable 'k' [-Wunused-variable]
   33 |  int n,m,k,q;
      |          ^
joi2019_ho_t1.cpp:33:12: warning: unused variable 'q' [-Wunused-variable]
   33 |  int n,m,k,q;
      |            ^

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 6 ms 3640 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 2652 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 8 ms 4696 KB Output is correct
19 Correct 6 ms 4952 KB Output is correct
20 Correct 6 ms 4564 KB Output is correct
21 Correct 8 ms 4792 KB Output is correct
22 Correct 6 ms 4696 KB Output is correct
23 Correct 6 ms 4648 KB Output is correct
24 Correct 7 ms 4696 KB Output is correct
25 Correct 6 ms 4696 KB Output is correct
26 Correct 6 ms 4696 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 6 ms 3640 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 2652 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 8 ms 4696 KB Output is correct
19 Correct 6 ms 4952 KB Output is correct
20 Correct 6 ms 4564 KB Output is correct
21 Correct 8 ms 4792 KB Output is correct
22 Correct 6 ms 4696 KB Output is correct
23 Correct 6 ms 4648 KB Output is correct
24 Correct 7 ms 4696 KB Output is correct
25 Correct 6 ms 4696 KB Output is correct
26 Correct 6 ms 4696 KB Output is correct
27 Correct 318 ms 150056 KB Output is correct
28 Correct 1 ms 860 KB Output is correct
29 Correct 15 ms 11956 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 221 ms 110604 KB Output is correct
32 Correct 313 ms 158064 KB Output is correct
33 Correct 308 ms 158584 KB Output is correct
34 Correct 258 ms 128084 KB Output is correct
35 Correct 305 ms 158028 KB Output is correct
36 Correct 303 ms 158580 KB Output is correct
37 Correct 355 ms 159056 KB Output is correct
38 Correct 191 ms 109648 KB Output is correct
39 Correct 199 ms 110064 KB Output is correct