oj.uz

답안 #998034

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998034 2024-06-13T08:36:37 Z anHiep Examination (JOI19_examination) C++14
22 / 100
 448 ms 41508 KB 
#include <bits/stdc++.h>

#define int long long
#define ll long long
#define pb push_back

using namespace std;

struct point{
    int a, b, c, id, val;
};
vector<point> student;
const int maxn = 3e5 + 10;
int ans[maxn];

bool cmp(point x, point y){
    if(x.a != y.a) return x.a > y.a;
    if(x.b != y.b) return x.b < y.b;
    return x.c < y.c;
}

void inv(point &a){
    a.a = -a.a;
    a.b = -a.b;
    a.c = -a.c;
}

int bit[maxn];

int getsum(int i){
    ll sum = 0;
    while(i > 0){
        sum+=bit[i];
        i-=(i & (-i));
    }
    return sum;
}

void update(int i, int v){
    while(i < maxn){
        bit[i]+=v;
        i+=(i & (-i));
    }
}

void dnc(int l, int r){
    if(l + 1 == r) return;
    int mid = (l + r)/2;
    dnc(l , mid); dnc(mid, r);
    vector<pair<int,int>> rec; vector<point> tmp;
    int a = l, b = mid, sum = 0;

    while(a < mid && b < r) {
        if(student[a].b > student[b].b){
            update(student[a].c, student[a].val);
            sum+=student[a].val;
            rec.push_back({student[a].c,student[a].val});
            tmp.push_back(student[a++]);
        }
        else{
            ans[student[b].id] += sum - getsum(student[b].c);
            tmp.push_back(student[b++]);
        }
    }
    while(a < mid) tmp.push_back(student[a++]);
    while(b < r) ans[student[b].id] += sum - getsum(student[b].c), tmp.push_back(student[b++]);
    for(int i = l ; i < r ; ++i) student[i] = tmp[i - l];

    for(auto x: rec) update(x.first, -x.second);
    vector<pair<int,int>> ().swap(rec);
    vector<point> ().swap(tmp);
}


signed main(){
    int n, q;
    cin >> n >> q;
    vector<int> compress;
    compress.pb(-1e18); compress.pb(1e18);
    for(int i = 0; i < n; i++){
        point tmp; cin >> tmp.a >> tmp.b;
        tmp.c = tmp.a + tmp.b; tmp.id = 0; tmp.val = 1;
        // inv(tmp);
        compress.pb(tmp.a);compress.pb(tmp.b);compress.pb(tmp.c);
        student.pb(tmp);
    }

    int cnt = 1;
    int _q = q;
    while(q--){
        point tmp;
        cin >> tmp.a >> tmp.b >> tmp.c;
        tmp.a--; tmp.b--; tmp.c--;
        tmp.val = 0 ;
        compress.pb(tmp.a); compress.pb(tmp.b); compress.pb(tmp.c);
        tmp.id = cnt;
        // inv(tmp);
        cnt++;
        student.pb(tmp);
    }
    sort(compress.begin(),compress.end());
    for(auto &x : student){
        x.a = lower_bound(compress.begin(),compress.end(),x.a) - compress.begin();
        x.b = lower_bound(compress.begin(),compress.end(),x.b) - compress.begin();
        x.c = lower_bound(compress.begin(),compress.end(),x.c) - compress.begin();
    }
    sort(student.begin(),student.end(), cmp);

    dnc(0, n + _q);

    for(int i = 1; i <= _q; i++){
        cout << ans[i] << "\n";
    }
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4540 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 13 ms 5732 KB Output is correct
8 Correct 12 ms 5584 KB Output is correct
9 Correct 12 ms 5580 KB Output is correct
10 Correct 13 ms 5580 KB Output is correct
11 Correct 9 ms 5580 KB Output is correct
12 Correct 6 ms 5456 KB Output is correct
13 Correct 12 ms 5584 KB Output is correct
14 Correct 12 ms 5556 KB Output is correct
15 Correct 13 ms 5584 KB Output is correct
16 Correct 8 ms 5456 KB Output is correct
17 Correct 10 ms 5584 KB Output is correct
18 Correct 6 ms 5448 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 430 ms 37468 KB Output is correct
2 Correct 448 ms 41508 KB Output is correct
3 Correct 418 ms 38088 KB Output is correct
4 Correct 352 ms 37696 KB Output is correct
5 Correct 276 ms 35372 KB Output is correct
6 Correct 200 ms 34744 KB Output is correct
7 Correct 377 ms 37892 KB Output is correct
8 Correct 396 ms 38344 KB Output is correct
9 Correct 368 ms 36772 KB Output is correct
10 Correct 238 ms 37328 KB Output is correct
11 Correct 290 ms 37464 KB Output is correct
12 Correct 176 ms 39060 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 430 ms 37468 KB Output is correct
2 Correct 448 ms 41508 KB Output is correct
3 Correct 418 ms 38088 KB Output is correct
4 Correct 352 ms 37696 KB Output is correct
5 Correct 276 ms 35372 KB Output is correct
6 Correct 200 ms 34744 KB Output is correct
7 Correct 377 ms 37892 KB Output is correct
8 Correct 396 ms 38344 KB Output is correct
9 Correct 368 ms 36772 KB Output is correct
10 Correct 238 ms 37328 KB Output is correct
11 Correct 290 ms 37464 KB Output is correct
12 Correct 176 ms 39060 KB Output is correct
13 Incorrect 393 ms 39028 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4540 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 13 ms 5732 KB Output is correct
8 Correct 12 ms 5584 KB Output is correct
9 Correct 12 ms 5580 KB Output is correct
10 Correct 13 ms 5580 KB Output is correct
11 Correct 9 ms 5580 KB Output is correct
12 Correct 6 ms 5456 KB Output is correct
13 Correct 12 ms 5584 KB Output is correct
14 Correct 12 ms 5556 KB Output is correct
15 Correct 13 ms 5584 KB Output is correct
16 Correct 8 ms 5456 KB Output is correct
17 Correct 10 ms 5584 KB Output is correct
18 Correct 6 ms 5448 KB Output is correct
19 Correct 430 ms 37468 KB Output is correct
20 Correct 448 ms 41508 KB Output is correct
21 Correct 418 ms 38088 KB Output is correct
22 Correct 352 ms 37696 KB Output is correct
23 Correct 276 ms 35372 KB Output is correct
24 Correct 200 ms 34744 KB Output is correct
25 Correct 377 ms 37892 KB Output is correct
26 Correct 396 ms 38344 KB Output is correct
27 Correct 368 ms 36772 KB Output is correct
28 Correct 238 ms 37328 KB Output is correct
29 Correct 290 ms 37464 KB Output is correct
30 Correct 176 ms 39060 KB Output is correct
31 Incorrect 393 ms 39028 KB Output isn't correct
32 Halted 0 ms 0 KB -