답안 #68613 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
68613	2018-08-17T14:25:55 Z	Alexa2001	Pinball (JOI14_pinball)	C++17	100 / 100	752 ms	32892 KB

pinball

#include <bits/stdc++.h>
#define mid ((st+dr)/2)
#define left_son (node<<1)
#define right_son ((node<<1)|1)

using namespace std;

typedef long long ll;
const ll inf = 1e18;
const int Nmax = 3e5 + 5;

ll ans = inf;
int A[Nmax], B[Nmax], C[Nmax], D[Nmax];
int n, m, i;


class Aint
{
    ll a[Nmax<<2];

    public:
        void update(int node, int st, int dr, int pos, ll val)
        {
            if(st == dr)
            {
                a[node] = min(a[node], val);
                return;
            }

            if(pos <= mid) update(left_son, st, mid, pos, val);
                else update(right_son, mid+1, dr, pos, val);
            a[node] = min(a[left_son], a[right_son]);
        }

        ll query(int node, int st, int dr, int L, int R)
        {
            if(L <= st && dr <= R)
                return a[node];

            ll aux1 = inf, aux2 = inf;
            if(L <= mid) aux1 = query(left_son, st, mid, L, R);
            if(mid < R) aux2 = query(right_son, mid+1, dr, L, R);

            return min(aux1, aux2);
        }

        void build(int node, int st, int dr, int pos)
        {
            if(st == dr)
            {
                a[node] = (st == pos ? 0 : inf);
                return;
            }

            build(left_son, st, mid, pos);
            build(right_son, mid+1, dr, pos);
            a[node] = min(a[left_son], a[right_son]);
        }

} aint1, aint2;


void normalize()
{
    int i;
    map<int,int> mp;
    mp[1] = mp[m] = 1;
    for(i=1; i<=n; ++i) mp[A[i]] = mp[B[i]] = mp[C[i]] = 1;

    int nr = 0;
    for(auto &it : mp) it.second = ++nr;
    for(i=1; i<=n; ++i) A[i] = mp[A[i]], B[i] = mp[B[i]], C[i] = mp[C[i]];
    m = mp.size();
}

int main()
{
  ///  freopen("input", "r", stdin);
    cin.sync_with_stdio(false);

    cin >> n >> m;

    for(i=1; i<=n; ++i)
        cin >> A[i] >> B[i] >> C[i] >> D[i];

    normalize();

    aint1.build(1, 1, m, 1);
    aint2.build(1, 1, m, m);

    for(i=1; i<=n; ++i)
    {
        ll res1 = aint1.query(1, 1, m, A[i], B[i]);
        ll res2 = aint2.query(1, 1, m, A[i], B[i]);

        ans = min(ans, res1 + res2 + D[i]);

        aint1.update( 1, 1, m, C[i], res1 + D[i] );
        aint2.update( 1, 1, m, C[i], res2 + D[i] );
    }

    cout << (ans == inf ? -1 : ans) << '\n';
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	428 KB	Output is correct
4	Correct	2 ms	428 KB	Output is correct
5	Correct	3 ms	616 KB	Output is correct
6	Correct	2 ms	616 KB	Output is correct
7	Correct	2 ms	616 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	3 ms	616 KB	Output is correct
10	Correct	2 ms	616 KB	Output is correct
11	Correct	3 ms	768 KB	Output is correct
12	Correct	2 ms	768 KB	Output is correct
13	Correct	3 ms	768 KB	Output is correct
14	Correct	2 ms	768 KB	Output is correct

Subtask #3
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	428 KB	Output is correct
4	Correct	2 ms	428 KB	Output is correct
5	Correct	3 ms	616 KB	Output is correct
6	Correct	2 ms	616 KB	Output is correct
7	Correct	2 ms	616 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	3 ms	616 KB	Output is correct
10	Correct	2 ms	616 KB	Output is correct
11	Correct	3 ms	768 KB	Output is correct
12	Correct	2 ms	768 KB	Output is correct
13	Correct	3 ms	768 KB	Output is correct
14	Correct	2 ms	768 KB	Output is correct
15	Correct	2 ms	768 KB	Output is correct
16	Correct	3 ms	768 KB	Output is correct
17	Correct	4 ms	768 KB	Output is correct
18	Correct	3 ms	768 KB	Output is correct
19	Correct	5 ms	928 KB	Output is correct
20	Correct	4 ms	928 KB	Output is correct
21	Correct	3 ms	928 KB	Output is correct
22	Correct	5 ms	928 KB	Output is correct
23	Correct	4 ms	928 KB	Output is correct
24	Correct	4 ms	928 KB	Output is correct

Subtask #4
49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	428 KB	Output is correct
4	Correct	2 ms	428 KB	Output is correct
5	Correct	3 ms	616 KB	Output is correct
6	Correct	2 ms	616 KB	Output is correct
7	Correct	2 ms	616 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	3 ms	616 KB	Output is correct
10	Correct	2 ms	616 KB	Output is correct
11	Correct	3 ms	768 KB	Output is correct
12	Correct	2 ms	768 KB	Output is correct
13	Correct	3 ms	768 KB	Output is correct
14	Correct	2 ms	768 KB	Output is correct
15	Correct	2 ms	768 KB	Output is correct
16	Correct	3 ms	768 KB	Output is correct
17	Correct	4 ms	768 KB	Output is correct
18	Correct	3 ms	768 KB	Output is correct
19	Correct	5 ms	928 KB	Output is correct
20	Correct	4 ms	928 KB	Output is correct
21	Correct	3 ms	928 KB	Output is correct
22	Correct	5 ms	928 KB	Output is correct
23	Correct	4 ms	928 KB	Output is correct
24	Correct	4 ms	928 KB	Output is correct
25	Correct	32 ms	2556 KB	Output is correct
26	Correct	102 ms	5756 KB	Output is correct
27	Correct	351 ms	10728 KB	Output is correct
28	Correct	206 ms	10728 KB	Output is correct
29	Correct	266 ms	10728 KB	Output is correct
30	Correct	322 ms	10728 KB	Output is correct
31	Correct	576 ms	18300 KB	Output is correct
32	Correct	514 ms	18300 KB	Output is correct
33	Correct	79 ms	18300 KB	Output is correct
34	Correct	298 ms	18300 KB	Output is correct
35	Correct	327 ms	32648 KB	Output is correct
36	Correct	752 ms	32892 KB	Output is correct
37	Correct	646 ms	32892 KB	Output is correct
38	Correct	621 ms	32892 KB	Output is correct

답안 #68613

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 18.0 / 18.0

Subtask #3 22.0 / 22.0

Subtask #4 49.0 / 49.0

Subtask #1
11.0 / 11.0

Subtask #2
18.0 / 18.0

Subtask #3
22.0 / 22.0

Subtask #4
49.0 / 49.0