oj.uz

Submission #544944

# Submission time Handle Problem Language Result Execution time Memory
544944 2022-04-03T07:53:47 Z SmolBrain Dreaming (IOI13_dreaming) C++17
22 / 100
 163 ms 3276 KB 
// Om Namah Shivaya
// GM in 121 days

#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;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 3005;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

#include "dreaming.h"

vector<pii> adj[maxn];
vector<int> mxsum(maxn);
vector<bool> vis(maxn);
int mn = inf1, best = -1;
int mxval = -1, mxnode = -1;

void dfs1(int node, int par, int sum, int root) {
    amax(mxsum[root], sum);

    for (auto [child, w] : adj[node]) {
        if (child == par) conts;
        dfs1(child, node, sum + w, root);
    }
}

void dfs2(int node, int par) {
    if (mxsum[node] < mn) {
        mn = mxsum[node];
        best = node;
    }

    vis[node] = 1;

    for (auto [child, w] : adj[node]) {
        if (child == par) conts;
        dfs2(child, node);
    }
}

void dfs3(int node, int par, int sum) {
    if (sum > mxval) {
        mxval = sum;
        mxnode = node;
    }

    for (auto [child, w] : adj[node]) {
        if (child == par) conts;
        dfs3(child, node, sum + w);
    }
}

int travelTime(int n, int m, int l, int a[], int b[], int t[]) {
    // https://www.quora.com/What-is-the-solution-for-Dreaming-on-IOI-2013
    rep(i, m) {
        int u = a[i], v = b[i], w = t[i];
        adj[u].pb({v, w});
        adj[v].pb({u, w});
    }

    rep(i, n) {
        dfs1(i, -1, 0, i);
    }

    vector<pii> vals;

    rep(i, n) {
        if (vis[i]) conts;
        mn = inf1, best = -1;
        dfs2(i, -1);
        vals.pb({mn, best});
    }

    sort(rall(vals));
    int siz = sz(vals);

    rep1(i, siz - 1) {
        int u = vals[0].ss, v = vals[i].ss;
        adj[u].pb({v, l}), adj[v].pb({u, l});
    }

    dfs3(0, -1, 0);
    dfs3(mxnode, -1, 0);

    return mxval;
}

Compilation message

dreaming.cpp: In function 'void usaco(std::string)':
dreaming.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dreaming.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 3276 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 388 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 388 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 388 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 392 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 388 KB Output is correct
25 Correct 1 ms 392 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 3276 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 9 ms 1684 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 388 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 388 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 388 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 392 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 388 KB Output is correct
25 Correct 1 ms 392 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 400 KB Output is correct
34 Correct 4 ms 468 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 388 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 0 ms 388 KB Output is correct
54 Correct 163 ms 724 KB Output is correct
55 Correct 156 ms 724 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 71 ms 468 KB Output is correct
59 Correct 94 ms 572 KB Output is correct
60 Correct 2 ms 468 KB Output is correct
61 Correct 1 ms 468 KB Output is correct
62 Correct 57 ms 468 KB Output is correct
63 Correct 60 ms 568 KB Output is correct
64 Correct 1 ms 468 KB Output is correct
65 Correct 1 ms 468 KB Output is correct
66 Correct 113 ms 468 KB Output is correct
67 Correct 63 ms 564 KB Output is correct
68 Correct 2 ms 468 KB Output is correct
69 Correct 2 ms 468 KB Output is correct
70 Correct 1 ms 468 KB Output is correct
71 Correct 1 ms 468 KB Output is correct
72 Correct 90 ms 468 KB Output is correct
73 Correct 90 ms 468 KB Output is correct
74 Correct 3 ms 468 KB Output is correct
75 Correct 4 ms 468 KB Output is correct
76 Correct 73 ms 468 KB Output is correct
77 Correct 92 ms 576 KB Output is correct
78 Correct 1 ms 468 KB Output is correct
79 Correct 1 ms 532 KB Output is correct
80 Correct 1 ms 468 KB Output is correct
81 Correct 1 ms 516 KB Output is correct
82 Correct 3 ms 468 KB Output is correct
83 Correct 2 ms 568 KB Output is correct
84 Correct 8 ms 468 KB Output is correct
85 Correct 1 ms 468 KB Output is correct
86 Correct 30 ms 520 KB Output is correct
87 Correct 84 ms 556 KB Output is correct
88 Correct 2 ms 468 KB Output is correct
89 Correct 2 ms 532 KB Output is correct
90 Correct 1 ms 468 KB Output is correct
91 Correct 1 ms 468 KB Output is correct
92 Correct 24 ms 468 KB Output is correct
93 Correct 28 ms 468 KB Output is correct
94 Correct 31 ms 468 KB Output is correct
95 Correct 50 ms 532 KB Output is correct
96 Correct 38 ms 468 KB Output is correct
97 Correct 36 ms 536 KB Output is correct
98 Correct 48 ms 540 KB Output is correct
99 Correct 81 ms 556 KB Output is correct
100 Correct 56 ms 548 KB Output is correct
101 Correct 55 ms 552 KB Output is correct
102 Correct 1 ms 340 KB Output is correct
103 Correct 1 ms 340 KB Output is correct
104 Correct 1 ms 396 KB Output is correct
105 Correct 1 ms 340 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 1 ms 340 KB Output is correct
108 Correct 1 ms 340 KB Output is correct
109 Correct 1 ms 340 KB Output is correct
110 Correct 1 ms 340 KB Output is correct
111 Correct 1 ms 340 KB Output is correct
112 Correct 2 ms 340 KB Output is correct
113 Correct 6 ms 396 KB Output is correct
114 Correct 8 ms 400 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 3276 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -