oj.uz

Submission #314142

# Submission time Handle Problem Language Result Execution time Memory
314142 2020-10-18T16:39:47 Z caoash Pinball (JOI14_pinball) C++14
100 / 100
 957 ms 62176 KB 
#include <bits/stdc++.h> 
using namespace std;

using ll = long long;

using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

const int MX = 300005;
const int MOD = (int) (1e9 + 7);
const ll INF = (ll) 1e18;

namespace output {
  void pr(int x) {
    cout << x;
  }
  void pr(long x) {
    cout << x;
  }
  void pr(ll x) {
    cout << x;
  }
  void pr(unsigned x) {
    cout << x;
  }
  void pr(unsigned long x) {
    cout << x;
  }
  void pr(unsigned long long x) {
    cout << x;
  }
  void pr(float x) {
    cout << x;
  }
  void pr(double x) {
    cout << x;
  }
  void pr(long double x) {
    cout << x;
  }
  void pr(char x) {
    cout << x;
  }
  void pr(const char * x) {
    cout << x;
  }
  void pr(const string & x) {
    cout << x;
  }
  void pr(bool x) {
    pr(x ? "true" : "false");
  }

  template < class T1, class T2 > void pr(const pair < T1, T2 > & x);
  template < class T > void pr(const T & x);

  template < class T, class...Ts > void pr(const T & t,
    const Ts & ...ts) {
    pr(t);
    pr(ts...);
  }
  template < class T1, class T2 > void pr(const pair < T1, T2 > & x) {
    pr("{", x.f, ", ", x.s, "}");
  }
  template < class T > void pr(const T & x) {
    pr("{"); // const iterator needed for vector<bool>
    bool fst = 1;
    for (const auto & a: x) pr(!fst ? ", " : "", a), fst = 0;
    pr("}");
  }

  void ps() {
    pr("\n");
  } // print w/ spaces
  template < class T, class...Ts > void ps(const T & t,
    const Ts & ...ts) {
    pr(t);
    if (sizeof...(ts)) pr(" ");
    ps(ts...);
  }

  void pc() {
    cout << "]" << endl;
  } // debug w/ commas
  template < class T, class...Ts > void pc(const T & t,
    const Ts & ...ts) {
    pr(t);
    if (sizeof...(ts)) pr(", ");
    pc(ts...);
  }
  #define dbg(x...) pr("[", #x, "] = ["), pc(x);
}

#ifndef ONLINE_JUDGE
using namespace output;
#else
using namespace output;
#define dbg(x...)
#endif

map<ll, int> cmp;

int m, n;
ll dp[MX][2];
ll best[MX][2];
vector<array<ll, 4>> nums;

struct Node {
    ll val;
};

template<int SZ> struct Seg {
    Node tree[4*SZ];

    Node merge(Node a, Node b){
        Node ret;
        ret.val = min(a.val, b.val);
        return ret;
    }

    void build(int v, int l, int r) {
        tree[v].val = INF;
        if (l != r) {
            int m = (l + r) / 2;
            build(2 * v + 1, l, m);
            build(2 * v + 2, m + 1, r);
        }
    }
    
    void update(int v, int l, int r, int i, ll x) {
        if (i > r || i < l) {
            return;
        } else if (l == r) {
            tree[v].val = x;
        } else {
            int m = (l + r) / 2;
            update(2 * v + 1, l, m, i, x);
            update(2 * v + 2, m + 1, r, i, x);
            tree[v] = merge(tree[2 * v + 1], tree[2 * v + 2]);
        }
    }

    Node query(int v, int l, int r, int ql, int qr) {
        if (l > qr || r < ql) {
            Node init;
            init.val = INF;
            return init;
        } else if (l >= ql && r <= qr) {
            return tree[v];
        } else {
            int m = (l + r) / 2;
            Node a = query(2 * v + 1, l, m, ql, qr);
            Node b = query(2 * v + 2, m + 1, r, ql, qr);
            return merge(a, b);
        }
    }
};

Seg<MX> orz[2];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> m >> n;
    set<ll> vals;
    vals.insert(1);
    for (int i = 0; i < m; i++) {
        ll a, b, c, d;
        cin >> a >> b >> c >> d;
        vals.insert(a);
        vals.insert(b);
        vals.insert(c);
        nums.pb({a, b, c, d});
    }
    vals.insert(n);
    int cnt = 0;
    for (auto x : vals) cmp[x] = cnt++;
    for (int i = 0; i < cnt; i++) {
        dp[i][0] = INF, dp[i][1] = INF;
    }
    dp[0][0] = 0;
    dp[0][1] = 0;
    orz[0].build(0, 0, cnt);
    orz[1].build(0, 0, cnt);
    for (int i = 0; i < cnt; i++) {
        best[i][0] = INF, best[i][1] = INF;
    }
    auto cng = [&] (int v, ll x, int c) {
        if (x < best[v][c]) {
            best[v][c] = x;
            orz[c].update(0, 0, cnt, v, x);
        }
    };
    cng(cmp[1], 0, 0);
    cng(cmp[n], 0, 1);
    for (int i = 1; i <= m; i++) {
        array<ll, 4> x = nums[i - 1];
        for (int j = 0; j < 2; j++) {
            dp[i][j] = orz[j].query(0, 0, cnt, cmp[x[0]], cmp[x[1]]).val + x[3];
            cng(cmp[x[2]], dp[i][j], j);
        }
    }
    ll ans = INF;
    for (int i = 1; i <= m; i++) {
        ans = min(ans, dp[i][0] + dp[i][1] - nums[i - 1][3]);
    }
    if (ans == INF) cout << -1 << '\n';
    else cout << ans << '\n';
}

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 4 ms 640 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 896 KB Output is correct
20 Correct 3 ms 512 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 4 ms 896 KB Output is correct
23 Correct 4 ms 896 KB Output is correct
24 Correct 3 ms 896 KB Output is correct
25 Correct 37 ms 4216 KB Output is correct
26 Correct 135 ms 10984 KB Output is correct
27 Correct 447 ms 20956 KB Output is correct
28 Correct 176 ms 5396 KB Output is correct
29 Correct 302 ms 18916 KB Output is correct
30 Correct 284 ms 8284 KB Output is correct
31 Correct 749 ms 35292 KB Output is correct
32 Correct 635 ms 24672 KB Output is correct
33 Correct 77 ms 11372 KB Output is correct
34 Correct 352 ms 31316 KB Output is correct
35 Correct 416 ms 62044 KB Output is correct
36 Correct 957 ms 62172 KB Output is correct
37 Correct 700 ms 62172 KB Output is correct
38 Correct 636 ms 62176 KB Output is correct