Submission #395284

#TimeUsernameProblemLanguageResultExecution timeMemory
395284syl123456Fun Tour (APIO20_fun)C++17
0 / 100
1 ms204 KiB
#include "fun.h"
#include <bits/stdc++.h>
#define all(i) (i).begin(), (i).end()
using namespace std;
std::vector<int> createFunTour(int N, int Q) {
    int H = hoursRequired(0, N - 1);
    int A = attractionsBehind(0, N - 1);
    vector<int> dep(N), sz(N);
    dep[0] = 0, sz[0] = N;
    int cen = 0;
    for (int i = 1; i < N; ++i) {
        dep[i] = hoursRequired(0, i);
        sz[i] = attractionsBehind(0, i);
        if (dep[i] > dep[cen] && sz[i] > N / 2) cen = i;
    }
    vector<int> v[3], ch;
    if (cen != 0) for (int i = 0; i < N; ++i) dep[i] = i == cen ? 0 : hoursRequired(cen, i);
    for (int i = 0; i < N; ++i) if (dep[i] == 1) ch.push_back(i);
    for (int j = 0; j < ch.size(); ++j) v[j].push_back(ch[j]);
    for (int i = 0; i < N; ++i) if (dep[i] > 1) {
        bool b = false;
        for (int j = 0; j < ch.size() - 1; ++j) if (dep[i] == 1 + hoursRequired(ch[j], i)) {
            v[j].push_back(i);
            b = true;
            break;
        }
        if (!b) v[ch.size() - 1].push_back(i);
    }
    for (int i = 0; i < 3; ++i) sort(all(v[i]), [&](int x, int y) {
        return dep[x] < dep[y];
    });
    vector<int> ans;
    int pre = -1;
    for (int i = 0; i < N - 1; ++i) {
        int tmp = -1;
        for (int j = 0; j < 3; ++j) if (j != pre && !v[j].empty() && (tmp == -1 || dep[v[j].back()] > dep[v[tmp].back()]))
            tmp = j;
        ans.push_back(v[tmp].back());
        v[tmp].pop_back();
    }
    ans.push_back(cen);
    return ans;
}
/*
 * n depth
 * n sz
 * cen = max dep && sz > n/2
 * rt != cen ? n dis cen + n two ch
 *           : n first ch + n second ch
 *
 */

Compilation message (stderr)

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for (int j = 0; j < ch.size(); ++j) v[j].push_back(ch[j]);
      |                     ~~^~~~~~~~~~~
fun.cpp:22:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         for (int j = 0; j < ch.size() - 1; ++j) if (dep[i] == 1 + hoursRequired(ch[j], i)) {
      |                         ~~^~~~~~~~~~~~~~~
fun.cpp:6:9: warning: unused variable 'H' [-Wunused-variable]
    6 |     int H = hoursRequired(0, N - 1);
      |         ^
fun.cpp:7:9: warning: unused variable 'A' [-Wunused-variable]
    7 |     int A = attractionsBehind(0, N - 1);
      |         ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...