#include <algorithm> #include <deque> #include <functional> #include <iostream> #include <ostream> #include <queue> #include <random> #include <set> #include <map> #include<unordered_map> #include<unordered_set> #define q_map unordered_map #define q_set unordered_set #define pb push_back #define fst first #define nd second #define ll long long #define ld long double #define mp make_pair #define INF 100000007; using namespace std; const int max_size = 1000000; const int max_size_square = 1000; vector<pair<ll, ll>> G[max_size]; bool ODW[max_size]; int array_t[max_size]; queue<int> kolejka; void BFS(int w) { ODW[w] = true; kolejka.push(w); cout << w << endl; while (kolejka.empty() == false) { int n = kolejka.front(); kolejka.pop(); int rozmiar = G[n].size(); for (int i = 0; i < rozmiar; i++) { if (ODW[G[n][i].fst] == false) { kolejka.push(G[n][i].fst); ODW[G[n][i].fst] = true; cout << G[n][i].fst << endl; } } } } void DFS(ll w) { ODW[w] = true; int rozmiar = G[w].size(); for (int i = 0; i < rozmiar; i++) { if (!ODW[G[w][i].fst]) { ODW[G[w][i].fst] = true; DFS(G[w][i].fst); } } } ll LAS(ll* S, ll n) { long long local_min[max_size]; local_min[0] = -INF; for (int i = 1; i <= n; i++) { local_min[i] = INF; } for (int i = 0; i < n; i++) { int index = lower_bound(local_min, local_min + n + 1, S[i]) - local_min; if (S[i] < local_min[index - 1]) { local_min[index - 1] = S[i]; } else { local_min[index] = S[i]; } } int maxi = 0; for (int i = 0; i <= n; i++) { if (abs(local_min[i]) != 100000007) { maxi = i; } } return maxi; } ll newton_symbol(ll n, ll k) { if (k < 0) { return 0; } if (k == 0) { return 1; } if (k == 1) { return n; } if (k > 1) { ll res = 1; while (k > 0) { res *= (n - k + 1); res /= k; k--; } return res; } } template <class A> void save(A* tab, A* tab_end) { while (tab != tab_end) { cin >> *tab; tab++; } } template <class A> void write(A* tab, A* tab_end) { while (tab != tab_end) { cout << *tab << " "; tab++; } cout << endl; } ll gcd_extended(ll a, ll b, ll* x, ll* y) { if (a == 0) { *x = 0; *y = 1; return b; } ll x1, y1; ll gcd = gcd_extended(b % a, a, &x1, &y1); *x = y1 - (b / a) * x1; *y = x1; return gcd; } ll mod_inverse(ll A, ll M) { ll x, y; ll g = gcd_extended(A, M, &x, &y); if (g == 1) { return -1; } else { return (x % M + M) % M; } } ll pow_mod(ld a, ll n, ld M) { if (n == 0) { return fmod(a, M); } if (n % 2 == 1) { return fmod(pow_mod(a, n - 1, M) * a, M); } else { return fmod(pow_mod(a, n / 2, M) * pow_mod(a, n / 2, M), M); } } bool is_prime_fermat(ll p) { bool is_prime = true; for (int i = 0; i < 20; i++) { ll a = (rand() % (p - 3)) + 2; is_prime = (pow_mod(a, p - 1, p) % p) == 1; if (!is_prime) { is_prime; } } return is_prime; } class interval_tree { public: int size_t; int tab[2 * max_size + 1]; interval_tree(int size) { int lon = log2(size) + 1; size_t = pow(2, lon); cout << size_t << endl; for (int j = 0; j < size; j++) { tab[size_t + j] = array_t[j]; } for (int j = size_t - 1; j >= 1; j--) { tab[j] = tab[2 * j] + tab[2 * j + 1]; } } void change(int i, int val) { int x = val - tab[size_t + i - 1]; int index = size_t + i - 1; while (index > 0) { tab[index] += x; index /= 2; } } long long SUM_prefix(int i) { long long wynik = 0; vector<int> bit_i; int c = i; long long licznik = 1; int tmp = size_t; while (c > 0) { if (c % 2 == 1) { bit_i.push_back(licznik); } c /= 2; licznik *= 2; } reverse(bit_i.begin(), bit_i.end()); for (auto a : bit_i) { int k = a; int w = tmp; while (k > 1) { w /= 2; k /= 2; } wynik += tab[w]; tmp = tmp + a; } return wynik; } long long SUM(int l, int r) { return SUM_prefix(r) - SUM_prefix(l - 1); } }; int LCS(string a, string b) { int tab[max_size_square + 1][max_size_square + 1]; for (int i = 0; i <= a.size(); i++) { tab[i][0] = 0; } for (int j = 0; j <= b.size(); j++) { tab[0][j] = 0; } for (int i = 1; i <= a.size(); i++) { for (int j = 1; j <= b.size(); j++) { if (a[i - 1] == b[j - 1]) { tab[i][j] = tab[i - 1][j - 1] + 1; } else { tab[i][j] = max(tab[i - 1][j], tab[i][j - 1]); } } } return tab[a.size()][b.size()]; } int main() { int n; cin >> n; vector<int> awans; vector<pair<int, int>> chca; for (int i = 1;i <= n;i++) { string s; int x; cin >> s >> x; if (s == "TAK") { chca.pb(mp(i, x)); } } for (int i = 0;i < 10;i++) { awans.pb(chca[i].first); } int counter = 0; int i = 10; while (counter < 10 && i<chca.size()) { if (chca[i].second < 2) { awans.pb(chca[i].first); counter++; } i++; } for (int j = 0;j < 20;j++) { cout << awans[j] << " "; } }
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 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 | #include <algorithm> #include <deque> #include <functional> #include <iostream> #include <ostream> #include <queue> #include <random> #include <set> #include <map> #include<unordered_map> #include<unordered_set> #define q_map unordered_map #define q_set unordered_set #define pb push_back #define fst first #define nd second #define ll long long #define ld long double #define mp make_pair #define INF 100000007; using namespace std; const int max_size = 1000000; const int max_size_square = 1000; vector<pair<ll, ll>> G[max_size]; bool ODW[max_size]; int array_t[max_size]; queue<int> kolejka; void BFS(int w) { ODW[w] = true; kolejka.push(w); cout << w << endl; while (kolejka.empty() == false) { int n = kolejka.front(); kolejka.pop(); int rozmiar = G[n].size(); for (int i = 0; i < rozmiar; i++) { if (ODW[G[n][i].fst] == false) { kolejka.push(G[n][i].fst); ODW[G[n][i].fst] = true; cout << G[n][i].fst << endl; } } } } void DFS(ll w) { ODW[w] = true; int rozmiar = G[w].size(); for (int i = 0; i < rozmiar; i++) { if (!ODW[G[w][i].fst]) { ODW[G[w][i].fst] = true; DFS(G[w][i].fst); } } } ll LAS(ll* S, ll n) { long long local_min[max_size]; local_min[0] = -INF; for (int i = 1; i <= n; i++) { local_min[i] = INF; } for (int i = 0; i < n; i++) { int index = lower_bound(local_min, local_min + n + 1, S[i]) - local_min; if (S[i] < local_min[index - 1]) { local_min[index - 1] = S[i]; } else { local_min[index] = S[i]; } } int maxi = 0; for (int i = 0; i <= n; i++) { if (abs(local_min[i]) != 100000007) { maxi = i; } } return maxi; } ll newton_symbol(ll n, ll k) { if (k < 0) { return 0; } if (k == 0) { return 1; } if (k == 1) { return n; } if (k > 1) { ll res = 1; while (k > 0) { res *= (n - k + 1); res /= k; k--; } return res; } } template <class A> void save(A* tab, A* tab_end) { while (tab != tab_end) { cin >> *tab; tab++; } } template <class A> void write(A* tab, A* tab_end) { while (tab != tab_end) { cout << *tab << " "; tab++; } cout << endl; } ll gcd_extended(ll a, ll b, ll* x, ll* y) { if (a == 0) { *x = 0; *y = 1; return b; } ll x1, y1; ll gcd = gcd_extended(b % a, a, &x1, &y1); *x = y1 - (b / a) * x1; *y = x1; return gcd; } ll mod_inverse(ll A, ll M) { ll x, y; ll g = gcd_extended(A, M, &x, &y); if (g == 1) { return -1; } else { return (x % M + M) % M; } } ll pow_mod(ld a, ll n, ld M) { if (n == 0) { return fmod(a, M); } if (n % 2 == 1) { return fmod(pow_mod(a, n - 1, M) * a, M); } else { return fmod(pow_mod(a, n / 2, M) * pow_mod(a, n / 2, M), M); } } bool is_prime_fermat(ll p) { bool is_prime = true; for (int i = 0; i < 20; i++) { ll a = (rand() % (p - 3)) + 2; is_prime = (pow_mod(a, p - 1, p) % p) == 1; if (!is_prime) { is_prime; } } return is_prime; } class interval_tree { public: int size_t; int tab[2 * max_size + 1]; interval_tree(int size) { int lon = log2(size) + 1; size_t = pow(2, lon); cout << size_t << endl; for (int j = 0; j < size; j++) { tab[size_t + j] = array_t[j]; } for (int j = size_t - 1; j >= 1; j--) { tab[j] = tab[2 * j] + tab[2 * j + 1]; } } void change(int i, int val) { int x = val - tab[size_t + i - 1]; int index = size_t + i - 1; while (index > 0) { tab[index] += x; index /= 2; } } long long SUM_prefix(int i) { long long wynik = 0; vector<int> bit_i; int c = i; long long licznik = 1; int tmp = size_t; while (c > 0) { if (c % 2 == 1) { bit_i.push_back(licznik); } c /= 2; licznik *= 2; } reverse(bit_i.begin(), bit_i.end()); for (auto a : bit_i) { int k = a; int w = tmp; while (k > 1) { w /= 2; k /= 2; } wynik += tab[w]; tmp = tmp + a; } return wynik; } long long SUM(int l, int r) { return SUM_prefix(r) - SUM_prefix(l - 1); } }; int LCS(string a, string b) { int tab[max_size_square + 1][max_size_square + 1]; for (int i = 0; i <= a.size(); i++) { tab[i][0] = 0; } for (int j = 0; j <= b.size(); j++) { tab[0][j] = 0; } for (int i = 1; i <= a.size(); i++) { for (int j = 1; j <= b.size(); j++) { if (a[i - 1] == b[j - 1]) { tab[i][j] = tab[i - 1][j - 1] + 1; } else { tab[i][j] = max(tab[i - 1][j], tab[i][j - 1]); } } } return tab[a.size()][b.size()]; } int main() { int n; cin >> n; vector<int> awans; vector<pair<int, int>> chca; for (int i = 1;i <= n;i++) { string s; int x; cin >> s >> x; if (s == "TAK") { chca.pb(mp(i, x)); } } for (int i = 0;i < 10;i++) { awans.pb(chca[i].first); } int counter = 0; int i = 10; while (counter < 10 && i<chca.size()) { if (chca[i].second < 2) { awans.pb(chca[i].first); counter++; } i++; } for (int j = 0;j < 20;j++) { cout << awans[j] << " "; } } |