# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
157667 | InfiniteJest | Bitaro the Brave (JOI19_ho_t1) | C++14 | 1072 ms | 127932 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];
vector<pair<int,int> > v;
int main(){
cin>>h>>w;
for(int i=0;i<h;i++){
int sum=0;
for(int y=0;y<w;y++){
cin>>tab[i][y];
if(tab[i][y]=='O')sum++;
else if(tab[i][y]=='I')sump[y]++;
else v.pb(mp(i,y));
prefb[i][y]=sum;
pref[i][y]=sump[y];
}
}
/*for(int i=0;i<w;i++){
int sum=0;
for(int y=0;y<h;y++){
if(tab[y][i]=='I')sum++;
pref[y][i]=sum;
}
}*/
ll tot=0;
for(int i=0;i<v.size();i++)tot+=(prefb[v[i].fi][w-1]-prefb[v[i].fi][v[i].se])*(pref[h-1][v[i].se]-pref[v[i].fi][v[i].se]);
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... |