답안 #464055

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
464055	2021-08-12T10:18:14 Z	myvaluska	Lollipop (POI11_liz)	C++14	73 / 100	2000 ms	20352 KB

// pec.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <set>
#include <string>
using namespace std;

int main()
{
    int n;
    int m;
    cin >> n;
    cin >> m;
    string s;
    cin >> s;
    vector<int>v(n + 1);
    for (int i = 1; i < n + 1; i++)
    {
        if (s[i - 1] == 'W')
        {
            v[i] = 1;
        }
        else if (s[i - 1] == 'T')
        {
            v[i] = 2;
        }
    }
    vector<int>prefix(n + 1);
    prefix[0] = 0;
    for (int i = 1; i < n + 1; i++)
    {
        prefix[i] = prefix[i - 1] + v[i];
    }
    vector<int>jedna(n + 1, 1e9+36);
    for (int i = n; i > 0; i--)
    {
        if (v[i] == 1)
        {
            jedna[i] = i;
        }
        else
        {
            if (i != n)
            {
                jedna[i] = jedna[i + 1];
            }
        }
    }
    while (m--)
    {
        int k;
        cin >> k;
        if (k > prefix[n])
        {
            cout << "NIE" << endl;
        }
        else
        {
            int index = lower_bound(prefix.begin(), prefix.end(),k)-prefix.begin();
            if (prefix[index] == k)
            {
                cout << 1 << ' ';
                cout << index << endl;
            }
            else
            {
                int mini = min(jedna[1], jedna[index] - index + 1);
                int l = mini;
                int r = mini + index - 1;
                if (r > n)
                {
                    cout << "NIE" << endl;
                }
                else
                {
                    if (prefix[r] - prefix[l - 1] == k)
                    {
                        cout << l << ' ';
                        cout << r << endl;
                    }
                    else
                    {
                        cout << l + 1 << ' ';
                        cout << r << endl;
                    }
                }
            }
        }
    }

    return 0;
    //std::cout << "Hello World!\n";
}

// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu

// Tips for Getting Started: 
//   1. Use the Solution Explorer window to add/manage files
//   2. Use the Team Explorer window to connect to source control
//   3. Use the Output window to see build output and other messages
//   4. Use the Error List window to view errors
//   5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
//   6. In the future, to open this project again, go to File > Open > Project and select the .sln file

Subtask #1
8.0 / 8.0

#	결과	메모리	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct

Subtask #3
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	43 ms	340 KB	Output is correct

Subtask #4
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	332 KB	Output is correct
2	Correct	23 ms	424 KB	Output is correct
3	Correct	28 ms	460 KB	Output is correct

Subtask #5
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	45 ms	644 KB	Output is correct
2	Correct	49 ms	724 KB	Output is correct
3	Correct	232 ms	1360 KB	Output is correct

Subtask #6
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	183 ms	1648 KB	Output is correct
2	Correct	910 ms	4172 KB	Output is correct
3	Correct	451 ms	2948 KB	Output is correct

Subtask #7
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	166 ms	1860 KB	Output is correct
2	Correct	216 ms	1956 KB	Output is correct
3	Correct	470 ms	3436 KB	Output is correct

Subtask #8
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	701 ms	4268 KB	Output is correct
2	Correct	701 ms	4060 KB	Output is correct
3	Correct	952 ms	6564 KB	Output is correct

Subtask #9
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1499 ms	9948 KB	Output is correct
2	Correct	1474 ms	9448 KB	Output is correct
3	Correct	1707 ms	12640 KB	Output is correct

Subtask #10
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1253 ms	11352 KB	Output is correct
2	Correct	1734 ms	13060 KB	Output is correct
3	Execution timed out	2009 ms	16020 KB	Time limit exceeded

Subtask #11
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2090 ms	19832 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #12
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2087 ms	20352 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

답안 #464055

Compilation message