fork download
  1. // ~~ icebear love attttt ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10. bool minimize(T &a, const T &b) {
  11. if (a > b) return a = b, true;
  12. return false;
  13. }
  14.  
  15. template<class T>
  16. bool maximize(T &a, const T &b) {
  17. if (a < b) return a = b, true;
  18. return false;
  19. }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "icebearat"
  33.  
  34. const int MOD = 1e9 + 7;
  35. const int inf = 1e9 + 27092008;
  36. const ll INF = 1e18 + 27092008;
  37. const int N = 2e5 + 5;
  38. int q, node[N << 2];
  39. map<int, stack<int>> st;
  40.  
  41. void update(int pos, int value) {
  42. int id = 1, l = 1, r = q;
  43. while(l < r) {
  44. int mid = (l + r) >> 1;
  45. if (pos > mid) id = (id << 1 | 1), l = mid + 1;
  46. else id = (id << 1), r = mid;
  47. }
  48. node[id] = value;
  49. while(id) {
  50. id >>= 1;
  51. node[id] = __gcd(node[id << 1], node[id << 1 | 1]);
  52. }
  53. }
  54.  
  55. void init(void) {
  56. cin >> q;
  57. }
  58.  
  59. void process(void) {
  60. FOR(i, 1, q) {
  61. int t, x;
  62. cin >> t >> x;
  63. if (t == 1) {
  64. update(i, x);
  65. st[x].push(i);
  66. }
  67. else {
  68. update(st[x].top(), 0);
  69. st[x].pop();
  70. }
  71. cout << node[1] << '\n';
  72. }
  73. }
  74.  
  75. int main() {
  76. ios_base::sync_with_stdio(0);
  77. cin.tie(0); cout.tie(0);
  78. if (fopen(task".inp", "r")) {
  79. freopen(task".inp", "r", stdin);
  80. freopen(task".out", "w", stdout);
  81. }
  82. int tc = 1;
  83. // cin >> tc;
  84. while(tc--) {
  85. init();
  86. process();
  87. }
  88. return 0;
  89. }
  90.  
  91.  
Success #stdin #stdout 0.01s 5288KB
stdin
Standard input is empty
stdout
Standard output is empty