oj.uz

Submission #857789

# Submission time Handle Problem Language Result Execution time Memory
857789 2023-10-07T01:21:54 Z caohung06 Putovanje (COCI20_putovanje) C++17
110 / 110
 60 ms 30788 KB 
//  07-10-2023
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <stack>
#include <set>
#include <time.h>
#include <assert.h>
#include <iomanip>
#include <cstring>
#include <queue>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define BIT(x, i) (1 & ((x) >> (i)))
#define OFF(x, i) ((x) ^ (1 << (i)))
#define ON(x, i) ((x) | (1 << (i)))
#define CNT(x) __builtin_popcountll(x)
#define file(name)                         \
    if (fopen(name ".inp", "r"))           \
    {                                      \
        freopen(name ".inp", "r", stdin);  \
        freopen(name ".out", "w", stdout); \
    }
#define faster                    \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
using namespace std;
const ll N = 200000;
ll n;
ll u[N], v[N], w[N], z[N];
ll vis[N], par[N], rnk[N], p[N], dp[N];
vector<ll> g[N];
ll fnd(ll x) { return x == par[x] ? x : par[x] = fnd(par[x]); }
ll dfs(ll c)
{
    ll ret = 0;
    vis[c] = 1, p[c] = par[c] = c, dp[c] = 1 + (c && c < n - 1);
    for (ll i = c - 1; i <= c + 1; i += 2)
        if (i >= 0 && i < n && vis[i])
            dp[p[fnd(i)]] -= 2;
    for (ll i : g[c])
        if (!vis[c ^ u[i] ^ v[i]])
        {
            if (u[i] != c)
                swap(u[i], v[i]);
            ret += dfs(v[i]), dp[c] += dp[v[i]];
            ret += min(w[i] * dp[v[i]], z[i]);
            ll x = fnd(c), y = fnd(v[i]);
            if (rnk[x] < rnk[y])
                swap(x, y);
            rnk[x] += rnk[x] == rnk[y], par[y] = x, p[x] = c;
        }
    return ret;
}

main()
{
    faster;
    file("tmp");
    cin >> n;
    for (ll i = 0; i < n - 1; i++)
    {
        cin >> u[i] >> v[i] >> w[i] >> z[i];
        g[--u[i]].push_back(i);
        g[--v[i]].push_back(i);
    }
    cout << dfs(0);
    return 0;
}

Compilation message

putovanje.cpp:63:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   63 | main()
      | ^~~~
putovanje.cpp: In function 'int main()':
putovanje.cpp:27:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |         freopen(name ".inp", "r", stdin);  \
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
putovanje.cpp:66:5: note: in expansion of macro 'file'
   66 |     file("tmp");
      |     ^~~~
putovanje.cpp:28:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         freopen(name ".out", "w", stdout); \
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
putovanje.cpp:66:5: note: in expansion of macro 'file'
   66 |     file("tmp");
      |     ^~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 3 ms 17052 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 3 ms 16988 KB Output is correct
5 Correct 3 ms 16984 KB Output is correct
6 Correct 3 ms 17056 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 4 ms 16984 KB Output is correct
9 Correct 3 ms 16984 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 26192 KB Output is correct
2 Correct 39 ms 29020 KB Output is correct
3 Correct 46 ms 30788 KB Output is correct
4 Correct 46 ms 29776 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 38 ms 27640 KB Output is correct
7 Correct 34 ms 25664 KB Output is correct
8 Correct 50 ms 27880 KB Output is correct
9 Correct 37 ms 27696 KB Output is correct
10 Correct 32 ms 27732 KB Output is correct
11 Correct 35 ms 28252 KB Output is correct
12 Correct 37 ms 28592 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 3 ms 17052 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 3 ms 16988 KB Output is correct
5 Correct 3 ms 16984 KB Output is correct
6 Correct 3 ms 17056 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 4 ms 16984 KB Output is correct
9 Correct 3 ms 16984 KB Output is correct
10 Correct 39 ms 26192 KB Output is correct
11 Correct 39 ms 29020 KB Output is correct
12 Correct 46 ms 30788 KB Output is correct
13 Correct 46 ms 29776 KB Output is correct
14 Correct 3 ms 16988 KB Output is correct
15 Correct 38 ms 27640 KB Output is correct
16 Correct 34 ms 25664 KB Output is correct
17 Correct 50 ms 27880 KB Output is correct
18 Correct 37 ms 27696 KB Output is correct
19 Correct 32 ms 27732 KB Output is correct
20 Correct 35 ms 28252 KB Output is correct
21 Correct 37 ms 28592 KB Output is correct
22 Correct 60 ms 24664 KB Output is correct
23 Correct 46 ms 23884 KB Output is correct
24 Correct 44 ms 24340 KB Output is correct
25 Correct 3 ms 17060 KB Output is correct
26 Correct 18 ms 21340 KB Output is correct
27 Correct 38 ms 23888 KB Output is correct
28 Correct 31 ms 26704 KB Output is correct
29 Correct 37 ms 28504 KB Output is correct
30 Correct 35 ms 28312 KB Output is correct
31 Correct 4 ms 17500 KB Output is correct