oj.uz

Submission #367979

# Submission time Handle Problem Language Result Execution time Memory
367979 2021-02-19T05:44:46 Z Return_0 Bitaro the Brave (JOI19_ho_t1) C++17
20 / 100
 12 ms 8044 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< x << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 3e3 + 7;

char c [N][N];
ll ps1 [N][N], ps2 [N][N], n, m, ans;

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> m;
	for (ll i = 1; i <= n; i++) for (ll j = 1; j <= m; j++)	cin>> c[i][j];

	for (ll i = 1; i <= n; i++) for (ll j = m; j; j--)	ps1[i][j] = ps1[i][j + 1] + (c[i][j] == 'O');
	for (ll j = 1; j <= m; j++) for (ll i = n; i; i--)	ps2[i][j] = ps2[i + 1][j] + (c[i][j] == 'I');
	for (ll i = 1; i <= n; i++) for (ll j = 1; j <= m; j++)	if (c[i][j] == 'J') ans += ps1[i][j] * ps2[i][j];

	kill(ans);

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
3 4
JOIJ
JIOO
IIII

4 4
JJOO
JJOO
IIJO
IIIJ

*/

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 1536 KB Output is correct
6 Correct 1 ms 1516 KB Output is correct
7 Correct 1 ms 1388 KB Output is correct
8 Correct 2 ms 1516 KB Output is correct
9 Correct 1 ms 1516 KB Output is correct
10 Correct 1 ms 1408 KB Output is correct
11 Correct 2 ms 1516 KB Output is correct
12 Correct 2 ms 1536 KB Output is correct
13 Correct 2 ms 1516 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 1536 KB Output is correct
6 Correct 1 ms 1516 KB Output is correct
7 Correct 1 ms 1388 KB Output is correct
8 Correct 2 ms 1516 KB Output is correct
9 Correct 1 ms 1516 KB Output is correct
10 Correct 1 ms 1408 KB Output is correct
11 Correct 2 ms 1516 KB Output is correct
12 Correct 2 ms 1536 KB Output is correct
13 Correct 2 ms 1516 KB Output is correct
14 Correct 9 ms 7532 KB Output is correct
15 Correct 4 ms 4972 KB Output is correct
16 Correct 5 ms 4332 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 10 ms 8044 KB Output is correct
19 Correct 12 ms 7916 KB Output is correct
20 Incorrect 9 ms 7916 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 1536 KB Output is correct
6 Correct 1 ms 1516 KB Output is correct
7 Correct 1 ms 1388 KB Output is correct
8 Correct 2 ms 1516 KB Output is correct
9 Correct 1 ms 1516 KB Output is correct
10 Correct 1 ms 1408 KB Output is correct
11 Correct 2 ms 1516 KB Output is correct
12 Correct 2 ms 1536 KB Output is correct
13 Correct 2 ms 1516 KB Output is correct
14 Correct 9 ms 7532 KB Output is correct
15 Correct 4 ms 4972 KB Output is correct
16 Correct 5 ms 4332 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 10 ms 8044 KB Output is correct
19 Correct 12 ms 7916 KB Output is correct
20 Incorrect 9 ms 7916 KB Output isn't correct
21 Halted 0 ms 0 KB -