#include <bits/stdc++.h>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 2e5 + 228;
const int big = 1e9;
int n, m;
int main(){
iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
cin >> n >> m;
for (int i = 1; i <= n; i++){
int a, b;
cin >> a >> b;
//g[a].pb(b);
}
cout << m << en;
int kol = 0;
for (int i = 1; i <= n; i += 2){
kol++;
cout << i << ' ';
if (kol == m) return 0;
}
return 0;
}
/*
5 1
1 2
2 3
3 4
4 5
5 6
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
106 ms |
492 KB |
Output is correct |
2 |
Incorrect |
107 ms |
364 KB |
Sheep 4883 not protected |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
364 KB |
Sheep 857 not protected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Sheep 16 not protected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
110 ms |
492 KB |
Sheep 54 not protected |
2 |
Halted |
0 ms |
0 KB |
- |