oj.uz

Submission #535738

# Submission time Handle Problem Language Result Execution time Memory
535738 2022-03-11T05:21:22 Z browntoad Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 373 ms 159096 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=3005;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
 
//=======================================================================================
char arr[maxn][maxn];
int corb[maxn][maxn];
int cing[maxn][maxn];
signed main (){
    IOS();
    int h, w; cin>>h>>w;
    REP(i,h){
        REP(j, w){
            cin>>arr[i][j];
        }
    }
    // corb is constant i
    REP(i, h){
        RREP(j, w){
            corb[i][j]=corb[i][j+1]+(arr[i][j]=='O');
        }
    }
    REP(j, w){
        RREP(i, h){
            cing[i][j]=cing[i+1][j]+(arr[i][j]=='I');
        }
    }
    int ans=0;
    REP(i, h){
        REP(j, w){
            if (arr[i][j]=='J'){
                ans+=corb[i][j]*cing[i][j];
            }
        }
    }
    cout<<ans<<endl;

}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1488 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 8 ms 8916 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 7 ms 5332 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 13 ms 9924 KB Output is correct
19 Correct 8 ms 9812 KB Output is correct
20 Correct 9 ms 9712 KB Output is correct
21 Correct 11 ms 9952 KB Output is correct
22 Correct 10 ms 9824 KB Output is correct
23 Correct 8 ms 9688 KB Output is correct
24 Correct 9 ms 9940 KB Output is correct
25 Correct 8 ms 9812 KB Output is correct
26 Correct 10 ms 9684 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1488 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 8 ms 8916 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 7 ms 5332 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 13 ms 9924 KB Output is correct
19 Correct 8 ms 9812 KB Output is correct
20 Correct 9 ms 9712 KB Output is correct
21 Correct 11 ms 9952 KB Output is correct
22 Correct 10 ms 9824 KB Output is correct
23 Correct 8 ms 9688 KB Output is correct
24 Correct 9 ms 9940 KB Output is correct
25 Correct 8 ms 9812 KB Output is correct
26 Correct 10 ms 9684 KB Output is correct
27 Correct 366 ms 158660 KB Output is correct
28 Correct 13 ms 26328 KB Output is correct
29 Correct 15 ms 13900 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 289 ms 131328 KB Output is correct
32 Correct 336 ms 159060 KB Output is correct
33 Correct 348 ms 158500 KB Output is correct
34 Correct 311 ms 152372 KB Output is correct
35 Correct 373 ms 159096 KB Output is correct
36 Correct 354 ms 158576 KB Output is correct
37 Correct 368 ms 159088 KB Output is correct
38 Correct 259 ms 130820 KB Output is correct
39 Correct 225 ms 130864 KB Output is correct