Submission #998301

#	Time	Username	Problem	Language	Result	Execution time	Memory
998301		abczz	JOIOJI (JOI14_joioji)	C++17	100 / 100	34 ms	6124 KiB

joioji

#include <iostream>
#include <array>
#include <algorithm>
#include <map>
#define ll long long

using namespace std;

ll n, f;
map <array<ll, 2>, ll> mp;
array <ll, 2> cur;
string S;
int main() {
  cin >> n >> S;
  mp[cur] = -1;
  for (int i=0; i<n; ++i) {
    if (S[i] == 'J') --cur[0], --cur[1];
    else if (S[i] == 'O') ++cur[0];
    else ++cur[1];
    if (mp.find(cur) == mp.end()) mp[cur] = i;
    else {
      f = max(f, i-mp[cur]);
    }
  }
  cout << f << '\n';
}

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 80 / 80