oj.uz

Submission #768435

# Submission time Handle Problem Language Result Execution time Memory
768435 2023-06-28T07:14:24 Z singlabharat Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 83 ms 19068 KB 
// OM SHRI GANESHAY NAMAH
// HARE KRISHNA

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
using vi = vector<int>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
using si = set<int>;
using mii = map<int, int>;
template<typename T> using pbds = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define sz(x) (int)size(x)
#define pb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define fr first
#define sc second
#define fo(i, end) for (int i = 0; i < end; i++)
#define foo(i, start, end) for (int i = start; i < end; i++)
template<typename T> inline void domin(T &x, T y) {if (y < x) x = y;}
template<typename T> inline void domax(T &x, T y) {if (y > x) x = y;}
template<typename T, typename U> ostream& operator<<(ostream &os, const pair<T, U> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template < typename T_container, typename T = typename enable_if < !is_same<T_container, string>::value, typename T_container::value_type >::type > ostream & operator<<(ostream &os, const T_container &a) { os << '{'; string sep; for (const T &x : a) os << sep << x, sep = ", "; return os << '}';}
void debug() {cerr << endl;}
template <typename Head, typename... Tail> void debug(Head h, Tail... t) {cerr << h << ' '; debug(t...);}
#ifdef singlabharat
#define debug(...) cerr << "(" << #__VA_ARGS__ << ") : ", debug(__VA_ARGS__)
#else
#define debug(...)
#endif
#define endl '\n'
const int MX = 2e5 + 2, MOD = 1e9 + 7, INF = 1e18;

void solve() {
	int n, m;
	cin >> n >> m;
	vs a(n);
	vi row(n), col(m);
	fo(i, n) {
		cin >> a[i];
		for (char c : a[i]) row[i] += (c == 'O');
	}
	fo(j, m) fo(i, n) col[j] += (a[i][j] == 'I');
	int ans = 0;
	fo(i, n) {
		fo(j, m) {
			ans += (a[i][j] == 'J') * (row[i] * col[j]);
			row[i] -= (a[i][j] == 'O');
			col[j] -= (a[i][j] == 'I');
		}
	}
	cout << ans;
}

int32_t main() {

#ifdef singlabharat
	freopen("error.txt", "w", stderr);
#endif

	cin.tie(0)->sync_with_stdio(0);

	int t = 1;
	// cin >> t;

	for (int tc = 1; tc <= t; tc++) {
		// cout << "Case #" << tc << ": ";
		solve();
	}
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 720 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 584 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 2 ms 840 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 3 ms 716 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 716 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 720 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 584 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 2 ms 840 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 3 ms 716 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 716 KB Output is correct
27 Correct 59 ms 17884 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 4 ms 1584 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 39 ms 13084 KB Output is correct
32 Correct 66 ms 18824 KB Output is correct
33 Correct 65 ms 18904 KB Output is correct
34 Correct 58 ms 15248 KB Output is correct
35 Correct 83 ms 18820 KB Output is correct
36 Correct 75 ms 18864 KB Output is correct
37 Correct 68 ms 19068 KB Output is correct
38 Correct 35 ms 13096 KB Output is correct
39 Correct 37 ms 13060 KB Output is correct