# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199765 | Mercenary | Bitaro the Brave (JOI19_ho_t1) | C++14 | 114 ms | 89592 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define taskname "A"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
const int maxn = 3005;
string s[maxn];
int a[maxn][maxn] , b[maxn][maxn] , m , n;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen(taskname".INP","r")){
freopen(taskname".INP", "r",stdin);
freopen(taskname".OUT", "w",stdout);
}
ll res = 0;
cin >> m >> n;
for(int i = 0 ; i < m ; ++i)cin >> s[i];
for(int i = m - 1 ; i >= 0 ; --i){
for(int j = n - 1 ; j >= 0 ; --j){
a[i][j] = a[i][j + 1] + (s[i][j] == 'O');
b[i][j] = b[i + 1][j] + (s[i][j] == 'I');
}
}
for(int i = 0 ; i < m ; ++i){
for(int j = 0 ; j < n ; ++j){
res += (ll)(s[i][j] == 'J') * a[i][j] * b[i][j];
}
}
cout << res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |