oj.uz

Submission #109450

# Submission time Handle Problem Language Result Execution time Memory
109450 2019-05-06T15:24:53 Z wasyl Bitaro the Brave (JOI19_ho_t1) C++11
100 / 100
 89 ms 9124 KB 
    #pragma GCC optimize("O3")
    /*{{{*/
    #include <bits/stdc++.h>
    #ifdef LOCAL
    int c_ = 0;
    #define cout (c_?cerr:cout)
    #define debug(...) \
    {if(!c_++)cerr<<"\033[96;1m"; \
    __VA_ARGS__; \
    if(!--c_)cerr<<"\033[0m";}
    #else
    #define debug(...) {}
    #endif
    #define assrt(...) debug(\
    if (not (__VA_ARGS__)) \
        exit((cerr << __LINE__ << ": " << #__VA_ARGS__ << '\n', 0));\
    )
    #define st first
    #define nd second
    #define all(...) (__VA_ARGS__).begin(), (__VA_ARGS__).end()
    using namespace std; using ll = long long;
    template < typename t > using V = vector< t >;
    template < typename t, size_t s > using A = array< t, s >;
    void print() {cout << '\n';}
    template< typename t, typename... v >
    void print(const t& a, const v&... b)
    {cout << a << (sizeof...(b)?" ":""); print(b...);}
    template< typename t > void print_range(t a, const t& b)
    { while (a != b) cout << (*a++) << ' '; cout << '\n';}
    #define dump(...) debug(print(#__VA_ARGS__,'=',__VA_ARGS__))
    #define dump_range(...) debug(cerr<<#__VA_ARGS__ << ": "; print_range(__VA_ARGS__))
    /*}}}*/
     
    constexpr int hax = 3e3, wax = hax;
     
    int h, w, tab[wax + 1];
     
    int32_t main()
    {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
     
        cin >> h >> w;
     
        ll res = 0;
        for (int i = 0; i < h; ++i)
        {
            string s; cin >> s;
            int c = 0;
            for (int j = w - 1; j >= 0; --j)
            {
                if (s[j] == 'J')
                    tab[j] += c;
                if (s[j] == 'O')
                    ++c;
                if (s[j] == 'I')
                    res += tab[j];
            }
        }
     
        print(res);
    }

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 4 ms 512 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 5 ms 640 KB Output is correct
19 Correct 4 ms 512 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 4 ms 640 KB Output is correct
24 Correct 5 ms 640 KB Output is correct
25 Correct 3 ms 640 KB Output is correct
26 Correct 4 ms 640 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 4 ms 512 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 5 ms 640 KB Output is correct
19 Correct 4 ms 512 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 4 ms 640 KB Output is correct
24 Correct 5 ms 640 KB Output is correct
25 Correct 3 ms 640 KB Output is correct
26 Correct 4 ms 640 KB Output is correct
27 Correct 73 ms 8580 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 5 ms 1024 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 57 ms 6392 KB Output is correct
32 Correct 34 ms 9080 KB Output is correct
33 Correct 29 ms 9080 KB Output is correct
34 Correct 73 ms 7416 KB Output is correct
35 Correct 38 ms 8992 KB Output is correct
36 Correct 40 ms 9124 KB Output is correct
37 Correct 89 ms 9080 KB Output is correct
38 Correct 27 ms 6396 KB Output is correct
39 Correct 22 ms 6400 KB Output is correct