Submission #939435

#	Time	Username	Problem	Language	Result	Execution time	Memory
939435		AkibAzmain	Segments (IZhO18_segments)	C++17	7 / 100	5061 ms	7740 KiB

segments

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using ll = long long;
using namespace __gnu_pbds;
template < class key, class compare = less < key > >
using iset = tree < key, null_type, compare, rb_tree_tag,
                    tree_order_statistics_node_update >;

void
solve (int tc, int ttc)
{
  ll q, t;
  cin >> q >> t;
  map < ll, pair < ll, ll > > a;
  ll i = 1;
  ll las = 0;
  while (q--)
    {
      int o;
      cin >> o;
      if (o == 1)
        {
          ll x, y;
          cin >> x >> y;
          x ^= t * las;
          y ^= t * las;
          if (x > y) swap (x, y);
          a[i++] = { x, y };
        }
      else if (o == 2)
        {
          int id;
          cin >> id;
          a.erase (id);
        }
      else
        {
          ll x, y, k;
          cin >> x >> y >> k;
          x ^= t * las;
          y ^= t * las;
          if (x > y) swap (x, y);
          ll ans = 0;
          for (auto &s : a)
            if (min (s.second.second, y) - max (s.second.first, x) + 1 >= k)
              ++ans;
          cout << ans << '\n';
          las = ans;
        }
    }
}

int
main ()
{
  ios::sync_with_stdio (false);
  cin.tie (nullptr);
  int ttc = 1;
  // cin >> ttc;
  for (int tc = 1; tc <= ttc; ++tc) solve (tc, ttc);
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 15
• Subtask 3: 0 / 16
• Subtask 4: 0 / 17
• Subtask 5: 0 / 20
• Subtask 6: 0 / 25