oj.uz

답안 #998643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998643 2024-06-14T12:02:49 Z VMaksimoski008 Examination (JOI19_examination) C++17
100 / 100
 715 ms 96108 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

// Query/Update: O(Nlog^2N)
// Memory: O(NlogN)
struct BIT_2D_Offline {
	int n;
	vector<vector<int> > tree, vals;

	BIT_2D_Offline(int n, vector<pii> &U) : n(n), vals(n+1), tree(n+1) {
		sort(U.begin(), U.end(), [&](pii &a, pii &b) { return a.second < b.second; });
		for(int i=1; i<=n; i++) vals[i].push_back( -1 );

		for(auto &[x, y]: U)
			for(; x<=n; x+=x&-x)
				if(vals[x].back() != y) vals[x].push_back(y);

		for(int i=1; i<=n; i++) tree[i].resize( vals[i].size() );
	}

	int getId(int i, int v) {
		return upper_bound( vals[i].begin(), vals[i].end(), v ) - vals[i].begin() - 1;
	}

	void update(int x, int y, int v) {
		for(; x<=n; x+=x&-x)
			for(int p=getId(x, y); p<tree[x].size(); p+=p&-p) tree[x][p] += v;
	}

	int Q(int x, int y) {
		if(x <= 0 || y <= 0) return 0;
		int ans = 0;
		for(; x; x-=x&-x)
			for(int p=getId(x, y); p; p-=p&-p) ans += tree[x][p];
		return ans;
	}

	int query(int x1, int y1, int x2, int y2) {
		if(x1 > x2 || y1 > y2) return 0;
		return Q(x2, y2) - Q(x1-1, y2) - Q(x2, y1-1) + Q(x1-1, y1-1);
	}
};

int32_t main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    int n, q;
    cin >> n >> q;

    vector<pii> v(n);
    set<int> s; s.insert(0);

    for(pii &x : v) {
        cin >> x.first >> x.second;
        x.first++, x.second++;
        s.insert(x.first);
        s.insert(x.second);
    }

    vector<array<int, 4> > qus(q);
    for(int i=0; i<q; i++) {
        cin >> qus[i][0] >> qus[i][1] >> qus[i][2];
        qus[i][0]++; qus[i][1]++; qus[i][2] += 2;
        qus[i][3] = i;
        s.insert(qus[i][0]);
        s.insert(qus[i][1]);
        s.insert(qus[i][2]);
    }

    vector<int> comp(all(s));
    vector<pii> U;
    for(auto &x : v) {
        x.first = lower_bound(comp.begin(), comp.end(), x.first) - comp.begin();
        x.second = lower_bound(comp.begin(), comp.end(), x.second) - comp.begin();
        U.push_back(x);
    }

    for(auto &x : qus) {
        x[0] = lower_bound(comp.begin(), comp.end(), x[0]) - comp.begin();
        x[1] = lower_bound(comp.begin(), comp.end(), x[1]) - comp.begin();
        x[2] = lower_bound(comp.begin(), comp.end(), x[2]) - comp.begin();
    }

    BIT_2D_Offline bit(5*n+5, U);

    sort(qus.begin(), qus.end(), [&](array<int, 4> &a, array<int, 4> &b) {
        return a[2] > b[2];
    });

    sort(v.begin(), v.end(), [&](pii &a, pii &b) {
        return comp[a.first] + comp[a.second] > comp[b.first] + comp[b.second];
    });

    vector<int> ans(q);

    int j=-1;
    for(auto &qu : qus) {
        while(j+1 < n && comp[v[j+1].first] + comp[v[j+1].second] >= comp[qu[2]]) {
            j++;
            //cout << v[j].first << " " << v[j].second << '\n';
            bit.update(v[j].first, v[j].second, 1);
        }

        //cout << "! " << qu[0] << " " << qu[1] << '\n';
        ans[qu[3]] = bit.query(qu[0], qu[1], 5*n, 5*n);
    }

    for(int &x : ans) cout << x << '\n';
    return 0;
}

Compilation message

examination.cpp: In constructor 'BIT_2D_Offline::BIT_2D_Offline(int, std::vector<std::pair<int, int> >&)':
examination.cpp:25:29: warning: 'BIT_2D_Offline::vals' will be initialized after [-Wreorder]
   25 |  vector<vector<int> > tree, vals;
      |                             ^~~~
examination.cpp:25:23: warning:   'std::vector<std::vector<int> > BIT_2D_Offline::tree' [-Wreorder]
   25 |  vector<vector<int> > tree, vals;
      |                       ^~~~
examination.cpp:27:2: warning:   when initialized here [-Wreorder]
   27 |  BIT_2D_Offline(int n, vector<pii> &U) : n(n), vals(n+1), tree(n+1) {
      |  ^~~~~~~~~~~~~~
examination.cpp: In member function 'void BIT_2D_Offline::update(int, int, int)':
examination.cpp:44:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |    for(int p=getId(x, y); p<tree[x].size(); p+=p&-p) tree[x][p] += v;
      |                           ~^~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 11 ms 3164 KB Output is correct
8 Correct 12 ms 3164 KB Output is correct
9 Correct 11 ms 3160 KB Output is correct
10 Correct 7 ms 2652 KB Output is correct
11 Correct 8 ms 2908 KB Output is correct
12 Correct 3 ms 2140 KB Output is correct
13 Correct 9 ms 2908 KB Output is correct
14 Correct 10 ms 2972 KB Output is correct
15 Correct 9 ms 2904 KB Output is correct
16 Correct 7 ms 2768 KB Output is correct
17 Correct 6 ms 2652 KB Output is correct
18 Correct 4 ms 2140 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 441 ms 71500 KB Output is correct
2 Correct 421 ms 71628 KB Output is correct
3 Correct 437 ms 71628 KB Output is correct
4 Correct 219 ms 64452 KB Output is correct
5 Correct 292 ms 72904 KB Output is correct
6 Correct 115 ms 59344 KB Output is correct
7 Correct 412 ms 71880 KB Output is correct
8 Correct 416 ms 71792 KB Output is correct
9 Correct 357 ms 71300 KB Output is correct
10 Correct 270 ms 72904 KB Output is correct
11 Correct 178 ms 63368 KB Output is correct
12 Correct 91 ms 58872 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 441 ms 71500 KB Output is correct
2 Correct 421 ms 71628 KB Output is correct
3 Correct 437 ms 71628 KB Output is correct
4 Correct 219 ms 64452 KB Output is correct
5 Correct 292 ms 72904 KB Output is correct
6 Correct 115 ms 59344 KB Output is correct
7 Correct 412 ms 71880 KB Output is correct
8 Correct 416 ms 71792 KB Output is correct
9 Correct 357 ms 71300 KB Output is correct
10 Correct 270 ms 72904 KB Output is correct
11 Correct 178 ms 63368 KB Output is correct
12 Correct 91 ms 58872 KB Output is correct
13 Correct 486 ms 73504 KB Output is correct
14 Correct 462 ms 71484 KB Output is correct
15 Correct 443 ms 71880 KB Output is correct
16 Correct 258 ms 64752 KB Output is correct
17 Correct 329 ms 73416 KB Output is correct
18 Correct 113 ms 59340 KB Output is correct
19 Correct 508 ms 73676 KB Output is correct
20 Correct 488 ms 72908 KB Output is correct
21 Correct 466 ms 73680 KB Output is correct
22 Correct 257 ms 73048 KB Output is correct
23 Correct 189 ms 63432 KB Output is correct
24 Correct 96 ms 58832 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 11 ms 3164 KB Output is correct
8 Correct 12 ms 3164 KB Output is correct
9 Correct 11 ms 3160 KB Output is correct
10 Correct 7 ms 2652 KB Output is correct
11 Correct 8 ms 2908 KB Output is correct
12 Correct 3 ms 2140 KB Output is correct
13 Correct 9 ms 2908 KB Output is correct
14 Correct 10 ms 2972 KB Output is correct
15 Correct 9 ms 2904 KB Output is correct
16 Correct 7 ms 2768 KB Output is correct
17 Correct 6 ms 2652 KB Output is correct
18 Correct 4 ms 2140 KB Output is correct
19 Correct 441 ms 71500 KB Output is correct
20 Correct 421 ms 71628 KB Output is correct
21 Correct 437 ms 71628 KB Output is correct
22 Correct 219 ms 64452 KB Output is correct
23 Correct 292 ms 72904 KB Output is correct
24 Correct 115 ms 59344 KB Output is correct
25 Correct 412 ms 71880 KB Output is correct
26 Correct 416 ms 71792 KB Output is correct
27 Correct 357 ms 71300 KB Output is correct
28 Correct 270 ms 72904 KB Output is correct
29 Correct 178 ms 63368 KB Output is correct
30 Correct 91 ms 58872 KB Output is correct
31 Correct 486 ms 73504 KB Output is correct
32 Correct 462 ms 71484 KB Output is correct
33 Correct 443 ms 71880 KB Output is correct
34 Correct 258 ms 64752 KB Output is correct
35 Correct 329 ms 73416 KB Output is correct
36 Correct 113 ms 59340 KB Output is correct
37 Correct 508 ms 73676 KB Output is correct
38 Correct 488 ms 72908 KB Output is correct
39 Correct 466 ms 73680 KB Output is correct
40 Correct 257 ms 73048 KB Output is correct
41 Correct 189 ms 63432 KB Output is correct
42 Correct 96 ms 58832 KB Output is correct
43 Correct 704 ms 95456 KB Output is correct
44 Correct 692 ms 95428 KB Output is correct
45 Correct 715 ms 95432 KB Output is correct
46 Correct 356 ms 78536 KB Output is correct
47 Correct 411 ms 92612 KB Output is correct
48 Correct 121 ms 60108 KB Output is correct
49 Correct 655 ms 95684 KB Output is correct
50 Correct 657 ms 96108 KB Output is correct
51 Correct 658 ms 95472 KB Output is correct
52 Correct 396 ms 93384 KB Output is correct
53 Correct 234 ms 71884 KB Output is correct