oj.uz

답안 #951806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
951806 2024-03-22T16:52:57 Z Vladth11 Measures (CEOI22_measures) C++14
100 / 100
 227 ms 56512 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

#define int long long

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;

const ll NMAX = 400001;
const int INF = (1LL << 56);
const ll nrbits = 20;
const ll MOD = 998244353;
const int VMAX = 10;

int d, cnt;

int lazy[NMAX * 4];
vector <pii> tot;

struct elem{
    int val, nrm;
}a[NMAX], b[NMAX];

bool cmp(pii aa, pii bb){
    int prim = a[aa.first].val;
    if(aa.second == 1)
        prim = b[aa.first].val;
    int sec = a[bb.first].val;
    if(bb.second == 1)
        sec = b[bb.first].val;
    return prim < sec;
}

struct Node {
    int maxim, minim;
    int sol;
} aint[NMAX * 4];

void propaga(int node, int st, int dr) {
    if(st != dr) {
        lazy[node * 2] += lazy[node];
        lazy[node * 2 + 1] += lazy[node];
    }
    aint[node].maxim += lazy[node];
    aint[node].minim += lazy[node];
    lazy[node] = 0;
}

Node combine(Node a, Node b) {
    Node sol = {-INF, INF, 0};
    sol.sol = max(a.sol, b.sol);
    sol.sol = max(sol.sol, a.maxim - b.minim);
    sol.maxim = max(a.maxim, b.maxim);
    sol.minim = min(a.minim, b.minim);
    return sol;
}

void activate(int node, int st, int dr, int x, int val) {
    propaga(node, st, dr);
    if(st == dr) {
        aint[node].maxim += INF + val;
        aint[node].minim -= INF;
        aint[node].minim += val;
        aint[node].sol = 0;
        return;
    }
    int mid = (st + dr) / 2;
    if(x <= mid)
        activate(node * 2, st, mid, x, val);
    else
        activate(node * 2 + 1, mid + 1, dr, x, val);
    propaga(node * 2, st, mid);
    propaga(node * 2 + 1, mid + 1, dr);
    aint[node] = combine(aint[node * 2], aint[node * 2 + 1]);
}

void update(int node, int st, int dr, int a, int b, int val) {
    if(a > dr)
        return;
    propaga(node, st, dr);
    if(a <= st && dr <= b) {
        lazy[node] += val;
        return;
    }
    int mid = (st + dr) / 2;
    if(a <= mid)
        update(node * 2, st, mid, a, b, val);
    if(b > mid)
        update(node * 2 + 1, mid + 1, dr, a, b, val);
    propaga(node * 2, st, mid);
    propaga(node * 2 + 1, mid + 1, dr);
    aint[node] = combine(aint[node * 2], aint[node * 2 + 1]);
}

signed main() {
#ifdef HOME
    ifstream cin(".in");
    ofstream cout(".out");
#endif // HOME
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    for(int i = 0; i < NMAX * 4; i++) {
        aint[i].maxim = -INF;
        aint[i].minim = INF;
        aint[i].sol = 0;
    }
    int n, i, m, x;
    cin >> n >> m >> d;
    tot.clear();
    for(i = 1; i <= n; i++) {
        cin >> a[i].val;
        tot.push_back({i, 0});
    }
    for(i = 1; i <= m; i++) {
        cin >> b[i].val;
        tot.push_back({i, 1});
    }
    sort(tot.begin(), tot.end(), cmp);
    for(int i = 0; i < tot.size(); i++){
        if(tot[i].second == 1){
            b[tot[i].first].nrm = i + 1;
        }else{
            a[tot[i].first].nrm = i + 1;
        }
    }
    cnt = tot.size();
    for(i = 1; i <= n; i++) {
        update(1, 1, cnt, a[i].nrm + 1, cnt, -d);
        activate(1, 1, cnt, a[i].nrm, a[i].val);
    }
    for(i = 1; i <= m; i++) {
        update(1, 1, cnt, b[i].nrm + 1, cnt, -d);
        activate(1, 1, cnt, b[i].nrm, b[i].val);
        propaga(1, 1, cnt);
        int sol = max(0LL, aint[1].sol);
        cout << sol/2;
        if(sol%2) cout << ".5";
        cout << " ";
    }
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:122:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     for(int i = 0; i < tot.size(); i++){
      |                    ~~^~~~~~~~~~~~
Main.cpp:110:18: warning: unused variable 'x' [-Wunused-variable]
  110 |     int n, i, m, x;
      |                  ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 43612 KB Output is correct
2 Correct 9 ms 43688 KB Output is correct
3 Correct 7 ms 43612 KB Output is correct
4 Correct 7 ms 43684 KB Output is correct
5 Correct 7 ms 43612 KB Output is correct
6 Correct 7 ms 43612 KB Output is correct
7 Correct 8 ms 43688 KB Output is correct
8 Correct 7 ms 43612 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 43612 KB Output is correct
2 Correct 9 ms 43688 KB Output is correct
3 Correct 7 ms 43612 KB Output is correct
4 Correct 7 ms 43684 KB Output is correct
5 Correct 7 ms 43612 KB Output is correct
6 Correct 7 ms 43612 KB Output is correct
7 Correct 8 ms 43688 KB Output is correct
8 Correct 7 ms 43612 KB Output is correct
9 Correct 212 ms 55520 KB Output is correct
10 Correct 193 ms 55064 KB Output is correct
11 Correct 143 ms 55752 KB Output is correct
12 Correct 188 ms 55932 KB Output is correct
13 Correct 147 ms 54456 KB Output is correct
14 Correct 164 ms 54980 KB Output is correct
15 Correct 205 ms 54208 KB Output is correct
16 Correct 142 ms 54976 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 52672 KB Output is correct
2 Correct 158 ms 54708 KB Output is correct
3 Correct 156 ms 55948 KB Output is correct
4 Correct 150 ms 54204 KB Output is correct
5 Correct 152 ms 55820 KB Output is correct
6 Correct 151 ms 53952 KB Output is correct
7 Correct 155 ms 55272 KB Output is correct
8 Correct 151 ms 53764 KB Output is correct
9 Correct 153 ms 53696 KB Output is correct
10 Correct 156 ms 56252 KB Output is correct
11 Correct 154 ms 55500 KB Output is correct
12 Correct 154 ms 55996 KB Output is correct
13 Correct 154 ms 53688 KB Output is correct
14 Correct 154 ms 55708 KB Output is correct
15 Correct 154 ms 56308 KB Output is correct
16 Correct 152 ms 53180 KB Output is correct
17 Correct 153 ms 55276 KB Output is correct

Subtask #4
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 52672 KB Output is correct
2 Correct 158 ms 54708 KB Output is correct
3 Correct 156 ms 55948 KB Output is correct
4 Correct 150 ms 54204 KB Output is correct
5 Correct 152 ms 55820 KB Output is correct
6 Correct 151 ms 53952 KB Output is correct
7 Correct 155 ms 55272 KB Output is correct
8 Correct 151 ms 53764 KB Output is correct
9 Correct 153 ms 53696 KB Output is correct
10 Correct 156 ms 56252 KB Output is correct
11 Correct 154 ms 55500 KB Output is correct
12 Correct 154 ms 55996 KB Output is correct
13 Correct 154 ms 53688 KB Output is correct
14 Correct 154 ms 55708 KB Output is correct
15 Correct 154 ms 56308 KB Output is correct
16 Correct 152 ms 53180 KB Output is correct
17 Correct 153 ms 55276 KB Output is correct
18 Correct 216 ms 54968 KB Output is correct
19 Correct 213 ms 56512 KB Output is correct
20 Correct 155 ms 56256 KB Output is correct
21 Correct 190 ms 54464 KB Output is correct
22 Correct 191 ms 54184 KB Output is correct
23 Correct 159 ms 54720 KB Output is correct
24 Correct 213 ms 54540 KB Output is correct
25 Correct 161 ms 53756 KB Output is correct
26 Correct 214 ms 53696 KB Output is correct
27 Correct 227 ms 56508 KB Output is correct
28 Correct 185 ms 54464 KB Output is correct
29 Correct 203 ms 55740 KB Output is correct
30 Correct 197 ms 53816 KB Output is correct
31 Correct 190 ms 55740 KB Output is correct
32 Correct 162 ms 56072 KB Output is correct
33 Correct 217 ms 53624 KB Output is correct
34 Correct 190 ms 55484 KB Output is correct