제출 #1356377

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1356377		opeleklanos	사탕 분배 (IOI21_candies)	C++20	컴파일 에러	0 ms	0 KiB

candies

#include <iostream>
#include <vector>
#include <algorithm>
// #include <queue>
using namespace std;

#define ll long long

#define INFI (ll)1000000000000000000


struct segTree{
    int l; int r;
    int lc, rc;
    pair<ll, int> mx;
    pair<ll, int> mn;
    ll lazy;
    segTree(int ind){
        l = r = ind;
        lc = rc = -1;
        mx = mn = {(ll)0, ind};
        lazy = (ll)0;
    }
    segTree(int indxInPool, int le, int ri){
        l = le; r = ri;
        lc = indxInPool*2 + 1;
        rc = indxInPool*2 + 2;
        mx = mn = {0, le};
        lazy = 0;
    }
};

vector<segTree> np;

void build (int l, int r, int ind){
    if(l == r){
        np[ind] = segTree(l);
        return;
    }
    else{
        np[ind] = segTree(ind, l, r);
        build(l, (l+r)/2, np[ind].lc);
        build((l+r)/2 + 1, r, np[ind].rc);
    }
}

void update(int l, int r, ll x, int st){

    np[st].mn.first += np[st].lazy;
    np[st].mx.first += np[st].lazy;
    if(np[st].l != np[st].r){
        np[np[st].lc].lazy += np[st].lazy;
        np[np[st].rc].lazy += np[st].lazy;
    }
    np[st].lazy = 0;

    if(np[st].l == np[st].r){
        np[st].mn.first += x;
        np[st].mx.first += x;
        np[st].lazy = 0;
        return;
    }

    if(np[st].l == l && np[st].r == r){
        np[np[st].lc].lazy += x;
        np[np[st].rc].lazy += x;
        np[st].mn.first += x;
        np[st].mx.first += x;
        np[st].lazy = 0;
        return;
    }
    int mid = (np[st].l + np[st].r)/2;

    if(l<=mid) update(l, min(r, mid), x, np[st].lc);
    if(r>mid) update(max(mid+1, l), r, x, np[st].rc);

    np[st].mn = min(make_pair(np[np[st].lc].mn.first + np[np[st].lc].lazy, np[np[st].lc].mn.second), {np[np[st].rc].mn.first + np[np[st].rc].lazy, np[np[st].rc].mn.second});
    np[st].mx = max(make_pair(np[np[st].lc].mx.first + np[np[st].lc].lazy, np[np[st].lc].mx.second), {np[np[st].rc].mx.first + np[np[st].rc].lazy, np[np[st].rc].mx.second});

}

pair<ll, int> query(int md, int l, int r, int st){

    if(l <= np[st].l && np[st].r <= r){
        if(md == 0) return np[st].mn;
        else return np[st].mx;
    }

    np[st].mn.first += np[st].lazy;
    np[st].mx.first += np[st].lazy;
    if(np[st].l != np[st].r){
        np[np[st].lc].lazy += np[st].lazy;
        np[np[st].rc].lazy += np[st].lazy;
    }
    np[st].lazy = 0;

    if(np[st].l == np[st].r){
        if(md == 0) return np[st].mn;
        else return np[st].mx;
    }

    int mid = (np[st].l + np[st].r)/2;

    if(md == 0){
        pair<ll, int> ans = {INFI, INFI};
        if(l <= mid) ans = min(ans, query(md, l, min(r, mid), np[st].lc));
        if(r > mid) ans = min(ans, query(md, max(l, mid+1), r, np[st].rc));
        return ans;
    }

    //if(md == 1){
        pair<ll, int> ans = {-INFI, -INFI};
        if(l <= mid) ans = max(ans, query(md, l, min(r, mid), np[st].lc));
        if(r > mid) ans = max(ans, query(md, max(l, mid+1), r, np[st].rc));
        return ans;
    //}
}

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

/usr/bin/ld: /tmp/cc2S7zN6.o: in function `main':
grader.cpp:(.text.startup+0x2fe): undefined reference to `distribute_candies(std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >)'
collect2: error: ld returned 1 exit status