# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163198 | TadijaSebez | JOIOJI (JOI14_joioji) | C++11 | 95 ms | 6264 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;
const int N=200050;
char s[N];
int main()
{
int n,IJ=0,IO=0;
scanf("%i",&n);
scanf("%s",s+1);
map<pair<int,int>,int> fir;
fir[{0,0}]=0;
int ans=0;
for(int i=1;i<=n;i++)
{
if(s[i]=='I') IJ++,IO++;
if(s[i]=='J') IJ--;
if(s[i]=='O') IO--;
if(fir.count({IJ,IO})) ans=max(ans,i-fir[{IJ,IO}]);
else fir[{IJ,IO}]=i;
}
printf("%i\n",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... |