oj.uz

Submission #208065

# Submission time Handle Problem Language Result Execution time Memory
208065 2020-03-10T00:36:09 Z coldEr66 Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 321 ms 151204 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}
template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

const ll MAXn=3e3+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=0x3f3f3f3f;

string str[MAXn];
ll cnto[MAXn][MAXn];
ll cnti[MAXn][MAXn];
int main(){
    IOS();
    int n,m;
    cin >> n >> m;
    REP (i,n) cin >> str[i];

    REP (i,n) REP (j,m) {
        cnto[i][j] += (str[i][j] == 'O') + (j ?cnto[i][j-1]:0);
        debug(i,j,cnto[i][j]);
    }
    REP (j,m) REP (i,n) {
        cnti[j][i] += (str[i][j] == 'I') + (i ?cnti[j][i-1]:0);
        debug(i,j,cnti[j][i]);
    }

    ll ans = 0;
    REP (i,n) REP (j,m) {
        if (str[i][j] == 'J') {
            ll tco = cnto[i][m-1] - (j ?cnto[i][j-1]:0);
            ll tci = cnti[j][n-1] - (i ?cnti[j][i-1]:0);
            debug(i,j,tco,tci);
            ans += tco * tci;
        }
    }
    cout << ans << endl;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 508 KB Output is correct
5 Correct 5 ms 1400 KB Output is correct
6 Correct 5 ms 1400 KB Output is correct
7 Correct 5 ms 1400 KB Output is correct
8 Correct 6 ms 1400 KB Output is correct
9 Correct 5 ms 1272 KB Output is correct
10 Correct 5 ms 1400 KB Output is correct
11 Correct 6 ms 1400 KB Output is correct
12 Correct 5 ms 1272 KB Output is correct
13 Correct 5 ms 1400 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 508 KB Output is correct
5 Correct 5 ms 1400 KB Output is correct
6 Correct 5 ms 1400 KB Output is correct
7 Correct 5 ms 1400 KB Output is correct
8 Correct 6 ms 1400 KB Output is correct
9 Correct 5 ms 1272 KB Output is correct
10 Correct 5 ms 1400 KB Output is correct
11 Correct 6 ms 1400 KB Output is correct
12 Correct 5 ms 1272 KB Output is correct
13 Correct 5 ms 1400 KB Output is correct
14 Correct 11 ms 7160 KB Output is correct
15 Correct 6 ms 2296 KB Output is correct
16 Correct 10 ms 5628 KB Output is correct
17 Correct 6 ms 1656 KB Output is correct
18 Correct 13 ms 8568 KB Output is correct
19 Correct 12 ms 8320 KB Output is correct
20 Correct 11 ms 8440 KB Output is correct
21 Correct 13 ms 8568 KB Output is correct
22 Correct 12 ms 8440 KB Output is correct
23 Correct 11 ms 8568 KB Output is correct
24 Correct 13 ms 8568 KB Output is correct
25 Correct 11 ms 8320 KB Output is correct
26 Correct 12 ms 8568 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 508 KB Output is correct
5 Correct 5 ms 1400 KB Output is correct
6 Correct 5 ms 1400 KB Output is correct
7 Correct 5 ms 1400 KB Output is correct
8 Correct 6 ms 1400 KB Output is correct
9 Correct 5 ms 1272 KB Output is correct
10 Correct 5 ms 1400 KB Output is correct
11 Correct 6 ms 1400 KB Output is correct
12 Correct 5 ms 1272 KB Output is correct
13 Correct 5 ms 1400 KB Output is correct
14 Correct 11 ms 7160 KB Output is correct
15 Correct 6 ms 2296 KB Output is correct
16 Correct 10 ms 5628 KB Output is correct
17 Correct 6 ms 1656 KB Output is correct
18 Correct 13 ms 8568 KB Output is correct
19 Correct 12 ms 8320 KB Output is correct
20 Correct 11 ms 8440 KB Output is correct
21 Correct 13 ms 8568 KB Output is correct
22 Correct 12 ms 8440 KB Output is correct
23 Correct 11 ms 8568 KB Output is correct
24 Correct 13 ms 8568 KB Output is correct
25 Correct 11 ms 8320 KB Output is correct
26 Correct 12 ms 8568 KB Output is correct
27 Correct 278 ms 146936 KB Output is correct
28 Correct 12 ms 10232 KB Output is correct
29 Correct 27 ms 22392 KB Output is correct
30 Correct 11 ms 10104 KB Output is correct
31 Correct 203 ms 124724 KB Output is correct
32 Correct 238 ms 150776 KB Output is correct
33 Correct 270 ms 151032 KB Output is correct
34 Correct 237 ms 135160 KB Output is correct
35 Correct 284 ms 150864 KB Output is correct
36 Correct 284 ms 151020 KB Output is correct
37 Correct 321 ms 151204 KB Output is correct
38 Correct 174 ms 123888 KB Output is correct
39 Correct 201 ms 124376 KB Output is correct