oj.uz

Submission #235067

# Submission time Handle Problem Language Result Execution time Memory
235067 2020-05-26T21:57:52 Z AmineWeslati Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 463 ms 158968 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0};

int32_t main(){
   boost;
	int R,C; cin>>R>>C;
	char g[R][C];
	int a[R][C], b[R][C];
	for(int i=0; i<R; i++) for(int j=0; j<C; j++){
      cin>>g[i][j];
      a[i][j]=b[i][j]=0;
	}

	for(int i=0; i<R; i++){
      if(g[i][C-1]=='O') a[i][C-1]=1;
      for(int j=C-2; j>=0; j--){
         a[i][j]+=a[i][j+1];
         if(g[i][j]=='O') a[i][j]++;
      }
	}

	for(int j=0; j<C; j++){
      if(g[R-1][j]=='I') b[R-1][j]=1;
      for(int i=R-2; i>=0; i--){
         b[i][j]+=b[i+1][j];
         if(g[i][j]=='I') b[i][j]++;
      }
	}
	int ans=0;
	for(int i=0; i<R; i++)for(int j=0; j<C; j++) if(g[i][j]=='J') ans+=a[i][j]*b[i][j];
	cout << ans << endl;

   return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 5 ms 512 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 12 ms 3736 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 8 ms 2560 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 14 ms 4736 KB Output is correct
19 Correct 11 ms 4608 KB Output is correct
20 Correct 12 ms 4608 KB Output is correct
21 Correct 14 ms 4736 KB Output is correct
22 Correct 12 ms 4608 KB Output is correct
23 Correct 11 ms 4608 KB Output is correct
24 Correct 14 ms 4736 KB Output is correct
25 Correct 11 ms 4608 KB Output is correct
26 Correct 12 ms 4632 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 12 ms 3736 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 8 ms 2560 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 14 ms 4736 KB Output is correct
19 Correct 11 ms 4608 KB Output is correct
20 Correct 12 ms 4608 KB Output is correct
21 Correct 14 ms 4736 KB Output is correct
22 Correct 12 ms 4608 KB Output is correct
23 Correct 11 ms 4608 KB Output is correct
24 Correct 14 ms 4736 KB Output is correct
25 Correct 11 ms 4608 KB Output is correct
26 Correct 12 ms 4632 KB Output is correct
27 Correct 406 ms 150008 KB Output is correct
28 Correct 5 ms 768 KB Output is correct
29 Correct 23 ms 11776 KB Output is correct
30 Correct 5 ms 768 KB Output is correct
31 Correct 294 ms 110328 KB Output is correct
32 Correct 384 ms 157816 KB Output is correct
33 Correct 399 ms 158456 KB Output is correct
34 Correct 342 ms 128120 KB Output is correct
35 Correct 399 ms 157796 KB Output is correct
36 Correct 394 ms 158456 KB Output is correct
37 Correct 463 ms 158968 KB Output is correct
38 Correct 276 ms 109808 KB Output is correct
39 Correct 265 ms 109944 KB Output is correct