oj.uz

답안 #725118

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
725118 2023-04-16T23:25:45 Z danikoynov 즐거운 행로 (APIO20_fun) C++14
100 / 100
 242 ms 21416 KB 
#include "fun.h"

#include <bits/stdc++.h>
using namespace std;

const int maxn = 2e6 + 10;

int sub[maxn], dis[maxn];

bool cmp(int a, int b)
{
    return dis[a] < dis[b];
}
vector<int> createFunTour(int N, int Q)
{
    for (int i = 0; i < N; i ++)
        sub[i] = attractionsBehind(0, i);

    int centroid = 0;
    for (int i = 0; i < N; i ++)
    {
        if (sub[i] >= (N + 1) / 2 && sub[i] < sub[centroid])
            centroid = i;
    }

    for (int i = 0; i < N; i ++)
        dis[i] = hoursRequired(centroid, i);

    vector < int > cp[3];
    int p[3];
    p[0] = p[1] = p[2] = -1;
    for (int i = 0; i < N; i ++)
    {
        if (dis[i] == 1)
        {
            if (p[0] == -1)
                p[0] = i;
            else if (p[1] == -1)
                p[1] = i;
            else
                p[2] = i;
        }
    }


    for (int i = 0; i < N; i ++)
    {
        if (i == centroid)
            continue;
        if (i == p[0])
            cp[0].push_back(i);
        else if (i == p[1])
            cp[1].push_back(i);
        else if (i == p[2])
            cp[2].push_back(i);
        else
        {
            if (hoursRequired(p[0], i) + 1 == dis[i])
                cp[0].push_back(i);
            else if (hoursRequired(p[1], i) + 1 == dis[i])
                cp[1].push_back(i);
            else
                cp[2].push_back(i);
        }
    }

    /**for (int v : cp[0])
        cout << v << " ";
    cout << endl;
    for (int v : cp[1])
        cout << v << " ";
    cout << endl;
        for (int v : cp[2])
        cout << v << " ";
    cout << endl;*/

    if (cp[0].size() < cp[1].size())
    {
        swap(p[0], p[1]);
        swap(cp[0], cp[1]);
    }

    if (cp[0].size() < cp[2].size())
    {
        swap(p[0], p[2]);
        swap(cp[0], cp[2]);
    }

    if (cp[1].size() < cp[2].size())
    {
        swap(p[1], p[2]);
        swap(cp[1], cp[2]);
    }

    sort(cp[0].begin(), cp[0].end(), cmp);
    sort(cp[1].begin(), cp[1].end(), cmp);
    sort(cp[2].begin(), cp[2].end(), cmp);
    vector < int > ans;
    int last = -1, inside = 0;
    if (p[2] == -1)
    {
        while(cp[1].size() > 0)
        {
            ans.push_back(cp[0].back());
            ans.push_back(cp[1].back());
            cp[0].pop_back();
            cp[1].pop_back();
        }
        if (!cp[0].empty())
            ans.push_back(cp[0].back());
    }
    else
    {
        int big = -1;
        if (cp[0].size() > cp[1].size() + cp[2].size())
        {
            inside = 1;
            cp[2].insert(cp[2].begin(), centroid);

        }
        while(true)
        {
            if (cp[0].size() == 0 || cp[1].size() == 0 || cp[2].size() == 0)
                break;
            if (cp[0].size() == cp[1].size() + cp[2].size())
            {
                big = 0;
                break;
            }
            if (cp[1].size() == cp[0].size() + cp[2].size())
            {
                big = 1;
                break;
            }
            if (cp[2].size() == cp[0].size() + cp[1].size())
            {
                big = 2;
                break;
            }

            int cur = -1;
            if (last != 0 && (cur == -1 || dis[cp[0].back()] > dis[cp[cur].back()]))
                cur = 0;
            if (last != 1 && (cur == -1 || dis[cp[1].back()] > dis[cp[cur].back()]))
                cur = 1;
            if (last != 2 && (cur == -1 || dis[cp[2].back()] > dis[cp[cur].back()]))
                cur = 2;

            ans.push_back(cp[cur].back());
            cp[cur].pop_back();
            last = cur;
        }

        if (cp[0].size() == 0 || cp[1].size() == 0 || cp[2].size() == 0)
        {
            if (cp[0].size() == 0)
                swap(cp[0], cp[2]);
            else if (cp[1].size() == 0)
                swap(cp[1], cp[2]);
            if (dis[cp[0].back()] < dis[cp[1].back()])
                swap(cp[0], cp[1]);

            while(cp[1].size() > 0)
            {
                ans.push_back(cp[0].back());
                ans.push_back(cp[1].back());
                cp[0].pop_back();
                cp[1].pop_back();
            }
            if (!cp[0].empty())
                ans.push_back(cp[0].back());

        }
        else
        {

            vector < int > sm;
            for (int i = 0; i < 3; i ++)
            {
                if (i != big)
                    sm.push_back(i);
            }

            int v = sm[0], u = sm[1];
            if (v == last)
                v = sm[1], u = sm[0];

            if (dis[cp[v].back()] > dis[cp[u].back()])
                last = big;
            while(!cp[v].empty())
            {
                cp[u].push_back(cp[v].back());
                cp[v].pop_back();
            }

            sort(cp[u].begin(), cp[u].end(), cmp);
            while(ans.size() < N - 1 + inside)
            {
                if (last == big)
                {
                    ans.push_back(cp[u].back());
                    cp[u].pop_back();
                    last = u;
                }
                else
                {
                    ans.push_back(cp[big].back());
                    cp[big].pop_back();
                    last = big;
                }
            }
        }

    }

    if (inside == 0)
    ans.push_back(centroid);
    /*cout << "tour" << endl;
    for (int v : ans)
        cout << v << " ";
    cout << endl;*/
    return ans;
}

Compilation message

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

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 1 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 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 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 1 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 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 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 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 1 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 212 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 212 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 1 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 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 340 KB Output is correct
18 Correct 125 ms 15440 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 5 ms 1236 KB Output is correct
23 Correct 11 ms 2132 KB Output is correct
24 Correct 13 ms 2944 KB Output is correct
25 Correct 61 ms 8956 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 8 ms 1620 KB Output is correct
15 Correct 129 ms 15284 KB Output is correct
16 Correct 122 ms 15148 KB Output is correct
17 Correct 21 ms 3852 KB Output is correct
18 Correct 65 ms 7160 KB Output is correct
19 Correct 98 ms 12020 KB Output is correct
20 Correct 4 ms 748 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 1 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 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 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 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 1 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 212 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 212 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 125 ms 15440 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 3 ms 468 KB Output is correct
47 Correct 3 ms 724 KB Output is correct
48 Correct 5 ms 1236 KB Output is correct
49 Correct 11 ms 2132 KB Output is correct
50 Correct 13 ms 2944 KB Output is correct
51 Correct 61 ms 8956 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 8 ms 1620 KB Output is correct
54 Correct 129 ms 15284 KB Output is correct
55 Correct 122 ms 15148 KB Output is correct
56 Correct 21 ms 3852 KB Output is correct
57 Correct 65 ms 7160 KB Output is correct
58 Correct 98 ms 12020 KB Output is correct
59 Correct 4 ms 748 KB Output is correct
60 Correct 164 ms 15328 KB Output is correct
61 Correct 166 ms 17764 KB Output is correct
62 Correct 185 ms 15312 KB Output is correct
63 Correct 182 ms 19268 KB Output is correct
64 Correct 184 ms 19328 KB Output is correct
65 Correct 184 ms 15592 KB Output is correct
66 Correct 188 ms 17784 KB Output is correct
67 Correct 173 ms 19600 KB Output is correct
68 Correct 207 ms 18732 KB Output is correct
69 Correct 242 ms 20296 KB Output is correct
70 Correct 156 ms 15408 KB Output is correct
71 Correct 175 ms 19224 KB Output is correct
72 Correct 214 ms 17972 KB Output is correct
73 Correct 222 ms 18860 KB Output is correct
74 Correct 241 ms 20212 KB Output is correct
75 Correct 215 ms 15520 KB Output is correct
76 Correct 178 ms 19436 KB Output is correct
77 Correct 199 ms 19588 KB Output is correct
78 Correct 211 ms 19844 KB Output is correct
79 Correct 232 ms 21124 KB Output is correct
80 Correct 214 ms 21416 KB Output is correct
81 Correct 188 ms 16484 KB Output is correct
82 Correct 162 ms 16612 KB Output is correct
83 Correct 160 ms 16704 KB Output is correct
84 Correct 60 ms 7172 KB Output is correct