제출 #1230907

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1230907		toast12	새로운 문제 (POI11_liz)	C++20	100 / 100	1228 ms	22512 KiB

liz

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> v(n+1);
    for (int i = 1; i <= n; i++) {
        char c;
        cin >> c;
        if (c == 'T') v[i] = 2;
        else v[i] = 1;
    }
    vector<int> ps(n+1);
    for (int i = 1; i <= n; i++) ps[i] = ps[i-1]+v[i];
    vector<int> a(n+2, n+1);
    for (int i = n; i > 0; i--) {
        if (v[i] == 1) a[i] = i;
        else a[i] = a[i+1];
    }
    while (m--) {
        int k;
        cin >> k;
        auto it = lower_bound(ps.begin(), ps.end(), k);
        if (it == ps.end()) {
            cout << "NIE\n";
            continue;
        }
        if (*it == k) {
            cout << 1 << ' ' << (it-ps.begin()) << '\n';
            continue;
        }
        int i = it-ps.begin();
        int l = min(a[1], a[i]-i+1);
        int r = l+i-1;
        if (r > n) cout << "NIE\n";
        else if (ps[r]-ps[l-1] == k) cout << l << ' ' << r << '\n';
        else cout << l+1 << ' ' << r << '\n';
    }
    return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 8 / 8
• Subtask 5: 8 / 8
• Subtask 6: 8 / 8
• Subtask 7: 8 / 8
• Subtask 8: 8 / 8
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9
• Subtask 11: 9 / 9
• Subtask 12: 9 / 9