#include <bits/stdc++.h> using namespace std; #define FOR(i, b) for (int i = 0; i < b; ++i) #define sz(s) (int)s.size() #define all(s) s.begin(), s.end() #define mp make_pair #define pb push_back void solve() { int n; cin >> n; int already_qualified = 0; auto print_contestant = [&](int i) { ++already_qualified; cout << i + 1 << (already_qualified < 20 ? ' ' : '\n'); }; for (int i = 0; i < n; i++) { string allowed_for_final; cin >> allowed_for_final; int num_of_times_in_final; cin >> num_of_times_in_final; if (allowed_for_final == "TAK") { if (already_qualified < 10) { print_contestant(i); } else if (already_qualified < 20 and num_of_times_in_final < 2) { print_contestant(i); } } } } int main() { ios::sync_with_stdio(0); cin.tie(0); solve(); }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 | #include <bits/stdc++.h> using namespace std; #define FOR(i, b) for (int i = 0; i < b; ++i) #define sz(s) (int)s.size() #define all(s) s.begin(), s.end() #define mp make_pair #define pb push_back void solve() { int n; cin >> n; int already_qualified = 0; auto print_contestant = [&](int i) { ++already_qualified; cout << i + 1 << (already_qualified < 20 ? ' ' : '\n'); }; for (int i = 0; i < n; i++) { string allowed_for_final; cin >> allowed_for_final; int num_of_times_in_final; cin >> num_of_times_in_final; if (allowed_for_final == "TAK") { if (already_qualified < 10) { print_contestant(i); } else if (already_qualified < 20 and num_of_times_in_final < 2) { print_contestant(i); } } } } int main() { ios::sync_with_stdio(0); cin.tie(0); solve(); } |