# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
580853 | Metal_Sonic | Bitaro the Brave (JOI19_ho_t1) | C++17 | 8 ms | 9172 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 ll long long
#define sz(x) (int)(x).size()
#define all(x) x.begin() , x.end()
void setIO(string name = "") {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
if(sz(name)){
freopen((name+".in").c_str(), "r", stdin);
freopen((name+".out").c_str(), "w", stdout);
}
}
const int N = 3005;
int I[N][N] , O[N][N] , J[N][N];
void run_test_case(){
int n , m;cin>>n>>m;
for(int i = 0; i < n; i++){
string s;cin>>s;
for(int j = 0; j < m; j++){
if(s[j] == 'I')I[i][j]++;
else if(s[j] == 'O')O[i][j]++;
else J[i][j]++;
if(j)O[i][j]+=O[i][j-1];
if(i)I[i][j]+=I[i-1][j];
}
}
int ans = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
if(J[i][j])ans+=(O[i][m-1]-O[i][j])*(I[n-1][j]-I[i][j]);
}
}
cout<<ans;
}
int main() {
setIO();
int T = 1;
while(T--){
run_test_case();
}
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... |