oj.uz

Submission #379171

# Submission time Handle Problem Language Result Execution time Memory
379171 2021-03-17T12:19:36 Z hackermub Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 247 ms 89324 KB 
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int,int>
#define float long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define uid uniform_int_distribution<int>
#define forn(i,st,n,inc) for(int i=st;i<n;i+=inc)
#define rforn(i,st,n,inc) for(int i=st-1;i>=n;i-=inc)
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7;//998244353;
const int64_t INF = 1e18;

ostream& operator<<(ostream& o,const string& s){
    for(auto c:s) o<<c;
    return o;
}

template<typename F,typename S>
ostream& operator<<(ostream& o,const pair<F,S>& p){
    o<<"["<<p.fi<<","<<p.se<<"]";
    return o;
}

template<typename... T,template<class...> class C>
ostream& operator<<(ostream& o,const C<T...>& v){
    o<<"[";
    int tot=0;
    for(auto x:v){ 
        o<<x;
        if(tot<v.size()-1) o<<",";
        tot++;
    }
    o<<"]";
    return o;
}

vector<string> vec_splitter(string s) {
    s += ',';
    vector<string> res;
    while(!s.empty()) {
        res.push_back(s.substr(0, s.find(',')));
        s = s.substr(s.find(',') + 1);
    }
    return res;
}
void debug_out(
vector<string> __attribute__ ((unused)) args,
__attribute__ ((unused)) int idx, 
__attribute__ ((unused)) int LINE_NUM) { cerr << endl; } 
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
    if(idx > 0) cerr << ", "; else cerr << "Line(" << LINE_NUM << ") ";
    stringstream ss; ss << H;
    cerr << args[idx] << " = " << ss.str();
    debug_out(args, idx + 1, LINE_NUM, T...);
}

#ifdef OFFLINE
clock_t Tm=clock();
#define debug(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
#else
#define debug(...)
#endif

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie();
    //If you hack my code , You are gay
    int n,m;
    cin>>n>>m;
    string x[n];
    for(int i=0;i<n;i++) cin>>x[i];
    vector<vector<int>> osuf(n,vector<int>(m)),isuf(m,vector<int>(n));
    for(int i=0;i<n;i++){
        for(int j=m-1;j>=0;j--){
            osuf[i][j] = x[i][j]=='O';
            if(j!=m-1) osuf[i][j]+=osuf[i][j+1];
        }
    }
    for(int j=0;j<m;j++){
        for(int i=n-1;i>=0;i--){
            isuf[j][i] = x[i][j]=='I';
            if(i!=n-1) isuf[j][i]+=isuf[j][i+1];
        }
    }
    ll ans=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(x[i][j]=='J'){
                ans+=osuf[i][j]*isuf[j][i]*1LL;
            }
        }
    }
    cout<<ans;
    //mara kha
    #ifdef OFFLINE
        cerr<<"Time = "<<(double)(clock()-Tm)/CLOCKS_PER_SEC;
    #endif
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 4 ms 2032 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 4 ms 1516 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 5 ms 2540 KB Output is correct
19 Correct 5 ms 2540 KB Output is correct
20 Correct 5 ms 2540 KB Output is correct
21 Correct 5 ms 2796 KB Output is correct
22 Correct 4 ms 2796 KB Output is correct
23 Correct 4 ms 2796 KB Output is correct
24 Correct 6 ms 2816 KB Output is correct
25 Correct 5 ms 2796 KB Output is correct
26 Correct 5 ms 2796 KB Output is correct
27 Correct 222 ms 76396 KB Output is correct
28 Correct 1 ms 748 KB Output is correct
29 Correct 12 ms 6892 KB Output is correct
30 Correct 1 ms 620 KB Output is correct
31 Correct 155 ms 59592 KB Output is correct
32 Correct 219 ms 82884 KB Output is correct
33 Correct 215 ms 80620 KB Output is correct
34 Correct 184 ms 69044 KB Output is correct
35 Correct 217 ms 85188 KB Output is correct
36 Correct 209 ms 89324 KB Output is correct
37 Correct 247 ms 81004 KB Output is correct
38 Correct 151 ms 58732 KB Output is correct
39 Correct 124 ms 56604 KB Output is correct