oj.uz

답안 #1047933

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1047933 2024-08-07T17:56:18 Z Nonoze Graph (BOI20_graph) C++17
58 / 100
 700 ms 24028 KB 
/*
*	Author: Nonoze
*	Created: Wednesday 07/08/2024
*/
#include <bits/stdc++.h>
using namespace std;

namespace std {

// https://judge.yosupo.jp/submission/193613
struct IOPre {
    static constexpr int TEN = 10, SZ = TEN * TEN * TEN * TEN;
    std::array<char, 4 * SZ> num;
    constexpr IOPre() : num{} {
        for (int i = 0; i < SZ; i++) for (int n = i, j = 3; j >= 0; j--) num[i * 4 + j] = n % TEN + '0', n /= TEN;
    }
};

struct IO {
#if !HAVE_DECL_FREAD_UNLOCKED
    #define fread_unlocked fread
#endif
#if !HAVE_DECL_FWRITE_UNLOCKED
    #define fwrite_unlocked fwrite
#endif
    static constexpr int SZ = 1 << 17, LEN = 32, TEN = 10, HUNDRED = TEN * TEN,
                         THOUSAND = HUNDRED * TEN, TENTHOUSAND = THOUSAND * TEN,
                         MAGIC_MULTIPLY = 205, MAGIC_SHIFT = 11, MASK = 15,
                         TWELVE = 12, SIXTEEN = 16;
    static constexpr IOPre io_pre = {};
    std::array<char, SZ> input_buffer, output_buffer;
    int input_ptr_left, input_ptr_right, output_ptr_right;

    IO() : input_buffer{}, output_buffer{}, input_ptr_left{}, input_ptr_right{}, output_ptr_right{} {}
    IO(const IO&) = delete;
    IO(IO&&) = delete;
    IO& operator=(const IO&) = delete;
    IO& operator=(IO&&) = delete;
    ~IO() { flush(); }

    template<typename T> static constexpr bool is_char_v    = std::is_same_v<T, char>;
    template<typename T> static constexpr bool is_bool_v    = std::is_same_v<T, bool>;
    template<typename T> static constexpr bool is_string_v  =
            std::is_same_v<T, std::string> || std::is_same_v<T, const char*> ||
            std::is_same_v<T, char*> || std::is_same_v< std::decay_t<T>, char*>;
    template<typename T> static constexpr bool is_default_v =
            is_char_v<T> || is_bool_v<T> || is_string_v<T> || std::is_integral_v<T>;

    inline void load() {
        memmove(std::begin(input_buffer),
                std::begin(input_buffer) + input_ptr_left,
                input_ptr_right - input_ptr_left);
        input_ptr_right =
            input_ptr_right - input_ptr_left +
            fread_unlocked(
                std::begin(input_buffer) + input_ptr_right - input_ptr_left, 1,
                SZ - input_ptr_right + input_ptr_left, stdin);
        input_ptr_left = 0;
    }

    inline void read_char(char& c) {
        if (input_ptr_left + LEN > input_ptr_right) load();
        c = input_buffer[input_ptr_left++];
    }
    inline void read_string(std::string& x) {
        char c;
        while (read_char(c), c < '!') continue;
        x = c;
        while (read_char(c), c >= '!') x += c;
    }
    template<typename T>
    inline std::enable_if_t<std::is_integral_v<T>, void> read_int(T& x) {
        if (input_ptr_left + LEN > input_ptr_right) load();
        char c = 0;
        do c = input_buffer[input_ptr_left++];
        while (c < '-');
        [[maybe_unused]] bool minus = false;
        if constexpr (std::is_signed<T>::value == true)
            if (c == '-') minus = true, c = input_buffer[input_ptr_left++];
        x = 0;
        while (c >= '0')
            x = x * TEN + (c & MASK), c = input_buffer[input_ptr_left++];
        if constexpr (std::is_signed<T>::value == true)
            if (minus) x = -x;
    }

    inline void skip_space() {
        if (input_ptr_left + LEN > input_ptr_right) load();
        while (input_buffer[input_ptr_left] <= ' ') input_ptr_left++;
    }

    inline void flush() {
        fwrite_unlocked(std::begin(output_buffer), 1, output_ptr_right, stdout);
        output_ptr_right = 0;
    }

    inline void write_char(char c) {
        if (output_ptr_right > SZ - LEN) flush();
        output_buffer[output_ptr_right++] = c;
    }

    inline void write_bool(bool b) {
        if (output_ptr_right > SZ - LEN) flush();
        output_buffer[output_ptr_right++] = b ? '1' : '0';
    }

    inline void write_string(const std::string& s) {
        for (auto x : s) write_char(x);
    }

    inline void write_string(const char* s) {
        while (*s) write_char(*s++);
    }

    inline void write_string(char* s) {
        while (*s) write_char(*s++);
    }

    template <typename T>
    inline std::enable_if_t< std::is_integral_v<T>, void> write_int(T x) {
        if (output_ptr_right > SZ - LEN) flush();
        if (!x) {
            output_buffer[output_ptr_right++] = '0';
            return;
        }
        if constexpr (std::is_signed_v<T>) if (x < 0) output_buffer[output_ptr_right++] = '-', x = -x;
        int i = TWELVE;
        std::array<char, SIXTEEN> buf{};
        for (; x >= TENTHOUSAND; x /= TENTHOUSAND, i -= 4)
            memcpy(std::begin(buf) + i, std::begin(io_pre.num) + (x % TENTHOUSAND) * 4, 4);
        if (x < HUNDRED) {
            if (x < TEN) output_buffer[output_ptr_right++] = '0' + x;
            else {
                uint32_t q = (uint32_t(x) * MAGIC_MULTIPLY) >> MAGIC_SHIFT;
                uint32_t r = uint32_t(x) - q * TEN;
                output_buffer[output_ptr_right++] = '0' + q;
                output_buffer[output_ptr_right++] = '0' + r;
            }
        } else {
            if (x < THOUSAND) 
                memcpy(std::begin(output_buffer) + output_ptr_right, std::begin(io_pre.num) + (x << 2) + 1, 3),
                output_ptr_right += 3;
            else
                memcpy(std::begin(output_buffer) + output_ptr_right, std::begin(io_pre.num) + (x << 2), 4),
                output_ptr_right += 4;
        }
        memcpy(std::begin(output_buffer) + output_ptr_right, std::begin(buf) + i + 4, TWELVE - i);
        output_ptr_right += TWELVE - i;
    }

    template <typename T_>
    std::enable_if_t<(is_default_v< std::remove_cv_t< std::remove_reference_t<T_> > >), IO&> operator<<(T_&& x) {
        using T = std::remove_cv_t< std::remove_reference_t<T_> >;
        if constexpr (is_bool_v<T>) write_bool(x);
        else if constexpr (is_string_v<T>) write_string(x);
        else if constexpr (is_char_v<T>) write_char(x);
        else if constexpr (std::is_integral_v<T>) write_int(x);
        return *this;
    }

    template<typename T>
    std::enable_if_t<(is_default_v<T> && !is_bool_v<T>), IO&> operator>>(T& x) {
        if constexpr (is_string_v<T>) read_string(x);
        else if constexpr (is_char_v<T>) read_char(x);
        else if constexpr (std::is_integral_v<T>) read_int(x);
        return *this;
    }

    IO* tie(std::nullptr_t) { return this; }
    void sync_with_stdio(bool) {}
} io;

} // namespace std

using std::io;

#define cin io

#ifndef _IN_LOCAL
	#define dbg(...)
#endif

#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)

#define int long long
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=25;



void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}




int n, k, m, q;
vector<pair<int, int>> adj[100000];
bool visited[100000];
double weights[100000];

vector<vector<int>> contains;
vector<int> roots;

void dfspre(int u) {
	visited[u]=1;
	contains.back().pb(u);
	for (auto [v, w] : adj[u]) if (!visited[v]) dfspre(v);
}

void precalc() {
	for (int i=0; i<n; i++) if (!visited[i]) {
		roots.pb(i);
		contains.pb({});
		dfspre(i);
	}
}


double dfs(int u) {
	visited[u]=1;
	double act=abs(weights[u]);
	for (auto [v, w]: adj[u]) {
		if (weights[v]!=-inf && weights[v]+weights[u]!=w) return inf;
		if (weights[v]!=-inf) continue;
		weights[v]=w-weights[u];
		double t=dfs(v);
		if (t==inf) return inf;
		act+=t;
	}
	return act;
}

void solve() {
	cin >> n >> m;
	for (int i=0; i<m; i++) {
		int u, v, w; cin >> u >> v >> w; u--, v--;
		adj[u].pb({v, w});
		adj[v].pb({u, w});
	}
	precalc();
	int empl=0;
	for (auto src: roots) {
		double tt=0, best=inf;
		for (double t=-60; t<=60; (t>=-25&&t<25?t+=0.5:t++)) {
			for (auto u: contains[empl]) weights[u]=-inf;
			weights[src]=t;
			double act=dfs(src);
			if (act<best) best=act, tt=t;
		}
		if (best==inf) quit("NO");
		for (auto u: contains[empl]) weights[u]=-inf;
		weights[src]=tt;
		dfs(src);
		empl++;
	}
	cout << "YES" << fixed << setprecision(8) << endl;
	for (int i=0; i<n; i++) cout << weights[i] << ' ';
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3676 KB answer = YES
2 Correct 1 ms 3676 KB answer = YES
3 Correct 1 ms 3676 KB answer = YES
4 Correct 1 ms 3676 KB answer = NO
5 Correct 1 ms 3784 KB answer = YES
6 Correct 1 ms 3676 KB answer = YES
7 Correct 1 ms 3676 KB answer = YES
8 Correct 1 ms 3676 KB answer = YES
9 Correct 1 ms 3672 KB answer = NO
10 Correct 1 ms 3676 KB answer = YES
11 Correct 1 ms 3676 KB answer = YES
12 Correct 1 ms 3676 KB answer = NO
13 Correct 1 ms 3676 KB answer = YES
14 Correct 1 ms 3676 KB answer = YES
15 Correct 1 ms 3672 KB answer = YES
16 Correct 1 ms 3676 KB answer = YES
17 Correct 1 ms 3676 KB answer = YES
18 Correct 1 ms 3676 KB answer = YES
19 Correct 1 ms 3676 KB answer = YES
20 Correct 1 ms 3676 KB answer = YES
21 Correct 1 ms 3676 KB answer = YES
22 Correct 1 ms 3932 KB answer = NO
23 Correct 1 ms 3676 KB answer = NO

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3676 KB answer = YES
2 Correct 1 ms 3676 KB answer = YES
3 Correct 1 ms 3676 KB answer = YES
4 Correct 1 ms 3676 KB answer = NO
5 Correct 1 ms 3784 KB answer = YES
6 Correct 1 ms 3676 KB answer = YES
7 Correct 1 ms 3676 KB answer = YES
8 Correct 1 ms 3676 KB answer = YES
9 Correct 1 ms 3672 KB answer = NO
10 Correct 1 ms 3676 KB answer = YES
11 Correct 1 ms 3676 KB answer = YES
12 Correct 1 ms 3676 KB answer = NO
13 Correct 1 ms 3676 KB answer = YES
14 Correct 1 ms 3676 KB answer = YES
15 Correct 1 ms 3672 KB answer = YES
16 Correct 1 ms 3676 KB answer = YES
17 Correct 1 ms 3676 KB answer = YES
18 Correct 1 ms 3676 KB answer = YES
19 Correct 1 ms 3676 KB answer = YES
20 Correct 1 ms 3676 KB answer = YES
21 Correct 1 ms 3676 KB answer = YES
22 Correct 1 ms 3932 KB answer = NO
23 Correct 1 ms 3676 KB answer = NO
24 Correct 1 ms 3672 KB answer = YES
25 Correct 1 ms 3672 KB answer = YES
26 Correct 1 ms 3676 KB answer = YES
27 Correct 1 ms 3676 KB answer = YES
28 Correct 1 ms 3676 KB answer = YES
29 Correct 1 ms 3676 KB answer = YES
30 Correct 1 ms 3676 KB answer = NO
31 Correct 1 ms 3788 KB answer = YES
32 Correct 1 ms 3676 KB answer = YES
33 Correct 1 ms 3676 KB answer = YES
34 Correct 1 ms 3676 KB answer = YES
35 Correct 1 ms 3672 KB answer = YES
36 Correct 1 ms 3776 KB answer = YES

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3676 KB answer = YES
2 Correct 1 ms 3676 KB answer = YES
3 Correct 1 ms 3676 KB answer = YES
4 Correct 1 ms 3676 KB answer = NO
5 Correct 1 ms 3784 KB answer = YES
6 Correct 1 ms 3676 KB answer = YES
7 Correct 1 ms 3676 KB answer = YES
8 Correct 1 ms 3676 KB answer = YES
9 Correct 1 ms 3672 KB answer = NO
10 Correct 1 ms 3676 KB answer = YES
11 Correct 1 ms 3676 KB answer = YES
12 Correct 1 ms 3676 KB answer = NO
13 Correct 1 ms 3676 KB answer = YES
14 Correct 1 ms 3676 KB answer = YES
15 Correct 1 ms 3672 KB answer = YES
16 Correct 1 ms 3676 KB answer = YES
17 Correct 1 ms 3676 KB answer = YES
18 Correct 1 ms 3676 KB answer = YES
19 Correct 1 ms 3676 KB answer = YES
20 Correct 1 ms 3676 KB answer = YES
21 Correct 1 ms 3676 KB answer = YES
22 Correct 1 ms 3932 KB answer = NO
23 Correct 1 ms 3676 KB answer = NO
24 Correct 1 ms 3672 KB answer = YES
25 Correct 1 ms 3672 KB answer = YES
26 Correct 1 ms 3676 KB answer = YES
27 Correct 1 ms 3676 KB answer = YES
28 Correct 1 ms 3676 KB answer = YES
29 Correct 1 ms 3676 KB answer = YES
30 Correct 1 ms 3676 KB answer = NO
31 Correct 1 ms 3788 KB answer = YES
32 Correct 1 ms 3676 KB answer = YES
33 Correct 1 ms 3676 KB answer = YES
34 Correct 1 ms 3676 KB answer = YES
35 Correct 1 ms 3672 KB answer = YES
36 Correct 1 ms 3776 KB answer = YES
37 Correct 1 ms 3672 KB answer = YES
38 Correct 1 ms 3676 KB answer = YES
39 Correct 1 ms 3676 KB answer = YES
40 Correct 2 ms 3676 KB answer = YES
41 Correct 2 ms 3676 KB answer = NO
42 Correct 2 ms 3676 KB answer = YES
43 Correct 3 ms 3676 KB answer = YES
44 Correct 3 ms 3676 KB answer = YES
45 Correct 2 ms 3676 KB answer = YES
46 Correct 1 ms 3788 KB answer = YES
47 Correct 2 ms 3788 KB answer = YES
48 Correct 1 ms 3784 KB answer = YES

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3676 KB answer = YES
2 Correct 1 ms 3676 KB answer = YES
3 Correct 1 ms 3676 KB answer = YES
4 Correct 1 ms 3676 KB answer = NO
5 Correct 1 ms 3784 KB answer = YES
6 Correct 1 ms 3676 KB answer = YES
7 Correct 1 ms 3676 KB answer = YES
8 Correct 1 ms 3676 KB answer = YES
9 Correct 1 ms 3672 KB answer = NO
10 Correct 1 ms 3676 KB answer = YES
11 Correct 1 ms 3676 KB answer = YES
12 Correct 1 ms 3676 KB answer = NO
13 Correct 1 ms 3676 KB answer = YES
14 Correct 1 ms 3676 KB answer = YES
15 Correct 1 ms 3672 KB answer = YES
16 Correct 1 ms 3676 KB answer = YES
17 Correct 1 ms 3676 KB answer = YES
18 Correct 1 ms 3676 KB answer = YES
19 Correct 1 ms 3676 KB answer = YES
20 Correct 1 ms 3676 KB answer = YES
21 Correct 1 ms 3676 KB answer = YES
22 Correct 1 ms 3932 KB answer = NO
23 Correct 1 ms 3676 KB answer = NO
24 Correct 1 ms 3672 KB answer = YES
25 Correct 1 ms 3672 KB answer = YES
26 Correct 1 ms 3676 KB answer = YES
27 Correct 1 ms 3676 KB answer = YES
28 Correct 1 ms 3676 KB answer = YES
29 Correct 1 ms 3676 KB answer = YES
30 Correct 1 ms 3676 KB answer = NO
31 Correct 1 ms 3788 KB answer = YES
32 Correct 1 ms 3676 KB answer = YES
33 Correct 1 ms 3676 KB answer = YES
34 Correct 1 ms 3676 KB answer = YES
35 Correct 1 ms 3672 KB answer = YES
36 Correct 1 ms 3776 KB answer = YES
37 Correct 1 ms 3672 KB answer = YES
38 Correct 1 ms 3676 KB answer = YES
39 Correct 1 ms 3676 KB answer = YES
40 Correct 2 ms 3676 KB answer = YES
41 Correct 2 ms 3676 KB answer = NO
42 Correct 2 ms 3676 KB answer = YES
43 Correct 3 ms 3676 KB answer = YES
44 Correct 3 ms 3676 KB answer = YES
45 Correct 2 ms 3676 KB answer = YES
46 Correct 1 ms 3788 KB answer = YES
47 Correct 2 ms 3788 KB answer = YES
48 Correct 1 ms 3784 KB answer = YES
49 Correct 33 ms 4688 KB answer = YES
50 Correct 27 ms 4956 KB answer = YES
51 Correct 28 ms 4956 KB answer = YES
52 Correct 5 ms 4700 KB answer = NO
53 Correct 2 ms 3676 KB answer = YES
54 Correct 5 ms 3932 KB answer = YES
55 Correct 14 ms 4240 KB answer = YES
56 Correct 33 ms 4700 KB answer = YES
57 Correct 19 ms 4592 KB answer = YES
58 Correct 16 ms 4444 KB answer = YES
59 Correct 14 ms 4440 KB answer = YES
60 Correct 27 ms 4616 KB answer = YES
61 Correct 9 ms 4188 KB answer = YES
62 Correct 15 ms 14192 KB answer = NO
63 Correct 21 ms 14416 KB answer = YES
64 Correct 18 ms 14404 KB answer = NO
65 Correct 21 ms 14420 KB answer = YES
66 Correct 4 ms 3928 KB answer = YES

Subtask #5
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3676 KB answer = YES
2 Correct 1 ms 3676 KB answer = YES
3 Correct 1 ms 3676 KB answer = YES
4 Correct 1 ms 3676 KB answer = NO
5 Correct 1 ms 3784 KB answer = YES
6 Correct 1 ms 3676 KB answer = YES
7 Correct 1 ms 3676 KB answer = YES
8 Correct 1 ms 3676 KB answer = YES
9 Correct 1 ms 3672 KB answer = NO
10 Correct 1 ms 3676 KB answer = YES
11 Correct 1 ms 3676 KB answer = YES
12 Correct 1 ms 3676 KB answer = NO
13 Correct 1 ms 3676 KB answer = YES
14 Correct 1 ms 3676 KB answer = YES
15 Correct 1 ms 3672 KB answer = YES
16 Correct 1 ms 3676 KB answer = YES
17 Correct 1 ms 3676 KB answer = YES
18 Correct 1 ms 3676 KB answer = YES
19 Correct 1 ms 3676 KB answer = YES
20 Correct 1 ms 3676 KB answer = YES
21 Correct 1 ms 3676 KB answer = YES
22 Correct 1 ms 3932 KB answer = NO
23 Correct 1 ms 3676 KB answer = NO
24 Correct 1 ms 3672 KB answer = YES
25 Correct 1 ms 3672 KB answer = YES
26 Correct 1 ms 3676 KB answer = YES
27 Correct 1 ms 3676 KB answer = YES
28 Correct 1 ms 3676 KB answer = YES
29 Correct 1 ms 3676 KB answer = YES
30 Correct 1 ms 3676 KB answer = NO
31 Correct 1 ms 3788 KB answer = YES
32 Correct 1 ms 3676 KB answer = YES
33 Correct 1 ms 3676 KB answer = YES
34 Correct 1 ms 3676 KB answer = YES
35 Correct 1 ms 3672 KB answer = YES
36 Correct 1 ms 3776 KB answer = YES
37 Correct 1 ms 3672 KB answer = YES
38 Correct 1 ms 3676 KB answer = YES
39 Correct 1 ms 3676 KB answer = YES
40 Correct 2 ms 3676 KB answer = YES
41 Correct 2 ms 3676 KB answer = NO
42 Correct 2 ms 3676 KB answer = YES
43 Correct 3 ms 3676 KB answer = YES
44 Correct 3 ms 3676 KB answer = YES
45 Correct 2 ms 3676 KB answer = YES
46 Correct 1 ms 3788 KB answer = YES
47 Correct 2 ms 3788 KB answer = YES
48 Correct 1 ms 3784 KB answer = YES
49 Correct 33 ms 4688 KB answer = YES
50 Correct 27 ms 4956 KB answer = YES
51 Correct 28 ms 4956 KB answer = YES
52 Correct 5 ms 4700 KB answer = NO
53 Correct 2 ms 3676 KB answer = YES
54 Correct 5 ms 3932 KB answer = YES
55 Correct 14 ms 4240 KB answer = YES
56 Correct 33 ms 4700 KB answer = YES
57 Correct 19 ms 4592 KB answer = YES
58 Correct 16 ms 4444 KB answer = YES
59 Correct 14 ms 4440 KB answer = YES
60 Correct 27 ms 4616 KB answer = YES
61 Correct 9 ms 4188 KB answer = YES
62 Correct 15 ms 14192 KB answer = NO
63 Correct 21 ms 14416 KB answer = YES
64 Correct 18 ms 14404 KB answer = NO
65 Correct 21 ms 14420 KB answer = YES
66 Correct 4 ms 3928 KB answer = YES
67 Correct 161 ms 17660 KB answer = YES
68 Correct 146 ms 17604 KB answer = YES
69 Correct 152 ms 17636 KB answer = YES
70 Correct 195 ms 24028 KB answer = YES
71 Correct 154 ms 17604 KB answer = YES
72 Correct 444 ms 11720 KB answer = YES
73 Correct 229 ms 11724 KB answer = YES
74 Correct 128 ms 11976 KB answer = YES
75 Correct 95 ms 10452 KB answer = NO
76 Correct 44 ms 4948 KB answer = YES
77 Correct 110 ms 6092 KB answer = YES
78 Correct 192 ms 7380 KB answer = YES
79 Correct 375 ms 10408 KB answer = YES
80 Correct 241 ms 11976 KB answer = YES
81 Correct 159 ms 12740 KB answer = NO
82 Correct 224 ms 17092 KB answer = YES
83 Execution timed out 750 ms 18372 KB Time limit exceeded
84 Halted 0 ms 0 KB -