oj.uz

답안 #243722

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
243722 2020-07-01T16:11:24 Z xiryss Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 210 ms 23928 KB 
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
/*#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")*/
//#pragma comment(linker, "/STACK:367077216")
#define _CRT_SECURE_NO_WARNINGS
#include <chrono>
#include <set>
#include <map>
#include <deque>
#include <string>
#include <cstdint>
#include <cmath>
#include <queue>
#include <cassert>
#include <random>
#include <bitset>
#include <iomanip>
#include <numeric>
#include <time.h>//////////////
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
//#define endl '\n'
#define mp make_pair
#define pbc push_back
#define pob pop_back()
#define empb emplace_back
#define queuel queue<long long>
#define sqr(a) ((a) * (a))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pin(p) cin >> p.first >> p.second;
#define uniq(a) sort(all(a));(a).resize(unique(all(a)) - a.begin());
#define rev(v) reverse(v.begin(), v.end());
#define sout(s, c) for (auto i : s) cout << i << c;
#define pout(p) cout << p.first << " " << p.second;
#define er(v, l, r) erase(v.begin() + l, v.begin() + r);
#define vin(v) for (ll i = 0; i < v.size(); ++i) cin >> v[i];
#define vout(v, c) for (int i = 0; i < v.size(); ++i) cout << v[i] << c;
#define pushi(v, a) for (int i = 0; i < a.size(); ++i) v.push_back(a[i]);
#define fastio() ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); srand(time(NULL))
#define dab(v) for(auto i:v)cout<<i<<' ';
#define sp system("pause")
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
using namespace std;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
mt19937 rnd(time(0) + 228 + 'k' + 'e' + 'k' + 'e' + 'r' + 'o' + 'f' + 'e' + 'y');
const ld EPS = 1e-10;
bool checkprime(int x)
{
	for (int i = 2; i * i <= x; ++i) if (x % i == 0) return 0;
	return 1;
}
const ld PI = acos(-1);
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
int mod = MOD7;
const int inf = 1e9;
int h, w;
const int MAXN = 5e3 + 1;
char a[MAXN][MAXN];
signed main()
{
	fastio();
	cin >> h >> w;
	for (int i = 0; i < h; ++i)
	{
		for (int j = 0; j < w; ++j)
		{
			cin >> a[i][j];
		}
	}
	ll ans = 0;
	vector<int> ci(h), co(h), ri(w), ro(w);
	for (int i = h-1; i >=0;--i)
	{
		for (int j = w-1; j >=0 ;-- j)
		{
			if (a[i][j] == 'I')
			{
				ci[i] ++;
				ri[j]++;
			}
			else if (a[i][j] == 'O')
			{
				ro[j] ++;
				co[i] ++;
			}
			else
			{
				ans += co[i] * ri[j];
			}
		}
	}
	cout << ans;
	//sp;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 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 6 ms 768 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 5 ms 768 KB Output is correct
11 Correct 5 ms 768 KB Output is correct
12 Correct 5 ms 768 KB Output is correct
13 Correct 6 ms 768 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 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 6 ms 768 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 5 ms 768 KB Output is correct
11 Correct 5 ms 768 KB Output is correct
12 Correct 5 ms 768 KB Output is correct
13 Correct 6 ms 768 KB Output is correct
14 Correct 10 ms 2688 KB Output is correct
15 Correct 6 ms 2048 KB Output is correct
16 Correct 7 ms 1664 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 11 ms 2816 KB Output is correct
19 Correct 11 ms 2816 KB Output is correct
20 Correct 9 ms 2816 KB Output is correct
21 Correct 11 ms 2816 KB Output is correct
22 Correct 9 ms 2816 KB Output is correct
23 Correct 9 ms 2816 KB Output is correct
24 Correct 11 ms 2816 KB Output is correct
25 Correct 10 ms 2816 KB Output is correct
26 Correct 10 ms 2816 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 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 6 ms 768 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 5 ms 768 KB Output is correct
11 Correct 5 ms 768 KB Output is correct
12 Correct 5 ms 768 KB Output is correct
13 Correct 6 ms 768 KB Output is correct
14 Correct 10 ms 2688 KB Output is correct
15 Correct 6 ms 2048 KB Output is correct
16 Correct 7 ms 1664 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 11 ms 2816 KB Output is correct
19 Correct 11 ms 2816 KB Output is correct
20 Correct 9 ms 2816 KB Output is correct
21 Correct 11 ms 2816 KB Output is correct
22 Correct 9 ms 2816 KB Output is correct
23 Correct 9 ms 2816 KB Output is correct
24 Correct 11 ms 2816 KB Output is correct
25 Correct 10 ms 2816 KB Output is correct
26 Correct 10 ms 2816 KB Output is correct
27 Correct 210 ms 23520 KB Output is correct
28 Correct 11 ms 9728 KB Output is correct
29 Correct 19 ms 2432 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 157 ms 18680 KB Output is correct
32 Correct 170 ms 23928 KB Output is correct
33 Correct 153 ms 23800 KB Output is correct
34 Correct 167 ms 21624 KB Output is correct
35 Correct 155 ms 23800 KB Output is correct
36 Correct 165 ms 23804 KB Output is correct
37 Correct 189 ms 23928 KB Output is correct
38 Correct 112 ms 18680 KB Output is correct
39 Correct 103 ms 18680 KB Output is correct