oj.uz

Submission #997996

# Submission time Handle Problem Language Result Execution time Memory
997996 2024-06-13T07:36:35 Z vjudge1 Examination (JOI19_examination) C++17
100 / 100
 410 ms 29472 KB 
#include<bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")
 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); i++)
#define Fore(i, a, b) for (auto i = (a); i >= (b); i--)
#define FOR(i, a, b) for (auto i = (a); i <= (b); i++)
#define ret(s) return void(cout << s);
 
const int mod = 1e9 + 7, mod2 = 998244353;
const double PI = acos(-1), eps = 1e-9;
const ull npos = string::npos;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using cd = complex<double>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<cd> vcd;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;
 
ll add(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a+=b;return a >= m ? a - m: a;}
ll sub(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a-=b;return a < 0 ? a + m: a;}
ll mul(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;return a*b % m;}
ll bin_mul(ll a, ll b, ll m) {if (a >= m) a%=m;if (b >= m) b%=m;ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;}
ll power(ll a, ll b, int m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b) {return (a + b - 1)/b;}
ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); i++) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; i++) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; i++) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; i++) {if (n % i == 0) {int k = 0; while (n % i == 0) k++, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
int Log2(int n) {return 31 - __builtin_clz(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}
 
template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; while (a > 0) {s+=(int)a % 10 + '0'; a/=10;} Reverse(s); out << s; return out;}
 
template<class T>
struct BIT {
    int n;
    vector<T> bit;
    void init(int N) {
        n = N;
        bit.resize(n + 1);
    }
    void build(const vector<T> &a) {
        for (int i = 1; i <= n; i++) set(i, a[i]);
    }
    void set(int i, T v) {
        for (; i <= n; i+=i & (-i)) bit[i]+=v;
    }
    T get(int i) {
        T x = 0;
        for (; i; i-=i & (-i)) x+=bit[i];
        return x;
    }
    T get(int l, int r) {
        return get(r) - get(l - 1);
    }
};
BIT<int> b;
struct stu {
    int x, y, z, i;
    stu() {}
};
const int N = 2e5 + 5;
vector<stu> t[4*N];
int n, q, ans[N], pos[N];
stu a[N];
void cdq(int l, int r) {
    if (l == r) return;
    int m = (l + r) >> 1;
    cdq(l, m); cdq(m + 1, r);
    int i = 0, j = 0, s = 0;
    vi u;
    vector<stu> c(a + l, a + m + 1), d(a + m + 1, a + r + 1);
    // while (i <= m && j <= r) {
    //     if (a[i].y >= a[j].y) s++, b.set(pos[i], 1), u.pb(pos[i]);
    //     else ans[a[j].i]+=s - b.get(pos[j] - 1);
    // }
    sort(all(c), [](stu x, stu y){
        return x.y > y.y;
    });
    sort(all(d), [](stu x, stu y){
        return x.y > y.y;
    });
    // cout << l << ' ' << r << '\n';
    // trav(i,c) cout << vi{i.i,i.x,i.y,i.z} << '\n';
    // cout << '\n';
    // trav(i,d) cout << vi{i.i,i.x,i.y,i.z} << '\n';
    // cout << '\n';
    while (i < sz(c) && j < sz(d)) {
        if (c[i].y >= d[j].y) {
            if (c[i].i <= n) s++, b.set(pos[c[i].i], 1), u.pb(pos[c[i].i]);
            i++;
        } else {
            if (d[j].i > n) ans[d[j].i]+=s - b.get(pos[d[j].i] - 1);
            j++;
        }
    }
    while (j < sz(d)) {
        if (d[j].i > n) ans[d[j].i]+=s - b.get(pos[d[j].i] - 1);
        j++;
    }
    trav(i,u) b.set(i, -1);
    // cout << "ans: ";
    // FOR(i,1,n+q) cout << ans[i] << ' ';
    // cout << '\n';
    // FOR(i,l,r) a[i] = c[i - l];
    // if (l == 1 && r == 9) {
    //     FOR(i,l,r) cout << vi{a[i].i,a[i].x,a[i].y,a[i].z} << '\n';
    // }
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
    cin >> n >> q;
    FOR(i,1,n) cin >> a[i].x >> a[i].y, a[i].z = a[i].x + a[i].y, a[i].i = i;
    FOR(i,n+1,n+q) cin >> a[i].x >> a[i].y >> a[i].z, a[i].i = i;
    sort(a + 1, a + n + q + 1, [](stu x, stu y){
        return make_tuple(x.x, x.y, x.z, -x.i) > make_tuple(y.x, y.y, y.z, -y.i);
    });
    b.init(n + q + 5);
    vi com;
    FOR(i,1,n+q) com.pb(a[i].z);
    Unique(com);
    FOR(i,1,n+q) pos[a[i].i] = Lower(com, a[i].z) + 1;
    // FOR(i,1,n+q) cout << vi{a[i].i,a[i].x,a[i].y,a[i].z} << '\n';
    // cout << '\n';
    cdq(1, n + q);
    FOR(i,n+1,n+q) cout << ans[i] << '\n';
    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 21596 KB Output is correct
2 Correct 5 ms 21596 KB Output is correct
3 Correct 5 ms 21736 KB Output is correct
4 Correct 5 ms 21596 KB Output is correct
5 Correct 6 ms 21596 KB Output is correct
6 Correct 5 ms 21596 KB Output is correct
7 Correct 12 ms 21832 KB Output is correct
8 Correct 12 ms 21948 KB Output is correct
9 Correct 12 ms 21852 KB Output is correct
10 Correct 13 ms 21852 KB Output is correct
11 Correct 11 ms 21852 KB Output is correct
12 Correct 9 ms 21852 KB Output is correct
13 Correct 11 ms 21852 KB Output is correct
14 Correct 11 ms 21920 KB Output is correct
15 Correct 12 ms 21852 KB Output is correct
16 Correct 9 ms 21968 KB Output is correct
17 Correct 10 ms 21980 KB Output is correct
18 Correct 9 ms 21852 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 29040 KB Output is correct
2 Correct 330 ms 29020 KB Output is correct
3 Correct 331 ms 28988 KB Output is correct
4 Correct 264 ms 29024 KB Output is correct
5 Correct 243 ms 29020 KB Output is correct
6 Correct 186 ms 28988 KB Output is correct
7 Correct 317 ms 29440 KB Output is correct
8 Correct 322 ms 28992 KB Output is correct
9 Correct 314 ms 29436 KB Output is correct
10 Correct 230 ms 29024 KB Output is correct
11 Correct 213 ms 29024 KB Output is correct
12 Correct 172 ms 28564 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 29040 KB Output is correct
2 Correct 330 ms 29020 KB Output is correct
3 Correct 331 ms 28988 KB Output is correct
4 Correct 264 ms 29024 KB Output is correct
5 Correct 243 ms 29020 KB Output is correct
6 Correct 186 ms 28988 KB Output is correct
7 Correct 317 ms 29440 KB Output is correct
8 Correct 322 ms 28992 KB Output is correct
9 Correct 314 ms 29436 KB Output is correct
10 Correct 230 ms 29024 KB Output is correct
11 Correct 213 ms 29024 KB Output is correct
12 Correct 172 ms 28564 KB Output is correct
13 Correct 361 ms 29088 KB Output is correct
14 Correct 339 ms 28992 KB Output is correct
15 Correct 327 ms 28992 KB Output is correct
16 Correct 285 ms 29036 KB Output is correct
17 Correct 283 ms 28992 KB Output is correct
18 Correct 189 ms 28996 KB Output is correct
19 Correct 372 ms 28988 KB Output is correct
20 Correct 349 ms 28988 KB Output is correct
21 Correct 349 ms 29204 KB Output is correct
22 Correct 226 ms 28992 KB Output is correct
23 Correct 211 ms 29024 KB Output is correct
24 Correct 176 ms 28556 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 21596 KB Output is correct
2 Correct 5 ms 21596 KB Output is correct
3 Correct 5 ms 21736 KB Output is correct
4 Correct 5 ms 21596 KB Output is correct
5 Correct 6 ms 21596 KB Output is correct
6 Correct 5 ms 21596 KB Output is correct
7 Correct 12 ms 21832 KB Output is correct
8 Correct 12 ms 21948 KB Output is correct
9 Correct 12 ms 21852 KB Output is correct
10 Correct 13 ms 21852 KB Output is correct
11 Correct 11 ms 21852 KB Output is correct
12 Correct 9 ms 21852 KB Output is correct
13 Correct 11 ms 21852 KB Output is correct
14 Correct 11 ms 21920 KB Output is correct
15 Correct 12 ms 21852 KB Output is correct
16 Correct 9 ms 21968 KB Output is correct
17 Correct 10 ms 21980 KB Output is correct
18 Correct 9 ms 21852 KB Output is correct
19 Correct 326 ms 29040 KB Output is correct
20 Correct 330 ms 29020 KB Output is correct
21 Correct 331 ms 28988 KB Output is correct
22 Correct 264 ms 29024 KB Output is correct
23 Correct 243 ms 29020 KB Output is correct
24 Correct 186 ms 28988 KB Output is correct
25 Correct 317 ms 29440 KB Output is correct
26 Correct 322 ms 28992 KB Output is correct
27 Correct 314 ms 29436 KB Output is correct
28 Correct 230 ms 29024 KB Output is correct
29 Correct 213 ms 29024 KB Output is correct
30 Correct 172 ms 28564 KB Output is correct
31 Correct 361 ms 29088 KB Output is correct
32 Correct 339 ms 28992 KB Output is correct
33 Correct 327 ms 28992 KB Output is correct
34 Correct 285 ms 29036 KB Output is correct
35 Correct 283 ms 28992 KB Output is correct
36 Correct 189 ms 28996 KB Output is correct
37 Correct 372 ms 28988 KB Output is correct
38 Correct 349 ms 28988 KB Output is correct
39 Correct 349 ms 29204 KB Output is correct
40 Correct 226 ms 28992 KB Output is correct
41 Correct 211 ms 29024 KB Output is correct
42 Correct 176 ms 28556 KB Output is correct
43 Correct 410 ms 29032 KB Output is correct
44 Correct 371 ms 29040 KB Output is correct
45 Correct 369 ms 29028 KB Output is correct
46 Correct 295 ms 28992 KB Output is correct
47 Correct 289 ms 28992 KB Output is correct
48 Correct 240 ms 29032 KB Output is correct
49 Correct 374 ms 29432 KB Output is correct
50 Correct 396 ms 29092 KB Output is correct
51 Correct 391 ms 29472 KB Output is correct
52 Correct 267 ms 28984 KB Output is correct
53 Correct 241 ms 28932 KB Output is correct