oj.uz

답안 #677437

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677437 2023-01-03T11:00:41 Z qwerasdfzxcl 방벽 (JOI15_walls) C++17
100 / 100
 307 ms 31916 KB 
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
constexpr ll INF = 1e18;
constexpr int INF2 = 1e9 + 100;
ll a[200200];
int l[200200], r[200200], n, q;

pair<ll, int> operator + (const pair<ll, int> &x, const pair<ll, int> &y) {return make_pair(x.first + y.first, x.second + y.second);}
pair<ll, int> operator - (const pair<ll, int> &x, const pair<ll, int> &y) {return make_pair(x.first - y.first, x.second - y.second);}
ll myabs(ll x){return x<0?-x:x;}

struct Edge{
    int s, e;
    ll x;
    Edge(){}
    Edge(int _s, int _e, ll _x): s(_s), e(_e), x(_x) {}
    bool operator < (const Edge &E) const{
        return tie(x, s) > tie(E.x, E.s);
    }
};

struct Linked_List{
    int nxt[200200], prv[200200];
    pair<ll, int> dist[200200], T; ///dist[i] = (i -> nxt[i])
    priority_queue<Edge> pq;
    ll a[200200];

    void ch(int i, ll x, int y){
        T = T - dist[i];
        dist[i] = {x, y};
        T = T + dist[i];
    }

    void init(ll s){
        for (int i=1;i<=n;i++) a[i] = ::a[i];
        a[0] = s;
        fill(nxt, nxt+n+1, -INF2);
        fill(prv, prv+n+1, -INF2);
        fill(dist, dist+n+1, make_pair(0LL, 0));

        for (int i=0;i<n;){
            int j = i+1;
            ll dmn = a[j] - a[i], dmx = a[j] - a[i];
            while(j<=n){
                dmn = min(dmn, a[j] - a[j-1]);
                dmx = max(dmx, a[j] - a[j-1]);
                if (dmn < 0 && dmx > 0) break;
                j++;
            }

            if (dmn==0 && dmx==0) break;
            --j;

            nxt[i] = j, prv[j] = i;
            if (i){
                ch(i, myabs(a[j]-a[i]), 1);
                pq.emplace(i, j, dist[i].first);
            }

            i = j;
        }
    }

    void process(int L){
        while(!pq.empty()){
            auto [s, e, x] = pq.top();
            if (x>L) break;
            pq.pop();

            if (nxt[s]!=e) continue;

            int ss = prv[s], ee = nxt[e];

            ///delete
            nxt[s] = -INF2;
            prv[e] = -INF2;
            ch(s, 0, 0);

            ///link
            assert(ss!=-INF2);
            if (ee==-INF2) continue;

            prv[s] = -INF2;
            nxt[e] = -INF2;
            ch(e, 0, 0);

            nxt[ss] = ee, prv[ee] = ss;
            if (ss){
                ch(ss, myabs(a[ee]-a[ss]), 1);
                pq.emplace(ss, ee, dist[ss].first);
            }
        }
    }

    ll query(int L, int x){
        process(L);
        auto [sum, c] = T;
        return sum - (ll)L*c + myabs(x - a[nxt[0]]);
    }
}Llist, Rlist;

ll pmn[200200], pmx[200200], ans[200200];

ll calc(int L, int R){
    int posL = upper_bound(pmn+1, pmn+n+1, -L) - pmn;
    int posR = upper_bound(pmx+1, pmx+n+1, R) - pmx;
    if (posL==n+1 && posR==n+1) return 0;

    if (posL < posR) return Rlist.query(R-L, L);
    else return Llist.query(R-L, R);

    assert(0);
    return 0;
}

bool cmp(int i, int j){return r[i] - l[i] < r[j] - l[j];}

int main(){
    scanf("%d %d", &q, &n);
    for (int i=1;i<=q;i++) scanf("%d %d", l+i, r+i);
    for (int i=1;i<=n;i++) scanf("%lld", a+i);

    Llist.init(-INF);
    Rlist.init(INF);

    pmn[0] = -INF2, pmx[0] = -INF2;
    for (int i=1;i<=n;i++){
        pmn[i] = max(pmn[i-1], -a[i]);
        pmx[i] = max(pmx[i-1], a[i]);
    }

    vector<int> idx;
    for (int i=1;i<=q;i++) idx.push_back(i);
    sort(idx.begin(), idx.end(), cmp);

    for (auto &i:idx) ans[i] = calc(l[i], r[i]);
    for (int i=1;i<=q;i++) printf("%lld\n", ans[i]);
    return 0;
}

Compilation message

walls.cpp: In function 'int main()':
walls.cpp:121:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  121 |     scanf("%d %d", &q, &n);
      |     ~~~~~^~~~~~~~~~~~~~~~~
walls.cpp:122:33: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  122 |     for (int i=1;i<=q;i++) scanf("%d %d", l+i, r+i);
      |                            ~~~~~^~~~~~~~~~~~~~~~~~~
walls.cpp:123:33: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  123 |     for (int i=1;i<=n;i++) scanf("%lld", a+i);
      |                            ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7508 KB Output is correct
2 Correct 58 ms 22672 KB Output is correct
3 Correct 66 ms 23900 KB Output is correct
4 Correct 58 ms 23892 KB Output is correct
5 Correct 67 ms 23996 KB Output is correct
6 Correct 47 ms 23848 KB Output is correct
7 Correct 28 ms 17492 KB Output is correct
8 Correct 41 ms 17516 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 8960 KB Output is correct
2 Correct 83 ms 22788 KB Output is correct
3 Correct 101 ms 14920 KB Output is correct
4 Correct 226 ms 31776 KB Output is correct
5 Correct 171 ms 29584 KB Output is correct
6 Correct 209 ms 31772 KB Output is correct
7 Correct 182 ms 29724 KB Output is correct
8 Correct 207 ms 31840 KB Output is correct
9 Correct 104 ms 22948 KB Output is correct
10 Correct 163 ms 31376 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7508 KB Output is correct
2 Correct 58 ms 22672 KB Output is correct
3 Correct 66 ms 23900 KB Output is correct
4 Correct 58 ms 23892 KB Output is correct
5 Correct 67 ms 23996 KB Output is correct
6 Correct 47 ms 23848 KB Output is correct
7 Correct 28 ms 17492 KB Output is correct
8 Correct 41 ms 17516 KB Output is correct
9 Correct 17 ms 8960 KB Output is correct
10 Correct 83 ms 22788 KB Output is correct
11 Correct 101 ms 14920 KB Output is correct
12 Correct 226 ms 31776 KB Output is correct
13 Correct 171 ms 29584 KB Output is correct
14 Correct 209 ms 31772 KB Output is correct
15 Correct 182 ms 29724 KB Output is correct
16 Correct 207 ms 31840 KB Output is correct
17 Correct 104 ms 22948 KB Output is correct
18 Correct 163 ms 31376 KB Output is correct
19 Correct 307 ms 29652 KB Output is correct
20 Correct 280 ms 31828 KB Output is correct
21 Correct 236 ms 29736 KB Output is correct
22 Correct 264 ms 29512 KB Output is correct
23 Correct 259 ms 29740 KB Output is correct
24 Correct 289 ms 31916 KB Output is correct
25 Correct 129 ms 23148 KB Output is correct
26 Correct 147 ms 23804 KB Output is correct
27 Correct 215 ms 31272 KB Output is correct