oj.uz

Submission #629716

# Submission time Handle Problem Language Result Execution time Memory
629716 2022-08-14T23:37:12 Z peti1234 Radio Towers (IOI22_towers) C++17
44 / 100
 4000 ms 11072 KB 
#include <bits/stdc++.h>

using namespace std;
const int c=100005, sok=2e9+5;
int n, t[c], maxi;
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]);
}
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) {
    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 lassu(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;
    }
    return lassu(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
*/
/*
7
1 2 6 4 5 3 7
*/

Compilation message

towers.cpp: In function 'void init(int, std::vector<int>)':
towers.cpp:80:20: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   80 |         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 301 ms 976 KB Output is correct
2 Correct 730 ms 1360 KB Output is correct
3 Correct 660 ms 1448 KB Output is correct
4 Correct 447 ms 1452 KB Output is correct
5 Correct 732 ms 1456 KB Output is correct
6 Correct 758 ms 1432 KB Output is correct
7 Correct 885 ms 1456 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 2 ms 464 KB Output is correct
5 Correct 2 ms 464 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 2 ms 464 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 464 KB Output is correct
22 Correct 3 ms 464 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 2 ms 464 KB Output is correct
30 Correct 2 ms 476 KB Output is correct
31 Correct 2 ms 464 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 0 ms 312 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 2 ms 464 KB Output is correct
5 Correct 2 ms 464 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 2 ms 464 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 464 KB Output is correct
22 Correct 3 ms 464 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 2 ms 464 KB Output is correct
30 Correct 2 ms 476 KB Output is correct
31 Correct 2 ms 464 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 0 ms 312 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 75 ms 5156 KB Output is correct
37 Correct 122 ms 7836 KB Output is correct
38 Correct 134 ms 7924 KB Output is correct
39 Correct 224 ms 10948 KB Output is correct
40 Correct 207 ms 10952 KB Output is correct
41 Correct 235 ms 10948 KB Output is correct
42 Correct 216 ms 10956 KB Output is correct
43 Correct 12 ms 1444 KB Output is correct
44 Correct 12 ms 1452 KB Output is correct
45 Correct 15 ms 1568 KB Output is correct
46 Correct 17 ms 1452 KB Output is correct
47 Correct 121 ms 7812 KB Output is correct
48 Correct 204 ms 10960 KB Output is correct
49 Correct 257 ms 10912 KB Output is correct
50 Correct 11 ms 1444 KB Output is correct
51 Correct 17 ms 1428 KB Output is correct
52 Correct 118 ms 7740 KB Output is correct
53 Correct 261 ms 10920 KB Output is correct
54 Correct 219 ms 10912 KB Output is correct
55 Correct 17 ms 1480 KB Output is correct
56 Correct 17 ms 1352 KB Output is correct
57 Correct 147 ms 7692 KB Output is correct
58 Correct 155 ms 7744 KB Output is correct
59 Correct 128 ms 7836 KB Output is correct
60 Correct 220 ms 10824 KB Output is correct
61 Correct 210 ms 10952 KB Output is correct
62 Correct 203 ms 10920 KB Output is correct
63 Correct 198 ms 10956 KB Output is correct
64 Correct 20 ms 1460 KB Output is correct
65 Correct 13 ms 1460 KB Output is correct
66 Correct 17 ms 1448 KB Output is correct
67 Correct 21 ms 1440 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4035 ms 7752 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 2000 KB Output is correct
2 Correct 1010 ms 7716 KB Output is correct
3 Correct 924 ms 7820 KB Output is correct
4 Correct 1135 ms 10952 KB Output is correct
5 Correct 1227 ms 10920 KB Output is correct
6 Correct 960 ms 10952 KB Output is correct
7 Correct 925 ms 10928 KB Output is correct
8 Correct 756 ms 1440 KB Output is correct
9 Correct 688 ms 1360 KB Output is correct
10 Correct 663 ms 1472 KB Output is correct
11 Correct 842 ms 1444 KB Output is correct
12 Correct 147 ms 7764 KB Output is correct
13 Correct 193 ms 10916 KB Output is correct
14 Correct 197 ms 10824 KB Output is correct
15 Correct 20 ms 1488 KB Output is correct
16 Correct 13 ms 1448 KB Output is correct
17 Correct 119 ms 7548 KB Output is correct
18 Correct 131 ms 7740 KB Output is correct
19 Correct 133 ms 7720 KB Output is correct
20 Correct 234 ms 10956 KB Output is correct
21 Correct 221 ms 10912 KB Output is correct
22 Correct 258 ms 10956 KB Output is correct
23 Correct 239 ms 11072 KB Output is correct
24 Correct 12 ms 1440 KB Output is correct
25 Correct 13 ms 1356 KB Output is correct
26 Correct 12 ms 1452 KB Output is correct
27 Correct 18 ms 1352 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 3 ms 464 KB Output is correct
30 Correct 3 ms 464 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 2 ms 336 KB Output is correct
35 Correct 2 ms 336 KB Output is correct
36 Correct 2 ms 464 KB Output is correct
37 Correct 2 ms 464 KB Output is correct
38 Correct 3 ms 464 KB Output is correct
39 Correct 4 ms 464 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 1 ms 208 KB Output is correct
42 Correct 1 ms 208 KB Output is correct
43 Correct 1 ms 208 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 2 ms 464 KB Output is correct
5 Correct 2 ms 464 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 2 ms 464 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 464 KB Output is correct
22 Correct 3 ms 464 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 2 ms 464 KB Output is correct
30 Correct 2 ms 476 KB Output is correct
31 Correct 2 ms 464 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 0 ms 312 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 75 ms 5156 KB Output is correct
37 Correct 122 ms 7836 KB Output is correct
38 Correct 134 ms 7924 KB Output is correct
39 Correct 224 ms 10948 KB Output is correct
40 Correct 207 ms 10952 KB Output is correct
41 Correct 235 ms 10948 KB Output is correct
42 Correct 216 ms 10956 KB Output is correct
43 Correct 12 ms 1444 KB Output is correct
44 Correct 12 ms 1452 KB Output is correct
45 Correct 15 ms 1568 KB Output is correct
46 Correct 17 ms 1452 KB Output is correct
47 Correct 121 ms 7812 KB Output is correct
48 Correct 204 ms 10960 KB Output is correct
49 Correct 257 ms 10912 KB Output is correct
50 Correct 11 ms 1444 KB Output is correct
51 Correct 17 ms 1428 KB Output is correct
52 Correct 118 ms 7740 KB Output is correct
53 Correct 261 ms 10920 KB Output is correct
54 Correct 219 ms 10912 KB Output is correct
55 Correct 17 ms 1480 KB Output is correct
56 Correct 17 ms 1352 KB Output is correct
57 Correct 147 ms 7692 KB Output is correct
58 Correct 155 ms 7744 KB Output is correct
59 Correct 128 ms 7836 KB Output is correct
60 Correct 220 ms 10824 KB Output is correct
61 Correct 210 ms 10952 KB Output is correct
62 Correct 203 ms 10920 KB Output is correct
63 Correct 198 ms 10956 KB Output is correct
64 Correct 20 ms 1460 KB Output is correct
65 Correct 13 ms 1460 KB Output is correct
66 Correct 17 ms 1448 KB Output is correct
67 Correct 21 ms 1440 KB Output is correct
68 Execution timed out 4035 ms 7752 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 976 KB Output is correct
2 Correct 730 ms 1360 KB Output is correct
3 Correct 660 ms 1448 KB Output is correct
4 Correct 447 ms 1452 KB Output is correct
5 Correct 732 ms 1456 KB Output is correct
6 Correct 758 ms 1432 KB Output is correct
7 Correct 885 ms 1456 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 2 ms 464 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 2 ms 336 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 2 ms 464 KB Output is correct
28 Correct 0 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 3 ms 464 KB Output is correct
32 Correct 3 ms 464 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 2 ms 336 KB Output is correct
37 Correct 2 ms 336 KB Output is correct
38 Correct 2 ms 464 KB Output is correct
39 Correct 2 ms 464 KB Output is correct
40 Correct 2 ms 476 KB Output is correct
41 Correct 2 ms 464 KB Output is correct
42 Correct 1 ms 208 KB Output is correct
43 Correct 0 ms 312 KB Output is correct
44 Correct 1 ms 208 KB Output is correct
45 Correct 1 ms 208 KB Output is correct
46 Correct 75 ms 5156 KB Output is correct
47 Correct 122 ms 7836 KB Output is correct
48 Correct 134 ms 7924 KB Output is correct
49 Correct 224 ms 10948 KB Output is correct
50 Correct 207 ms 10952 KB Output is correct
51 Correct 235 ms 10948 KB Output is correct
52 Correct 216 ms 10956 KB Output is correct
53 Correct 12 ms 1444 KB Output is correct
54 Correct 12 ms 1452 KB Output is correct
55 Correct 15 ms 1568 KB Output is correct
56 Correct 17 ms 1452 KB Output is correct
57 Correct 121 ms 7812 KB Output is correct
58 Correct 204 ms 10960 KB Output is correct
59 Correct 257 ms 10912 KB Output is correct
60 Correct 11 ms 1444 KB Output is correct
61 Correct 17 ms 1428 KB Output is correct
62 Correct 118 ms 7740 KB Output is correct
63 Correct 261 ms 10920 KB Output is correct
64 Correct 219 ms 10912 KB Output is correct
65 Correct 17 ms 1480 KB Output is correct
66 Correct 17 ms 1352 KB Output is correct
67 Correct 147 ms 7692 KB Output is correct
68 Correct 155 ms 7744 KB Output is correct
69 Correct 128 ms 7836 KB Output is correct
70 Correct 220 ms 10824 KB Output is correct
71 Correct 210 ms 10952 KB Output is correct
72 Correct 203 ms 10920 KB Output is correct
73 Correct 198 ms 10956 KB Output is correct
74 Correct 20 ms 1460 KB Output is correct
75 Correct 13 ms 1460 KB Output is correct
76 Correct 17 ms 1448 KB Output is correct
77 Correct 21 ms 1440 KB Output is correct
78 Execution timed out 4035 ms 7752 KB Time limit exceeded
79 Halted 0 ms 0 KB -