oj.uz

Submission #758977

# Submission time Handle Problem Language Result Execution time Memory
758977 2023-06-15T16:07:34 Z bachhoangxuan Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 348 ms 212032 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=650;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,m;cin >> n >> m;
    vector<vector<int>> O(n,vector<int>(m,0)),I(n,vector<int>(m,0)),J(n,vector<int>(m,0));
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            char c;cin >> c;
            if(c=='O') O[i][j]=1;
            else if(c=='I') I[i][j]=1;
            else J[i][j]=1;
        }
    }
    for(int i=0;i<n;i++){
        for(int j=m-2;j>=0;j--) O[i][j]+=O[i][j+1];
    }
    for(int i=0;i<m;i++){
        for(int j=n-2;j>=0;j--) I[j][i]+=I[j+1][i];
    }
    int ans=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++) ans+=J[i][j]*O[i][j]*I[i][j];
    }
    cout << ans << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 7 ms 4820 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 5 ms 3284 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 8 ms 6228 KB Output is correct
19 Correct 7 ms 5972 KB Output is correct
20 Correct 7 ms 6100 KB Output is correct
21 Correct 8 ms 6228 KB Output is correct
22 Correct 6 ms 5972 KB Output is correct
23 Correct 6 ms 6100 KB Output is correct
24 Correct 8 ms 6228 KB Output is correct
25 Correct 7 ms 5972 KB Output is correct
26 Correct 6 ms 6100 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 7 ms 4820 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 5 ms 3284 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 8 ms 6228 KB Output is correct
19 Correct 7 ms 5972 KB Output is correct
20 Correct 7 ms 6100 KB Output is correct
21 Correct 8 ms 6228 KB Output is correct
22 Correct 6 ms 5972 KB Output is correct
23 Correct 6 ms 6100 KB Output is correct
24 Correct 8 ms 6228 KB Output is correct
25 Correct 7 ms 5972 KB Output is correct
26 Correct 6 ms 6100 KB Output is correct
27 Correct 329 ms 200192 KB Output is correct
28 Correct 1 ms 1108 KB Output is correct
29 Correct 19 ms 15576 KB Output is correct
30 Correct 1 ms 852 KB Output is correct
31 Correct 232 ms 147320 KB Output is correct
32 Correct 282 ms 210620 KB Output is correct
33 Correct 295 ms 211320 KB Output is correct
34 Correct 272 ms 170916 KB Output is correct
35 Correct 283 ms 210532 KB Output is correct
36 Correct 273 ms 211380 KB Output is correct
37 Correct 348 ms 212032 KB Output is correct
38 Correct 198 ms 146208 KB Output is correct
39 Correct 174 ms 146772 KB Output is correct