#define debug 0 #include <bits/stdc++.h> #define fastio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define perf 1 #define st first #define nd second #define remin(a,b) a=min(a,b); #define remax(a,b) a=max(a,b); #define mod 998244353 //#define mod 1'000'000'007 using namespace std; void solve() { int n; cin >> n; vector<int> v; for (int i = 0; i < n; ++i) { int x; string s; cin >> s >> x; if (s == "TAK") { if (v.size() < 20) { if (v.size() < 10) { v.emplace_back(i+1); } else if (x < 2) { v.emplace_back(i+1); } } } } for (int i : v) cout << i << ' '; cout << '\n'; } int main() { fastio(); int t=1; //cin >> t; while (t--) { solve(); } return 0; }
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 | #define debug 0 #include <bits/stdc++.h> #define fastio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define perf 1 #define st first #define nd second #define remin(a,b) a=min(a,b); #define remax(a,b) a=max(a,b); #define mod 998244353 //#define mod 1'000'000'007 using namespace std; void solve() { int n; cin >> n; vector<int> v; for (int i = 0; i < n; ++i) { int x; string s; cin >> s >> x; if (s == "TAK") { if (v.size() < 20) { if (v.size() < 10) { v.emplace_back(i+1); } else if (x < 2) { v.emplace_back(i+1); } } } } for (int i : v) cout << i << ' '; cout << '\n'; } int main() { fastio(); int t=1; //cin >> t; while (t--) { solve(); } return 0; } |