oj.uz

Submission #544470

# Submission time Handle Problem Language Result Execution time Memory
544470 2022-04-02T04:17:29 Z armashka Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 284 ms 18044 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
    
const int N = 1e6 + 10;
const int M = 1e3 + 5;
const ll inf = 1e9;
const ll mod = 1e9 + 7;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }                                   
bool even(ll n) { return (n % 2 == 0); }

ll n, m, cnt1[3005], cnt2[3005];
char c[3005][3005];

const void solve(/*Armashka*/) {
    cin >> n >> m;
    for (int i = 1; i <= n; ++ i) {
        for (int j = 1; j <= m; ++ j) {
            cin >> c[i][j];
            if (c[i][j] == 'O') ++ cnt1[i];
            if (c[i][j] == 'I') ++ cnt2[j];
        }
    }
    ll ans = 0;
    for (int i = 1; i <= n; ++ i) {
        for (int j = 1; j <= m; ++ j) {
            if (c[i][j] == 'J') ans += (cnt1[i] * cnt2[j]);
            else if (c[i][j] == 'O') -- cnt1[i];
            else -- cnt2[j];
        }
    }
    cout << ans;
}
 
signed main() {
    srand(time(NULL));
    fast;
    // file("");
    int tt = 1;
    // cin >> tt;
    while (tt --) {
        solve();
    }                            
}
// Jelbiretip kok tudy, boys in the hood
// Kim qandai juz, kimde qandai ru

Compilation message

joi2019_ho_t1.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 608 KB Output is correct
6 Correct 1 ms 608 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 608 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 1 ms 608 KB Output is correct
11 Correct 1 ms 608 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 604 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 608 KB Output is correct
6 Correct 1 ms 608 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 608 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 1 ms 608 KB Output is correct
11 Correct 1 ms 608 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 7 ms 2016 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 3 ms 1108 KB Output is correct
17 Correct 1 ms 352 KB Output is correct
18 Correct 10 ms 2008 KB Output is correct
19 Correct 6 ms 2020 KB Output is correct
20 Correct 5 ms 2016 KB Output is correct
21 Correct 8 ms 2016 KB Output is correct
22 Correct 5 ms 2024 KB Output is correct
23 Correct 4 ms 2004 KB Output is correct
24 Correct 9 ms 1984 KB Output is correct
25 Correct 6 ms 2004 KB Output is correct
26 Correct 5 ms 2004 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 608 KB Output is correct
6 Correct 1 ms 608 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 608 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 1 ms 608 KB Output is correct
11 Correct 1 ms 608 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 7 ms 2016 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 3 ms 1108 KB Output is correct
17 Correct 1 ms 352 KB Output is correct
18 Correct 10 ms 2008 KB Output is correct
19 Correct 6 ms 2020 KB Output is correct
20 Correct 5 ms 2016 KB Output is correct
21 Correct 8 ms 2016 KB Output is correct
22 Correct 5 ms 2024 KB Output is correct
23 Correct 4 ms 2004 KB Output is correct
24 Correct 9 ms 1984 KB Output is correct
25 Correct 6 ms 2004 KB Output is correct
26 Correct 5 ms 2004 KB Output is correct
27 Correct 252 ms 17484 KB Output is correct
28 Correct 3 ms 7124 KB Output is correct
29 Correct 11 ms 1756 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 192 ms 13904 KB Output is correct
32 Correct 208 ms 18036 KB Output is correct
33 Correct 139 ms 17852 KB Output is correct
34 Correct 228 ms 15916 KB Output is correct
35 Correct 177 ms 18044 KB Output is correct
36 Correct 132 ms 17880 KB Output is correct
37 Correct 284 ms 18004 KB Output is correct
38 Correct 111 ms 13704 KB Output is correct
39 Correct 92 ms 13888 KB Output is correct