oj.uz

Submission #66092

# Submission time Handle Problem Language Result Execution time Memory
66092 2018-08-09T14:18:11 Z SpeedOfMagic Pinball (JOI14_pinball) C++17
100 / 100
 566 ms 19932 KB 
/** MIT License Copyright (c) 2018 Vasilyev Daniil **/
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
template<typename T> using v = vector<T>;
#define int long long
typedef long double ld;
typedef string str;
typedef vector<int> vint;
#define rep(a, l, r) for(int a = (l); a < (r); a++)
#define pb push_back
#define sz(a) ((int) a.size())
const long long inf = 4611686018427387903; //2^62 - 1
#if 0  //FileIO
const string fileName = "";
ifstream fin ((fileName == "" ? "input.txt"  : fileName + ".in" ));
ofstream fout((fileName == "" ? "output.txt" : fileName + ".out"));
#define get fin>>
#define put fout<<
#else
#define get cin>>
#define put cout<<
#endif
#define eol put endl
#define check(a) put #a << ": " << a << endl;
void read() {}     template<typename Arg,typename... Args> void read (Arg& arg,Args&... args){get (arg)     ;read(args...) ;}
void print(){}     template<typename Arg,typename... Args> void print(Arg  arg,Args...  args){put (arg)<<" ";print(args...);}
void debug(){eol;} template<typename Arg,typename... Args> void debug(Arg  arg,Args...  args){put (arg)<<" ";debug(args...);}
int getInt(){int a; get a; return a;}
//code goes here
vint segTree;
int tot;
void init(int n) {
    tot = n;
    while (tot & (tot - 1))
        tot++;
    segTree = vint(2 * tot);
    rep(i, 1, tot * 2)
        segTree[i] = inf;
}

int query(int l, int r, int cur = 1, int ll = 1, int rr = tot) {
    if (l > r)
        return inf;
    if (l == ll && r == rr)
        return segTree[cur];
    int p = (ll + rr) / 2;
    return min(query(l, min(r, p), cur * 2, ll, p), query(max(l, p + 1), r, cur * 2 + 1, p + 1, rr));
}

void update(int pos, int val, int cur = 1, int ll = 1, int rr = tot) {
    if (ll == rr) {
        segTree[cur] = min(segTree[cur], val);
        return;
    }

    int p = (ll + rr) / 2;
    if (pos <= p)
        update(pos, val, cur * 2, ll, p);
    else
        update(pos, val, cur * 2 + 1, p + 1, rr);

    segTree[cur] = min(segTree[cur * 2], segTree[cur * 2 + 1]);
}

void run() {
    int m, n;
    read(m, n);
    int a[m], b[m], c[m], d[m];
    set<int> all;

    bool first[m], last[m];
    rep(i, 0, m) {
        read(a[i], b[i], c[i], d[i]);
        first[i] = (a[i] == 1);
        last[i] = (b[i] == n);
        all.insert(c[i]);
    }
    map<int, int> hsh;
    int p = 1;
    for (int i : all)
        hsh[i] = p++;

    n = -inf;
    rep(i, 0, m) {
        a[i] = (*hsh.lower_bound(a[i])).second;
        auto dd = hsh.upper_bound(b[i]);
        dd--;
        b[i] = (*dd).second;
        c[i] = hsh[c[i]];
        n = max(n, b[i]);
    }

    int dp[2][m];
    rep(k, 0, 2) {
        init(n);
        rep(i, 0, m) {
            if ((!k && first[i]) || (k && last[i]))
                dp[k][i] = d[i];
            else
                dp[k][i] = min(inf, query(a[i], b[i]) + d[i]);
            update(c[i], dp[k][i]);
        }
    }

    //rep(i, 0, 2) { rep(j, 0, m) print(dp[i][j]); eol; }

    int ans = inf;
    rep(i, 0, m)
        ans = min(ans, dp[0][i] + dp[1][i] - d[i]);
    if (ans == inf)
        put -1;
    else
        put ans;
}

int32_t main() {srand(time(0)); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); put fixed; put setprecision(15); run(); return 0;}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 3 ms 396 KB Output is correct
4 Correct 3 ms 396 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 2 ms 616 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 3 ms 616 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 3 ms 396 KB Output is correct
4 Correct 3 ms 396 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 2 ms 616 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 3 ms 616 KB Output is correct
9 Correct 2 ms 616 KB Output is correct
10 Correct 2 ms 616 KB Output is correct
11 Correct 3 ms 616 KB Output is correct
12 Correct 3 ms 616 KB Output is correct
13 Correct 3 ms 616 KB Output is correct
14 Correct 2 ms 616 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 3 ms 396 KB Output is correct
4 Correct 3 ms 396 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 2 ms 616 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 3 ms 616 KB Output is correct
9 Correct 2 ms 616 KB Output is correct
10 Correct 2 ms 616 KB Output is correct
11 Correct 3 ms 616 KB Output is correct
12 Correct 3 ms 616 KB Output is correct
13 Correct 3 ms 616 KB Output is correct
14 Correct 2 ms 616 KB Output is correct
15 Correct 3 ms 616 KB Output is correct
16 Correct 3 ms 616 KB Output is correct
17 Correct 6 ms 740 KB Output is correct
18 Correct 4 ms 740 KB Output is correct
19 Correct 5 ms 740 KB Output is correct
20 Correct 5 ms 740 KB Output is correct
21 Correct 3 ms 740 KB Output is correct
22 Correct 5 ms 740 KB Output is correct
23 Correct 8 ms 740 KB Output is correct
24 Correct 5 ms 740 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 3 ms 396 KB Output is correct
4 Correct 3 ms 396 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 2 ms 616 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 3 ms 616 KB Output is correct
9 Correct 2 ms 616 KB Output is correct
10 Correct 2 ms 616 KB Output is correct
11 Correct 3 ms 616 KB Output is correct
12 Correct 3 ms 616 KB Output is correct
13 Correct 3 ms 616 KB Output is correct
14 Correct 2 ms 616 KB Output is correct
15 Correct 3 ms 616 KB Output is correct
16 Correct 3 ms 616 KB Output is correct
17 Correct 6 ms 740 KB Output is correct
18 Correct 4 ms 740 KB Output is correct
19 Correct 5 ms 740 KB Output is correct
20 Correct 5 ms 740 KB Output is correct
21 Correct 3 ms 740 KB Output is correct
22 Correct 5 ms 740 KB Output is correct
23 Correct 8 ms 740 KB Output is correct
24 Correct 5 ms 740 KB Output is correct
25 Correct 40 ms 2024 KB Output is correct
26 Correct 96 ms 4968 KB Output is correct
27 Correct 366 ms 10324 KB Output is correct
28 Correct 177 ms 10324 KB Output is correct
29 Correct 231 ms 10324 KB Output is correct
30 Correct 265 ms 10324 KB Output is correct
31 Correct 549 ms 16628 KB Output is correct
32 Correct 566 ms 16628 KB Output is correct
33 Correct 49 ms 16628 KB Output is correct
34 Correct 235 ms 16628 KB Output is correct
35 Correct 327 ms 19876 KB Output is correct
36 Correct 559 ms 19880 KB Output is correct
37 Correct 535 ms 19932 KB Output is correct
38 Correct 429 ms 19932 KB Output is correct