oj.uz

답안 #296157

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
296157 2020-09-10T10:58:45 Z Alexa2001 즐거운 행로 (APIO20_fun) C++17
0 / 100
 132 ms 16240 KB 
#include "fun.h"
#include <bits/stdc++.h>

using namespace std;

const int Nmax = 1e5 + 5;

int n;
vector<int> ans;
bool used[Nmax];
int dist[Nmax];


void add(int node)
{
    ans.push_back(node);
    used[node] = 1;
}

void solve(int root)
{
    int i, j;
    for(i=0; i<n; ++i) dist[i] = hoursRequired(root, i);

   /// root = 0;

    while(1)
    {
        vector<int> sons;
        vector<vector<int>> d;

        for(j=0; j<n; ++j)
            if(!used[j] && dist[j] == dist[root] + 1)
                sons.push_back(j);

        if(sons.empty())
        {
            add(root);
            return;
        }

        d.resize(sons.size());

        for(j=0; j<n; ++j)
            if(!used[j] && j != root)
            {
                int where = 0;
                for(i=1; !where && i<sons.size(); ++i)
                    if(dist[j] == dist[sons[i]] + hoursRequired(sons[i], j))
                        where = i;

                d[where].push_back(j);
            }

        for(i=0; i<sons.size(); ++i)
            sort(d[i].begin(), d[i].end(), [&] (int x, int y) { return dist[x] < dist[y];} );

        if(sons.size() == 1)
        {
            add(d[0].back());
            add(root);

            if(sons[0] == d[0].back()) return;

            root = sons[0];
            continue;
        }

        int last = -1;

        while(1)
        {
            int best = -1, nd = -1;

            for(i=0; i<sons.size(); ++i)
                if(i != last && d[i].size() && dist[d[i].back()] > best)
                    best = dist[d[i].back()], nd = i;

            if(nd == -1) break;

            add(d[nd].back());
            d[nd].pop_back();
            last = nd;
        }

        add(root);

        root = -1;
        for(i=0; i<sons.size(); ++i)
            if(d[i].size()) root = sons[i];

        if(root == -1) return;
    }

}

vector<int> createFunTour(int N, int Q)
{
    n = N;

    solve(1);
    return ans;
}

Compilation message

fun.cpp: In function 'void solve(int)':
fun.cpp:48:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |                 for(i=1; !where && i<sons.size(); ++i)
      |                                    ~^~~~~~~~~~~~
fun.cpp:55:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |         for(i=0; i<sons.size(); ++i)
      |                  ~^~~~~~~~~~~~
fun.cpp:75:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |             for(i=0; i<sons.size(); ++i)
      |                      ~^~~~~~~~~~~~
fun.cpp:89:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for(i=0; i<sons.size(); ++i)
      |                  ~^~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Incorrect 1 ms 384 KB Tour is not fun
13 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Incorrect 1 ms 384 KB Tour is not fun
13 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 132 ms 16240 KB Output is correct
19 Incorrect 1 ms 384 KB Tour is not fun
20 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Incorrect 1 ms 384 KB Tour is not fun
6 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Incorrect 1 ms 384 KB Tour is not fun
13 Halted 0 ms 0 KB -