# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
809075 | 2023-08-05T15:37:58 Z | vjudge1 | Bitaro the Brave (JOI19_ho_t1) | C++17 | 1 ms | 468 KB |
#include<bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int h,w; cin >> h >> w; vector<int> J[h], O[h],I[w]; for (int i = 0; i < h; i++) { string s; cin >> s; for (int j = 0; j < w; j++) { if (s[j] == 'J') { J[i].push_back(j); } else if (s[j] == 'O') { O[i].push_back(j); } else { I[j].push_back(i); } } } for(int i=0;i<w;i++) { sort(I[i].begin(),I[i].end()); } int ans=0; for(int i=0;i<h;i++) { for(int j=0;j<J[i].size();j++) { for(int l=0;l<O[i].size();l++) { if(O[i][l]>J[i][j]) { int temp=I[J[i][j]].size(); int l=0,r=I[J[i][j]].size(); while(l<=r) { int m=(l+r)/2; if(I[J[i][j]][m]>i) { temp=m; r=m-1; } else { l=m+1; } } ans+=I[J[i][j]].size()-temp; } } } } cout<<ans; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 320 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Runtime error | 1 ms | 468 KB | Execution killed with signal 11 |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 320 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Runtime error | 1 ms | 468 KB | Execution killed with signal 11 |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 320 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Runtime error | 1 ms | 468 KB | Execution killed with signal 11 |
5 | Halted | 0 ms | 0 KB | - |