답안 #47402 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
47402	2018-05-02T11:53:26 Z	daniel_02	Construction of Highway (JOI18_construction)	C++17	7 / 100	1000 ms	1284 KB

construction

#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front

using namespace std;

const int N = 4000 + 7;
const int inf = 1e9 + 7;

int a[N], pr[N];

struct con
{
    int l, r;
    ll sm;
    con()
    {

        l = r = sm = 0;
    }
}t[N * 7];
int cnt;

void update(int v, int tl, int tr, int pos, int x)
{
    if (tl == tr)
    {
        t[v].sm = max(t[v].sm + x, 0LL);
    }
    else
    {
        int mid = (tl + tr) >> 1;

        if (mid >= pos)
        {
            if (!t[v].l)
                t[v].l = ++cnt;

            update(t[v].l, tl, mid, pos, x);
        }
        else
        {
            if (!t[v].r)
                t[v].r = ++cnt;

            update(t[v].r, mid + 1, tr, pos, x);
        }
        if (!t[v].l)t[v].l = ++cnt;
        if (!t[v].r)t[v].r = ++cnt;

        t[v].sm = t[t[v].l].sm + t[t[v].r].sm;
    }
}
ll get(int v, int tl, int tr, int l, int r)
{
    if (tl > r || l > tr)return 0LL;

    if (l <= tl && tr <= r)
    {
        return t[v].sm;
    }
    else
    {
        int mid = (tl + tr) >> 1;

        if (!t[v].l)
            t[v].l = ++cnt;
        if (!t[v].r)
            t[v].r = ++cnt;

        return get(t[v].l, tl, mid, l, r) + get(t[v].r, mid + 1, tr, l, r);
    }
}
deque<int>dq;

void dfs(int v)
{
    if (v == 0)
       return;
    dq.pf(a[v]);
    dfs(pr[v]);
}
void conquer(int v)
{
    ll ans = 0;
    dfs(v);

    cnt = 1;
    for (int i = 0; i < dq.size(); i++)
    {
        ans += get(1, 1, N, dq[i] + 1, N);
        update(1, 1, N, dq[i], 1);
    }
//    for (int i = 0; i < dq.size(); i++)
//        update(1, 1, inf, dq[i], -inf);
    memset(t, 0, sizeof(t));
    dq.clear();
    printf("%lld\n", ans);
}
void upd(int v, int x)
{
    if (v == 0)return;

    a[v] = x;

    upd(pr[v], x);
}
vector <int> vec;

main()
{
    int n;

    scanf("%d", &n);

    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        vec.pb(a[i]);
    }
    sort(vec.begin(),vec.end());
    vec.erase(unique(vec.begin(),vec.end()),vec.end());

    for (int i = 1; i <= n; i ++) {
        a[i] = lower_bound(vec.begin(),vec.end(),a[i]) - vec.begin() + 1;
    }

    for (int i = 1; i < n; i++)
    {
        int q, w;
        scanf("%d%d", &q, &w);
        if (i == 1)
        {
            puts("0");
            pr[w] = q;
            a[q] = a[w];
            continue;
        }
        conquer(q);
        upd(q, a[w]);
        pr[w] = q;
    }
}

Compilation message

construction.cpp: In function 'void conquer(int)':
construction.cpp:93:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < dq.size(); i++)
                     ~~^~~~~~~~~~~
construction.cpp: At global scope:
construction.cpp:114:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
construction.cpp: In function 'int main()':
construction.cpp:118:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
construction.cpp:121:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ~~~~~^~~~~~~~~~~~~
construction.cpp:134:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &q, &w);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	760 KB	Output is correct
2	Correct	3 ms	760 KB	Output is correct
3	Correct	31 ms	800 KB	Output is correct
4	Correct	11 ms	852 KB	Output is correct
5	Correct	18 ms	1032 KB	Output is correct
6	Correct	15 ms	1032 KB	Output is correct
7	Correct	15 ms	1032 KB	Output is correct
8	Correct	36 ms	1032 KB	Output is correct
9	Correct	38 ms	1032 KB	Output is correct
10	Correct	36 ms	1124 KB	Output is correct
11	Correct	25 ms	1124 KB	Output is correct
12	Correct	33 ms	1124 KB	Output is correct
13	Correct	32 ms	1124 KB	Output is correct
14	Correct	25 ms	1124 KB	Output is correct
15	Correct	15 ms	1124 KB	Output is correct
16	Correct	15 ms	1124 KB	Output is correct
17	Correct	17 ms	1124 KB	Output is correct
18	Correct	15 ms	1124 KB	Output is correct
19	Correct	26 ms	1124 KB	Output is correct
20	Correct	26 ms	1124 KB	Output is correct
21	Correct	28 ms	1124 KB	Output is correct
22	Correct	15 ms	1124 KB	Output is correct
23	Correct	16 ms	1124 KB	Output is correct
24	Correct	14 ms	1124 KB	Output is correct
25	Correct	14 ms	1124 KB	Output is correct
26	Correct	38 ms	1124 KB	Output is correct
27	Correct	25 ms	1124 KB	Output is correct
28	Correct	24 ms	1124 KB	Output is correct
29	Correct	27 ms	1124 KB	Output is correct
30	Correct	14 ms	1124 KB	Output is correct
31	Correct	14 ms	1124 KB	Output is correct
32	Correct	24 ms	1124 KB	Output is correct
33	Correct	20 ms	1124 KB	Output is correct
34	Correct	19 ms	1124 KB	Output is correct
35	Correct	20 ms	1124 KB	Output is correct
36	Correct	19 ms	1124 KB	Output is correct
37	Correct	18 ms	1124 KB	Output is correct
38	Correct	16 ms	1124 KB	Output is correct
39	Correct	20 ms	1124 KB	Output is correct
40	Correct	23 ms	1124 KB	Output is correct
41	Correct	17 ms	1124 KB	Output is correct
42	Correct	19 ms	1124 KB	Output is correct
43	Correct	17 ms	1124 KB	Output is correct
44	Correct	16 ms	1124 KB	Output is correct

Subtask #2
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	760 KB	Output is correct
2	Correct	3 ms	760 KB	Output is correct
3	Correct	31 ms	800 KB	Output is correct
4	Correct	11 ms	852 KB	Output is correct
5	Correct	18 ms	1032 KB	Output is correct
6	Correct	15 ms	1032 KB	Output is correct
7	Correct	15 ms	1032 KB	Output is correct
8	Correct	36 ms	1032 KB	Output is correct
9	Correct	38 ms	1032 KB	Output is correct
10	Correct	36 ms	1124 KB	Output is correct
11	Correct	25 ms	1124 KB	Output is correct
12	Correct	33 ms	1124 KB	Output is correct
13	Correct	32 ms	1124 KB	Output is correct
14	Correct	25 ms	1124 KB	Output is correct
15	Correct	15 ms	1124 KB	Output is correct
16	Correct	15 ms	1124 KB	Output is correct
17	Correct	17 ms	1124 KB	Output is correct
18	Correct	15 ms	1124 KB	Output is correct
19	Correct	26 ms	1124 KB	Output is correct
20	Correct	26 ms	1124 KB	Output is correct
21	Correct	28 ms	1124 KB	Output is correct
22	Correct	15 ms	1124 KB	Output is correct
23	Correct	16 ms	1124 KB	Output is correct
24	Correct	14 ms	1124 KB	Output is correct
25	Correct	14 ms	1124 KB	Output is correct
26	Correct	38 ms	1124 KB	Output is correct
27	Correct	25 ms	1124 KB	Output is correct
28	Correct	24 ms	1124 KB	Output is correct
29	Correct	27 ms	1124 KB	Output is correct
30	Correct	14 ms	1124 KB	Output is correct
31	Correct	14 ms	1124 KB	Output is correct
32	Correct	24 ms	1124 KB	Output is correct
33	Correct	20 ms	1124 KB	Output is correct
34	Correct	19 ms	1124 KB	Output is correct
35	Correct	20 ms	1124 KB	Output is correct
36	Correct	19 ms	1124 KB	Output is correct
37	Correct	18 ms	1124 KB	Output is correct
38	Correct	16 ms	1124 KB	Output is correct
39	Correct	20 ms	1124 KB	Output is correct
40	Correct	23 ms	1124 KB	Output is correct
41	Correct	17 ms	1124 KB	Output is correct
42	Correct	19 ms	1124 KB	Output is correct
43	Correct	17 ms	1124 KB	Output is correct
44	Correct	16 ms	1124 KB	Output is correct
45	Correct	27 ms	1124 KB	Output is correct
46	Correct	104 ms	1136 KB	Output is correct
47	Correct	108 ms	1136 KB	Output is correct
48	Correct	102 ms	1164 KB	Output is correct
49	Execution timed out	1091 ms	1284 KB	Time limit exceeded
50	Halted	0 ms	0 KB	-

Subtask #3
0 / 84.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	760 KB	Output is correct
2	Correct	3 ms	760 KB	Output is correct
3	Correct	31 ms	800 KB	Output is correct
4	Correct	11 ms	852 KB	Output is correct
5	Correct	18 ms	1032 KB	Output is correct
6	Correct	15 ms	1032 KB	Output is correct
7	Correct	15 ms	1032 KB	Output is correct
8	Correct	36 ms	1032 KB	Output is correct
9	Correct	38 ms	1032 KB	Output is correct
10	Correct	36 ms	1124 KB	Output is correct
11	Correct	25 ms	1124 KB	Output is correct
12	Correct	33 ms	1124 KB	Output is correct
13	Correct	32 ms	1124 KB	Output is correct
14	Correct	25 ms	1124 KB	Output is correct
15	Correct	15 ms	1124 KB	Output is correct
16	Correct	15 ms	1124 KB	Output is correct
17	Correct	17 ms	1124 KB	Output is correct
18	Correct	15 ms	1124 KB	Output is correct
19	Correct	26 ms	1124 KB	Output is correct
20	Correct	26 ms	1124 KB	Output is correct
21	Correct	28 ms	1124 KB	Output is correct
22	Correct	15 ms	1124 KB	Output is correct
23	Correct	16 ms	1124 KB	Output is correct
24	Correct	14 ms	1124 KB	Output is correct
25	Correct	14 ms	1124 KB	Output is correct
26	Correct	38 ms	1124 KB	Output is correct
27	Correct	25 ms	1124 KB	Output is correct
28	Correct	24 ms	1124 KB	Output is correct
29	Correct	27 ms	1124 KB	Output is correct
30	Correct	14 ms	1124 KB	Output is correct
31	Correct	14 ms	1124 KB	Output is correct
32	Correct	24 ms	1124 KB	Output is correct
33	Correct	20 ms	1124 KB	Output is correct
34	Correct	19 ms	1124 KB	Output is correct
35	Correct	20 ms	1124 KB	Output is correct
36	Correct	19 ms	1124 KB	Output is correct
37	Correct	18 ms	1124 KB	Output is correct
38	Correct	16 ms	1124 KB	Output is correct
39	Correct	20 ms	1124 KB	Output is correct
40	Correct	23 ms	1124 KB	Output is correct
41	Correct	17 ms	1124 KB	Output is correct
42	Correct	19 ms	1124 KB	Output is correct
43	Correct	17 ms	1124 KB	Output is correct
44	Correct	16 ms	1124 KB	Output is correct
45	Correct	27 ms	1124 KB	Output is correct
46	Correct	104 ms	1136 KB	Output is correct
47	Correct	108 ms	1136 KB	Output is correct
48	Correct	102 ms	1164 KB	Output is correct
49	Execution timed out	1091 ms	1284 KB	Time limit exceeded
50	Halted	0 ms	0 KB	-

답안 #47402

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 0 / 9.0

Subtask #3 0 / 84.0

Subtask #1
7.0 / 7.0

Subtask #2
0 / 9.0

Subtask #3
0 / 84.0