oj.uz

Submission #374751

# Submission time Handle Problem Language Result Execution time Memory
374751 2021-03-08T05:37:53 Z jainbot27 Bulldozer (JOI17_bulldozer) C++17
100 / 100
 984 ms 50160 KB 
#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2001;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

struct Frac{
    long long n, d;
    Frac(long long n, long long d){
        if(d == 0){
            this->d = 0;
            this->n = 1;
            return;
        } 
        this->n = n; this->d = d;
        long long g = __gcd(n, d); this->n/=g;  this->d/=g;
        if(this->d < 0){ this->n*=-1; this->d*=-1; };
    }
    Frac(long long n){
        this->n = n; d = 1;
    }
    Frac(){n = 0; d = 1;}
    
    Frac operator-(){return Frac(-n, d);}
    Frac operator+=(const Frac& other){return Frac(n*other.d + other.n*d, d*other.d);}
    Frac operator-=(const Frac& other){return Frac(n*other.d - other.n*d, d*other.d);}
    Frac operator*=(const Frac& other){return Frac(n*other.n, d*other.d);}
    Frac operator/=(const Frac& other){return Frac(n*other.d, d*other.n);}
 
    friend Frac operator+(Frac a, const Frac& b){ return a+=b; }
    friend Frac operator-(Frac a, const Frac& b){ return a-=b; }
    friend Frac operator*(Frac a, const Frac& b){ return a*=b; }
    friend Frac operator/(Frac a, const Frac& b){ return a/=b; }
 
    bool operator==(const Frac& other){ return n==other.n && d==other.d; }
    bool operator<(const Frac& other){ return n*other.d < other.n*d; }
    bool operator!=(const Frac& other){ return !((*this)==other);}
    
    friend string ts(const Frac& a){ return to_string(a.n) + "/" + to_string(a.d); }
    friend ostream& operator<<(ostream& out, Frac &a) { return out << ts(a); } 
};

    typedef ar<ll, 4> T;
    T unit = {0, 0, 0, 0};
struct Tree {
    //[maxpref, maxsuf, maxsum, sum]
    T f(T a, T b) { 
        T res;
        res[0] = max({a[0], a[3]+b[0], 0LL});
        res[1] = max({b[1], a[1]+b[3], 0LL});
        res[2] = max({a[2], b[2], a[1]+b[0], 0LL});
        res[3] = a[3]+b[3];
        //cout << "a: " << a[0] << ' ' << a[1] << ' ' << a[2] << ' ' << a[3] << nl;
        //cout << "b: " << b[0] << ' ' << b[1] << ' ' << b[2] << ' ' << b[3] << nl;
        //cout << "res: " << res[0] << ' ' << res[1] << ' ' << res[2] << ' ' << res[3] << nl;
        return res;
    } // (any associative fn)
    vector<T> s; int n;
    Tree(int n = 0, T def = unit) : s(2*n, def), n(n) {}
    void update(int pos, T val) {
        for (s[pos += n] = f(val, unit); pos /= 2;)
            s[pos] = f(s[pos * 2], s[pos * 2 + 1]);
    }
    T query(int b, int e) { // query [b, e)
        T ra = unit, rb = unit;
        for (b += n, e += n; b < e; b /= 2, e /= 2) {
            if (b % 2) ra = f(ra, s[b++]);
            if (e % 2) rb = f(s[--e], rb);
        }
        return f(ra, rb);
    }
};

int n;
pair<pll, ll> a[mxN];
vector<pair<Frac, pii>> v;
int pos[mxN];
ll ans = 0;

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    F0R(i, n)
        cin >> a[i].f.f >> a[i].f.s >> a[i].s;
    sort(a, a+n);
    F0R(i, n){
        F0R(j, i){
            if(i==j) continue;
            v.pb({Frac(a[i].f.s-a[j].f.s, a[i].f.f-a[j].f.f), {j, i}});
        }
    }
    sort(all(v), [](pair<Frac, pii> A, pair<Frac, pii> B){
        if(A.f==B.f) return A.s < B.s;
        return A.f < B.f;

    });
    F0R(i, n) pos[i] = i;
    Tree st(n);
    F0R(i, n){
        ll val = a[i].s;
        st.update(i, {val, val, val, val});
    }
    //cout << st.query(0, n)[2] << nl;
    //exit(0);
    ckmax(ans, st.query(0, n)[2]);
    F0R(i, siz(v)){
        swap(pos[v[i].s.f], pos[v[i].s.s]);
        ll val = a[v[i].s.f].s;
        st.update(pos[v[i].s.f], {val, val, val, val});
        val = a[v[i].s.s].s;
        st.update(pos[v[i].s.s], {val, val, val, val});
        if(i==siz(v)-1||v[i].f!=v[i+1].f){
            ckmax(ans, st.query(0, n)[2]);
        }
    }
    cout << ans << nl;
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 41 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 2 ms 620 KB Output is correct
22 Correct 2 ms 620 KB Output is correct
23 Correct 88 ms 620 KB Output is correct
24 Correct 2 ms 620 KB Output is correct
25 Correct 2 ms 620 KB Output is correct
26 Correct 124 ms 712 KB Output is correct
27 Correct 3 ms 620 KB Output is correct
28 Correct 89 ms 620 KB Output is correct
29 Correct 2 ms 620 KB Output is correct
30 Correct 2 ms 620 KB Output is correct
31 Correct 2 ms 620 KB Output is correct
32 Correct 2 ms 620 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 41 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 2 ms 620 KB Output is correct
22 Correct 2 ms 620 KB Output is correct
23 Correct 88 ms 620 KB Output is correct
24 Correct 2 ms 620 KB Output is correct
25 Correct 2 ms 620 KB Output is correct
26 Correct 124 ms 712 KB Output is correct
27 Correct 3 ms 620 KB Output is correct
28 Correct 89 ms 620 KB Output is correct
29 Correct 2 ms 620 KB Output is correct
30 Correct 2 ms 620 KB Output is correct
31 Correct 2 ms 620 KB Output is correct
32 Correct 2 ms 620 KB Output is correct
33 Correct 971 ms 49828 KB Output is correct
34 Correct 967 ms 49828 KB Output is correct
35 Correct 976 ms 49784 KB Output is correct
36 Correct 970 ms 49828 KB Output is correct
37 Correct 976 ms 49828 KB Output is correct
38 Correct 971 ms 49828 KB Output is correct
39 Correct 974 ms 49828 KB Output is correct
40 Correct 972 ms 49828 KB Output is correct
41 Correct 966 ms 49828 KB Output is correct
42 Correct 975 ms 49828 KB Output is correct
43 Correct 944 ms 49852 KB Output is correct
44 Correct 923 ms 49828 KB Output is correct
45 Correct 919 ms 49828 KB Output is correct
46 Correct 931 ms 49828 KB Output is correct
47 Correct 923 ms 49828 KB Output is correct
48 Correct 931 ms 49828 KB Output is correct
49 Correct 930 ms 49828 KB Output is correct
50 Correct 928 ms 49972 KB Output is correct
51 Correct 939 ms 49884 KB Output is correct
52 Correct 937 ms 49904 KB Output is correct
53 Correct 927 ms 49828 KB Output is correct
54 Correct 928 ms 49828 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 41 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 2 ms 620 KB Output is correct
22 Correct 2 ms 620 KB Output is correct
23 Correct 88 ms 620 KB Output is correct
24 Correct 2 ms 620 KB Output is correct
25 Correct 2 ms 620 KB Output is correct
26 Correct 124 ms 712 KB Output is correct
27 Correct 3 ms 620 KB Output is correct
28 Correct 89 ms 620 KB Output is correct
29 Correct 2 ms 620 KB Output is correct
30 Correct 2 ms 620 KB Output is correct
31 Correct 2 ms 620 KB Output is correct
32 Correct 2 ms 620 KB Output is correct
33 Correct 971 ms 49828 KB Output is correct
34 Correct 967 ms 49828 KB Output is correct
35 Correct 976 ms 49784 KB Output is correct
36 Correct 970 ms 49828 KB Output is correct
37 Correct 976 ms 49828 KB Output is correct
38 Correct 971 ms 49828 KB Output is correct
39 Correct 974 ms 49828 KB Output is correct
40 Correct 972 ms 49828 KB Output is correct
41 Correct 966 ms 49828 KB Output is correct
42 Correct 975 ms 49828 KB Output is correct
43 Correct 944 ms 49852 KB Output is correct
44 Correct 923 ms 49828 KB Output is correct
45 Correct 919 ms 49828 KB Output is correct
46 Correct 931 ms 49828 KB Output is correct
47 Correct 923 ms 49828 KB Output is correct
48 Correct 931 ms 49828 KB Output is correct
49 Correct 930 ms 49828 KB Output is correct
50 Correct 928 ms 49972 KB Output is correct
51 Correct 939 ms 49884 KB Output is correct
52 Correct 937 ms 49904 KB Output is correct
53 Correct 927 ms 49828 KB Output is correct
54 Correct 928 ms 49828 KB Output is correct
55 Correct 973 ms 50032 KB Output is correct
56 Correct 961 ms 49828 KB Output is correct
57 Correct 970 ms 49904 KB Output is correct
58 Correct 979 ms 49828 KB Output is correct
59 Correct 960 ms 49828 KB Output is correct
60 Correct 968 ms 49828 KB Output is correct
61 Correct 961 ms 49828 KB Output is correct
62 Correct 965 ms 49960 KB Output is correct
63 Correct 972 ms 49852 KB Output is correct
64 Correct 969 ms 49828 KB Output is correct
65 Correct 966 ms 49860 KB Output is correct
66 Correct 970 ms 49828 KB Output is correct
67 Correct 961 ms 49828 KB Output is correct
68 Correct 971 ms 49828 KB Output is correct
69 Correct 965 ms 49956 KB Output is correct
70 Correct 971 ms 49828 KB Output is correct
71 Correct 972 ms 49828 KB Output is correct
72 Correct 981 ms 49828 KB Output is correct
73 Correct 967 ms 49828 KB Output is correct
74 Correct 968 ms 49828 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 620 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 3 ms 620 KB Output is correct
19 Correct 3 ms 768 KB Output is correct
20 Correct 3 ms 620 KB Output is correct
21 Correct 2 ms 620 KB Output is correct
22 Correct 2 ms 620 KB Output is correct
23 Correct 2 ms 620 KB Output is correct
24 Correct 2 ms 620 KB Output is correct
25 Correct 2 ms 620 KB Output is correct
26 Correct 0 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 41 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 2 ms 620 KB Output is correct
37 Correct 2 ms 620 KB Output is correct
38 Correct 88 ms 620 KB Output is correct
39 Correct 2 ms 620 KB Output is correct
40 Correct 2 ms 620 KB Output is correct
41 Correct 124 ms 712 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 89 ms 620 KB Output is correct
44 Correct 2 ms 620 KB Output is correct
45 Correct 2 ms 620 KB Output is correct
46 Correct 2 ms 620 KB Output is correct
47 Correct 2 ms 620 KB Output is correct
48 Correct 971 ms 49828 KB Output is correct
49 Correct 967 ms 49828 KB Output is correct
50 Correct 976 ms 49784 KB Output is correct
51 Correct 970 ms 49828 KB Output is correct
52 Correct 976 ms 49828 KB Output is correct
53 Correct 971 ms 49828 KB Output is correct
54 Correct 974 ms 49828 KB Output is correct
55 Correct 972 ms 49828 KB Output is correct
56 Correct 966 ms 49828 KB Output is correct
57 Correct 975 ms 49828 KB Output is correct
58 Correct 944 ms 49852 KB Output is correct
59 Correct 923 ms 49828 KB Output is correct
60 Correct 919 ms 49828 KB Output is correct
61 Correct 931 ms 49828 KB Output is correct
62 Correct 923 ms 49828 KB Output is correct
63 Correct 931 ms 49828 KB Output is correct
64 Correct 930 ms 49828 KB Output is correct
65 Correct 928 ms 49972 KB Output is correct
66 Correct 939 ms 49884 KB Output is correct
67 Correct 937 ms 49904 KB Output is correct
68 Correct 927 ms 49828 KB Output is correct
69 Correct 928 ms 49828 KB Output is correct
70 Correct 973 ms 50032 KB Output is correct
71 Correct 961 ms 49828 KB Output is correct
72 Correct 970 ms 49904 KB Output is correct
73 Correct 979 ms 49828 KB Output is correct
74 Correct 960 ms 49828 KB Output is correct
75 Correct 968 ms 49828 KB Output is correct
76 Correct 961 ms 49828 KB Output is correct
77 Correct 965 ms 49960 KB Output is correct
78 Correct 972 ms 49852 KB Output is correct
79 Correct 969 ms 49828 KB Output is correct
80 Correct 966 ms 49860 KB Output is correct
81 Correct 970 ms 49828 KB Output is correct
82 Correct 961 ms 49828 KB Output is correct
83 Correct 971 ms 49828 KB Output is correct
84 Correct 965 ms 49956 KB Output is correct
85 Correct 971 ms 49828 KB Output is correct
86 Correct 972 ms 49828 KB Output is correct
87 Correct 981 ms 49828 KB Output is correct
88 Correct 967 ms 49828 KB Output is correct
89 Correct 968 ms 49828 KB Output is correct
90 Correct 984 ms 49972 KB Output is correct
91 Correct 959 ms 49828 KB Output is correct
92 Correct 963 ms 49960 KB Output is correct
93 Correct 971 ms 49828 KB Output is correct
94 Correct 970 ms 49828 KB Output is correct
95 Correct 968 ms 49828 KB Output is correct
96 Correct 967 ms 49828 KB Output is correct
97 Correct 969 ms 49828 KB Output is correct
98 Correct 971 ms 49908 KB Output is correct
99 Correct 965 ms 49828 KB Output is correct
100 Correct 686 ms 49828 KB Output is correct
101 Correct 685 ms 49828 KB Output is correct
102 Correct 685 ms 49828 KB Output is correct
103 Correct 680 ms 49828 KB Output is correct
104 Correct 675 ms 49828 KB Output is correct
105 Correct 753 ms 49840 KB Output is correct
106 Correct 744 ms 50160 KB Output is correct
107 Correct 758 ms 49852 KB Output is correct
108 Correct 754 ms 49956 KB Output is correct
109 Correct 751 ms 49828 KB Output is correct
110 Correct 801 ms 49828 KB Output is correct
111 Correct 803 ms 49956 KB Output is correct
112 Correct 810 ms 49828 KB Output is correct
113 Correct 798 ms 49828 KB Output is correct
114 Correct 811 ms 49828 KB Output is correct
115 Correct 805 ms 49956 KB Output is correct
116 Correct 804 ms 49828 KB Output is correct
117 Correct 796 ms 49828 KB Output is correct
118 Correct 795 ms 49828 KB Output is correct
119 Correct 813 ms 49828 KB Output is correct
120 Correct 1 ms 364 KB Output is correct
121 Correct 1 ms 364 KB Output is correct
122 Correct 846 ms 49828 KB Output is correct
123 Correct 836 ms 49828 KB Output is correct
124 Correct 849 ms 49852 KB Output is correct
125 Correct 841 ms 49828 KB Output is correct
126 Correct 834 ms 49828 KB Output is correct
127 Correct 843 ms 49828 KB Output is correct
128 Correct 852 ms 49828 KB Output is correct
129 Correct 861 ms 49972 KB Output is correct
130 Correct 836 ms 49828 KB Output is correct
131 Correct 867 ms 49828 KB Output is correct
132 Correct 862 ms 49828 KB Output is correct
133 Correct 853 ms 49784 KB Output is correct