oj.uz

Submission #364463

# Submission time Handle Problem Language Result Execution time Memory
364463 2021-02-09T08:55:22 Z farhan132 Bitaro the Brave (JOI19_ho_t1) C++17
20 / 100
 88 ms 106604 KB 
/***Farhan132***/

#include <bits/stdc++.h>
 
using namespace std;
 
typedef int ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcountll(n)
#define clean fflush(stdout)

const ll mod =  (ll)1e9 + 7;
const ll maxn = (ll)2e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
//const ll INF = 1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};

ll track[2][3005][3005];
ll a[3005][3005];

ll n , m;

void work(ll id){
    if(id == 1){
    for(ll i = 1; i <= n; i++){
        for(ll j = m; j >= 1; j--){
            track[0][i][j] = track[0][i][j+1] + ( a[i][j] == id+1);
        }
    }
    }
    if(id == 2){
     for(ll j = 1; j <= m; j++){
        for(ll i = n; i >= 1; i--) track[1][i][j] = track[1][i+1][j] + (a[i][j] == id+1);
     }
    }
    return;
}

void solve(){
    
    cin >> n >> m;
    mem(track, 0);
    mem(a, 0);
    for(ll i = 1; i <= n; i++){
        for(ll j = 1; j <= m; j++){
            char c;
            cin >> c;
            if(c == 'J') a[i][j] = 1;
            if(c == 'O') a[i][j] = 2;
            if(c == 'I') a[i][j] = 3;
        }
    }
    f0(3) work(i);
    ll ans = 0;
    for(ll i = 1; i <= n; i++){
        for(ll j = 1; j <= m; j++){
            if(a[i][j] == 1) ans += track[1][i][j] * track[0][i][j];
        }
    }
    cout << ans;

    return;
    
}

 
int main() {
    
    
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #else 
     //   freopen("cbarn2.in", "r", stdin);
     //   freopen("cbarn2.out", "w", stdout);
     // ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
    //cout << fixed << setprecision(10);
   // work(maxn);
    //  mem(b,0);
    ll T;
    T=1;
    //cin >> T; 
    //scanf("%lld",&T);
   // ll CT = 0;
    //work();
    while(T--){
        //cout << "Case " << ++CT <<": " ;
        //printf("Case %lld: ",++CT);
        solve();
    }
 
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 106348 KB Output is correct
2 Correct 59 ms 106392 KB Output is correct
3 Correct 64 ms 106348 KB Output is correct
4 Correct 55 ms 106348 KB Output is correct
5 Correct 59 ms 106348 KB Output is correct
6 Correct 58 ms 106476 KB Output is correct
7 Correct 57 ms 106348 KB Output is correct
8 Correct 58 ms 106348 KB Output is correct
9 Correct 59 ms 106348 KB Output is correct
10 Correct 70 ms 106368 KB Output is correct
11 Correct 58 ms 106348 KB Output is correct
12 Correct 59 ms 106348 KB Output is correct
13 Correct 57 ms 106348 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 106348 KB Output is correct
2 Correct 59 ms 106392 KB Output is correct
3 Correct 64 ms 106348 KB Output is correct
4 Correct 55 ms 106348 KB Output is correct
5 Correct 59 ms 106348 KB Output is correct
6 Correct 58 ms 106476 KB Output is correct
7 Correct 57 ms 106348 KB Output is correct
8 Correct 58 ms 106348 KB Output is correct
9 Correct 59 ms 106348 KB Output is correct
10 Correct 70 ms 106368 KB Output is correct
11 Correct 58 ms 106348 KB Output is correct
12 Correct 59 ms 106348 KB Output is correct
13 Correct 57 ms 106348 KB Output is correct
14 Correct 72 ms 106496 KB Output is correct
15 Correct 56 ms 106348 KB Output is correct
16 Correct 71 ms 106476 KB Output is correct
17 Correct 58 ms 106348 KB Output is correct
18 Correct 80 ms 106604 KB Output is correct
19 Correct 75 ms 106604 KB Output is correct
20 Incorrect 88 ms 106604 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 106348 KB Output is correct
2 Correct 59 ms 106392 KB Output is correct
3 Correct 64 ms 106348 KB Output is correct
4 Correct 55 ms 106348 KB Output is correct
5 Correct 59 ms 106348 KB Output is correct
6 Correct 58 ms 106476 KB Output is correct
7 Correct 57 ms 106348 KB Output is correct
8 Correct 58 ms 106348 KB Output is correct
9 Correct 59 ms 106348 KB Output is correct
10 Correct 70 ms 106368 KB Output is correct
11 Correct 58 ms 106348 KB Output is correct
12 Correct 59 ms 106348 KB Output is correct
13 Correct 57 ms 106348 KB Output is correct
14 Correct 72 ms 106496 KB Output is correct
15 Correct 56 ms 106348 KB Output is correct
16 Correct 71 ms 106476 KB Output is correct
17 Correct 58 ms 106348 KB Output is correct
18 Correct 80 ms 106604 KB Output is correct
19 Correct 75 ms 106604 KB Output is correct
20 Incorrect 88 ms 106604 KB Output isn't correct
21 Halted 0 ms 0 KB -