oj.uz

Submission #237670

# Submission time Handle Problem Language Result Execution time Memory
237670 2020-06-08T08:47:22 Z zaneyu Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 317 ms 89508 KB 
/*input
4 4
JJOO
JJOO
IIJO
IIIJ
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ll long long 
#define ld long double
#define pii pair<double,double>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define MP make_pair
const ll INF64=4e12;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1){
            res=(res*a)%MOD;
        }
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
const ll maxn=3e3+5;
const ll maxlg=__lg(maxn)+2;
string arr[maxn];
int suffo[maxn][maxn],suffi[maxn][maxn];
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m;
    cin>>n>>m;
    REP(i,n) cin>>arr[i];
    REP(i,n){
        for(int j=m-1;j>=0;j--){
            suffo[i][j]=suffo[i][j+1]+(arr[i][j]=='O');
        }
    }
    REP(i,m){
        for(int j=n-1;j>=0;j--){
            suffi[j][i]=suffi[j+1][i]+(arr[j][i]=='I');
        }
    }
    ll ans=0;
    REP(i,n){
        REP(j,m){
            if(arr[i][j]=='J'){
                ans+=(suffi[i][j]*suffo[i][j]);
            }
        }
    }
    cout<<ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 1536 KB Output is correct
6 Correct 6 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 1280 KB Output is correct
9 Correct 5 ms 1280 KB Output is correct
10 Correct 5 ms 1280 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 5 ms 1280 KB Output is correct
13 Correct 5 ms 1280 KB Output is correct
14 Correct 10 ms 6272 KB Output is correct
15 Correct 6 ms 3840 KB Output is correct
16 Correct 9 ms 3836 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 11 ms 6912 KB Output is correct
19 Correct 10 ms 6784 KB Output is correct
20 Correct 10 ms 6784 KB Output is correct
21 Correct 11 ms 6912 KB Output is correct
22 Correct 11 ms 7040 KB Output is correct
23 Correct 10 ms 6784 KB Output is correct
24 Correct 12 ms 6912 KB Output is correct
25 Correct 12 ms 6912 KB Output is correct
26 Correct 10 ms 6784 KB Output is correct
27 Correct 298 ms 88440 KB Output is correct
28 Correct 15 ms 19328 KB Output is correct
29 Correct 14 ms 7808 KB Output is correct
30 Correct 5 ms 768 KB Output is correct
31 Correct 214 ms 71928 KB Output is correct
32 Correct 279 ms 89336 KB Output is correct
33 Correct 287 ms 89336 KB Output is correct
34 Correct 249 ms 83448 KB Output is correct
35 Correct 280 ms 89336 KB Output is correct
36 Correct 284 ms 89208 KB Output is correct
37 Correct 317 ms 89508 KB Output is correct
38 Correct 188 ms 72056 KB Output is correct
39 Correct 181 ms 71672 KB Output is correct