Submission #683944

#	Time	Username	Problem	Language	Result	Execution time	Memory
683944		acm	Segments (IZhO18_segments)	C++17	100 / 100	1804 ms	8508 KiB

segments

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#include <bits/stdc++.h>
#include <emmintrin.h>
#include <x86intrin.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define precision     \
  cout.precision(30); \
  cerr.precision(10);
#define ll long long
#define ld long double
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
  freopen((name + ".in").c_str(), "r", stdin);
  freopen((name + ".out").c_str(), "w", stdout);
}
const int bl = 900;
int n, m, g, t, sz, lastans, a[2][200005], b[2][200005], c[2][200005],
    pos[200005];
pair<int, int> d[bl + 5], e[200005];
inline int kek(int l, int r, int x) {
  int new_ans = 0;
#pragma GCC ivdep
  for (int i = 1; i <= sz; i++)
    new_ans +=
        c[0][d[i].S] <= r - x + 1 && c[1][d[i].S] >= l + x - 1 && x <= d[i].F;
  int p = lower_bound(e + 1, e + m + 1, mp(x, 0)) - e;
  p = m - p + 1;
  for (int i = 1; i <= p; i++)
    new_ans += b[0][i] <= r - x + 1 && b[1][i] >= l + x - 1;
  return new_ans;
}
void mrg() {
  pair<int, int> tmp[sz + m + 5];
  merge(e + 1, e + m + 1, d + 1, d + sz + 1, tmp + 1);
  m += sz;
  sz = 0;
  for (int i = 1; i <= m; i++) e[i] = tmp[i];
}
void bld() {
  sort(d + 1, d + sz + 1);
  mrg();
  for (int i = 1; i <= m; i++)
    b[0][m - i + 1] = c[0][e[i].S], b[1][m - i + 1] = c[1][e[i].S],
                 pos[e[i].S] = m - i + 1;
}
int main() {
  speed;
  precision;
  // code
  cin >> n >> t;
  for (int i = 1; i <= n; i++) {
    int type, l, r, x;
    cin >> type;
    if (type == 1) {
      cin >> l >> r;
      l ^= t * lastans;
      r ^= t * lastans;
      if (l > r) swap(l, r);
      ++g;
      c[0][g] = l;
      c[1][g] = r;
      d[++sz] = mp(r - l + 1, g);
    }
    if (type == 2) {
      cin >> x;
      c[0][x] = 1e9;
      c[1][x] = -1e9;
      b[0][pos[x]] = 1e9;
      b[1][pos[x]] = -1e9;
    }
    if (type == 3) {
      cin >> l >> r >> x;
      l ^= t * lastans;
      r ^= t * lastans;
      if (l > r) swap(l, r);
      cout << (lastans = kek(l, r, x)) << "\n";
    }
    if (bl <= sz) bld();
  }
  // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

Compilation message (stderr)

segments.cpp: In function 'void ioi(std::string)':
segments.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   freopen((name + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
segments.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   freopen((name + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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