oj.uz

Submission #43120

# Submission time Handle Problem Language Result Execution time Memory
43120 2018-03-09T09:39:38 Z aquablitz11 Race (IOI11_race) C++11
43 / 100
 3000 ms 37132 KB 
// headers
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// types
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using dbl = double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
// loops
#define forx(i, x, y) for (int i = (x); i <= (y); ++i)
#define forn(i, n) for (int i = 0; i < (n); ++i)
#define for1(i, n) for (int i = 1; i <= (n); ++i)
#define rofx(i, x, y) for (int i = x; i >= y; --i)
#define rofn(i, n) for (int i = n-1; i >= 0; --i)
#define rof1(i, n) for (int i = n; i >= 1; --i)
#define fora(x, v) for (auto x : v)
// define shortcuts
#define all(x) begin(x), end(x)
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define X first
#define Y second
#define MP make_pair
#define MT make_tuple
// functions
template<class T> inline bool hasbit(T x, int i) { return x&(1<<i); }
template<class T> inline T togbit(T x, int i) { return x|(1<<i); }
template<class T> inline T setbit(T x, int i) { return x|(1<<i); }
template<class T> inline T rembit(T x, int i) { return x&~(1<<i); }
template<class T> inline bool setmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool setmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> int compress(vector<T> &v) { sort(all(v)); v.resize(unique(all(v))-v.begin()); return v.size(); }
// read functions
int read_int() { int x; scanf("%d", &x); return x; }
ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
int read_dbl() { dbl x; scanf("%lf", &x); return x; }
void _R(int &x) { x = read_int(); }
void _R(ll &x) { x = read_ll(); }
void _R(dbl &x) { x = read_dbl(); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
// print functions
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const ll &x) { printf("%" PRId64, x); }
void _W(const ull &x) { printf("%" PRIu64, x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
// pseudo-random number generator
template<class T, T x1, T x2, T x3, int y1, int y2, int y3>
struct PRNG {
    using S = typename make_signed<T>::type;
    T s;
    PRNG(T _s = 0) : s(_s) {}
    T next() {
        T z = (s += x1);
        z = (z ^ (z >> y1)) * x2;
        z = (z ^ (z >> y2)) * x3;
        return z ^ (z >> y3);
    }
    T next(T n) { return next() % n; }
    S next(S l, S r) { return l + next(r - l + 1); }
    T operator()() { return next(); }
    T operator()(T n) { return next(n); }
    S operator()(S l, S r) { return next(l, r); }
    static T gen(T s) { return PRNG(s)(); }
    template<class U>
    void shuffle(U first, U last) {
        size_t n = last - first;
        for (size_t i = 0; i < n; i++) swap(first[i], first[next(i + 1)]);
    }
};
PRNG<uint32_t, 0x9E3779B1, 0x85EBCA6B, 0xC2B2AE35, 16, 13, 16> r32;
PRNG<uint64_t, 0x9E3779B97F4A7C15, 0xBF58476D1CE4E5B9, 0x94D049BB133111EB, 30, 27, 31> r64;
// program
int _main();
/*int main() {
    //ios::sync_with_stdio(false), cin.tie(0);
    //time_t begin = clock();
    int ret = _main();
    //time_t end = clock();
    //fprintf(stderr, "Program took %.3f seconds to compute\n", ((double)end-begin)/CLOCKS_PER_SEC);
    return ret;
}*/

/************************************************************
                CODE STARTS BELOW THIS POINT
************************************************************/

const int INF = 1e9;
const int N = 2e5+10;
const int K = 1e6+10;

int n, k;
vector<pii> G[N];
int size[N], mx[N], par[N];
bool rem[N];

void calc_size(int u, int p=-1)
{
    par[u] = p;
    mx[u] = 0;
    size[u] = 1;
    fora(v, G[u]) if (v.F != p && !rem[v.F]) {
        calc_size(v.F, u);
        setmax(mx[u], size[v.F]);
        size[u] += size[v.F];
    }
}

int find_centroid(int s)
{
    calc_size(s);
    pii best(INF, s);
    queue<int> Q;
    Q.push(s);
    while (!Q.empty()) {
        int u = Q.front(); Q.pop();
        int sz = max(mx[u], size[s]-size[u]);
        setmin(best, pii(sz, u));
        fora(v, G[u]) if (v.F != par[u] && !rem[v.F])
            Q.push(v.F);
    }
    return best.S;
}

unordered_map<int, int> new_path;
void find_path(int u, int p, int l, int sum)
{
    if (sum > k) return;
    if (!new_path[sum])
        new_path[sum] = INF;
    setmin(new_path[sum], l);
    fora(v, G[u]) if (v.F != p && !rem[v.F])
        find_path(v.F, u, l+1, sum+v.S);
}

int ans = INF;
int list_path[K], timestamp[K];
void solve_tree(int u)
{
    fora(v, G[u]) if (!rem[v.F]) {
        find_path(v.F, u, 1, v.S);
        fora(p, new_path) {
            if (p.F == k)
                setmin(ans, p.S);
            if (timestamp[k-p.F] != u) {
                list_path[k-p.F] = INF;
                timestamp[k-p.F] = u;
            }
            setmin(ans, list_path[k-p.F]+p.S);
        }
        fora(p, new_path) {
            if (timestamp[p.F] != u) {
                list_path[p.F] = INF;
                timestamp[p.F] = u;
            }
            setmin(list_path[p.F], p.S);
        }
        new_path.clear();
    }
}

void recur(int u)
{
    u = find_centroid(u);
    solve_tree(u);
    rem[u] = true;
    fora(v, G[u]) if (!rem[v.F])
        recur(v.F);
}

int best_path(int _N, int _K, int H[][2], int L[])
{
    n = _N, k = _K;
    forx(i, 0, k) {
        list_path[i] = INF;
        timestamp[i] = -1;
    }
    forn(i, n-1) {
        int u = H[i][0], v = H[i][1], w = L[i];
        G[u].eb(v, w);
        G[v].eb(u, w);
    }
    recur(0);
    if (ans == INF)
        ans = -1;
    return ans;
}

int h[N][2], l[N];
int _main()
{
    int n, k;
    R(n, k);
    forn(i, n-1)
        R(h[i][0], h[i][1], l[i]);
    W(best_path(n, k, h, l));
    
    return 0;
}

Compilation message

race.cpp: In function 'll read_ll()':
race.cpp:46:42: warning: format '%ld' expects argument of type 'long int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
 ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
                                        ~~^
race.cpp: In function 'ull read_ull()':
race.cpp:47:45: warning: format '%lu' expects argument of type 'long unsigned int*', but argument 2 has type 'ull* {aka long long unsigned int*}' [-Wformat=]
 ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
                                           ~~^
race.cpp: In function 'void _W(const ll&)':
race.cpp:57:44: warning: format '%ld' expects argument of type 'long int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
 void _W(const ll &x) { printf("%" PRId64, x); }
                                           ~^
race.cpp: In function 'void _W(const ull&)':
race.cpp:58:45: warning: format '%lu' expects argument of type 'long unsigned int', but argument 2 has type 'ull {aka long long unsigned int}' [-Wformat=]
 void _W(const ull &x) { printf("%" PRIu64, x); }
                                            ~^
race.cpp: In function 'int read_int()':
race.cpp:45:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 int read_int() { int x; scanf("%d", &x); return x; }
                         ~~~~~^~~~~~~~~~
race.cpp: In function 'll read_ll()':
race.cpp:46:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
                      ~~~~~^~~~~~~~~~~~~~~~
race.cpp: In function 'ull read_ull()':
race.cpp:47:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
                         ~~~~~^~~~~~~~~~~~~~~~
race.cpp: In function 'int read_dbl()':
race.cpp:48:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 int read_dbl() { dbl x; scanf("%lf", &x); return x; }
                         ~~~~~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5220 KB Output is correct
3 Correct 7 ms 5220 KB Output is correct
4 Correct 6 ms 5220 KB Output is correct
5 Correct 6 ms 5220 KB Output is correct
6 Correct 7 ms 5260 KB Output is correct
7 Correct 7 ms 5260 KB Output is correct
8 Correct 7 ms 5260 KB Output is correct
9 Correct 6 ms 5356 KB Output is correct
10 Correct 7 ms 5356 KB Output is correct
11 Correct 7 ms 5384 KB Output is correct
12 Correct 6 ms 5384 KB Output is correct
13 Correct 6 ms 5384 KB Output is correct
14 Correct 7 ms 5484 KB Output is correct
15 Correct 7 ms 5484 KB Output is correct
16 Correct 7 ms 5484 KB Output is correct
17 Correct 6 ms 5484 KB Output is correct
18 Correct 6 ms 5484 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5220 KB Output is correct
3 Correct 7 ms 5220 KB Output is correct
4 Correct 6 ms 5220 KB Output is correct
5 Correct 6 ms 5220 KB Output is correct
6 Correct 7 ms 5260 KB Output is correct
7 Correct 7 ms 5260 KB Output is correct
8 Correct 7 ms 5260 KB Output is correct
9 Correct 6 ms 5356 KB Output is correct
10 Correct 7 ms 5356 KB Output is correct
11 Correct 7 ms 5384 KB Output is correct
12 Correct 6 ms 5384 KB Output is correct
13 Correct 6 ms 5384 KB Output is correct
14 Correct 7 ms 5484 KB Output is correct
15 Correct 7 ms 5484 KB Output is correct
16 Correct 7 ms 5484 KB Output is correct
17 Correct 6 ms 5484 KB Output is correct
18 Correct 6 ms 5484 KB Output is correct
19 Correct 6 ms 5484 KB Output is correct
20 Correct 6 ms 5484 KB Output is correct
21 Correct 7 ms 5484 KB Output is correct
22 Correct 13 ms 12540 KB Output is correct
23 Correct 13 ms 12540 KB Output is correct
24 Correct 11 ms 12540 KB Output is correct
25 Correct 12 ms 12540 KB Output is correct
26 Correct 8 ms 12540 KB Output is correct
27 Correct 11 ms 12540 KB Output is correct
28 Correct 8 ms 12540 KB Output is correct
29 Correct 9 ms 12540 KB Output is correct
30 Correct 10 ms 12540 KB Output is correct
31 Correct 11 ms 12540 KB Output is correct
32 Correct 12 ms 12540 KB Output is correct
33 Correct 14 ms 12540 KB Output is correct
34 Correct 12 ms 12540 KB Output is correct
35 Correct 13 ms 12540 KB Output is correct
36 Correct 12 ms 12672 KB Output is correct
37 Correct 11 ms 12672 KB Output is correct
38 Correct 12 ms 12672 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5220 KB Output is correct
3 Correct 7 ms 5220 KB Output is correct
4 Correct 6 ms 5220 KB Output is correct
5 Correct 6 ms 5220 KB Output is correct
6 Correct 7 ms 5260 KB Output is correct
7 Correct 7 ms 5260 KB Output is correct
8 Correct 7 ms 5260 KB Output is correct
9 Correct 6 ms 5356 KB Output is correct
10 Correct 7 ms 5356 KB Output is correct
11 Correct 7 ms 5384 KB Output is correct
12 Correct 6 ms 5384 KB Output is correct
13 Correct 6 ms 5384 KB Output is correct
14 Correct 7 ms 5484 KB Output is correct
15 Correct 7 ms 5484 KB Output is correct
16 Correct 7 ms 5484 KB Output is correct
17 Correct 6 ms 5484 KB Output is correct
18 Correct 6 ms 5484 KB Output is correct
19 Correct 224 ms 12672 KB Output is correct
20 Correct 229 ms 12672 KB Output is correct
21 Correct 220 ms 12672 KB Output is correct
22 Correct 219 ms 12672 KB Output is correct
23 Correct 169 ms 12672 KB Output is correct
24 Correct 120 ms 12672 KB Output is correct
25 Correct 294 ms 13520 KB Output is correct
26 Correct 144 ms 15612 KB Output is correct
27 Correct 353 ms 17788 KB Output is correct
28 Correct 651 ms 26036 KB Output is correct
29 Correct 529 ms 26036 KB Output is correct
30 Correct 367 ms 26036 KB Output is correct
31 Correct 374 ms 26036 KB Output is correct
32 Correct 431 ms 26036 KB Output is correct
33 Correct 654 ms 26036 KB Output is correct
34 Correct 452 ms 26036 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5220 KB Output is correct
3 Correct 7 ms 5220 KB Output is correct
4 Correct 6 ms 5220 KB Output is correct
5 Correct 6 ms 5220 KB Output is correct
6 Correct 7 ms 5260 KB Output is correct
7 Correct 7 ms 5260 KB Output is correct
8 Correct 7 ms 5260 KB Output is correct
9 Correct 6 ms 5356 KB Output is correct
10 Correct 7 ms 5356 KB Output is correct
11 Correct 7 ms 5384 KB Output is correct
12 Correct 6 ms 5384 KB Output is correct
13 Correct 6 ms 5384 KB Output is correct
14 Correct 7 ms 5484 KB Output is correct
15 Correct 7 ms 5484 KB Output is correct
16 Correct 7 ms 5484 KB Output is correct
17 Correct 6 ms 5484 KB Output is correct
18 Correct 6 ms 5484 KB Output is correct
19 Correct 6 ms 5484 KB Output is correct
20 Correct 6 ms 5484 KB Output is correct
21 Correct 7 ms 5484 KB Output is correct
22 Correct 13 ms 12540 KB Output is correct
23 Correct 13 ms 12540 KB Output is correct
24 Correct 11 ms 12540 KB Output is correct
25 Correct 12 ms 12540 KB Output is correct
26 Correct 8 ms 12540 KB Output is correct
27 Correct 11 ms 12540 KB Output is correct
28 Correct 8 ms 12540 KB Output is correct
29 Correct 9 ms 12540 KB Output is correct
30 Correct 10 ms 12540 KB Output is correct
31 Correct 11 ms 12540 KB Output is correct
32 Correct 12 ms 12540 KB Output is correct
33 Correct 14 ms 12540 KB Output is correct
34 Correct 12 ms 12540 KB Output is correct
35 Correct 13 ms 12540 KB Output is correct
36 Correct 12 ms 12672 KB Output is correct
37 Correct 11 ms 12672 KB Output is correct
38 Correct 12 ms 12672 KB Output is correct
39 Correct 224 ms 12672 KB Output is correct
40 Correct 229 ms 12672 KB Output is correct
41 Correct 220 ms 12672 KB Output is correct
42 Correct 219 ms 12672 KB Output is correct
43 Correct 169 ms 12672 KB Output is correct
44 Correct 120 ms 12672 KB Output is correct
45 Correct 294 ms 13520 KB Output is correct
46 Correct 144 ms 15612 KB Output is correct
47 Correct 353 ms 17788 KB Output is correct
48 Correct 651 ms 26036 KB Output is correct
49 Correct 529 ms 26036 KB Output is correct
50 Correct 367 ms 26036 KB Output is correct
51 Correct 374 ms 26036 KB Output is correct
52 Correct 431 ms 26036 KB Output is correct
53 Correct 654 ms 26036 KB Output is correct
54 Correct 452 ms 26036 KB Output is correct
55 Correct 33 ms 26036 KB Output is correct
56 Correct 22 ms 26036 KB Output is correct
57 Correct 156 ms 26036 KB Output is correct
58 Correct 88 ms 26036 KB Output is correct
59 Correct 2471 ms 26036 KB Output is correct
60 Execution timed out 3054 ms 37132 KB Time limit exceeded
61 Halted 0 ms 0 KB -