답안 #62513 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
62513	2018-07-28T20:14:15 Z	qkxwsm	Construction of Highway (JOI18_construction)	C++17	16 / 100	2000 ms	24640 KB

construction

/*
PROG: source
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
 */
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
    int operator()(int x) const
	{
		x ^= (x >> 20) ^ (x >> 12);
    	return x ^ (x >> 7) ^ (x >> 4);
	}
	int operator()(long long x) const
	{
		return x ^ (x >> 32);
	}
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using hashtable = gp_hash_table<T, T, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T>
T normalize(T x, T mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N;
int arr[MAXN], upd[MAXN];
vector<int> compress;
int parent[MAXN];
int quer[MAXN];
int depth[MAXN];
int ancestor[25][MAXN];
ll fenwick[MAXN];

void update(int idx, ll v)
{
    for (int e = idx + 1; e <= N; e += e & (-e))
    {
        fenwick[e] += v;
    }
    return;
}
ll query(int idx)
{
    ll res = 0;
    for (int e = idx + 1; e; e -= e & (-e))
    {
        res += fenwick[e];
    }
    return res;
}

int32_t main()
{
	ios_base::sync_with_stdio(0);
	srand(time(0));
	//	cout << fixed << setprecision(10);
	//	cerr << fixed << setprecision(10);
	if (fopen("input.in", "r"))
	{
		freopen ("input.in", "r", stdin);
		freopen ("output.out", "w", stdout);
	}
    cin >> N;
    compress.resize(N);
    for (int i = 0; i < N; i++)
    {
        cin >> arr[i];
        compress[i] = arr[i];
    }
    sort(compress.begin(), compress.end());
    compress.erase(unique(compress.begin(), compress.end()), compress.end());
    for (int i = 0; i < N; i++)
    {
        arr[i] = LB(compress.begin(), compress.end(), arr[i]) - compress.begin();
    }
    arr[N] = N;
    parent[0] = N;
    depth[0] = 0;
    for (int i = 0; i < N - 1; i++)
    {
        int u, v;
        cin >> u >> v;
        u--; v--;
        parent[v] = u;
        depth[v] = depth[u] + 1;
        quer[i] = v;
    }
    for (int i = 0; i < 25; i++)
    {
        ancestor[i][N] = N;
    }
    for (int i = 0; i < N; i++)
    {
        ancestor[0][i] = parent[i];
    }
    for (int i = 1; i <= 21; i++)
    {
        for (int j = 0; j < N; j++)
        {
            ancestor[i][j] = ancestor[i - 1][ancestor[i - 1][j]];
        }
    }
    for (int i = 0; i <= N; i++)
    {
        upd[i] = N + i;
    }
    for (int i = 0; i < N - 1; i++)
    {
        //query inversions on path to u
        //update path to u to all be equal to arr[u]
        ll ans = 0;
        int u = quer[i], v = parent[u];
        while(v != N)
        {
            ll freq = 1;
            for (int j = 20; j >= 0; j--)
            {
                if (upd[v] == upd[ancestor[j][v]])
                {
                    freq += (1 << j);
                    v = ancestor[j][v];
                }
            }
            ans += freq * query(arr[v] - 1);
            update(arr[v], freq);
            v = parent[v];
        }
        v = parent[u];
        while(v != N)
        {
            ll freq = 1;
            for (int j = 20; j >= 0; j--)
            {
                if (upd[v] == upd[ancestor[j][v]])
                {
                    freq += (1 << j);
                    v = ancestor[j][v];
                }
            }
            update(arr[v], -freq);
            v = parent[v];
        }
        v = parent[u];
        while(v != N)
        {
            arr[v] = arr[u];
            upd[v] = i;
            v = parent[v];
        }
        cout << ans << '\n';
        // for (int i = 0; i < N; i++)
        // {
        //     cerr << arr[i] << ' ';
        // }
        // cerr << endl;
    }
	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Compilation message

construction.cpp: In function 'int32_t main()':
construction.cpp:178:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("input.in", "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
construction.cpp:179:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("output.out", "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	484 KB	Output is correct
3	Correct	11 ms	560 KB	Output is correct
4	Correct	3 ms	688 KB	Output is correct
5	Correct	4 ms	688 KB	Output is correct
6	Correct	3 ms	688 KB	Output is correct
7	Correct	3 ms	688 KB	Output is correct
8	Correct	3 ms	796 KB	Output is correct
9	Correct	3 ms	796 KB	Output is correct
10	Correct	4 ms	796 KB	Output is correct
11	Correct	3 ms	796 KB	Output is correct
12	Correct	4 ms	796 KB	Output is correct
13	Correct	3 ms	828 KB	Output is correct
14	Correct	3 ms	828 KB	Output is correct
15	Correct	3 ms	828 KB	Output is correct
16	Correct	3 ms	876 KB	Output is correct
17	Correct	4 ms	876 KB	Output is correct
18	Correct	4 ms	876 KB	Output is correct
19	Correct	3 ms	876 KB	Output is correct
20	Correct	3 ms	876 KB	Output is correct
21	Correct	3 ms	876 KB	Output is correct
22	Correct	3 ms	876 KB	Output is correct
23	Correct	3 ms	876 KB	Output is correct
24	Correct	4 ms	876 KB	Output is correct
25	Correct	4 ms	876 KB	Output is correct
26	Correct	4 ms	876 KB	Output is correct
27	Correct	4 ms	876 KB	Output is correct
28	Correct	3 ms	876 KB	Output is correct
29	Correct	5 ms	876 KB	Output is correct
30	Correct	4 ms	928 KB	Output is correct
31	Correct	3 ms	928 KB	Output is correct
32	Correct	5 ms	928 KB	Output is correct
33	Correct	3 ms	928 KB	Output is correct
34	Correct	4 ms	928 KB	Output is correct
35	Correct	3 ms	928 KB	Output is correct
36	Correct	4 ms	928 KB	Output is correct
37	Correct	4 ms	928 KB	Output is correct
38	Correct	4 ms	928 KB	Output is correct
39	Correct	4 ms	1008 KB	Output is correct
40	Correct	4 ms	1008 KB	Output is correct
41	Correct	4 ms	1008 KB	Output is correct
42	Correct	3 ms	1008 KB	Output is correct
43	Correct	3 ms	1008 KB	Output is correct
44	Correct	4 ms	1008 KB	Output is correct
45	Correct	5 ms	1048 KB	Output is correct
46	Correct	13 ms	1452 KB	Output is correct
47	Correct	10 ms	1528 KB	Output is correct
48	Correct	9 ms	1620 KB	Output is correct
49	Correct	42 ms	1696 KB	Output is correct
50	Correct	50 ms	1904 KB	Output is correct
51	Correct	42 ms	2012 KB	Output is correct
52	Correct	25 ms	2124 KB	Output is correct
53	Correct	25 ms	2152 KB	Output is correct
54	Correct	25 ms	2160 KB	Output is correct
55	Correct	24 ms	2252 KB	Output is correct
56	Correct	24 ms	2472 KB	Output is correct
57	Correct	11 ms	2472 KB	Output is correct
58	Correct	11 ms	2528 KB	Output is correct
59	Correct	13 ms	2612 KB	Output is correct
60	Correct	16 ms	2612 KB	Output is correct
61	Correct	29 ms	2704 KB	Output is correct
62	Correct	27 ms	2780 KB	Output is correct
63	Correct	25 ms	2856 KB	Output is correct
64	Correct	10 ms	2932 KB	Output is correct
65	Correct	9 ms	2980 KB	Output is correct
66	Correct	11 ms	3028 KB	Output is correct
67	Correct	9 ms	3080 KB	Output is correct
68	Correct	42 ms	3136 KB	Output is correct
69	Correct	27 ms	3184 KB	Output is correct
70	Correct	26 ms	3184 KB	Output is correct
71	Correct	24 ms	3288 KB	Output is correct
72	Correct	15 ms	3464 KB	Output is correct
73	Correct	12 ms	3464 KB	Output is correct
74	Correct	26 ms	3568 KB	Output is correct
75	Correct	18 ms	3568 KB	Output is correct
76	Correct	14 ms	3568 KB	Output is correct
77	Correct	15 ms	3616 KB	Output is correct
78	Correct	17 ms	3692 KB	Output is correct
79	Correct	14 ms	3728 KB	Output is correct
80	Correct	12 ms	3776 KB	Output is correct
81	Correct	16 ms	3824 KB	Output is correct
82	Correct	15 ms	3888 KB	Output is correct
83	Correct	13 ms	3952 KB	Output is correct
84	Correct	20 ms	4016 KB	Output is correct
85	Correct	14 ms	4064 KB	Output is correct
86	Correct	13 ms	4112 KB	Output is correct

Subtask #3
0 / 84.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	484 KB	Output is correct
3	Correct	11 ms	560 KB	Output is correct
4	Correct	3 ms	688 KB	Output is correct
5	Correct	4 ms	688 KB	Output is correct
6	Correct	3 ms	688 KB	Output is correct
7	Correct	3 ms	688 KB	Output is correct
8	Correct	3 ms	796 KB	Output is correct
9	Correct	3 ms	796 KB	Output is correct
10	Correct	4 ms	796 KB	Output is correct
11	Correct	3 ms	796 KB	Output is correct
12	Correct	4 ms	796 KB	Output is correct
13	Correct	3 ms	828 KB	Output is correct
14	Correct	3 ms	828 KB	Output is correct
15	Correct	3 ms	828 KB	Output is correct
16	Correct	3 ms	876 KB	Output is correct
17	Correct	4 ms	876 KB	Output is correct
18	Correct	4 ms	876 KB	Output is correct
19	Correct	3 ms	876 KB	Output is correct
20	Correct	3 ms	876 KB	Output is correct
21	Correct	3 ms	876 KB	Output is correct
22	Correct	3 ms	876 KB	Output is correct
23	Correct	3 ms	876 KB	Output is correct
24	Correct	4 ms	876 KB	Output is correct
25	Correct	4 ms	876 KB	Output is correct
26	Correct	4 ms	876 KB	Output is correct
27	Correct	4 ms	876 KB	Output is correct
28	Correct	3 ms	876 KB	Output is correct
29	Correct	5 ms	876 KB	Output is correct
30	Correct	4 ms	928 KB	Output is correct
31	Correct	3 ms	928 KB	Output is correct
32	Correct	5 ms	928 KB	Output is correct
33	Correct	3 ms	928 KB	Output is correct
34	Correct	4 ms	928 KB	Output is correct
35	Correct	3 ms	928 KB	Output is correct
36	Correct	4 ms	928 KB	Output is correct
37	Correct	4 ms	928 KB	Output is correct
38	Correct	4 ms	928 KB	Output is correct
39	Correct	4 ms	1008 KB	Output is correct
40	Correct	4 ms	1008 KB	Output is correct
41	Correct	4 ms	1008 KB	Output is correct
42	Correct	3 ms	1008 KB	Output is correct
43	Correct	3 ms	1008 KB	Output is correct
44	Correct	4 ms	1008 KB	Output is correct
45	Correct	5 ms	1048 KB	Output is correct
46	Correct	13 ms	1452 KB	Output is correct
47	Correct	10 ms	1528 KB	Output is correct
48	Correct	9 ms	1620 KB	Output is correct
49	Correct	42 ms	1696 KB	Output is correct
50	Correct	50 ms	1904 KB	Output is correct
51	Correct	42 ms	2012 KB	Output is correct
52	Correct	25 ms	2124 KB	Output is correct
53	Correct	25 ms	2152 KB	Output is correct
54	Correct	25 ms	2160 KB	Output is correct
55	Correct	24 ms	2252 KB	Output is correct
56	Correct	24 ms	2472 KB	Output is correct
57	Correct	11 ms	2472 KB	Output is correct
58	Correct	11 ms	2528 KB	Output is correct
59	Correct	13 ms	2612 KB	Output is correct
60	Correct	16 ms	2612 KB	Output is correct
61	Correct	29 ms	2704 KB	Output is correct
62	Correct	27 ms	2780 KB	Output is correct
63	Correct	25 ms	2856 KB	Output is correct
64	Correct	10 ms	2932 KB	Output is correct
65	Correct	9 ms	2980 KB	Output is correct
66	Correct	11 ms	3028 KB	Output is correct
67	Correct	9 ms	3080 KB	Output is correct
68	Correct	42 ms	3136 KB	Output is correct
69	Correct	27 ms	3184 KB	Output is correct
70	Correct	26 ms	3184 KB	Output is correct
71	Correct	24 ms	3288 KB	Output is correct
72	Correct	15 ms	3464 KB	Output is correct
73	Correct	12 ms	3464 KB	Output is correct
74	Correct	26 ms	3568 KB	Output is correct
75	Correct	18 ms	3568 KB	Output is correct
76	Correct	14 ms	3568 KB	Output is correct
77	Correct	15 ms	3616 KB	Output is correct
78	Correct	17 ms	3692 KB	Output is correct
79	Correct	14 ms	3728 KB	Output is correct
80	Correct	12 ms	3776 KB	Output is correct
81	Correct	16 ms	3824 KB	Output is correct
82	Correct	15 ms	3888 KB	Output is correct
83	Correct	13 ms	3952 KB	Output is correct
84	Correct	20 ms	4016 KB	Output is correct
85	Correct	14 ms	4064 KB	Output is correct
86	Correct	13 ms	4112 KB	Output is correct
87	Correct	24 ms	5056 KB	Output is correct
88	Correct	95 ms	8064 KB	Output is correct
89	Correct	460 ms	18676 KB	Output is correct
90	Correct	409 ms	20652 KB	Output is correct
91	Correct	503 ms	22908 KB	Output is correct
92	Execution timed out	2064 ms	24640 KB	Time limit exceeded
93	Halted	0 ms	0 KB	-

답안 #62513

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 9.0 / 9.0

Subtask #3 0 / 84.0

Subtask #1
7.0 / 7.0

Subtask #2
9.0 / 9.0

Subtask #3
0 / 84.0