oj.uz

Submission #591900

# Submission time Handle Problem Language Result Execution time Memory
591900 2022-07-08T07:43:55 Z Hanksburger Pinball (JOI14_pinball) C++17
100 / 100
 69 ms 9324 KB 
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> dpl;
map<long long, long long, greater<long long> > dpr;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long n, m, ans=1e18;
    cin >> n >> m;
    dpl[1]=dpr[m]=0;
    dpl[m]=dpr[1]=1e18;
    for (long long i=1; i<=n; i++)
    {
        long long a, b, c, d, l, r;
        cin >> a >> b >> c >> d;
        l=dpl.lower_bound(a)->second;
        r=dpr.lower_bound(b)->second;
        ans=min(ans, l+r+d);
        auto it=dpl.insert({c, l+d}).first;
        long long k=min(it->second, l+d);
        it->second=k;
        if (next(it)!=dpl.end() && next(it)->second<=k)
            it=dpl.erase(it);
        while (it!=dpl.begin() && (--it)->second>=k)
            it=dpl.erase(it);
        it=dpr.insert({c, r+d}).first;
        k=min(it->second, r+d);
        it->second=k;
        if (next(it)!=dpr.end() && next(it)->second<=k)
            it=dpr.erase(it);
        while (it!=dpr.begin() && (--it)->second>=k)
            it=dpr.erase(it);
    }
    if (ans<=1e17)
        cout << ans;
    else
        cout << -1;
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 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 328 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 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 328 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 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 328 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 8 ms 592 KB Output is correct
26 Correct 14 ms 1108 KB Output is correct
27 Correct 36 ms 2716 KB Output is correct
28 Correct 52 ms 4048 KB Output is correct
29 Correct 28 ms 2132 KB Output is correct
30 Correct 63 ms 4264 KB Output is correct
31 Correct 53 ms 4124 KB Output is correct
32 Correct 53 ms 4168 KB Output is correct
33 Correct 14 ms 1744 KB Output is correct
34 Correct 27 ms 2228 KB Output is correct
35 Correct 68 ms 9324 KB Output is correct
36 Correct 57 ms 4260 KB Output is correct
37 Correct 69 ms 4940 KB Output is correct
38 Correct 67 ms 5488 KB Output is correct