# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1101876 | KasymK | Bitaro the Brave (JOI19_ho_t1) | C++17 | 11 ms | 3064 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"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 3005;
char c[N][N];
int sm[N], sm1[N];
int main(){
int n, m, answer = 0;
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
scanf(" %c", &c[i][j]), sm[i] += (c[i][j]=='O'?1:0), sm1[j] += (c[i][j]=='I'?1:0);
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j){
if(c[i][j] == 'J')
answer += sm[i]*sm1[j];
else if(c[i][j] == 'O')
sm[i]--;
else
sm1[j]--;
}
printf("%d\n", answer);
return 0;
}
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... |