oj.uz

Submission #982563

# Submission time Handle Problem Language Result Execution time Memory
982563 2024-05-14T12:21:28 Z phoenix Fun Tour (APIO20_fun) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#include "fun.h"

#define get_dist hoursRequired
#define get_size attractionsBehind

#ifdef LOCAL 
#define cerr cout
#else 
#define cerr if (false) cout
#endif


using namespace std;

vector<int> createFunTour(int n, int q) {
    vector<int> res;
    int C;
    vector<pair<int, int>> d[3];
    vector<int> dist(n);

    /*Step 1: Find Centroid */ {
        // a) pick a random vertex
        int v = 0;
        // b) for all i, find i's subtree's size if tree is rooted by v
        vector<int> sz(n);
        for (int i = 0; i < n; i++)
            sz[i] = get_size(v, i);
        // c) centroid is i s.t, 2 * sz[i] > n and sz[i] - min
        C = -1;
        for (int i = 0; i < n; i++)
            if (2 * sz[i] > n) 
                if (C == -1 || sz[i] < sz[C]) 
                    C = i;
        // d) Yay! We found centroid of tree
    }       

    /*Step 2: Find distance from C to any other vertices*/ {
        for (int i = 0; i < n; i++)
            dist[i] = get_dist(C, i);
    }

    /*Step 3: Divide all vertices to subrees of C*/ {
        vector<int> c;
        for (int i = 0; i < n; i++) 
            if (dist[i] == 1)
                c.push_back(i);
        
        for (int i = 0; i < n; i++) {
            if (i == C) continue;
            int j = 0;
            while (j < (int)c.size() - 1) {
                if (get_dist(i, c[j]) < dist[i]) break;
                j++;
            }
            d[j].push_back({dist[i], i});
        }
    }

    for (int i = 0; i < 3; i++) {
        sort(d[i].rbegin(), d[i].rend());
    }

    /*Step 4: Solve problem :)*/ {
        res.push_back(C);

        int lst = -1;
        while ((int)res.size() < n) {
            int s = 0;
            for (int i = 0; i < 3; i++) 
                s += (int)d[i].size();
            
            int nxt = -1;
            for (int i = 0; i < 3; i++) {
                if (d[i].empty() || i == lst) 
                    continue;
                if ((int)d[i].size() * 2 == s) {
                    nxt = i;
                    break;
                } 
                if (nxt == -1 || d[i].back().first < d[nxt].back().first)
                    nxt = i;
            }
            res.push_back(d[nxt].back().second);
            d[nxt].pop_back();
        }
    }
    reverse(res.begin(), res.end());

    return res;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 1 ms 344 KB Tour is not fun
7 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 1 ms 344 KB Tour is not fun
7 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 1 ms 344 KB Tour is not fun
6 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Tour is not fun
4 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 1 ms 344 KB Tour is not fun
7 Halted 0 ms 0 KB -