# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717540 | 2023-04-02T07:02:56 Z | vjudge1 | Bitaro the Brave (JOI19_ho_t1) | C++14 | 1 ms | 212 KB |
#include <bits/stdc++.h> using namespace std; int findingnemo(int x,int y){ int ans=0; for(int a=1;a<=x;a++){ for(int b=1;b<=y;b++){ ans++; } } //cout << x << y << ans << endl; return ans; } int 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'){ //cout << x << y << endl; for(int j=0;j<w;j++){ if(grid[x][j]=='O'){ //cout << x << j << endl; if(y<j) counto++; } } for(int i=0;i<h;i++){ if(grid[i][y]=='I'){ //cout << i << y << endl; if(x<i) counti++; } } if((counto>=1)&&(counti>=1)) ans = ans + findingnemo(counto,counti); } } } cout << ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |