# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717574 | vjudge1 | Bitaro the Brave (JOI19_ho_t1) | C++17 | 1 ms | 212 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 int long long int
int findingnemo(int x,int y){
int ans=0;
for(int a=1;a<=x;a++){
for(int b=1;b<=y;b++){
ans++;
}
}
return ans;
}
int32_t main(){
int h,w,jx,jy,counto=0,counti=0,ans;
cin >> h >> w;
char grid[h][w];
for(int x=0;x<h;x++){
for(int y=0;y<w;y++){
cin >> grid[x][y];
}
}
for(int x=0;x<h;x++){
for(int y=0;y<w;y++){
counto=0;
counti=0;
if(grid[x][y]=='J'){
for(int j=0;j<w;j++){
if(grid[x][j]=='O'){
if(y<j) counto++;
}
}
for(int i=0;i<h;i++){
if(grid[i][y]=='I'){
if(x<i) counti++;
}
}
if((counto>=1)&&(counti>=1)) ans = ans + findingnemo(counto,counti);
}
}
}
cout << ans;
}
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... |