147492025-02-01 16:21:49mateTűzijátékcpp17Partially correct 45/5043ms1696 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k, d; cin >> n >> k >> d;
    vector <int> v(n+1);
    for(int i = 0; i < n; i++)  cin >> v[i];
    vector <int> ans;
    int l = v[0];
    ans.push_back(1);
    for(int i = 1; i < n; i++){
        if(v[i] - l >= d && v[i] + d <= v[k-1]){
            ans.push_back(i+1);
            l = v[i];
        }else{
            continue;
        }
    }
    l = v[k-1];
    ans.push_back(k);
    for(int i = k + 1; i < n; i++){
        if(v[i] - l >= d){
            ans.push_back(i+1);
            l = v[i];
        }
    }
    cout << ans.size() << '\n';
    for(int x : ans)    cout << x << ' ';
}
SubtaskSumTestVerdictTimeMemory
base45/50
1Accepted0/01ms316 KiB
2Accepted0/041ms1584 KiB
3Partially correct1/21ms316 KiB
4Accepted2/21ms508 KiB
5Wrong answer0/21ms320 KiB
6Accepted2/21ms500 KiB
7Wrong answer0/21ms316 KiB
8Accepted2/21ms324 KiB
9Accepted2/23ms328 KiB
10Accepted2/24ms516 KiB
11Accepted2/24ms508 KiB
12Accepted2/28ms608 KiB
13Accepted2/28ms576 KiB
14Accepted2/27ms592 KiB
15Accepted3/37ms468 KiB
16Accepted3/312ms756 KiB
17Accepted3/316ms868 KiB
18Accepted3/319ms968 KiB
19Accepted3/343ms1696 KiB
20Accepted3/341ms1560 KiB
21Accepted4/441ms1600 KiB
22Accepted4/441ms1600 KiB