# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
809234 | vjudge1 | Bitaro the Brave (JOI19_ho_t1) | C++17 | 502 ms | 71628 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;
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);
}
}
sort(O[i].begin(),O[i].end());
}
for(int i=0;i<w;i++)
{
sort(I[i].begin(),I[i].end());
}
long long ans=0;
for(int i=0;i<h;i++)
{
for(int j=0;j<J[i].size();j++)
{
int res=O[i].size();
int l1=0,r1=O[i].size()-1;
while(l1<=r1)
{
int m=(l1+r1)/2;
if(O[i][m]>J[i][j])
{
res=m;
r1=m-1;
}
else
{
l1=m+1;
}
}
int temp=I[J[i][j]].size();
int l=0,r=I[J[i][j]].size()-1;
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+=(O[i].size()-res)*(I[J[i][j]].size()-temp);
}
}
cout<<ans;
return 0;
}
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... |