oj.uz

Submission #759033

# Submission time Handle Problem Language Result Execution time Memory
759033 2023-06-15T17:07:54 Z Sam_a17 Examination (JOI19_examination) C++17
100 / 100
 420 ms 34072 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(Tree <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 

// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else if(str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
const int N = 1e5 + 500;
vector<pair<pair<int, int>, int>> adj[N];
vector<int> vi[N];
int n, q;

struct fenwick2 {
  int n;
  vector<int> tr;

  void init(int m) {
    n = m, tr.assign(m + 1, 0);
  }

  void upd(int u, int value) {
    while(u <= n) {
      tr[u] += value;
      u += u & (-u);
    }
  }
  
  int qry(int u) {
    int s = 0;
    while(u > 0) {
      s += tr[u];
      u -= u & (-u);
    }
    return s;
  }
  
  int sum(int l, int r) {
    return qry(r) - qry(l - 1);
  }
} fft[N];

struct fenwick {
  int n;
  void init(int m) {
    n = m;
  }

  void upd(int u, int value) {
    while(u <= n) {
      auto it = lower_bound(all(vi[u]), value);
      int curr = it - vi[u].begin() + 1;
      fft[u].upd(curr, 1);
      u += u & (-u);
    }
  }

  void add(int u, int value) {
    while(u <= n) {
      vi[u].push_back(value);
      u += u & (-u);
    }
  }
  
  int qry(int u, int up) {
    int s = 0;
    while(u > 0) {
      auto it = lower_bound(all(vi[u]), up);
      if(it != vi[u].end()) {
        int curr = it - vi[u].begin() + 1;
        s += fft[u].sum(curr, sz(fft[u].tr) - 2);
      }
      u -= u & (-u);
    }
    return s;
  }
  
  int sum(int l, int r, int value) {
    return qry(r, value) - qry(l - 1, value);
  }
} ft;

void solve_() {
  cin >> n >> q;
 
  vector<pair<int, pair<int, int>>> vec;

  vector<int> compress;
  for(int i = 1; i <= n; i++) {
    int a, b; cin >> a >> b;
    vec.push_back({a + b, {a, b}});
    compress.push_back(a);
  }

  sort(all(vec));
  sort(all(compress));
  uniq(compress);
  ft.init(N - 100);

  vector<int> cmp(n);
  int it = 0;
  for(auto i: vec) {
    // assert(i.second.first < N);
    cmp[it] = lower_bound(all(compress), i.second.first) - compress.begin() + 1;
    ft.add(cmp[it], i.second.second);
    it++;
  }

  for(int i = 0; i < N; i++) {
    sort(all(vi[i]));
    uniq(vi[i]);
    fft[i].init(sz(vi[i]) + 2);
  }

  for(int i = 1; i <= q; i++) {
    int x, y, z; cin >> x >> y >> z;
    // x += 1, y += 1, z += 2;
    auto it = lower_bound(all(vec), make_pair(z, make_pair(0, 0)));
    if(it != vec.end()) {
      adj[it - vec.begin()].push_back({{x, y}, i});
    }
  }

  vector<long long> answ(q + 1, 0);
  for(int i = n - 1; i >= 0; i--) {
    ft.upd(cmp[i], vec[i].second.second);
    for(auto j: adj[i]) {
      auto git = lower_bound(all(compress), j.first.first);
      if(git != compress.end()) {
        answ[j.second] = ft.sum(git - compress.begin() + 1, N - 201, j.first.second);
      }
    }
  }

  for(int i = 1; i <= q; i++) {
    cout << answ[i] << '\n';
  }
}

int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

examination.cpp: In function 'void setIO(std::string)':
examination.cpp:76:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:77:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:79:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:80:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11220 KB Output is correct
2 Correct 8 ms 11208 KB Output is correct
3 Correct 10 ms 11312 KB Output is correct
4 Correct 8 ms 11220 KB Output is correct
5 Correct 10 ms 11348 KB Output is correct
6 Correct 10 ms 11260 KB Output is correct
7 Correct 16 ms 12004 KB Output is correct
8 Correct 16 ms 11896 KB Output is correct
9 Correct 16 ms 11992 KB Output is correct
10 Correct 13 ms 11836 KB Output is correct
11 Correct 14 ms 12012 KB Output is correct
12 Correct 12 ms 11784 KB Output is correct
13 Correct 16 ms 11912 KB Output is correct
14 Correct 16 ms 11980 KB Output is correct
15 Correct 16 ms 11952 KB Output is correct
16 Correct 14 ms 11988 KB Output is correct
17 Correct 12 ms 11732 KB Output is correct
18 Correct 14 ms 11656 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 24380 KB Output is correct
2 Correct 320 ms 24484 KB Output is correct
3 Correct 310 ms 24400 KB Output is correct
4 Correct 144 ms 21852 KB Output is correct
5 Correct 207 ms 27316 KB Output is correct
6 Correct 96 ms 23036 KB Output is correct
7 Correct 261 ms 24360 KB Output is correct
8 Correct 300 ms 24484 KB Output is correct
9 Correct 239 ms 24392 KB Output is correct
10 Correct 151 ms 27508 KB Output is correct
11 Correct 120 ms 21352 KB Output is correct
12 Correct 77 ms 23064 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 24380 KB Output is correct
2 Correct 320 ms 24484 KB Output is correct
3 Correct 310 ms 24400 KB Output is correct
4 Correct 144 ms 21852 KB Output is correct
5 Correct 207 ms 27316 KB Output is correct
6 Correct 96 ms 23036 KB Output is correct
7 Correct 261 ms 24360 KB Output is correct
8 Correct 300 ms 24484 KB Output is correct
9 Correct 239 ms 24392 KB Output is correct
10 Correct 151 ms 27508 KB Output is correct
11 Correct 120 ms 21352 KB Output is correct
12 Correct 77 ms 23064 KB Output is correct
13 Correct 368 ms 25144 KB Output is correct
14 Correct 361 ms 25064 KB Output is correct
15 Correct 331 ms 24408 KB Output is correct
16 Correct 187 ms 22696 KB Output is correct
17 Correct 265 ms 27776 KB Output is correct
18 Correct 93 ms 23744 KB Output is correct
19 Correct 383 ms 25184 KB Output is correct
20 Correct 355 ms 25140 KB Output is correct
21 Correct 375 ms 25176 KB Output is correct
22 Correct 180 ms 27520 KB Output is correct
23 Correct 106 ms 21292 KB Output is correct
24 Correct 96 ms 23052 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11220 KB Output is correct
2 Correct 8 ms 11208 KB Output is correct
3 Correct 10 ms 11312 KB Output is correct
4 Correct 8 ms 11220 KB Output is correct
5 Correct 10 ms 11348 KB Output is correct
6 Correct 10 ms 11260 KB Output is correct
7 Correct 16 ms 12004 KB Output is correct
8 Correct 16 ms 11896 KB Output is correct
9 Correct 16 ms 11992 KB Output is correct
10 Correct 13 ms 11836 KB Output is correct
11 Correct 14 ms 12012 KB Output is correct
12 Correct 12 ms 11784 KB Output is correct
13 Correct 16 ms 11912 KB Output is correct
14 Correct 16 ms 11980 KB Output is correct
15 Correct 16 ms 11952 KB Output is correct
16 Correct 14 ms 11988 KB Output is correct
17 Correct 12 ms 11732 KB Output is correct
18 Correct 14 ms 11656 KB Output is correct
19 Correct 323 ms 24380 KB Output is correct
20 Correct 320 ms 24484 KB Output is correct
21 Correct 310 ms 24400 KB Output is correct
22 Correct 144 ms 21852 KB Output is correct
23 Correct 207 ms 27316 KB Output is correct
24 Correct 96 ms 23036 KB Output is correct
25 Correct 261 ms 24360 KB Output is correct
26 Correct 300 ms 24484 KB Output is correct
27 Correct 239 ms 24392 KB Output is correct
28 Correct 151 ms 27508 KB Output is correct
29 Correct 120 ms 21352 KB Output is correct
30 Correct 77 ms 23064 KB Output is correct
31 Correct 368 ms 25144 KB Output is correct
32 Correct 361 ms 25064 KB Output is correct
33 Correct 331 ms 24408 KB Output is correct
34 Correct 187 ms 22696 KB Output is correct
35 Correct 265 ms 27776 KB Output is correct
36 Correct 93 ms 23744 KB Output is correct
37 Correct 383 ms 25184 KB Output is correct
38 Correct 355 ms 25140 KB Output is correct
39 Correct 375 ms 25176 KB Output is correct
40 Correct 180 ms 27520 KB Output is correct
41 Correct 106 ms 21292 KB Output is correct
42 Correct 96 ms 23052 KB Output is correct
43 Correct 397 ms 30612 KB Output is correct
44 Correct 417 ms 30460 KB Output is correct
45 Correct 420 ms 30428 KB Output is correct
46 Correct 202 ms 26292 KB Output is correct
47 Correct 254 ms 33256 KB Output is correct
48 Correct 111 ms 23220 KB Output is correct
49 Correct 346 ms 30196 KB Output is correct
50 Correct 369 ms 30364 KB Output is correct
51 Correct 290 ms 30192 KB Output is correct
52 Correct 203 ms 34072 KB Output is correct
53 Correct 117 ms 24132 KB Output is correct