oj.uz

Submission #966441

# Submission time Handle Problem Language Result Execution time Memory
966441 2024-04-19T21:29:32 Z YassirSalama Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 187 ms 159044 KB 
#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};
#define endl "\n"
#define int ll
using ull=unsigned long long;
using ll=long long;
using pii=pair<int,int>;
const int mod=1e9+7;
#define OVL(x,s) for(auto y:x) cout<<y<<s; cout<<"\n";
template <typename T> istream& operator>>(istream& is, vector<T> &a) {
    copy_n(istream_iterator<T>(is), a.size(), a.begin()); return is;}
#ifdef IOI
void dbg_out() { cout << endl; } template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__);
#else
#define dbg(...) 1337;
#endif
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
const int mxn=2e5+100;
signed main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n,m;
cin>>n>>m;
vector<string> v(n);
cin>>v;
map<char,int> mp;
mp['U']=0;
mp['J']=1;
mp['I']=2;
int ans=0;
int dp1[n][m];
memset(dp1,0,sizeof(dp1));
int dp2[n][m];
memset(dp2,0,sizeof(dp2));

for(int i=0;i<n;i++){
    for(int j=0;j<m;j++){
        if(v[i][j]=='O')
            dp1[i][j]++;
        if(j)
            dp1[i][j]+=dp1[i][j-1];
    }
    for(int j=0;j<m;j++){
        if(v[i][j]=='I'){
            dp2[i][j]++;
        }
        if(i){
            dp2[i][j]+=dp2[i-1][j];
        }
    }
}
for(int i=0;i<n;i++){
    for(int j=0;j<m;j++){
        if(v[i][j]!='J') continue;
        int a=dp1[i][m-1]-(j?dp1[i][j-1]:0LL);
        int b=dp2[n-1][j]-(i?dp2[i-1][j]:0LL);
        ans+=a*b;
    }
}


cout<<ans<<endl;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 604 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 4 ms 3420 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 5 ms 4444 KB Output is correct
19 Correct 4 ms 4444 KB Output is correct
20 Correct 4 ms 4448 KB Output is correct
21 Correct 5 ms 4444 KB Output is correct
22 Correct 4 ms 4444 KB Output is correct
23 Correct 4 ms 4524 KB Output is correct
24 Correct 5 ms 4444 KB Output is correct
25 Correct 3 ms 4444 KB Output is correct
26 Correct 4 ms 4440 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 4 ms 3420 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 5 ms 4444 KB Output is correct
19 Correct 4 ms 4444 KB Output is correct
20 Correct 4 ms 4448 KB Output is correct
21 Correct 5 ms 4444 KB Output is correct
22 Correct 4 ms 4444 KB Output is correct
23 Correct 4 ms 4524 KB Output is correct
24 Correct 5 ms 4444 KB Output is correct
25 Correct 3 ms 4444 KB Output is correct
26 Correct 4 ms 4440 KB Output is correct
27 Correct 178 ms 150000 KB Output is correct
28 Correct 1 ms 856 KB Output is correct
29 Correct 9 ms 11868 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 135 ms 110696 KB Output is correct
32 Correct 133 ms 157812 KB Output is correct
33 Correct 127 ms 158760 KB Output is correct
34 Correct 152 ms 128340 KB Output is correct
35 Correct 129 ms 157952 KB Output is correct
36 Correct 124 ms 158496 KB Output is correct
37 Correct 187 ms 159044 KB Output is correct
38 Correct 89 ms 109708 KB Output is correct
39 Correct 86 ms 110088 KB Output is correct