oj.uz

답안 #235843

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
235843 2020-05-30T06:33:48 Z toxic_hack Pinball (JOI14_pinball) C++14
100 / 100
 886 ms 44152 KB 
#include<bits/stdc++.h>

typedef long long ll;
typedef long double lld;
using namespace std;

#define endl "\n"
#define fi first
#define se second
#define MEMS(a,b) memset(a,b,sizeof(a))
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define __ freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define all(c) c.begin(),c.end()
#define pii pair<int, int>

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r)
{
	uniform_int_distribution<int> uid(l, r);
	return uid(rng);
}

#define tr(...) cout<<__FUNCTION__<<' '<<__LINE__<<" = ";trace(#__VA_ARGS__, __VA_ARGS__)
template<typename S, typename T>
ostream& operator<<(ostream& out,pair<S,T> const& p){out<<'('<<p.fi<<", "<<p.se<<')';return out;}

template<typename T>
ostream& operator<<(ostream& out,vector<T> const& v){
ll l=v.size();for(ll i=0;i<l-1;i++)out<<v[i]<<' ';if(l>0)out<<v[l-1];return out;}

template <typename T>
ostream &operator<<(ostream &out, set<T> const &v) {
    for (auto i = v.begin(); i != v.end(); i++)
        out << (*i) << ' ';
    return out;
}
template <typename T>
ostream &operator<<(ostream &out, multiset<T> const &v) {
    for (auto i = v.begin(); i != v.end(); i++)
        out << (*i) << ' ';
    return out;
}
template <typename T, typename V>
ostream &operator<<(ostream &out, map<T, V> const &v) {
    for (auto i = v.begin(); i != v.end(); i++)
        out << "\n" << (i->first) <<  ":"  << (i->second);
    return out;
}

template<typename T>
void trace(const char* name, T&& arg1){cout<<name<<" : "<<arg1<<endl;}

template<typename T, typename... Args>
void trace(const char* names, T&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cout.write(names, comma-names)<<" : "<<arg1<<" | ";trace(comma+1,args...);}

#define int ll

const int N = 1e6 + 10;

struct node {
    int l, r, c, cost;

};

int dpl[N];
int dpr[N];
const int inf = 1e18;
int t[4*N];

void build(int v, int tl, int tr) {
    if (tl == tr) {
        t[v] = inf;
    } else {
        int tm = (tl + tr) / 2;
        build(v*2, tl, tm);
        build(v*2+1, tm+1, tr);
        t[v] = min(t[v*2], t[v*2+1]);
    }
}

int get(int v, int tl, int tr, int l, int r) {
    if (l > r)
        return inf;
    if (l == tl && r == tr)
        return t[v];
    int tm = (tl + tr) / 2;
    return min(get(v*2, tl, tm, l, min(r, tm)), 
                   get(v*2+1, tm+1, tr, max(l, tm+1), r));
}

void update(int v, int tl, int tr, int pos, int new_val) {
    if (tl == tr) {
        if (t[v] < new_val) return;
        t[v] = new_val; 
    } else {
        int tm = (tl + tr) / 2;
        if (pos <= tm)
            update(v*2, tl, tm, pos, new_val);
        else
            update(v*2+1, tm+1, tr, pos, new_val);
        t[v] = min(t[v*2], t[v*2+1]);
    }
}

int n, m;

node arr[N];

int solve() {
    cin >> n >> m;
    map<int, int> comp;
    for (int i = 1; i <= n; ++i) {
        int l, r, c, cost;
        cin >> l >> r >> c >> cost;
        arr[i] = {l, r, c, cost};
        comp[l];
        comp[r];
        comp[c];
    }
    int curr = 1;
    for (auto &i : comp) {
        i.se = curr++;
    }
    build(1, 1, N - 1);
    for (int i = 1; i <= n; i++) {
        if (arr[i].l == 1) {
            dpl[i] = arr[i].cost;
        } else {
            int cost = arr[i].cost;
            int bef = get(1, 1, N - 1, comp[arr[i].l], comp[arr[i].r]);
            dpl[i] = cost + bef;
        }
        update(1, 1, N - 1, comp[arr[i].c], dpl[i]);
    }

    build(1, 1, N - 1);
    int ans = inf;

    for (int i = 1; i <= n; i++) {
        if (arr[i].r == m) {
            ans = min(ans, dpl[i]);
            dpr[i] = arr[i].cost;
        } else {
            int cost = arr[i].cost;
            int bef = get(1, 1, N - 1, comp[arr[i].l], comp[arr[i].r]);
            ans = min(ans, dpl[i] + bef);
            dpr[i] = cost + bef;
        }
        update(1, 1, N - 1, comp[arr[i].c], dpr[i]);
    }

    for (int i = 1; i <= n; i++) {
        if (arr[i].l == 1 && arr[i].r == m) {
            ans = min(ans, arr[i].cost);
        } 
    }
    if (ans != inf)
        cout << ans << endl;
    else {
        cout << -1 << endl;
    }
    return 0;
}

int32_t main(){ _
    int t;
    // cin >> t;
    t = 1;
    while (t--) solve();
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 16768 KB Output is correct
2 Correct 23 ms 16768 KB Output is correct
3 Correct 23 ms 16768 KB Output is correct
4 Correct 23 ms 16768 KB Output is correct
5 Correct 23 ms 16768 KB Output is correct
6 Correct 23 ms 16768 KB Output is correct
7 Correct 23 ms 16768 KB Output is correct
8 Correct 24 ms 16768 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 16768 KB Output is correct
2 Correct 23 ms 16768 KB Output is correct
3 Correct 23 ms 16768 KB Output is correct
4 Correct 23 ms 16768 KB Output is correct
5 Correct 23 ms 16768 KB Output is correct
6 Correct 23 ms 16768 KB Output is correct
7 Correct 23 ms 16768 KB Output is correct
8 Correct 24 ms 16768 KB Output is correct
9 Correct 26 ms 16896 KB Output is correct
10 Correct 23 ms 16768 KB Output is correct
11 Correct 23 ms 16768 KB Output is correct
12 Correct 24 ms 16896 KB Output is correct
13 Correct 23 ms 16896 KB Output is correct
14 Correct 24 ms 16888 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 16768 KB Output is correct
2 Correct 23 ms 16768 KB Output is correct
3 Correct 23 ms 16768 KB Output is correct
4 Correct 23 ms 16768 KB Output is correct
5 Correct 23 ms 16768 KB Output is correct
6 Correct 23 ms 16768 KB Output is correct
7 Correct 23 ms 16768 KB Output is correct
8 Correct 24 ms 16768 KB Output is correct
9 Correct 26 ms 16896 KB Output is correct
10 Correct 23 ms 16768 KB Output is correct
11 Correct 23 ms 16768 KB Output is correct
12 Correct 24 ms 16896 KB Output is correct
13 Correct 23 ms 16896 KB Output is correct
14 Correct 24 ms 16888 KB Output is correct
15 Correct 31 ms 16768 KB Output is correct
16 Correct 24 ms 16816 KB Output is correct
17 Correct 26 ms 16896 KB Output is correct
18 Correct 24 ms 17016 KB Output is correct
19 Correct 26 ms 17024 KB Output is correct
20 Correct 26 ms 16896 KB Output is correct
21 Correct 25 ms 16896 KB Output is correct
22 Correct 25 ms 17024 KB Output is correct
23 Correct 25 ms 17024 KB Output is correct
24 Correct 28 ms 17144 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 16768 KB Output is correct
2 Correct 23 ms 16768 KB Output is correct
3 Correct 23 ms 16768 KB Output is correct
4 Correct 23 ms 16768 KB Output is correct
5 Correct 23 ms 16768 KB Output is correct
6 Correct 23 ms 16768 KB Output is correct
7 Correct 23 ms 16768 KB Output is correct
8 Correct 24 ms 16768 KB Output is correct
9 Correct 26 ms 16896 KB Output is correct
10 Correct 23 ms 16768 KB Output is correct
11 Correct 23 ms 16768 KB Output is correct
12 Correct 24 ms 16896 KB Output is correct
13 Correct 23 ms 16896 KB Output is correct
14 Correct 24 ms 16888 KB Output is correct
15 Correct 31 ms 16768 KB Output is correct
16 Correct 24 ms 16816 KB Output is correct
17 Correct 26 ms 16896 KB Output is correct
18 Correct 24 ms 17016 KB Output is correct
19 Correct 26 ms 17024 KB Output is correct
20 Correct 26 ms 16896 KB Output is correct
21 Correct 25 ms 16896 KB Output is correct
22 Correct 25 ms 17024 KB Output is correct
23 Correct 25 ms 17024 KB Output is correct
24 Correct 28 ms 17144 KB Output is correct
25 Correct 57 ms 18552 KB Output is correct
26 Correct 146 ms 22392 KB Output is correct
27 Correct 419 ms 29032 KB Output is correct
28 Correct 234 ms 25336 KB Output is correct
29 Correct 287 ms 26744 KB Output is correct
30 Correct 339 ms 26488 KB Output is correct
31 Correct 720 ms 35832 KB Output is correct
32 Correct 682 ms 33016 KB Output is correct
33 Correct 82 ms 22008 KB Output is correct
34 Correct 368 ms 30544 KB Output is correct
35 Correct 343 ms 44152 KB Output is correct
36 Correct 886 ms 44152 KB Output is correct
37 Correct 714 ms 44152 KB Output is correct
38 Correct 652 ms 44152 KB Output is correct