oj.uz

답안 #334259

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334259 2020-12-08T19:45:52 Z HoneyBadger Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 281 ms 160364 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>


/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
*/


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else
    #define dbg(x)
#endif

#define int long long
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }

ostream& operator << (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << ' ';
    return out;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 3010;
const double EPS = 1e-9;


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


int ci[MX][MX];
int co[MX][MX];
str t[MX];

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin >> n >> m;
    fi(0, n) {
    	cin >> t[i];
    	fj(1, m + 1) {
    		co[i][j] = co[i][j - 1] + (t[i][j - 1] == 'O');
    		ci[j - 1][i + 1] = ci[j - 1][i] + (t[i][j - 1] == 'I');
    	}
    }
    int ans = 0;
    fi(0, n) {
    	fj(0, m) {
    		if (t[i][j] == 'J') {
    			ans += (co[i][m] - co[i][j]) * (ci[j][n] - ci[j][i]);
    		}
    	}
    }
    cout << ans << '\n';
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 1388 KB Output is correct
6 Correct 1 ms 1260 KB Output is correct
7 Correct 1 ms 1388 KB Output is correct
8 Correct 1 ms 1388 KB Output is correct
9 Correct 1 ms 1260 KB Output is correct
10 Correct 1 ms 1388 KB Output is correct
11 Correct 1 ms 1388 KB Output is correct
12 Correct 1 ms 1260 KB Output is correct
13 Correct 1 ms 1388 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 1388 KB Output is correct
6 Correct 1 ms 1260 KB Output is correct
7 Correct 1 ms 1388 KB Output is correct
8 Correct 1 ms 1388 KB Output is correct
9 Correct 1 ms 1260 KB Output is correct
10 Correct 1 ms 1388 KB Output is correct
11 Correct 1 ms 1388 KB Output is correct
12 Correct 1 ms 1260 KB Output is correct
13 Correct 1 ms 1388 KB Output is correct
14 Correct 7 ms 7148 KB Output is correct
15 Correct 2 ms 2284 KB Output is correct
16 Correct 5 ms 5612 KB Output is correct
17 Correct 1 ms 1644 KB Output is correct
18 Correct 9 ms 8684 KB Output is correct
19 Correct 7 ms 8428 KB Output is correct
20 Correct 8 ms 8556 KB Output is correct
21 Correct 9 ms 8940 KB Output is correct
22 Correct 8 ms 8704 KB Output is correct
23 Correct 7 ms 8812 KB Output is correct
24 Correct 9 ms 8940 KB Output is correct
25 Correct 7 ms 8684 KB Output is correct
26 Correct 8 ms 8812 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 1388 KB Output is correct
6 Correct 1 ms 1260 KB Output is correct
7 Correct 1 ms 1388 KB Output is correct
8 Correct 1 ms 1388 KB Output is correct
9 Correct 1 ms 1260 KB Output is correct
10 Correct 1 ms 1388 KB Output is correct
11 Correct 1 ms 1388 KB Output is correct
12 Correct 1 ms 1260 KB Output is correct
13 Correct 1 ms 1388 KB Output is correct
14 Correct 7 ms 7148 KB Output is correct
15 Correct 2 ms 2284 KB Output is correct
16 Correct 5 ms 5612 KB Output is correct
17 Correct 1 ms 1644 KB Output is correct
18 Correct 9 ms 8684 KB Output is correct
19 Correct 7 ms 8428 KB Output is correct
20 Correct 8 ms 8556 KB Output is correct
21 Correct 9 ms 8940 KB Output is correct
22 Correct 8 ms 8704 KB Output is correct
23 Correct 7 ms 8812 KB Output is correct
24 Correct 9 ms 8940 KB Output is correct
25 Correct 7 ms 8684 KB Output is correct
26 Correct 8 ms 8812 KB Output is correct
27 Correct 280 ms 155288 KB Output is correct
28 Correct 8 ms 10220 KB Output is correct
29 Correct 32 ms 23020 KB Output is correct
30 Correct 8 ms 10220 KB Output is correct
31 Correct 204 ms 131052 KB Output is correct
32 Correct 217 ms 159724 KB Output is correct
33 Correct 254 ms 160108 KB Output is correct
34 Correct 244 ms 142444 KB Output is correct
35 Correct 244 ms 159724 KB Output is correct
36 Correct 245 ms 160108 KB Output is correct
37 Correct 281 ms 160364 KB Output is correct
38 Correct 165 ms 130284 KB Output is correct
39 Correct 181 ms 130540 KB Output is correct