oj.uz

Submission #629718

# Submission time Handle Problem Language Result Execution time Memory
629718 2022-08-15T00:04:34 Z peti1234 Radio Towers (IOI22_towers) C++17
35 / 100
 1195 ms 40208 KB 
#include <bits/stdc++.h>

using namespace std;
const int c=100005, sok=2e9+5;
int n, t[c], maxi, fixd;
bool tc1=1, fontos[c];
set<pair<int, int> > tc5;
set<int> pos;
set<pair<int, int> > dif;
int kul(int a, int b) {
    return abs(t[a]-t[b]);
}



vector<vector<pair<int, int>>> rmq_mini, rmq_maxi;
vector<int> rmq_log;
void rmq_init(vector<int> sz) {
    int n=sz.size();
    rmq_log.resize(n+1);
    for (int i=2; i<=n; i++) {
        rmq_log[i]=rmq_log[i/2]+1;
    }
    int po=1, db=1;
    while (po<=n) {
        po*=2, db++;
    }
    rmq_mini.resize(db);
    rmq_maxi.resize(db);
    for (int i=0; i<db; i++) {
        rmq_mini[i].resize(n);
        rmq_maxi[i].resize(n);
    }
    for (int i=0; i<n; i++) {
        rmq_mini[0][i]={sz[i], i};
        rmq_maxi[0][i]={sz[i], i};
    }
    for (int j=1; j<db; j++) {
        for (int i=0; i+(1<<j)<=n; i++) {
            int s=i+(1<<(j-1));
            rmq_mini[j][i]=min(rmq_mini[j-1][i], rmq_mini[j-1][s]);
            rmq_maxi[j][i]=max(rmq_maxi[j-1][i], rmq_maxi[j-1][s]);
        }
    }
}
pair<int, int> rmq_ask(int l, int r, int id) {
    int s=rmq_log[r-l+1], s2=r+1-(1<<s);
    if (!id) {
        return min(rmq_mini[s][l], rmq_mini[s][s2]);
    } else {
        return max(rmq_maxi[s][l], rmq_maxi[s][s2]);
    }
}


vector<int> spec;


int try_tc46(int l, int r, int d) {
    if (fixd!=0 && d!=fixd) return 0;
    if (fixd==0) {
        fixd=d;

        int ut=sok, id=1;
        for (int i=1; i<=n+1; i++) {
            if (id==1) {
                ut=max(ut, t[i]);
                if (ut>t[i]) {
                    spec.push_back(i-1);
                    ut=t[i];
                    id=0;
                }
            } else {
                ut=min(ut, t[i]);
                if (t[i]>ut) {
                    spec.push_back(i-1);
                    ut=t[i];
                    id=1;
                }
            }
        }

        spec.push_back(n+1);

        /*cout<< "spec: ";
        for (auto x:spec) cout << x << " ";
        cout << "\n";*/

    }

    int kezd=-1, veg=-1;
    int si=spec.size(), lo=0, hi=si, mid;
    while (hi-lo>1) {
        mid=(hi+lo)/2;
        if (spec[mid]<l) lo=mid;
        else hi=mid;
    }
    kezd=hi;
    if (spec[kezd]>r) return 1;
    lo=0, hi=si;
    while (hi-lo>1) {
        mid=(hi+lo)/2;
        if (spec[mid]>r) hi=mid;
        else lo=mid;
    }
    veg=lo;
    //cout << "sikerult " << kezd << " " << veg << "\n";
    assert(kezd<=veg);
    int ans=(veg+1)/2-(kezd/2);
    int kpos=spec[kezd], vpos=spec[veg];
    if (l<kpos && kezd%2==0 && rmq_ask(l, kpos-1, 0).first+d<=t[kpos]) ans++;
    if (vpos<r && veg%2==0 && rmq_ask(veg+1, r, 0).first+d<=t[vpos]) ans++;

    return ans;
}
void sub(int p) {
    auto it=pos.find(p);
    int el=0, kov=0;
    it++;
    kov=(*it);
    it--, it--;
    el=(*it);
    //cout << "valt " << el << " " << p << " " << kov << "\n";
    pos.erase(p);
    dif.erase({kul(p, kov), p});
    dif.erase({kul(el, p), el});
    dif.insert({kul(el, kov), el});
}
void calc_tc5() {
    fontos[0]=1, fontos[n+1]=1;
    int ut=sok, ans=0, id=1;
    for (int i=1; i<=n+1; i++) {
        if (id==1) {
            ut=max(ut, t[i]);
            if (ut>t[i]) {
                fontos[i-1]=1;
                ut=t[i];
                id=0;
                ans++;
            }
        } else {
            ut=min(ut, t[i]);
            if (t[i]>ut) {
                fontos[i-1]=1;
                ut=t[i];
                id=1;
            }
        }
    }
    int el=-1;
    for (int i=0; i<=n+1; i++) {
        if (!fontos[i]) continue;
        pos.insert(i);
        if (el!=-1) {
            dif.insert({kul(el, i), el});
            //cout << "fontos " << el << " " << i << "\n";
        }
        el=i;
    }
    tc5.insert({0, ans});
    while (ans>1) {
        auto it=dif.begin();
        int ert=(*it).first, p=(*it).second;
        auto it2=pos.upper_bound(p);
        int kov=*it2;
        //cout << "fontos " << p << " " << kov << "\n";
        sub(p), sub(kov);
        ans--;
        //cout << ert << " " << ans << "\n";
        it=tc5.upper_bound({ert, ans});
        if (it!=tc5.end()) tc5.erase(it);
        tc5.insert({ert, ans});
    }
}
void init(int N, vector<int> sz) {
    vector<int> sz2;
    sz2.push_back(sok);
    for (auto x:sz) sz2.push_back(x);
    sz2.push_back(sok);
    rmq_init(sz2);
    n=N;
    for (int i=0; i<n; i++) {
        t[i+1]=sz[i];
        if (t[i+1]>t[maxi]) maxi=i+1;
    }
    t[0]=sok, t[n+1]=sok;
    for (int i=1; i<=n; i++) {
        if (i<maxi && t[i]>t[i+1] || i>maxi && t[i]>t[i-1]) {
            tc1=0;
        }
    }
    calc_tc5();
}

int slow(int l, int r, int d) {
    int ut=t[l]+d, ans=0, id=1;
    for (int i=l; i<=r; i++) {
        if (id==1) {
            ut=max(ut, t[i]);
            if (ut-t[i]>=d) {
                ut=t[i];
                id=0;
                ans++;
            }
        } else {
            ut=min(ut, t[i]);
            if (t[i]-ut>=d) {
                ut=t[i];
                id=1;
            }
        }
    }
    return ans;
}

int max_towers(int l, int r, int d) {
    l++, r++;
    if (tc1) {
        if (l<=maxi && maxi<=r && max(t[l], t[r])+d<=t[maxi]) return 2;
        return 1;
    }
    if (l==1 && r==n) {
        auto it=tc5.upper_bound({d, 0});
        it--;
        return (*it).second;
    }
    int x=try_tc46(l, r, d);
    if (x) {
        return x;
    }
    return slow(l, r, d);
}
/*
int main()
{
    int N;
    vector<int> P;
    cin >> N;
    for (int i=0; i<N; i++) {
        int x;
        cin >> x;
        P.push_back(x);
    }
    init(N, P);
    int q;
    cin >> q;
    while (q--) {
        int l, r, d;
        cin >> l >> r >> d;
        cout << max_towers(l, r, d) << "\n";
    }
    return 0;
}
*/
/*
5
1 5 3 4 2
1
0 2 1
*/
/*
7
1 2 6 4 5 3 7
*/

Compilation message

towers.cpp: In function 'void init(int, std::vector<int>)':
towers.cpp:188:20: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  188 |         if (i<maxi && t[i]>t[i+1] || i>maxi && t[i]>t[i-1]) {
      |             ~~~~~~~^~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 399 ms 17504 KB Output is correct
2 Correct 589 ms 30616 KB Output is correct
3 Correct 886 ms 30644 KB Output is correct
4 Correct 720 ms 30656 KB Output is correct
5 Correct 544 ms 30612 KB Output is correct
6 Correct 891 ms 30656 KB Output is correct
7 Correct 755 ms 30620 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 720 KB Output is correct
10 Correct 1 ms 720 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '13', found: '16'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '13', found: '16'
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 707 ms 36520 KB Output is correct
2 Correct 1016 ms 36892 KB Output is correct
3 Correct 985 ms 36920 KB Output is correct
4 Correct 1195 ms 40092 KB Output is correct
5 Correct 1048 ms 40028 KB Output is correct
6 Correct 976 ms 40104 KB Output is correct
7 Correct 1099 ms 40092 KB Output is correct
8 Correct 571 ms 30640 KB Output is correct
9 Correct 1004 ms 30656 KB Output is correct
10 Correct 782 ms 30748 KB Output is correct
11 Correct 915 ms 30656 KB Output is correct
12 Correct 784 ms 30684 KB Output is correct
13 Correct 861 ms 30552 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 720 KB Output is correct
16 Correct 1 ms 720 KB Output is correct
17 Correct 156 ms 36768 KB Output is correct
18 Correct 216 ms 40088 KB Output is correct
19 Correct 235 ms 40208 KB Output is correct
20 Correct 29 ms 30656 KB Output is correct
21 Correct 29 ms 30648 KB Output is correct
22 Correct 140 ms 36792 KB Output is correct
23 Correct 244 ms 40020 KB Output is correct
24 Correct 216 ms 39980 KB Output is correct
25 Correct 27 ms 30564 KB Output is correct
26 Correct 29 ms 30656 KB Output is correct
27 Correct 2 ms 848 KB Output is correct
28 Correct 3 ms 848 KB Output is correct
29 Correct 2 ms 848 KB Output is correct
30 Correct 1 ms 720 KB Output is correct
31 Correct 1 ms 720 KB Output is correct
32 Correct 3 ms 720 KB Output is correct
33 Correct 2 ms 848 KB Output is correct
34 Correct 4 ms 904 KB Output is correct
35 Correct 1 ms 720 KB Output is correct
36 Correct 2 ms 720 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 8352 KB Output is correct
2 Correct 938 ms 36892 KB Output is correct
3 Correct 1100 ms 37008 KB Output is correct
4 Correct 1058 ms 39944 KB Output is correct
5 Correct 960 ms 40024 KB Output is correct
6 Correct 964 ms 39992 KB Output is correct
7 Correct 1099 ms 39944 KB Output is correct
8 Correct 917 ms 30640 KB Output is correct
9 Correct 835 ms 30656 KB Output is correct
10 Correct 859 ms 30600 KB Output is correct
11 Correct 755 ms 30664 KB Output is correct
12 Correct 134 ms 36880 KB Output is correct
13 Correct 247 ms 39956 KB Output is correct
14 Correct 219 ms 40120 KB Output is correct
15 Correct 28 ms 30668 KB Output is correct
16 Correct 27 ms 30620 KB Output is correct
17 Correct 146 ms 35584 KB Output is correct
18 Correct 152 ms 36896 KB Output is correct
19 Correct 154 ms 36888 KB Output is correct
20 Correct 206 ms 40028 KB Output is correct
21 Correct 219 ms 39904 KB Output is correct
22 Correct 220 ms 39960 KB Output is correct
23 Correct 228 ms 39992 KB Output is correct
24 Correct 28 ms 30644 KB Output is correct
25 Correct 28 ms 30656 KB Output is correct
26 Correct 28 ms 30664 KB Output is correct
27 Correct 33 ms 30588 KB Output is correct
28 Correct 2 ms 848 KB Output is correct
29 Correct 2 ms 848 KB Output is correct
30 Correct 3 ms 848 KB Output is correct
31 Correct 1 ms 720 KB Output is correct
32 Correct 1 ms 720 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 3 ms 720 KB Output is correct
35 Correct 2 ms 720 KB Output is correct
36 Correct 3 ms 848 KB Output is correct
37 Correct 3 ms 848 KB Output is correct
38 Correct 3 ms 848 KB Output is correct
39 Correct 3 ms 848 KB Output is correct
40 Correct 1 ms 720 KB Output is correct
41 Correct 1 ms 740 KB Output is correct
42 Correct 1 ms 720 KB Output is correct
43 Correct 2 ms 720 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '13', found: '16'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 399 ms 17504 KB Output is correct
2 Correct 589 ms 30616 KB Output is correct
3 Correct 886 ms 30644 KB Output is correct
4 Correct 720 ms 30656 KB Output is correct
5 Correct 544 ms 30612 KB Output is correct
6 Correct 891 ms 30656 KB Output is correct
7 Correct 755 ms 30620 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 720 KB Output is correct
10 Correct 1 ms 720 KB Output is correct
11 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '13', found: '16'
12 Halted 0 ms 0 KB -