| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1307057 | nanaseyuzuki | JOIOJI (JOI14_joioji) | C++20 | 32 ms | 6120 KiB |
#include <bits/stdc++.h>
// Kazusa_Megumi
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
using namespace std;
const int mn = 5e5 + 5, mod = 1e9 + 7, inf = 2e9;
int n;
string s;
map <pii, int> mp;
void solve() {
cin >> n >> s;
s = "#" + s;
int cur12 = 0, cur23 = 0, res = 0;
mp[{0, 0}] = 0;
for(int i = 1; i <= n; i++){
if(s[i] == 'J') cur12 ++;
else if(s[i] == 'O') cur12 --, cur23 ++;
else cur23 --;
if(!mp.count({cur12, cur23})) mp[{cur12, cur23}] = i;
else res = max(res, i - mp[{cur12, cur23}]);
}
cout << res << '\n';
}
main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
if (fopen("Kazuki.INP", "r")) {
freopen("Kazuki.INP", "r", stdin);
freopen("Kazuki.OUT", "w", stdout);
}
int t = 1;
// cin >> t;
while (t--) solve();
return 0;
}
컴파일 시 표준 에러 (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... | ||||
