oj.uz

Submission #924641

# Submission time Handle Problem Language Result Execution time Memory
924641 2024-02-09T11:00:31 Z Baizho Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 158 ms 91220 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
 #pragma GCC optimize("Ofast,unroll-loops,fast-math")
 #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(3e3)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
 
int n, m, c1[N][N], c2[N][N];
char a[N][N];

void Baizho() {
	cin>>n>>m;
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= m; j ++) {
			cin>>a[i][j];
		}
	}
	for(int i = 1; i <= n; i ++) {
		for(int j = m; j >= 1; j --) {
			c1[i][j] = c1[i][j + 1] + (a[i][j] == 'O');
		}
	}
	for(int j = 1; j <= m; j ++) {
		for(int i = n; i >= 1; i --) {
			c2[i][j] = c2[i + 1][j] + (a[i][j] == 'I');
		}
	}
	long long ans = 0;
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= m; j ++) {
			if(a[i][j] == 'J') ans += 1LL * c1[i][j] * c2[i][j];
		}
	}
	cout<<ans;
	
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

joi2019_ho_t1.cpp: In function 'void Freopen(std::string)':
joi2019_ho_t1.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 5212 KB Output is correct
6 Correct 1 ms 5208 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 5208 KB Output is correct
9 Correct 1 ms 5224 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 5212 KB Output is correct
12 Correct 1 ms 5076 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 5212 KB Output is correct
6 Correct 1 ms 5208 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 5208 KB Output is correct
9 Correct 1 ms 5224 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 5212 KB Output is correct
12 Correct 1 ms 5076 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 5 ms 12124 KB Output is correct
15 Correct 2 ms 9052 KB Output is correct
16 Correct 3 ms 8284 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 6 ms 12376 KB Output is correct
19 Correct 5 ms 12376 KB Output is correct
20 Correct 6 ms 12192 KB Output is correct
21 Correct 7 ms 12380 KB Output is correct
22 Correct 6 ms 12400 KB Output is correct
23 Correct 5 ms 12380 KB Output is correct
24 Correct 6 ms 12376 KB Output is correct
25 Correct 5 ms 12380 KB Output is correct
26 Correct 6 ms 12376 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 5212 KB Output is correct
6 Correct 1 ms 5208 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 5208 KB Output is correct
9 Correct 1 ms 5224 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 5212 KB Output is correct
12 Correct 1 ms 5076 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 5 ms 12124 KB Output is correct
15 Correct 2 ms 9052 KB Output is correct
16 Correct 3 ms 8284 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 6 ms 12376 KB Output is correct
19 Correct 5 ms 12376 KB Output is correct
20 Correct 6 ms 12192 KB Output is correct
21 Correct 7 ms 12380 KB Output is correct
22 Correct 6 ms 12400 KB Output is correct
23 Correct 5 ms 12380 KB Output is correct
24 Correct 6 ms 12376 KB Output is correct
25 Correct 5 ms 12380 KB Output is correct
26 Correct 6 ms 12376 KB Output is correct
27 Correct 147 ms 90724 KB Output is correct
28 Correct 9 ms 46940 KB Output is correct
29 Correct 9 ms 10588 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 109 ms 76404 KB Output is correct
32 Correct 139 ms 91164 KB Output is correct
33 Correct 141 ms 90960 KB Output is correct
34 Correct 129 ms 87124 KB Output is correct
35 Correct 129 ms 91220 KB Output is correct
36 Correct 129 ms 90960 KB Output is correct
37 Correct 158 ms 91220 KB Output is correct
38 Correct 91 ms 76520 KB Output is correct
39 Correct 101 ms 76368 KB Output is correct