답안 #234855

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
234855 2020-05-26T05:21:40 Z wiwiho Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
93 ms 12928 KB
//#define NDEBUG

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define pob pop_back()
#define pof pop_front()
#define F first
#define S second
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tiii tuple<int, int, int>
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) ((a) / (b) + !!((a) % (b)))

//#define TEST

typedef long long ll;
typedef unsigned long long ull;

using namespace std;
using namespace __gnu_pbds;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}


int main(){
    StarBurstStream

    int h, w;
    cin >> h >> w;

    vector<string> a(h);
    for(int i = 0; i < h; i++) cin >> a[i];

    vector<ll> cnt(w);
    ll ans = 0;
    for(int i = h - 1; i >= 0; i--){
        ll now = 0;
        for(int j = w - 1; j >= 0; j--){
            if(a[i][j] == 'O') now++;
            else if(a[i][j] == 'I') cnt[j]++;
            else ans += now * cnt[j];
        }
    }

    cout << ans << "\n";

    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 7 ms 768 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 7 ms 896 KB Output is correct
19 Correct 6 ms 896 KB Output is correct
20 Correct 5 ms 896 KB Output is correct
21 Correct 7 ms 896 KB Output is correct
22 Correct 5 ms 768 KB Output is correct
23 Correct 6 ms 896 KB Output is correct
24 Correct 7 ms 896 KB Output is correct
25 Correct 5 ms 768 KB Output is correct
26 Correct 5 ms 896 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 7 ms 768 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 7 ms 896 KB Output is correct
19 Correct 6 ms 896 KB Output is correct
20 Correct 5 ms 896 KB Output is correct
21 Correct 7 ms 896 KB Output is correct
22 Correct 5 ms 768 KB Output is correct
23 Correct 6 ms 896 KB Output is correct
24 Correct 7 ms 896 KB Output is correct
25 Correct 5 ms 768 KB Output is correct
26 Correct 5 ms 896 KB Output is correct
27 Correct 91 ms 12416 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 6 ms 1664 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 69 ms 9976 KB Output is correct
32 Correct 34 ms 12920 KB Output is correct
33 Correct 29 ms 12928 KB Output is correct
34 Correct 80 ms 10880 KB Output is correct
35 Correct 35 ms 12800 KB Output is correct
36 Correct 33 ms 12928 KB Output is correct
37 Correct 93 ms 12928 KB Output is correct
38 Correct 24 ms 9856 KB Output is correct
39 Correct 22 ms 9856 KB Output is correct