1129 | 2022. 03. 12 10:50:37 | kovacs.peter.18f | Tűzijáték | cpp11 | Elfogadva 50/50 | 17ms | 8120 KiB |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.tie(nullptr);
int N, S, T;
cin >> N >> S >> T;
vector<int> distanceS(N);
for (auto &e : distanceS) {
cin >> e;
}
vector<int> answerS{ S - 1 };
int last = distanceS[S - 1];
for (int i = S - 2; i >= 0; i--) {
if (last - distanceS[i] >= T) {
answerS.push_back(i);
last = distanceS[i];
}
}
last = distanceS[S - 1];
for (int i = S; i < N; i++) {
if (distanceS[i] - last >= T) {
answerS.push_back(i);
last = distanceS[i];
}
}
sort(answerS.begin(), answerS.end());
cout << answerS.size() << '\n';
for (auto e : answerS) {
cout << e + 1 << " ";
}
cout << '\n';
}
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 50/50 | ||||||
1 | Elfogadva | 0/0 | 2ms | 1760 KiB | |||
2 | Elfogadva | 0/0 | 17ms | 3660 KiB | |||
3 | Elfogadva | 2/2 | 1ms | 2660 KiB | |||
4 | Elfogadva | 2/2 | 1ms | 2664 KiB | |||
5 | Elfogadva | 2/2 | 2ms | 2664 KiB | |||
6 | Elfogadva | 2/2 | 2ms | 2672 KiB | |||
7 | Elfogadva | 2/2 | 1ms | 2672 KiB | |||
8 | Elfogadva | 2/2 | 1ms | 2680 KiB | |||
9 | Elfogadva | 2/2 | 2ms | 2724 KiB | |||
10 | Elfogadva | 2/2 | 4ms | 2776 KiB | |||
11 | Elfogadva | 2/2 | 3ms | 2960 KiB | |||
12 | Elfogadva | 2/2 | 4ms | 3072 KiB | |||
13 | Elfogadva | 2/2 | 3ms | 3320 KiB | |||
14 | Elfogadva | 2/2 | 3ms | 3312 KiB | |||
15 | Elfogadva | 3/3 | 3ms | 3444 KiB | |||
16 | Elfogadva | 3/3 | 4ms | 3880 KiB | |||
17 | Elfogadva | 3/3 | 6ms | 4116 KiB | |||
18 | Elfogadva | 3/3 | 7ms | 4536 KiB | |||
19 | Elfogadva | 3/3 | 14ms | 6044 KiB | |||
20 | Elfogadva | 3/3 | 14ms | 6800 KiB | |||
21 | Elfogadva | 4/4 | 13ms | 7608 KiB | |||
22 | Elfogadva | 4/4 | 13ms | 8120 KiB |