oj.uz

Submission #913615

# Submission time Handle Problem Language Result Execution time Memory
913615 2024-01-20T08:32:26 Z Mahdiyar1 Bitaro the Brave (JOI19_ho_t1) C++17
50 / 100
 284 ms 274432 KB 
// #pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#include <stack>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <bitset>
#include <cstring>
using namespace std;
typedef long long ll;

#define debug(i) cout << "#pass " << i<<endl
#define Kawasaki ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int ll
#define vi vector<int>
#define vii vector<vector<int> >
#define qi queue<int>
#define sort(v) sort(v.begin() , v.end())
#define reverse(v) reverse(v.begin(),v.end())
#define pb push_back
#define pf push_front
#define ppb pop_back
#define all(v) v.begin() , v.end()
#define pii pair<int,int>
#define bs bitset
#define mkp(x,y) make_pair(x , y)
#define fi first
#define se second

const int maxn = 3e3 + 10;
const int maxa = 2e3 + 10;
const int lg = 21;
const int mod = 1e9 + 7;
const int INF = 1e18 + 10;
const int len = 320;
//int p = 31 , q = 53 , pp = 1 , qq = 1;
// int pow(int a , int b , int _mod = mod){
//     return b ? pow(a*a%_mod , b>>1ll,_mod) * (b&1 ? a : 1) %_mod: 1;
// }
//pii mv[8] = {mkp(1,2) , mkp(-1,2) , mkp(1,-2) , mkp(-1,-2) , mkp(2,1) , mkp(2,-1) , mkp(-2,1) , mkp(-2,-1)};
pii mv[4] = {mkp(1,0) , mkp(-1,0) , mkp(0,1) , mkp(0,-1)};

int n , m , cnt[3][maxn][maxn] , ant[3][maxn][maxn];
string mp[maxn];

void solve(){
    cin >> n >> m;
    for(int i=1;i<=n;i++){
        cin >> mp[i];
        mp[i] = "." + mp[i];
        for(int j=1;j<=m;j++){
            int x = 0;
            if(mp[i][j] == 'O')x=1;
            else if(mp[i][j] == 'I')x=2;
            cnt[0][i][j] = cnt[0][i][j-1];ant[0][j][i] = ant[0][j][i-1];
            cnt[1][i][j] = cnt[1][i][j-1];ant[1][j][i] = ant[1][j][i-1];
            cnt[2][i][j] = cnt[2][i][j-1];ant[2][j][i] = ant[2][j][i-1];
            cnt[x][i][j] += 1;
            ant[x][j][i] += 1;
        }
    }
    int ans = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(mp[i][j] != 'J')continue;
            ans += (cnt[1][i][m] - cnt[1][i][j]) * (ant[2][j][n] - ant[2][j][i]);
        }
        // cout << i << ' ' << ans << endl;
    } 
    cout << ans << endl;
}

signed main(){
    Kawasaki;
    int T = 1 , TT = 1;
//    cin >> T;
    while(T--){
        solve();
    }
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:85:17: warning: unused variable 'TT' [-Wunused-variable]
   85 |     int T = 1 , TT = 1;
      |                 ^~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 3420 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 2 ms 3420 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 2 ms 3160 KB Output is correct
11 Correct 3 ms 3416 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 3 ms 3160 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 3420 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 2 ms 3420 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 2 ms 3160 KB Output is correct
11 Correct 3 ms 3416 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 3 ms 3160 KB Output is correct
14 Correct 12 ms 23132 KB Output is correct
15 Correct 5 ms 5976 KB Output is correct
16 Correct 13 ms 20572 KB Output is correct
17 Correct 3 ms 4188 KB Output is correct
18 Correct 24 ms 30140 KB Output is correct
19 Correct 19 ms 27992 KB Output is correct
20 Correct 26 ms 29740 KB Output is correct
21 Correct 26 ms 30004 KB Output is correct
22 Correct 24 ms 28104 KB Output is correct
23 Correct 18 ms 29580 KB Output is correct
24 Correct 23 ms 30024 KB Output is correct
25 Correct 22 ms 27888 KB Output is correct
26 Correct 21 ms 29788 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 3420 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 2 ms 3420 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 2 ms 3160 KB Output is correct
11 Correct 3 ms 3416 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 3 ms 3160 KB Output is correct
14 Correct 12 ms 23132 KB Output is correct
15 Correct 5 ms 5976 KB Output is correct
16 Correct 13 ms 20572 KB Output is correct
17 Correct 3 ms 4188 KB Output is correct
18 Correct 24 ms 30140 KB Output is correct
19 Correct 19 ms 27992 KB Output is correct
20 Correct 26 ms 29740 KB Output is correct
21 Correct 26 ms 30004 KB Output is correct
22 Correct 24 ms 28104 KB Output is correct
23 Correct 18 ms 29580 KB Output is correct
24 Correct 23 ms 30024 KB Output is correct
25 Correct 22 ms 27888 KB Output is correct
26 Correct 21 ms 29788 KB Output is correct
27 Runtime error 284 ms 274432 KB Execution killed with signal 9
28 Halted 0 ms 0 KB -