oj.uz

Submission #1070348

# Submission time Handle Problem Language Result Execution time Memory
1070348 2024-08-22T13:31:17 Z jerzyk Radio Towers (IOI22_towers) C++17
40 / 100
 1073 ms 28128 KB 
#include <bits/stdc++.h>
#include "towers.h"

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;
const int II = 2 * 1000 * 1000 * 1000;
const ll M = 1000LL * 1000LL * 1000LL + 7LL;
const int N = 1<<17;
int drz[2 * N], drz2[2 * N], drz3[2 * N], drz4[2 * N];
int drzmi[2 * N], drzma[2 * N];
vector<int> mrg[2 * N];

int tab[N], ml[N], mr[N], cdi[N], tim[N];
set<int> cur;
set<int>::iterator it;
set<pair<int, int>> dif;

int QueryMI(int a, int b)
{
    a += N - 1; b += N + 1;
    int ans = II;
    while(a / 2 != b / 2)
    {
        if(a % 2 == 0) ans = min(ans, drz2[a + 1]);
        if(b % 2 == 1) ans = min(ans, drz2[b - 1]);
        a /= 2; b /= 2;
    }
    return ans;
}

int FindL(int v, int a, int b, int pz, int kz, int x)
{
    if(a > kz || b < pz || drzma[v] < x) return N;
    if(v >= N) return v - N;
    int ans = FindL(v * 2, a, (a + b) / 2, pz, kz, x);
    if(ans < N) return ans;
    ans = FindL(v * 2 + 1, (a + b) / 2 + 1, b, pz, kz, x);
    return ans;
}

int FindR(int v, int a, int b, int pz, int kz, int x)
{
    if(a > kz || b < pz || drzma[v] < x) return 0;
    if(v >= N) return v - N;
    int ans = FindR(v * 2 + 1, (a + b) / 2 + 1, b, pz, kz, x);
    if(ans != 0) return ans;
    ans = FindR(v * 2, a, (a + b) / 2, pz, kz, x);
    return ans;
}

int FindXD(int a, int b, int k)
{
    vector<int> x, y;
    a += N - 1; b += N + 1;
    while(a / 2 != b / 2)
    {
        if(a % 2 == 0) x.pb(a + 1);
        if(b % 2 == 1) y.pb(b - 1);
        a /= 2; b /= 2;
    }
    reverse(y.begin(), y.end());
    for(int j = 0; j < (int)y.size(); ++j) x.pb(y[j]);
    int curmi = II;
    for(int i = 0; i < (int)x.size(); ++i)
    {
        if(drz3[x[i]] >= k || drz[x[i]] - curmi >= k)
        {
            int v = x[i];
            while(v < N)
            {
                v *= 2;
                if(!(drz3[v] >= k || drz[v] - curmi >= k))
                {
                    curmi = min(curmi, drz2[v]);
                    ++v;
                }
            }
            return v - N;
        }
        curmi = min(curmi, drz2[x[i]]);
    }
    return -1;
}

bool ChkL(int a, int b, int k)
{
    //cerr << "Chkl: " << a << " " << b << "\n";
    vector<int> x, y;
    a += N - 1; b += N + 1;
    while(a / 2 != b / 2)
    {
        if(a % 2 == 0) x.pb(a + 1);
        if(b % 2 == 1) y.pb(b - 1);
        a /= 2; b /= 2;
    }
    reverse(y.begin(), y.end());
    for(int j = 0; j < (int)y.size(); ++j) x.pb(y[j]);
    int curmi = II;
    for(int i = 0; i < (int)x.size(); ++i)
    {
        if(drz3[x[i]] >= k) return true;
        if(drz[x[i]] - curmi >= k) return true;
        curmi = min(curmi, drz2[x[i]]);
    }
    return false;
}

bool ChkR(int a, int b, int k)
{
    vector<int> x, y;
    a += N - 1; b += N + 1;
    while(a / 2 != b / 2)
    {
        if(a % 2 == 0) x.pb(a + 1);
        if(b % 2 == 1) y.pb(b - 1);
        a /= 2; b /= 2;
    }
    reverse(y.begin(), y.end());
    for(int j = 0; j < (int)y.size(); ++j) x.pb(y[j]);
    int curma = 0;
    for(int i = 0; i < (int)x.size(); ++i)
    {
        if(drz4[x[i]] >= k) return true;
        if(curma - drz2[x[i]] >= k) return true;
        curma = max(curma, drz[x[i]]);
    }
    return false;
}

void DoT(int n)
{
    drz2[N] = II; drzmi[N] = II;
    for(int i = N; i < 2 * N; ++i)
    {
        drz3[i] = -II / 2;
        drz4[i] = -II / 2;
    }
    for(int i = 1; i <= n; ++i)
    {
        drzmi[i + N] = tim[i]; drzma[i + N] = tim[i];
        drz[i + N] = tab[i]; drz2[i + N] = tab[i];
        mrg[i + N] = {tim[i]};
    }
    for(int i = n + 1; i < N; ++i)
    {drzmi[i + N] = II; drz2[i + N] = II;}

    for(int i = N - 1; i >= 1; --i)
    {
        drzma[i] = max(drzma[2 * i], drzma[2 * i + 1]);
        drzmi[i] = min(drzmi[2 * i], drzmi[2 * i + 1]);

        drz[i] = max(drz[2 * i], drz[2 * i + 1]);
        drz2[i] = min(drz2[2 * i], drz2[2 * i + 1]);

        drz3[i] = max(drz3[i * 2], drz3[i * 2 + 1]);
        drz3[i] = max(drz3[i], drz[i * 2 + 1] - drz2[i * 2]);

        drz4[i] = max(drz4[i * 2], drz4[i * 2 + 1]);
        drz4[i] = max(drz4[i], drz[i * 2] - drz2[i * 2 + 1]);

        mrg[i] = mrg[i * 2];
        for(int j = 0; j < (int)mrg[i * 2 + 1].size(); ++j)
            mrg[i].pb(mrg[i * 2 + 1][j]);
        sort(mrg[i].begin(), mrg[i].end());
    }
}

inline int Il(int v, int x)
{
    return (mrg[v].end() - lower_bound(mrg[v].begin(), mrg[v].end(), x));
}

int Query(int a, int b, int x)
{
    a += N - 1; b += N + 1;
    int ans = 0;
    while(a / 2 != b / 2)
    {
        if(a % 2 == 0) ans += Il(a + 1, x);
        if(b % 2 == 1) ans += Il(b - 1, x);
        a /= 2; b /= 2;
    }

    return ans;
}

int GetL(int v)
{
    it = cur.lower_bound(v);
    if(it == cur.begin()) return 0;
    --it; return *it;
}

int GetR(int v)
{
    it = cur.upper_bound(v);
    if(it == cur.end()) return 0;
    return *it;
}

void init(int _N, vector<int> _H)
{
    int n = _N;
    for(int i = 1; i <= n; ++i) tab[i] = _H[i - 1];
    for(int i = 1; i <= n; ++i)
    {
        ml[i] = 0LL; mr[i] = 0LL;
        cur.insert(i);
    }
    ml[1] = II; mr[n] = II;
    for(int i = 1; i <= n; ++i)
    {
        cdi[i] = min(ml[i], mr[i]) - tab[i];
        dif.insert(make_pair(cdi[i], i));
    }
    while((int)cur.size() > 1)
    {
        int v = (*dif.begin()).nd;
        dif.erase(dif.begin());
        cur.erase(v);
        tim[v] = cdi[v];
        int l = GetL(v), r = GetR(v);
        int xd = max(tab[v], max(mr[v], ml[v]));
        if(l != 0)
        {
            dif.erase(make_pair(cdi[l], l));
            mr[l] = max(mr[l], xd);
            cdi[l] = min(ml[l], mr[l]) - tab[l];
            dif.insert(make_pair(cdi[l], l));
        }
        if(r != 0)
        {
            dif.erase(make_pair(cdi[r], r));
            ml[r] = max(ml[r], xd);
            cdi[r] = min(ml[r], mr[r]) - tab[r];
            dif.insert(make_pair(cdi[r], r));
        }
    }
    for(int i = 1; i <= n; ++i)
        tim[i] = max(tim[i], 0);
    tim[*cur.begin()] = II;
    DoT(n);
    //for(int i = 1; i <= n; ++i)
        //cerr << tim[i] << " ";
    //cerr << "\n";
}

int max_towers(int L, int R, int D)
{
    ++L; ++R;
    int ans = Query(L, R, D);
    if(ans == 0)
    {
        int p = FindXD(L, R, D);
        //cerr << "Find: " << p << " " << QueryMI(p + 1, R) << "\n";
        if(p == -1) return 1;
        if(p < R && QueryMI(p + 1, R) <= tab[p] - D) return 2;
        return 1;
    }
    int l = FindL(1, 0, N - 1, L, R, D);
    int r = FindR(1, 0, N - 1, L, R, D);
    //cerr << "Que: " << l << " " << r << "\n";
    if(l != L && ChkL(L, l - 1, D)) ++ans;
    if(r != R && ChkR(r + 1, R, D)) ++ans;
    return ans;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 402 ms 22476 KB 27th lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 6 ms 15192 KB Output is correct
3 Correct 5 ms 15192 KB Output is correct
4 Correct 5 ms 15192 KB Output is correct
5 Correct 6 ms 15192 KB Output is correct
6 Correct 6 ms 15192 KB Output is correct
7 Correct 5 ms 15192 KB Output is correct
8 Correct 4 ms 14936 KB Output is correct
9 Correct 4 ms 14936 KB Output is correct
10 Correct 4 ms 14928 KB Output is correct
11 Correct 4 ms 14936 KB Output is correct
12 Correct 4 ms 14680 KB Output is correct
13 Correct 4 ms 15012 KB Output is correct
14 Correct 4 ms 15036 KB Output is correct
15 Correct 6 ms 15192 KB Output is correct
16 Correct 6 ms 15192 KB Output is correct
17 Correct 5 ms 15192 KB Output is correct
18 Correct 4 ms 14936 KB Output is correct
19 Correct 4 ms 14936 KB Output is correct
20 Correct 6 ms 15192 KB Output is correct
21 Correct 5 ms 15192 KB Output is correct
22 Correct 6 ms 15188 KB Output is correct
23 Correct 4 ms 14936 KB Output is correct
24 Correct 5 ms 14936 KB Output is correct
25 Correct 5 ms 14936 KB Output is correct
26 Correct 5 ms 15192 KB Output is correct
27 Correct 6 ms 15040 KB Output is correct
28 Correct 6 ms 15192 KB Output is correct
29 Correct 5 ms 15192 KB Output is correct
30 Correct 7 ms 15192 KB Output is correct
31 Correct 5 ms 15192 KB Output is correct
32 Correct 4 ms 14936 KB Output is correct
33 Correct 4 ms 14936 KB Output is correct
34 Correct 3 ms 14936 KB Output is correct
35 Correct 4 ms 14936 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 6 ms 15192 KB Output is correct
3 Correct 5 ms 15192 KB Output is correct
4 Correct 5 ms 15192 KB Output is correct
5 Correct 6 ms 15192 KB Output is correct
6 Correct 6 ms 15192 KB Output is correct
7 Correct 5 ms 15192 KB Output is correct
8 Correct 4 ms 14936 KB Output is correct
9 Correct 4 ms 14936 KB Output is correct
10 Correct 4 ms 14928 KB Output is correct
11 Correct 4 ms 14936 KB Output is correct
12 Correct 4 ms 14680 KB Output is correct
13 Correct 4 ms 15012 KB Output is correct
14 Correct 4 ms 15036 KB Output is correct
15 Correct 6 ms 15192 KB Output is correct
16 Correct 6 ms 15192 KB Output is correct
17 Correct 5 ms 15192 KB Output is correct
18 Correct 4 ms 14936 KB Output is correct
19 Correct 4 ms 14936 KB Output is correct
20 Correct 6 ms 15192 KB Output is correct
21 Correct 5 ms 15192 KB Output is correct
22 Correct 6 ms 15188 KB Output is correct
23 Correct 4 ms 14936 KB Output is correct
24 Correct 5 ms 14936 KB Output is correct
25 Correct 5 ms 14936 KB Output is correct
26 Correct 5 ms 15192 KB Output is correct
27 Correct 6 ms 15040 KB Output is correct
28 Correct 6 ms 15192 KB Output is correct
29 Correct 5 ms 15192 KB Output is correct
30 Correct 7 ms 15192 KB Output is correct
31 Correct 5 ms 15192 KB Output is correct
32 Correct 4 ms 14936 KB Output is correct
33 Correct 4 ms 14936 KB Output is correct
34 Correct 3 ms 14936 KB Output is correct
35 Correct 4 ms 14936 KB Output is correct
36 Correct 123 ms 23112 KB Output is correct
37 Correct 221 ms 27896 KB Output is correct
38 Correct 214 ms 28104 KB Output is correct
39 Correct 213 ms 28032 KB Output is correct
40 Correct 229 ms 28104 KB Output is correct
41 Correct 230 ms 28104 KB Output is correct
42 Correct 227 ms 28104 KB Output is correct
43 Correct 76 ms 28104 KB Output is correct
44 Correct 75 ms 28052 KB Output is correct
45 Correct 82 ms 28104 KB Output is correct
46 Correct 90 ms 27872 KB Output is correct
47 Correct 212 ms 28104 KB Output is correct
48 Correct 228 ms 28060 KB Output is correct
49 Correct 221 ms 28104 KB Output is correct
50 Correct 79 ms 28112 KB Output is correct
51 Correct 80 ms 28104 KB Output is correct
52 Correct 211 ms 28100 KB Output is correct
53 Correct 227 ms 28100 KB Output is correct
54 Correct 228 ms 28088 KB Output is correct
55 Correct 76 ms 27896 KB Output is correct
56 Correct 104 ms 28104 KB Output is correct
57 Correct 221 ms 27592 KB Output is correct
58 Correct 243 ms 28104 KB Output is correct
59 Correct 218 ms 27948 KB Output is correct
60 Correct 252 ms 28104 KB Output is correct
61 Correct 229 ms 27888 KB Output is correct
62 Correct 237 ms 28040 KB Output is correct
63 Correct 231 ms 28084 KB Output is correct
64 Correct 87 ms 28104 KB Output is correct
65 Correct 74 ms 28028 KB Output is correct
66 Correct 97 ms 28104 KB Output is correct
67 Correct 106 ms 28108 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 806 ms 27960 KB Output is correct
2 Correct 1073 ms 28104 KB Output is correct
3 Correct 1067 ms 28104 KB Output is correct
4 Correct 979 ms 28104 KB Output is correct
5 Correct 1033 ms 28104 KB Output is correct
6 Correct 979 ms 28088 KB Output is correct
7 Correct 1008 ms 28100 KB Output is correct
8 Correct 836 ms 28104 KB Output is correct
9 Correct 834 ms 28100 KB Output is correct
10 Correct 922 ms 28104 KB Output is correct
11 Correct 897 ms 28104 KB Output is correct
12 Incorrect 913 ms 28104 KB 321st lines differ - on the 1st token, expected: '2', found: '1'
13 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 17968 KB Output is correct
2 Correct 1035 ms 28056 KB Output is correct
3 Correct 1026 ms 28104 KB Output is correct
4 Correct 1028 ms 28060 KB Output is correct
5 Correct 1031 ms 28080 KB Output is correct
6 Correct 1014 ms 28056 KB Output is correct
7 Correct 958 ms 28064 KB Output is correct
8 Correct 825 ms 28104 KB Output is correct
9 Correct 860 ms 28060 KB Output is correct
10 Correct 804 ms 27896 KB Output is correct
11 Correct 829 ms 28104 KB Output is correct
12 Correct 216 ms 28128 KB Output is correct
13 Correct 219 ms 28064 KB Output is correct
14 Correct 226 ms 28060 KB Output is correct
15 Correct 81 ms 28104 KB Output is correct
16 Correct 79 ms 28104 KB Output is correct
17 Correct 195 ms 27572 KB Output is correct
18 Correct 203 ms 28108 KB Output is correct
19 Correct 206 ms 27896 KB Output is correct
20 Correct 216 ms 27952 KB Output is correct
21 Correct 223 ms 28100 KB Output is correct
22 Correct 223 ms 28052 KB Output is correct
23 Correct 215 ms 28104 KB Output is correct
24 Correct 74 ms 28104 KB Output is correct
25 Correct 70 ms 28104 KB Output is correct
26 Correct 83 ms 27896 KB Output is correct
27 Correct 96 ms 27980 KB Output is correct
28 Correct 5 ms 15192 KB Output is correct
29 Correct 6 ms 15104 KB Output is correct
30 Correct 5 ms 15192 KB Output is correct
31 Correct 4 ms 15024 KB Output is correct
32 Correct 4 ms 14936 KB Output is correct
33 Correct 4 ms 14936 KB Output is correct
34 Correct 5 ms 15192 KB Output is correct
35 Correct 6 ms 15192 KB Output is correct
36 Correct 6 ms 15192 KB Output is correct
37 Correct 5 ms 15192 KB Output is correct
38 Correct 5 ms 15004 KB Output is correct
39 Correct 5 ms 15192 KB Output is correct
40 Correct 4 ms 14936 KB Output is correct
41 Correct 4 ms 15068 KB Output is correct
42 Correct 4 ms 14936 KB Output is correct
43 Correct 7 ms 14936 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 6 ms 15192 KB Output is correct
3 Correct 5 ms 15192 KB Output is correct
4 Correct 5 ms 15192 KB Output is correct
5 Correct 6 ms 15192 KB Output is correct
6 Correct 6 ms 15192 KB Output is correct
7 Correct 5 ms 15192 KB Output is correct
8 Correct 4 ms 14936 KB Output is correct
9 Correct 4 ms 14936 KB Output is correct
10 Correct 4 ms 14928 KB Output is correct
11 Correct 4 ms 14936 KB Output is correct
12 Correct 4 ms 14680 KB Output is correct
13 Correct 4 ms 15012 KB Output is correct
14 Correct 4 ms 15036 KB Output is correct
15 Correct 6 ms 15192 KB Output is correct
16 Correct 6 ms 15192 KB Output is correct
17 Correct 5 ms 15192 KB Output is correct
18 Correct 4 ms 14936 KB Output is correct
19 Correct 4 ms 14936 KB Output is correct
20 Correct 6 ms 15192 KB Output is correct
21 Correct 5 ms 15192 KB Output is correct
22 Correct 6 ms 15188 KB Output is correct
23 Correct 4 ms 14936 KB Output is correct
24 Correct 5 ms 14936 KB Output is correct
25 Correct 5 ms 14936 KB Output is correct
26 Correct 5 ms 15192 KB Output is correct
27 Correct 6 ms 15040 KB Output is correct
28 Correct 6 ms 15192 KB Output is correct
29 Correct 5 ms 15192 KB Output is correct
30 Correct 7 ms 15192 KB Output is correct
31 Correct 5 ms 15192 KB Output is correct
32 Correct 4 ms 14936 KB Output is correct
33 Correct 4 ms 14936 KB Output is correct
34 Correct 3 ms 14936 KB Output is correct
35 Correct 4 ms 14936 KB Output is correct
36 Correct 123 ms 23112 KB Output is correct
37 Correct 221 ms 27896 KB Output is correct
38 Correct 214 ms 28104 KB Output is correct
39 Correct 213 ms 28032 KB Output is correct
40 Correct 229 ms 28104 KB Output is correct
41 Correct 230 ms 28104 KB Output is correct
42 Correct 227 ms 28104 KB Output is correct
43 Correct 76 ms 28104 KB Output is correct
44 Correct 75 ms 28052 KB Output is correct
45 Correct 82 ms 28104 KB Output is correct
46 Correct 90 ms 27872 KB Output is correct
47 Correct 212 ms 28104 KB Output is correct
48 Correct 228 ms 28060 KB Output is correct
49 Correct 221 ms 28104 KB Output is correct
50 Correct 79 ms 28112 KB Output is correct
51 Correct 80 ms 28104 KB Output is correct
52 Correct 211 ms 28100 KB Output is correct
53 Correct 227 ms 28100 KB Output is correct
54 Correct 228 ms 28088 KB Output is correct
55 Correct 76 ms 27896 KB Output is correct
56 Correct 104 ms 28104 KB Output is correct
57 Correct 221 ms 27592 KB Output is correct
58 Correct 243 ms 28104 KB Output is correct
59 Correct 218 ms 27948 KB Output is correct
60 Correct 252 ms 28104 KB Output is correct
61 Correct 229 ms 27888 KB Output is correct
62 Correct 237 ms 28040 KB Output is correct
63 Correct 231 ms 28084 KB Output is correct
64 Correct 87 ms 28104 KB Output is correct
65 Correct 74 ms 28028 KB Output is correct
66 Correct 97 ms 28104 KB Output is correct
67 Correct 106 ms 28108 KB Output is correct
68 Correct 806 ms 27960 KB Output is correct
69 Correct 1073 ms 28104 KB Output is correct
70 Correct 1067 ms 28104 KB Output is correct
71 Correct 979 ms 28104 KB Output is correct
72 Correct 1033 ms 28104 KB Output is correct
73 Correct 979 ms 28088 KB Output is correct
74 Correct 1008 ms 28100 KB Output is correct
75 Correct 836 ms 28104 KB Output is correct
76 Correct 834 ms 28100 KB Output is correct
77 Correct 922 ms 28104 KB Output is correct
78 Correct 897 ms 28104 KB Output is correct
79 Incorrect 913 ms 28104 KB 321st lines differ - on the 1st token, expected: '2', found: '1'
80 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 402 ms 22476 KB 27th lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -