oj.uz

Submission #1110122

# Submission time Handle Problem Language Result Execution time Memory
1110122 2024-11-08T19:29:09 Z vladilius Bulldozer (JOI17_bulldozer) C++17
80 / 100
 826 ms 35932 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second

struct ST{
    struct node{
        ll pr, sf, mx, s;
    };
    vector<node> t;
    int n;
    ST(int ns){
        n = ns;
        t.resize(4 * n);
    }
    void upd(int v, int tl, int tr, int& p, int& x){
        if (tl == tr){
            t[v].s = x;
            t[v].pr = t[v].sf = t[v].mx = max(0, x);
            return;
        }
        int tm = (tl + tr) / 2, vv = 2 * v;
        if (p <= tm){
            upd(vv, tl, tm, p, x);
        }
        else {
            upd(vv + 1, tm + 1, tr, p, x);
        }
        t[v].s = t[vv].s + t[vv + 1].s;
        t[v].mx = max({t[vv].mx, t[vv + 1].mx, t[vv].sf + t[vv + 1].pr});
        t[v].pr = max(t[vv].pr, t[vv].s + t[vv + 1].pr);
        t[v].sf = max(t[vv + 1].sf, t[vv + 1].s + t[vv].sf);
    }
    void upd(int p, int x){
        upd(1, 1, n, p, x);
    }
    ll get(){
        return t[1].mx;
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n; cin>>n;
    vector<int> x(n + 1), y(n + 1), a(n + 1), f = {0};
    for (int i = 1; i <= n; i++){
        cin>>x[i]>>y[i]>>a[i];
        f.pb(i);
    }
    
    auto cmp = [&](int i, int j){
        if (x[i] == x[j]){
            return y[i] < y[j];
        }
        return x[i] < x[j];
    };
    sort(f.begin() + 1, f.end(), cmp);
    vector<int> p(n + 1);
    for (int i = 1; i <= n; i++){
        p[f[i]] = i;
    }
    ST T(n);
    for (int i = 1; i <= n; i++){
        T.upd(p[i], a[i]);
    }
    ll out = T.get();
    
    vector<pair<pii, pii>> all;
    for (int i = 1; i <= n; i++){
        for (int j = i + 1; j <= n; j++){
            if (x[f[i]] != x[f[j]]){
                all.pb({{y[f[j]] - y[f[i]], x[f[j]] - x[f[i]]}, {f[i], f[j]}});
            }
        }
    }
    
    auto cmp1 = [&](pair<pii, pii> a, pair<pii, pii> b){
        auto [u1, v1] = a.ff;
        auto [u2, v2] = b.ff;
        return 1LL * u1 * v2 < 1LL * u2 * v1;
    };
    
    sort(all.begin(), all.end(), cmp1);
    vector<bool> used(n + 1);
    vector<pair<ld, int>> ff;
    vector<int> pp;
    int i = 0;
    while (i < all.size()){
        int j = i;
        while (j < all.size() && (1LL * all[i].ff.ff * all[j].ff.ss) == (1LL * all[i].ff.ss * all[j].ff.ff)){
            j++;
        }
        
        ld d = 1.0 * all[i].ff.ff / all[i].ff.ss + 0.00001;
        ff.clear(); pp.clear();
        for (int k = i; k < j; k++){
            auto [u, v] = all[k].ss;
            if (!used[u]){
                used[u] = 1;
                ff.pb({1.0 * y[u] - d * x[u], u});
                pp.pb(p[u]);
            }
            if (!used[v]){
                used[v] = 1;
                ff.pb({1.0 * y[v] - d * x[v], v});
                pp.pb(p[v]);
            }
        }
        sort(ff.begin(), ff.end());
        sort(pp.begin(), pp.end());
        for (int i = 0; i < pp.size(); i++){
            p[ff[i].ss] = pp[i];
            T.upd(pp[i], a[ff[i].ss]);
        }
        for (int k = i; k < j; k++){
            auto [u, v] = all[k].ss;
            used[u] = used[v] = 0;
        }
        
        out = max(out, T.get());
        i = j;
    }
    
    cout<<out<<"\n";
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:95:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |     while (i < all.size()){
      |            ~~^~~~~~~~~~~~
bulldozer.cpp:97:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |         while (j < all.size() && (1LL * all[i].ff.ff * all[j].ff.ss) == (1LL * all[i].ff.ss * all[j].ff.ff)){
      |                ~~^~~~~~~~~~~~
bulldozer.cpp:118:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |         for (int i = 0; i < pp.size(); i++){
      |                         ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 504 KB Output is correct
15 Correct 1 ms 336 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 2 ms 592 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 2 ms 592 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 760 KB Output is correct
24 Correct 2 ms 592 KB Output is correct
25 Correct 2 ms 592 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 3 ms 592 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 2 ms 592 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 764 KB Output is correct
32 Correct 2 ms 592 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 2 ms 592 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 2 ms 592 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 760 KB Output is correct
24 Correct 2 ms 592 KB Output is correct
25 Correct 2 ms 592 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 3 ms 592 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 2 ms 592 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 764 KB Output is correct
32 Correct 2 ms 592 KB Output is correct
33 Correct 762 ms 35776 KB Output is correct
34 Correct 793 ms 35764 KB Output is correct
35 Correct 786 ms 35764 KB Output is correct
36 Correct 825 ms 35764 KB Output is correct
37 Correct 785 ms 35764 KB Output is correct
38 Correct 769 ms 35764 KB Output is correct
39 Correct 820 ms 35764 KB Output is correct
40 Correct 807 ms 35764 KB Output is correct
41 Correct 823 ms 35764 KB Output is correct
42 Correct 797 ms 35764 KB Output is correct
43 Correct 788 ms 35764 KB Output is correct
44 Correct 803 ms 35764 KB Output is correct
45 Correct 812 ms 35764 KB Output is correct
46 Correct 788 ms 35764 KB Output is correct
47 Correct 787 ms 35764 KB Output is correct
48 Correct 778 ms 35932 KB Output is correct
49 Correct 762 ms 35764 KB Output is correct
50 Correct 763 ms 35764 KB Output is correct
51 Correct 820 ms 35764 KB Output is correct
52 Correct 777 ms 35932 KB Output is correct
53 Correct 776 ms 35764 KB Output is correct
54 Correct 777 ms 35764 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 2 ms 592 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 2 ms 592 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 760 KB Output is correct
24 Correct 2 ms 592 KB Output is correct
25 Correct 2 ms 592 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 3 ms 592 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 2 ms 592 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 764 KB Output is correct
32 Correct 2 ms 592 KB Output is correct
33 Correct 762 ms 35776 KB Output is correct
34 Correct 793 ms 35764 KB Output is correct
35 Correct 786 ms 35764 KB Output is correct
36 Correct 825 ms 35764 KB Output is correct
37 Correct 785 ms 35764 KB Output is correct
38 Correct 769 ms 35764 KB Output is correct
39 Correct 820 ms 35764 KB Output is correct
40 Correct 807 ms 35764 KB Output is correct
41 Correct 823 ms 35764 KB Output is correct
42 Correct 797 ms 35764 KB Output is correct
43 Correct 788 ms 35764 KB Output is correct
44 Correct 803 ms 35764 KB Output is correct
45 Correct 812 ms 35764 KB Output is correct
46 Correct 788 ms 35764 KB Output is correct
47 Correct 787 ms 35764 KB Output is correct
48 Correct 778 ms 35932 KB Output is correct
49 Correct 762 ms 35764 KB Output is correct
50 Correct 763 ms 35764 KB Output is correct
51 Correct 820 ms 35764 KB Output is correct
52 Correct 777 ms 35932 KB Output is correct
53 Correct 776 ms 35764 KB Output is correct
54 Correct 777 ms 35764 KB Output is correct
55 Correct 788 ms 35764 KB Output is correct
56 Correct 795 ms 35832 KB Output is correct
57 Correct 784 ms 35764 KB Output is correct
58 Correct 797 ms 35764 KB Output is correct
59 Correct 793 ms 35772 KB Output is correct
60 Correct 790 ms 35764 KB Output is correct
61 Correct 798 ms 35792 KB Output is correct
62 Correct 796 ms 35756 KB Output is correct
63 Correct 816 ms 35764 KB Output is correct
64 Correct 770 ms 35764 KB Output is correct
65 Correct 799 ms 35764 KB Output is correct
66 Correct 790 ms 35764 KB Output is correct
67 Correct 772 ms 35764 KB Output is correct
68 Correct 768 ms 35764 KB Output is correct
69 Correct 764 ms 35764 KB Output is correct
70 Correct 799 ms 35764 KB Output is correct
71 Correct 782 ms 35764 KB Output is correct
72 Correct 789 ms 35764 KB Output is correct
73 Correct 803 ms 35764 KB Output is correct
74 Correct 783 ms 35764 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 504 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 3 ms 592 KB Output is correct
17 Correct 2 ms 592 KB Output is correct
18 Correct 2 ms 592 KB Output is correct
19 Correct 2 ms 592 KB Output is correct
20 Correct 3 ms 592 KB Output is correct
21 Correct 3 ms 592 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 2 ms 592 KB Output is correct
24 Correct 2 ms 592 KB Output is correct
25 Correct 2 ms 592 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 2 ms 592 KB Output is correct
37 Correct 2 ms 460 KB Output is correct
38 Correct 2 ms 760 KB Output is correct
39 Correct 2 ms 592 KB Output is correct
40 Correct 2 ms 592 KB Output is correct
41 Correct 2 ms 592 KB Output is correct
42 Correct 3 ms 592 KB Output is correct
43 Correct 2 ms 592 KB Output is correct
44 Correct 2 ms 592 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 2 ms 764 KB Output is correct
47 Correct 2 ms 592 KB Output is correct
48 Correct 762 ms 35776 KB Output is correct
49 Correct 793 ms 35764 KB Output is correct
50 Correct 786 ms 35764 KB Output is correct
51 Correct 825 ms 35764 KB Output is correct
52 Correct 785 ms 35764 KB Output is correct
53 Correct 769 ms 35764 KB Output is correct
54 Correct 820 ms 35764 KB Output is correct
55 Correct 807 ms 35764 KB Output is correct
56 Correct 823 ms 35764 KB Output is correct
57 Correct 797 ms 35764 KB Output is correct
58 Correct 788 ms 35764 KB Output is correct
59 Correct 803 ms 35764 KB Output is correct
60 Correct 812 ms 35764 KB Output is correct
61 Correct 788 ms 35764 KB Output is correct
62 Correct 787 ms 35764 KB Output is correct
63 Correct 778 ms 35932 KB Output is correct
64 Correct 762 ms 35764 KB Output is correct
65 Correct 763 ms 35764 KB Output is correct
66 Correct 820 ms 35764 KB Output is correct
67 Correct 777 ms 35932 KB Output is correct
68 Correct 776 ms 35764 KB Output is correct
69 Correct 777 ms 35764 KB Output is correct
70 Correct 788 ms 35764 KB Output is correct
71 Correct 795 ms 35832 KB Output is correct
72 Correct 784 ms 35764 KB Output is correct
73 Correct 797 ms 35764 KB Output is correct
74 Correct 793 ms 35772 KB Output is correct
75 Correct 790 ms 35764 KB Output is correct
76 Correct 798 ms 35792 KB Output is correct
77 Correct 796 ms 35756 KB Output is correct
78 Correct 816 ms 35764 KB Output is correct
79 Correct 770 ms 35764 KB Output is correct
80 Correct 799 ms 35764 KB Output is correct
81 Correct 790 ms 35764 KB Output is correct
82 Correct 772 ms 35764 KB Output is correct
83 Correct 768 ms 35764 KB Output is correct
84 Correct 764 ms 35764 KB Output is correct
85 Correct 799 ms 35764 KB Output is correct
86 Correct 782 ms 35764 KB Output is correct
87 Correct 789 ms 35764 KB Output is correct
88 Correct 803 ms 35764 KB Output is correct
89 Correct 783 ms 35764 KB Output is correct
90 Correct 808 ms 35764 KB Output is correct
91 Correct 803 ms 35764 KB Output is correct
92 Correct 802 ms 35644 KB Output is correct
93 Correct 752 ms 35764 KB Output is correct
94 Correct 765 ms 35764 KB Output is correct
95 Correct 811 ms 35764 KB Output is correct
96 Correct 787 ms 35764 KB Output is correct
97 Correct 798 ms 35784 KB Output is correct
98 Correct 776 ms 35764 KB Output is correct
99 Correct 794 ms 35764 KB Output is correct
100 Correct 359 ms 19384 KB Output is correct
101 Correct 403 ms 19380 KB Output is correct
102 Correct 356 ms 19384 KB Output is correct
103 Correct 354 ms 19552 KB Output is correct
104 Correct 359 ms 19380 KB Output is correct
105 Correct 514 ms 35764 KB Output is correct
106 Correct 488 ms 35760 KB Output is correct
107 Correct 481 ms 35720 KB Output is correct
108 Correct 503 ms 35764 KB Output is correct
109 Correct 495 ms 35760 KB Output is correct
110 Correct 669 ms 35764 KB Output is correct
111 Correct 628 ms 35764 KB Output is correct
112 Correct 651 ms 35756 KB Output is correct
113 Correct 655 ms 35764 KB Output is correct
114 Correct 668 ms 35756 KB Output is correct
115 Correct 644 ms 35752 KB Output is correct
116 Correct 639 ms 35800 KB Output is correct
117 Correct 656 ms 35764 KB Output is correct
118 Correct 676 ms 35764 KB Output is correct
119 Correct 657 ms 35764 KB Output is correct
120 Correct 1 ms 336 KB Output is correct
121 Correct 1 ms 336 KB Output is correct
122 Correct 826 ms 35756 KB Output is correct
123 Incorrect 816 ms 35764 KB Output isn't correct
124 Halted 0 ms 0 KB -