답안 #561161

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
561161	2022-05-12T11:59:04 Z	piOOE	즐거운 행로 (APIO20_fun)	C++17	100 / 100	235 ms	21832 KB

#include "fun.h"
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>

using namespace std;

#define all(x) begin(x), end(x)

vector<int> createFunTour(int n, int q) {
    if (n == 2) {
        return {0, 1};
    }
    vector<int> d(n), sub(n);
    for (int i = 0; i < n; ++i) {
        sub[i] = attractionsBehind(0, i);
    }
    int c = 0;
    for (int i = 1; i < n; ++i) {
        if (sub[i] * 2 > n && sub[i] < sub[c]) {
            c = i;
        }
    }
    vector<int> adj;
    for (int i = 0; i < n; ++i) {
        if (i != c) {
            d[i] = hoursRequired(c, i);
            if (d[i] == 1) {
                adj.push_back(i);
            }
        }
    }
    int sz = int(adj.size());
    vector<priority_queue<array<int, 2>>> v(sz);
    for (int i = 0; i < n; ++i) {
        if (i == c) continue;
        int d0 = hoursRequired(i, adj[0]), d1 = hoursRequired(i, adj[1]);
        if (d0 == d1) {
            v[2].push({d[i], i});
        } else if (d0 < d1) {
            v[0].push({d[i], i});
        } else {
            v[1].push({d[i], i});
        }
    }
    vector<int> ans;
    int last = -1;
    while (ans.size() < n - 1) {
        vector<int> t(sz);
        iota(all(t), 0);
        sort(all(t), [&v](int i, int j) {
            if (v[i].empty()) return false;
            if (v[j].empty()) return true;
            return v[i].top()[0] > v[j].top()[0];
        });
        int a = t[0];
        if (sz > 1 && last == a && !v[t[1]].empty()) {
            a = t[1];
        }
        ans.push_back(v[a].top()[1]);
        v[a].pop();
        last = a;
        if (v[a].empty()) {
            sz -= 1;
            if (a < sz) {
                if (sz == 1) swap(v[1], v[a]);
                else if (sz == 2) swap(v[a], v[2]);
            }
            last = -1;
        }
        sort(all(t), [&v](int i, int j) {
            return v[i].size() > v[j].size();
        });
        if (sz > 2 && v[t[0]].size() > v[t[1]].size() + v[t[2]].size()) {
            int b = t[1] + t[2] - last; //we know that t[1] == last || t[2] == last
            assert(!v[b].empty());
            if (v[b].top()[0] > d[ans.back()]) {
                ans.push_back(v[b].top()[1]);
                v[b].pop();
            }
            if (t[1] > t[2]) swap(t[1], t[2]);
            last = t[1];
            while (!v[t[2]].empty()) {
                v[t[1]].push(v[t[2]].top());
                v[t[2]].pop();
            }
            if (t[2] == 1) {
                swap(v[1], v[2]);
            }
            sz -= 1;
        }
//        cout << ans.back() << endl;
    }
    ans.push_back(c);
    return ans;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:47:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |     while (ans.size() < n - 1) {
      |            ~~~~~~~~~~~^~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 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	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	296 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 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	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	296 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	296 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	300 KB	Output is correct
37	Correct	1 ms	300 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	1 ms	300 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 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	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	296 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	296 KB	Output is correct
18	Correct	133 ms	16572 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	2 ms	540 KB	Output is correct
21	Correct	4 ms	696 KB	Output is correct
22	Correct	7 ms	1236 KB	Output is correct
23	Correct	13 ms	2388 KB	Output is correct
24	Correct	16 ms	3200 KB	Output is correct
25	Correct	73 ms	9768 KB	Output is correct

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 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	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	10 ms	1748 KB	Output is correct
15	Correct	139 ms	16580 KB	Output is correct
16	Correct	148 ms	16200 KB	Output is correct
17	Correct	24 ms	4120 KB	Output is correct
18	Correct	62 ms	7852 KB	Output is correct
19	Correct	108 ms	13100 KB	Output is correct
20	Correct	4 ms	904 KB	Output is correct

Subtask #5
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 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	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	296 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	296 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	300 KB	Output is correct
37	Correct	1 ms	300 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	1 ms	300 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	1 ms	340 KB	Output is correct
43	Correct	1 ms	296 KB	Output is correct
44	Correct	133 ms	16572 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	2 ms	540 KB	Output is correct
47	Correct	4 ms	696 KB	Output is correct
48	Correct	7 ms	1236 KB	Output is correct
49	Correct	13 ms	2388 KB	Output is correct
50	Correct	16 ms	3200 KB	Output is correct
51	Correct	73 ms	9768 KB	Output is correct
52	Correct	1 ms	340 KB	Output is correct
53	Correct	10 ms	1748 KB	Output is correct
54	Correct	139 ms	16580 KB	Output is correct
55	Correct	148 ms	16200 KB	Output is correct
56	Correct	24 ms	4120 KB	Output is correct
57	Correct	62 ms	7852 KB	Output is correct
58	Correct	108 ms	13100 KB	Output is correct
59	Correct	4 ms	904 KB	Output is correct
60	Correct	178 ms	16388 KB	Output is correct
61	Correct	221 ms	18724 KB	Output is correct
62	Correct	195 ms	16968 KB	Output is correct
63	Correct	178 ms	21164 KB	Output is correct
64	Correct	186 ms	20724 KB	Output is correct
65	Correct	187 ms	17088 KB	Output is correct
66	Correct	195 ms	19332 KB	Output is correct
67	Correct	190 ms	21140 KB	Output is correct
68	Correct	202 ms	20420 KB	Output is correct
69	Correct	231 ms	21616 KB	Output is correct
70	Correct	166 ms	17220 KB	Output is correct
71	Correct	177 ms	20864 KB	Output is correct
72	Correct	194 ms	19504 KB	Output is correct
73	Correct	185 ms	20068 KB	Output is correct
74	Correct	232 ms	21784 KB	Output is correct
75	Correct	177 ms	17408 KB	Output is correct
76	Correct	186 ms	21244 KB	Output is correct
77	Correct	185 ms	21256 KB	Output is correct
78	Correct	174 ms	20340 KB	Output is correct
79	Correct	222 ms	21464 KB	Output is correct
80	Correct	235 ms	21832 KB	Output is correct
81	Correct	171 ms	16836 KB	Output is correct
82	Correct	193 ms	17092 KB	Output is correct
83	Correct	195 ms	16928 KB	Output is correct
84	Correct	72 ms	7204 KB	Output is correct

답안 #561161

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 19.0 / 19.0

Subtask #5 34.0 / 34.0

Subtask #1
10.0 / 10.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
19.0 / 19.0

Subtask #5
34.0 / 34.0