oj.uz

Submission #420071

# Submission time Handle Problem Language Result Execution time Memory
420071 2021-06-08T04:56:11 Z errorgorn Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 176 ms 160048 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,m;
string grid[3005];

ll arr[3005][3005];
ll brr[3005][3005];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n>>m;
	rep(x,0,n) cin>>grid[x];
	
	rep(x,n,0) rep(y,m,0){
		arr[x][y]=arr[x+1][y]+(grid[x][y]=='I');
	}
	
	rep(x,n,0) rep(y,m,0){
		brr[x][y]=brr[x][y+1]+(grid[x][y]=='O');
	}
	
	ll ans=0;
	rep(x,0,n) rep(y,0,m) if (grid[x][y]=='J'){
		ans+=arr[x][y]*brr[x][y];
	}
	
	cout<<ans<<endl;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 1320 KB Output is correct
6 Correct 1 ms 1316 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 1 ms 1324 KB Output is correct
9 Correct 1 ms 1356 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Correct 2 ms 1356 KB Output is correct
13 Correct 1 ms 1228 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 1320 KB Output is correct
6 Correct 1 ms 1316 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 1 ms 1324 KB Output is correct
9 Correct 1 ms 1356 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Correct 2 ms 1356 KB Output is correct
13 Correct 1 ms 1228 KB Output is correct
14 Correct 6 ms 7756 KB Output is correct
15 Correct 2 ms 3788 KB Output is correct
16 Correct 4 ms 4684 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 10 ms 8780 KB Output is correct
19 Correct 8 ms 8652 KB Output is correct
20 Correct 6 ms 8608 KB Output is correct
21 Correct 9 ms 8876 KB Output is correct
22 Correct 6 ms 8652 KB Output is correct
23 Correct 6 ms 8652 KB Output is correct
24 Correct 7 ms 8780 KB Output is correct
25 Correct 7 ms 8644 KB Output is correct
26 Correct 6 ms 8652 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 1320 KB Output is correct
6 Correct 1 ms 1316 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 1 ms 1324 KB Output is correct
9 Correct 1 ms 1356 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Correct 2 ms 1356 KB Output is correct
13 Correct 1 ms 1228 KB Output is correct
14 Correct 6 ms 7756 KB Output is correct
15 Correct 2 ms 3788 KB Output is correct
16 Correct 4 ms 4684 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 10 ms 8780 KB Output is correct
19 Correct 8 ms 8652 KB Output is correct
20 Correct 6 ms 8608 KB Output is correct
21 Correct 9 ms 8876 KB Output is correct
22 Correct 6 ms 8652 KB Output is correct
23 Correct 6 ms 8652 KB Output is correct
24 Correct 7 ms 8780 KB Output is correct
25 Correct 7 ms 8644 KB Output is correct
26 Correct 6 ms 8652 KB Output is correct
27 Correct 161 ms 158960 KB Output is correct
28 Correct 10 ms 19488 KB Output is correct
29 Correct 11 ms 13948 KB Output is correct
30 Correct 1 ms 844 KB Output is correct
31 Correct 125 ms 130716 KB Output is correct
32 Correct 132 ms 159864 KB Output is correct
33 Correct 127 ms 159428 KB Output is correct
34 Correct 163 ms 151628 KB Output is correct
35 Correct 130 ms 159856 KB Output is correct
36 Correct 127 ms 159428 KB Output is correct
37 Correct 176 ms 160048 KB Output is correct
38 Correct 114 ms 130028 KB Output is correct
39 Correct 102 ms 130148 KB Output is correct