oj.uz

Submission #1092654

# Submission time Handle Problem Language Result Execution time Memory
1092654 2024-09-24T16:54:48 Z vjudge1 Pinball (JOI14_pinball) C++17
100 / 100
 307 ms 26976 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC target("popcnt")
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
 
using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
using vlld = vector<lld>;
 
// #define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
 
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)
 
bool cmin(ll &a, ll b) { if(b<a){a=b;return 1;}return 0; }
bool cmax(ll &a, ll b) { if(b>a){a=b;return 1;}return 0; }
void valid(ll in) { cout<<((in)?"YES\n":"NO\n"); }
ll lcm(ll a, ll b) { return (a/gcd(a,b))*b; }
ll gauss(ll n) { return (n*(n+1))/2; }

struct SegTree {
    int l, r;
    ll mn;
    SegTree *left, *right;

    SegTree (int l, int r): l(l), r(r), mn(1e18), left(nullptr), right(nullptr) {  }
    SegTree (int l, int r, ll mn): l(l), r(r), mn(mn), left(nullptr), right(nullptr) {  }

    void check ( ) {
        int m = (l+r)/2;
        if (left == nullptr) left = new SegTree (l, m);
        if (right == nullptr) right = new SegTree (m+1, r);
    }

    void update(int i, ll v) {
        if (i>r || l>i) return;
        if (i<=l && r<=i) {
            mn = v;
            return;
        }
        check();
        left->update(i, v);
        right->update(i, v);
        mn = min(left->mn, right->mn);
    }

    ll query(int i, int j) {
        if (i>r || l>j || i>j) return 1e18;
        if (i<=l && r<=j) return mn;
        check();
        return min(left->query(i, j), right->query(i, j));
    }
};

const int N = 1e5 + 7;
struct device { ll a, b, c, d; };

void test_case() {
    ll n, m;
    cin >> n >> m;
    vector<device> a(n+1);
    ll ans = 1e18;
    vll rd;
    fore (i, 1, n+1) {
        cin >> a[i].a >> a[i].b >> a[i].c >> a[i].d;
        rd.pb(a[i].c);
    }
    rd.pb(1);
    rd.pb(m);
    sort(all(rd));
    SegTree *dp1 = new SegTree(0, n+1);
    SegTree *dpn = new SegTree(0, n+1);
    dp1->update(0, 0);
    dpn->update(n+1, 0);
    fore (i, 1, n+1) {
        int l = lower_bound(all(rd), a[i].a)-rd.begin(), r = upper_bound(all(rd), a[i].b)-rd.begin()-1;
        ll nv1 = dp1->query(l, r) + a[i].d;
        ll nvn = dpn->query(l, r) + a[i].d;
        ans = min(ans, nv1 + nvn - a[i].d);
        int p = lower_bound(all(rd), a[i].c)-rd.begin();
        if (dp1->query(p, p) > nv1) dp1->update(p, nv1);
        if (dpn->query(p, p) > nvn) dpn->update(p, nvn);
    }
    cout << (ans == 1e18 ? -1 : ans) << '\n';
}

int main() {
    int tt = 1;
    // cin >> tt;
    while(tt--) test_case();
}

Compilation message

pinball.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
pinball.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
18.0 / 18.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 420 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 3 ms 604 KB Output is correct
25 Correct 22 ms 2908 KB Output is correct
26 Correct 61 ms 6860 KB Output is correct
27 Correct 204 ms 18116 KB Output is correct
28 Correct 219 ms 9164 KB Output is correct
29 Correct 142 ms 13512 KB Output is correct
30 Correct 267 ms 15304 KB Output is correct
31 Correct 307 ms 26316 KB Output is correct
32 Correct 306 ms 25632 KB Output is correct
33 Correct 33 ms 5584 KB Output is correct
34 Correct 124 ms 13644 KB Output is correct
35 Correct 175 ms 26976 KB Output is correct
36 Correct 296 ms 26824 KB Output is correct
37 Correct 239 ms 26944 KB Output is correct
38 Correct 234 ms 26820 KB Output is correct