oj.uz

답안 #718098

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
718098 2023-04-03T10:18:28 Z LittleCube 즐거운 행로 (APIO20_fun) C++14
100 / 100
 355 ms 21988 KB 
#include "fun.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
#define pii pair<int, int>
#define F first
#define S second
using namespace std;

vector<int> createFunTour(int N, int Q)
{
    if (N == 2)
        return {0, 1};
    priority_queue<pii> pq;
    for (int i = 1; i < N; i++)
        pq.push(pii(attractionsBehind(0, i), i)); // N - 1
    int c = 0;
    while (!pq.empty() && pq.top().F > N / 2)
    {
        auto [sz, u] = pq.top();
        pq.pop();
        c = u;
    }
    vector<int> d(N), order(N), sol(2 * N, -1), large(2 * N, 0);
    vector<int> tmp[2];
    for (int i = 0; i < N; i++)
    {
        if (i != c)
            d[i] = hoursRequired(c, i); // N - 1
        order[i] = i;
    }
    sort(order.begin(), order.end(), [&](int i, int j)
         { return d[i] > d[j]; });

    auto diffSubtree = [&](int i, int j)
    {
        if (i == c || j == c)
            return true;
        return hoursRequired(i, j) == d[i] + d[j];
    };

    int t = 0;
    for (int i = 0; i < N - 1; i++)
    {
        if (tmp[t ^ 1].empty() || diffSubtree(order[i], tmp[t ^ 1].back()))
        {
            tmp[t].emplace_back(order[i]);
            if (tmp[t].size() + t > tmp[t ^ 1].size())
                t ^= 1;
        }
        else
            tmp[t ^ 1].emplace_back(order[i]);
    }

    for (int i = 0; i < tmp[0].size(); i++)
        sol[i * 2] = tmp[0][i];
    for (int i = 0; i < tmp[1].size(); i++)
        sol[i * 2 + 1] = tmp[1][i];

    tmp[0].clear(), tmp[1].clear();
    int over = -1, in = 0, out = 0, last = 2 * N;
    for (int i = 2 * N - 1; i > 0; i--)
        if (sol[i] == -1 && sol[i - 1] >= 0)
        {
            over = sol[i - 1];
            break;
        }
    for (int i = 0; i < 2 * N; i++)
        if (sol[i] >= 0)
        {
            if (!diffSubtree(sol[i], over))
                large[i] = 1;
            (large[i] ? in : out)++;
        }

    for (int i = 0; i < 2 * N; i++)
    {
        if (in >= out)
        {
            last = i;
            break;
        }
        (large[i] ? in : out)--;
    }

    for (int i = last; i < 2 * N; i++)
        if (sol[i] >= 0)
            tmp[large[i]].emplace_back(sol[i]);

    sort(tmp[0].begin(), tmp[0].end(), [&](int i, int j)
         { return d[i] > d[j]; });
    sort(tmp[1].begin(), tmp[1].end(), [&](int i, int j)
         { return d[i] > d[j]; });

    // x, y, b, a valid
    {
        int a = tmp[1].front(), b = tmp[0].front();
        if ((last < 1 || diffSubtree(sol[last - 1], b)) && // y, b different
            (last < 2 || d[b] <= d[sol[last - 2]]) &&      // x >= b
            (last < 1 || d[a] <= d[sol[last - 1]]))        // x <= b;
            swap(tmp[0], tmp[1]);
    }

    for (int i = last; i < 2 * N; i++)
        sol[i] = -1;

    for (int i = 0; i < tmp[1].size(); i++)
        sol[last + i * 2] = tmp[1][i];
    for (int i = 0; i < tmp[0].size(); i++)
        sol[last + i * 2 + 1] = tmp[0][i];

    int off = 0;
    for (int i = 0; i < 2 * N; i++)
        if (sol[i] == -1)
            off++;
        else
            sol[i - off] = sol[i];
    sol.resize(N);
    sol[N - 1] = c;
    return sol;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:21:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   21 |         auto [sz, u] = pq.top();
      |              ^
fun.cpp:56:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (int i = 0; i < tmp[0].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~
fun.cpp:58:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for (int i = 0; i < tmp[1].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~
fun.cpp:108:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |     for (int i = 0; i < tmp[1].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~
fun.cpp:110:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |     for (int i = 0; i < tmp[0].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 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 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 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 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 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 212 KB Output is correct
32 Correct 1 ms 340 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 340 KB Output is correct
37 Correct 1 ms 304 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 340 KB Output is correct
41 Correct 1 ms 296 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 340 KB Output is correct
18 Correct 126 ms 17280 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 3 ms 720 KB Output is correct
22 Correct 6 ms 1332 KB Output is correct
23 Correct 11 ms 2472 KB Output is correct
24 Correct 15 ms 3220 KB Output is correct
25 Correct 71 ms 10032 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 12 ms 1960 KB Output is correct
15 Correct 155 ms 17320 KB Output is correct
16 Correct 188 ms 16828 KB Output is correct
17 Correct 30 ms 4236 KB Output is correct
18 Correct 76 ms 8056 KB Output is correct
19 Correct 131 ms 13680 KB Output is correct
20 Correct 4 ms 852 KB Output is correct

Subtask #5
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 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 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 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 212 KB Output is correct
32 Correct 1 ms 340 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 340 KB Output is correct
37 Correct 1 ms 304 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 340 KB Output is correct
41 Correct 1 ms 296 KB Output is correct
42 Correct 1 ms 296 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 126 ms 17280 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 2 ms 596 KB Output is correct
47 Correct 3 ms 720 KB Output is correct
48 Correct 6 ms 1332 KB Output is correct
49 Correct 11 ms 2472 KB Output is correct
50 Correct 15 ms 3220 KB Output is correct
51 Correct 71 ms 10032 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 12 ms 1960 KB Output is correct
54 Correct 155 ms 17320 KB Output is correct
55 Correct 188 ms 16828 KB Output is correct
56 Correct 30 ms 4236 KB Output is correct
57 Correct 76 ms 8056 KB Output is correct
58 Correct 131 ms 13680 KB Output is correct
59 Correct 4 ms 852 KB Output is correct
60 Correct 221 ms 17216 KB Output is correct
61 Correct 198 ms 19372 KB Output is correct
62 Correct 238 ms 16960 KB Output is correct
63 Correct 194 ms 20936 KB Output is correct
64 Correct 226 ms 20928 KB Output is correct
65 Correct 225 ms 17080 KB Output is correct
66 Correct 219 ms 19416 KB Output is correct
67 Correct 227 ms 20948 KB Output is correct
68 Correct 223 ms 20140 KB Output is correct
69 Correct 268 ms 21708 KB Output is correct
70 Correct 187 ms 16936 KB Output is correct
71 Correct 199 ms 20920 KB Output is correct
72 Correct 237 ms 19520 KB Output is correct
73 Correct 215 ms 20108 KB Output is correct
74 Correct 256 ms 21988 KB Output is correct
75 Correct 229 ms 16960 KB Output is correct
76 Correct 222 ms 20940 KB Output is correct
77 Correct 247 ms 21056 KB Output is correct
78 Correct 214 ms 20084 KB Output is correct
79 Correct 278 ms 21852 KB Output is correct
80 Correct 355 ms 21928 KB Output is correct
81 Correct 203 ms 17040 KB Output is correct
82 Correct 212 ms 17140 KB Output is correct
83 Correct 266 ms 17040 KB Output is correct
84 Correct 71 ms 7272 KB Output is correct