# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
157701 | InfiniteJest | Bitaro the Brave (JOI19_ho_t1) | C++14 | 1040 ms | 111468 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 <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ifstream in("input.txt");
ofstream out("output.txt");
typedef long long ll;
int h,w;
char tab[5000][5000];
int pref[5000][5000];
int prefb[5000][5000];
int sump[5000];
int fb[5000];
int f[5000];
vector<pair<int,int> > v;
int main(){
cin>>h>>w;
int sumf;
ll tot=0;
for(int i=0;i<h;i++){
int sum=0;
for(int y=0;y<w;y++){
cin>>tab[i][y];
if(i!=0&&tab[i-1][y]=='J')fb[y]+=sumf-prefb[i-1][y];
if(tab[i][y]=='O')sum++;
else if(tab[i][y]=='I'){
sump[y]++;
f[y]++;
}
else{
tot+=f[y]*fb[y];
f[y]=0;
}
prefb[i][y]=sum;
pref[i][y]=sump[y];
}
sumf=sum;
}
//cout<<pref[0][3];
for(int i=0;i<w;i++)if(tab[h-1][i]!='J'){
//cout<<"i "<<i<<" f "<<f[i]<<" fb "<<fb[i]<<endl;
tot+=f[i]*fb[i];
}
//cout<<fb[0];
cout<<tot;
}
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... |