oj.uz

Submission #543379

# Submission time Handle Problem Language Result Execution time Memory
543379 2022-03-30T12:25:30 Z SmolBrain Fuel Station (NOI20_fuelstation) C++17
67 / 100
 3000 ms 14524 KB 
// Om Namah Shivaya
// GM in 125 days

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n, d; cin >> n >> d;
    vector<array<ll, 3>> a(n);
    rep(i, n) rep(j, 3) cin >> a[i][j];

    sort(all(a));

    auto check = [&](ll f) {
        ll prev = 0, fuel = f;

        rep(i, n) {
            auto [x, add, mx] = a[i];
            ll dis = x - prev;
            fuel -= dis;

            if (fuel < 0) {
                return false;
            }

            if (f <= mx) {
                fuel += add;
            }

            prev = x;
        }

        ll dis = d - prev;
        fuel -= dis;

        if (fuel < 0) return false;

        return true;
    };

    ll ans = d;

    vector<array<ll, 3>> b(n);
    rep(i, n) {
        auto [x, toadd, mx] = a[i];
        b[i] = {mx, x, toadd};
    }

    ll l = -1, r = -1;

    rep(i, n) {
        ll f = b[i][0];
        if (check(f)) {
            ans = f;

            if (i) {
                l = b[i - 1][0];
            }
            else {
                l = 1;
            }

            r = f;

            break;
        }
    }

    if (l == -1) {
        cout << ans << endl;
        return;
    }

    while (l <= r) {
        ll mid = (l + r) / 2;
        if (check(mid)) {
            amin(ans, mid);
            r = mid - 1;
        }
        else {
            l = mid + 1;
        }
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

FuelStation.cpp: In function 'void usaco(std::string)':
FuelStation.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
FuelStation.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 14396 KB Output is correct
2 Correct 145 ms 14400 KB Output is correct
3 Correct 142 ms 14284 KB Output is correct
4 Correct 146 ms 14396 KB Output is correct
5 Correct 139 ms 14396 KB Output is correct
6 Correct 141 ms 14392 KB Output is correct
7 Correct 139 ms 14404 KB Output is correct
8 Correct 142 ms 14404 KB Output is correct
9 Correct 139 ms 14396 KB Output is correct
10 Correct 139 ms 14396 KB Output is correct
11 Correct 142 ms 14280 KB Output is correct
12 Correct 142 ms 14412 KB Output is correct
13 Correct 143 ms 14392 KB Output is correct
14 Correct 147 ms 14392 KB Output is correct
15 Correct 144 ms 14392 KB Output is correct
16 Correct 144 ms 14400 KB Output is correct
17 Correct 138 ms 14392 KB Output is correct
18 Correct 139 ms 14396 KB Output is correct
19 Correct 139 ms 14408 KB Output is correct
20 Correct 144 ms 14280 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 4 ms 724 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Correct 4 ms 724 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 4 ms 724 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 5 ms 724 KB Output is correct
21 Correct 5 ms 724 KB Output is correct
22 Correct 4 ms 724 KB Output is correct
23 Correct 4 ms 724 KB Output is correct
24 Correct 4 ms 724 KB Output is correct
25 Correct 4 ms 724 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 4 ms 724 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Correct 4 ms 724 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 4 ms 724 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 5 ms 724 KB Output is correct
21 Correct 5 ms 724 KB Output is correct
22 Correct 4 ms 724 KB Output is correct
23 Correct 4 ms 724 KB Output is correct
24 Correct 4 ms 724 KB Output is correct
25 Correct 4 ms 724 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 109 ms 14396 KB Output is correct
28 Correct 104 ms 14404 KB Output is correct
29 Correct 104 ms 14392 KB Output is correct
30 Correct 108 ms 14292 KB Output is correct
31 Correct 107 ms 14404 KB Output is correct
32 Correct 109 ms 14524 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 232 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 112 ms 14412 KB Output is correct
40 Correct 101 ms 14284 KB Output is correct
41 Correct 105 ms 14388 KB Output is correct
42 Correct 104 ms 14396 KB Output is correct
43 Correct 105 ms 14404 KB Output is correct
44 Correct 578 ms 14412 KB Output is correct
45 Execution timed out 3076 ms 14280 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 316 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 316 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 252 KB Output is correct
30 Correct 1 ms 212 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 4 ms 724 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 3 ms 724 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 4 ms 724 KB Output is correct
30 Correct 4 ms 724 KB Output is correct
31 Correct 4 ms 724 KB Output is correct
32 Correct 4 ms 724 KB Output is correct
33 Correct 4 ms 724 KB Output is correct
34 Correct 4 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 5 ms 724 KB Output is correct
37 Correct 4 ms 724 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 4 ms 724 KB Output is correct
40 Correct 4 ms 724 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 5 ms 724 KB Output is correct
43 Correct 4 ms 724 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 4 ms 696 KB Output is correct
46 Correct 5 ms 724 KB Output is correct
47 Correct 5 ms 724 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 4 ms 724 KB Output is correct
55 Correct 4 ms 724 KB Output is correct
56 Correct 5 ms 724 KB Output is correct
57 Correct 4 ms 976 KB Output is correct
58 Correct 5 ms 980 KB Output is correct
59 Correct 5 ms 976 KB Output is correct
60 Correct 7 ms 1108 KB Output is correct
61 Correct 5 ms 980 KB Output is correct
62 Correct 5 ms 968 KB Output is correct
63 Correct 5 ms 932 KB Output is correct
64 Correct 6 ms 980 KB Output is correct
65 Correct 5 ms 972 KB Output is correct

Subtask #7
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 142 ms 14396 KB Output is correct
17 Correct 145 ms 14400 KB Output is correct
18 Correct 142 ms 14284 KB Output is correct
19 Correct 146 ms 14396 KB Output is correct
20 Correct 139 ms 14396 KB Output is correct
21 Correct 141 ms 14392 KB Output is correct
22 Correct 139 ms 14404 KB Output is correct
23 Correct 142 ms 14404 KB Output is correct
24 Correct 139 ms 14396 KB Output is correct
25 Correct 139 ms 14396 KB Output is correct
26 Correct 142 ms 14280 KB Output is correct
27 Correct 142 ms 14412 KB Output is correct
28 Correct 143 ms 14392 KB Output is correct
29 Correct 147 ms 14392 KB Output is correct
30 Correct 144 ms 14392 KB Output is correct
31 Correct 144 ms 14400 KB Output is correct
32 Correct 138 ms 14392 KB Output is correct
33 Correct 139 ms 14396 KB Output is correct
34 Correct 139 ms 14408 KB Output is correct
35 Correct 144 ms 14280 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 4 ms 724 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 3 ms 724 KB Output is correct
40 Correct 3 ms 724 KB Output is correct
41 Correct 3 ms 724 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 4 ms 724 KB Output is correct
50 Correct 4 ms 724 KB Output is correct
51 Correct 4 ms 724 KB Output is correct
52 Correct 4 ms 724 KB Output is correct
53 Correct 4 ms 724 KB Output is correct
54 Correct 4 ms 724 KB Output is correct
55 Correct 5 ms 724 KB Output is correct
56 Correct 5 ms 724 KB Output is correct
57 Correct 4 ms 724 KB Output is correct
58 Correct 4 ms 724 KB Output is correct
59 Correct 4 ms 724 KB Output is correct
60 Correct 4 ms 724 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 109 ms 14396 KB Output is correct
63 Correct 104 ms 14404 KB Output is correct
64 Correct 104 ms 14392 KB Output is correct
65 Correct 108 ms 14292 KB Output is correct
66 Correct 107 ms 14404 KB Output is correct
67 Correct 109 ms 14524 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 1 ms 232 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 0 ms 212 KB Output is correct
74 Correct 112 ms 14412 KB Output is correct
75 Correct 101 ms 14284 KB Output is correct
76 Correct 105 ms 14388 KB Output is correct
77 Correct 104 ms 14396 KB Output is correct
78 Correct 105 ms 14404 KB Output is correct
79 Correct 578 ms 14412 KB Output is correct
80 Execution timed out 3076 ms 14280 KB Time limit exceeded
81 Halted 0 ms 0 KB -