제출 #1286975

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1286975		dhuyyyy	Examination (JOI19_examination)	C++20	100 / 100	229 ms	21488 KiB

examination

#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define all(s) s.begin(),s.end()

using namespace std;

using ll = long long;
using ii = pair<int,int>;
using aa = array<int,3>;

const int N = 2e5+5;
const ll INF = 1e18;
const int MOD = 1e9;

/*
sort free theo chieu x

2 con tro chieu y

BIT chieu sum
*/

struct in{
    int x, y, z, id;
};

int n, m;

int res[N], BIT[N];

in a[N];

vector <int> compress;

bool cmp(in a,in b){
    if (a.x != b.x) return a.x > b.x;
    return a.id < b.id;
}
void update(int id,int val){
    while (id > 0){
        BIT[id] += val;
        id -= id & -id;
    }
    return;
}
int get(int id){
    int res = 0;
    while (id <= n + m){
        res += BIT[id];
        id += id & -id;
    }
    return res;
}
void DnC(int l,int r){
    if (l == r) return;
    int mid = (l + r) >> 1;
    DnC(l,mid);
    DnC(mid + 1,r);
    vector <aa> tmp;
    vector <int> revert;
    int j = l;
    for (int i = mid + 1; i <= r; i++){
        while (j <= mid && a[j].y >= a[i].y){
            tmp.push_back({a[j].y,a[j].z,a[j].id});
            if (a[j].id <= n){
                update(a[j].z,1);
                revert.push_back(a[j].z);
            }
            j++;
        }
        if (a[i].id > n){
            res[a[i].id - n] += get(a[i].z);
        }
        tmp.push_back({a[i].y,a[i].z,a[i].id});
    }
    while (j <= mid){
        tmp.push_back({a[j].y,a[j].z,a[j].id});
        j++;
    }
    for (int it : revert){
        update(it,-1);
    }
    for (int i = l; i <= r; i++){
        a[i].y = tmp[i - l][0];
        a[i].z = tmp[i - l][1];
        a[i].id = tmp[i - l][2];
    }
}
int calc(int val){
    return lower_bound(compress.begin(),compress.end(),val) - compress.begin() + 1;
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    if (fopen("main.inp","r")){
        freopen("main.inp","r",stdin);
        freopen("main.out","w",stdout);
    }
    cin >> n >> m;
    for (int i = 1; i <= n; i++){
        cin >> a[i].x >> a[i].y;
        a[i].z = a[i].x + a[i].y;
        compress.push_back(a[i].z);
        a[i].id = i;
    }
    for (int i = 1; i <= m; i++){
        cin >> a[i + n].x >> a[i + n].y >> a[i + n].z;
        compress.push_back(a[i + n].z);
        a[i + n].id = i + n;
    }
    sort(compress.begin(),compress.end());
    compress.erase(unique(compress.begin(),compress.end()),compress.end());
    sort(a+1,a+1+n+m,cmp);
    for (int i = 1; i <= n + m; i++){
        a[i].z = calc(a[i].z);
    }
    DnC(1,n + m);
    for (int i = 1; i <= m; i++) cout << res[i] << '\n';
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

examination.cpp: In function 'int main()':
examination.cpp:98:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |         freopen("main.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
examination.cpp:99:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |         freopen("main.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 2 / 2
• Subtask 2: 20 / 20
• Subtask 3: 21 / 21
• Subtask 4: 57 / 57