# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1132096 | lopkus | 스탬프 수집 (JOI16_ho_t2) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<char> a(n + 1);
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
int f = 0;
vector<int> prefj(n + 1, 0);
vector<int> sufi(n + 3, 0);
for(int i = 1; i <= n; i++) {
prefj[i] = prefj[i - 1] + (a[i] == 'J');
}
for(int i = n; i >= 1; i--) {
sufi[i] = sufi[i + 1] + (a[i] == 'I');
}
for(int i = 1; i <= n; i++) {
if(a[i] != 'J') {
continue;
}
for(int j = i + 1; j <= n; j++) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |