oj.uz

답안 #759023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
759023 2023-06-15T16:58:09 Z Sam_a17 Examination (JOI19_examination) C++17
41 / 100
 407 ms 30152 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;
    a += 1, b += 1;
    vec.push_back({a + b, {a, b}});
    compress.push_back(a);
    compress.push_back(b);
  }

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

  for(auto i: vec) {
    assert(i.second.first < N);
    ft.add(i.second.first, i.second.second);
  }

  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(vec[i].second.first, vec[i].second.second);
    for(auto j: adj[i]) {
      answ[j.second] = ft.sum(j.first.first, 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
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 11220 KB Output is correct
2 Correct 9 ms 11260 KB Output is correct
3 Correct 8 ms 11220 KB Output is correct
4 Runtime error 11 ms 16416 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 331 ms 24876 KB Output is correct
2 Correct 318 ms 27284 KB Output is correct
3 Correct 333 ms 27272 KB Output is correct
4 Correct 132 ms 24140 KB Output is correct
5 Correct 197 ms 29020 KB Output is correct
6 Correct 88 ms 24096 KB Output is correct
7 Correct 275 ms 27240 KB Output is correct
8 Correct 296 ms 27184 KB Output is correct
9 Correct 240 ms 27148 KB Output is correct
10 Correct 163 ms 29280 KB Output is correct
11 Correct 103 ms 23540 KB Output is correct
12 Correct 81 ms 24148 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 331 ms 24876 KB Output is correct
2 Correct 318 ms 27284 KB Output is correct
3 Correct 333 ms 27272 KB Output is correct
4 Correct 132 ms 24140 KB Output is correct
5 Correct 197 ms 29020 KB Output is correct
6 Correct 88 ms 24096 KB Output is correct
7 Correct 275 ms 27240 KB Output is correct
8 Correct 296 ms 27184 KB Output is correct
9 Correct 240 ms 27148 KB Output is correct
10 Correct 163 ms 29280 KB Output is correct
11 Correct 103 ms 23540 KB Output is correct
12 Correct 81 ms 24148 KB Output is correct
13 Correct 399 ms 28412 KB Output is correct
14 Correct 346 ms 28228 KB Output is correct
15 Correct 332 ms 27292 KB Output is correct
16 Correct 155 ms 25220 KB Output is correct
17 Correct 223 ms 30152 KB Output is correct
18 Correct 90 ms 24916 KB Output is correct
19 Correct 385 ms 28428 KB Output is correct
20 Correct 407 ms 28372 KB Output is correct
21 Correct 323 ms 28436 KB Output is correct
22 Correct 163 ms 29300 KB Output is correct
23 Correct 109 ms 23556 KB Output is correct
24 Correct 96 ms 24100 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 11220 KB Output is correct
2 Correct 9 ms 11260 KB Output is correct
3 Correct 8 ms 11220 KB Output is correct
4 Runtime error 11 ms 16416 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -