oj.uz

Submission #877499

# Submission time Handle Problem Language Result Execution time Memory
877499 2023-11-23T09:26:26 Z boris_mihov Fun Tour (APIO20_fun) C++17
10 / 100
 79 ms 20052 KB 
#include "fun.h"
#include <algorithm>
#include <iostream>
#include <cassert>
#include <numeric>
#include <vector>
#include <queue>

typedef long long llong;
const int MAXN = 100000 + 10;
const int INF  = 1e9;

int n;
int sz[MAXN];
int pos[MAXN];
int type[MAXN];
int perm[MAXN];
int depth[MAXN];
bool isActive[MAXN];
std::vector <int> g[MAXN];
std::vector <int> t[MAXN];
int waitlistType = -1;

struct Element
{
    int type;
    int depth;
    int node;

    friend bool operator < (const Element &a, const Element & b)
    {
        return a.depth < b.depth || (a.depth == b.depth && a.node > b.node);
    }
};

std::priority_queue <Element> pq;
std::queue <Element> q;

void calcSize(int node, int par)
{
    sz[node] = 1;
    for (const int &u : g[node])
    {
        if (u == par)
        {
            continue;
        }

        calcSize(u, node);
        sz[node] += sz[u];
    }
}

int findCentroid(int node, int par)
{
    for (const int &u : g[node])
    {
        if (u != par && sz[u] > n / 2)
        {
            return findCentroid(u, node);
        }
    }

    return node;
}

void assign(int node, int par, int t)
{
    type[node] = t;
    depth[node] = depth[par] + 1;
    for (const int &u : g[node])
    {
        if (u == par)
        {
            continue;
        }

        assign(u, node, t);
    }
}

std::vector <int> dfsThree(int node, int par)
{
    std::vector <int> res;
    res.push_back(node);

    for (const int &u : t[node])
    {
        if (u == par)
        {
            continue;
        }

        if (t[u].size() == 1)
        {
            res.push_back(u);
        }
    }

    for (const int &u : t[node])
    {
        if (u == par || t[u].size() == 1)
        {
            continue;
        }

        std::vector <int> curr = dfsThree(u, node);
        std::reverse(curr.begin(), curr.end());
        for (const int &v : curr)
        {
            res.push_back(v);
        }
    }

    return res;
}

std::vector <int> createFunTour(int N, int Q) 
{  
    n = N;
    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = i + 1 ; j <= n ; ++j)
        {
            if (hoursRequired(i - 1, j - 1) == 1)
            {
                g[i].push_back(j); 
                g[j].push_back(i);
            }
        }
    }

    calcSize(1, 0);
    int cntr = findCentroid(1, 0);

    for (int idx = 0 ; idx < g[cntr].size() ; ++idx)
    {
        assign(g[cntr][idx], cntr, idx);
    }

    std::vector <int> answer;
    for (int i = 1 ; i <= n ; ++i)
    {
        if (i == cntr)
        {
            continue;
        }

        pq.push({type[i], depth[i], i});
    }
    
    while (!pq.empty())
    {
        auto [t, d, node] = pq.top();
        pq.pop();  

        if (waitlistType == t)
        {
            q.push({t, d, node});
            continue;
        }

        if (waitlistType != -1)
        {
            answer.push_back(node);
            answer.push_back(q.front().node);
            q.pop();

            if (q.empty())
            {
                waitlistType = -1;
            }

            continue;
        }

        if (answer.size() && type[answer.back()] == t)
        {
            q.push({t, d, node});
            waitlistType = t;
            continue;
        }

        answer.push_back(node);
    }

    if (q.size() && type[answer.back()] != q.front().type)
    {
        answer.push_back(q.front().node);
        q.pop();
    }

    if (q.size())
    {
        q.push({q.front().type, 0, cntr});
        int cntActive = q.size() + 2;
        isActive[answer.back()] = true;
        while (!q.empty())
        {
            isActive[q.front().node] = true;
            q.pop();
        }

        for (int i = 1 ; i <= n ; ++i)
        {
            if (!isActive[i]) continue;
            for (const int &u : g[i])
            {
                if (isActive[u])
                {
                    t[i].push_back(u);
                }
            }
        }
    
        std::vector <int> toAdd = dfsThree(answer.back(), 0);
        answer.pop_back();

        for (const int &u : toAdd)
        {
            answer.push_back(u);
        }
    } else
    {
        answer.push_back(cntr);
    }

    for (int &u : answer)
    {
        u--;
    }

    return answer;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:136:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |     for (int idx = 0 ; idx < g[cntr].size() ; ++idx)
      |                        ~~~~^~~~~~~~~~~~~~~~
fun.cpp:196:13: warning: unused variable 'cntActive' [-Wunused-variable]
  196 |         int cntActive = q.size() + 2;
      |             ^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 1 ms 6748 KB Output is correct
20 Correct 1 ms 6748 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 1 ms 6748 KB Output is correct
20 Correct 1 ms 6748 KB Output is correct
21 Correct 1 ms 6748 KB Output is correct
22 Correct 1 ms 6748 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 8 ms 6748 KB Output is correct
25 Correct 1 ms 6748 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 1 ms 6744 KB Output is correct
29 Incorrect 9 ms 6840 KB Tour is not fun
30 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 8 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 10 ms 6748 KB Output is correct
17 Correct 8 ms 6744 KB Output is correct
18 Incorrect 79 ms 20052 KB Too many queries
19 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6744 KB Output is correct
8 Incorrect 9 ms 6840 KB Tour is not fun
9 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 1 ms 6748 KB Output is correct
20 Correct 1 ms 6748 KB Output is correct
21 Correct 1 ms 6748 KB Output is correct
22 Correct 1 ms 6748 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 8 ms 6748 KB Output is correct
25 Correct 1 ms 6748 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 1 ms 6744 KB Output is correct
29 Incorrect 9 ms 6840 KB Tour is not fun
30 Halted 0 ms 0 KB -