oj.uz

답안 #550876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
550876 2022-04-19T11:00:18 Z Zhora_004 Graph (BOI20_graph) C++17
58 / 100
 700 ms 19016 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#include <ctime>
#include <cstring>
#include <numeric>
#include <functional>
#include <chrono>
#include <cassert>
#include <bitset>
#include <fstream>
//#include <bit>
//#include <ranges>
//#include <numbers>
#define itn int
#define sacnf scanf
#define sz(a) ((int)((a).size()))
// printf("%.10f\n", ans);
/*ofstream fout("timeline.out");
ifstream fin("timeline.in");*/
using ll = long long;
using namespace std;
const ll mod = 1e9 + 7;
const int limit = 170;
const int N = 2e5 + 1, inf = 1e9;

struct Edge {
    int v, w;
};

int n, m;
vector<bool> vis;
vector<int> comp, ans;
vector<vector<Edge>> gp;

void dfs1(int u)
{
    vis[u] = 1;
    comp.push_back(u);
    for (Edge& e : gp[u]) if (!vis[e.v]) dfs1(e.v);
}

void dfs2(int u, int val)
{
    vis[u] = 1;
    ans[u] = val;
    for (Edge& e : gp[u]) if (!vis[e.v]) dfs2(e.v, e.w - val);
}

int ok()
{
    int sum = 0;
    for (int& u : comp)
    {
        for (Edge& e : gp[u])
        {
            int v = e.v, w = e.w;
            if (!(-limit <= ans[u] && ans[u] <= limit && -limit <= ans[v] && ans[v] <= limit && ans[u] + ans[v] == w)) return inf;
        }
        sum += abs(ans[u]);
    }
    return sum;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m;
    vis = vector<bool>(n);
    ans = vector<int>(n);
    gp = vector<vector<Edge>>(n);
    for (int i = 0; i < m; i++)
    {
        int u, v, w;
        cin >> u >> v >> w;
        gp[--u].push_back({ --v, w * 2 });
        gp[v].push_back({ u, w * 2 });
    }
    for (int i = 0; i < n; i++)
    {
        if (!vis[i])
        {
            comp.clear();
            dfs1(i);
            int mn = inf, num = inf;
            for (int val = -limit; val <= limit; val++)
            {
                for (int& u : comp) vis[u] = 0;
                queue<int> q;
                q.push(i);
                vis[i] = 1;
                ans[i] = val;
                int sum = abs(val);
                while (!q.empty())
                {
                    int u = q.front();
                    q.pop();
                    for (Edge& e : gp[u])
                    {
                        int v = e.v, w = e.w;
                        if (!vis[v])
                        {
                            vis[v] = 1;
                            ans[v] = w - ans[u];
                            q.push(v);
                            if (ans[v] < -limit || ans[v] > limit)
                            {
                                sum = inf;
                                break;
                            }
                            sum += abs(ans[v]);
                        }
                        else if (ans[u] + ans[v] != w)
                        {
                            sum = inf;
                            break;
                        }
                    }
                    if (sum == inf) break;
                }
                if (sum < mn) mn = sum, num = val;
            }
            if (num == inf) return cout << "NO", 0;
            for (int& u : comp) vis[u] = 0;
            queue<int> q;
            q.push(i);
            vis[i] = 1;
            ans[i] = num;
            while (!q.empty())
            {
                int u = q.front();
                q.pop();
                for (Edge& e : gp[u])
                {
                    int v = e.v, w = e.w;
                    if (!vis[v])
                    {
                        vis[v] = 1;
                        ans[v] = w - ans[u];
                        q.push(v);
                    }
                }
            }
        }
    }
    cout << "YES\n";
    for (int& i : ans)
    {
        if (i == -1) cout << "-0.5";
        else
        {
            cout << i / 2;
            if (abs(i) & 1) cout << ".5";
        }
        cout << " ";
    }

    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
17.0 / 17.0

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

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB answer = YES
2 Correct 1 ms 316 KB answer = YES
3 Correct 1 ms 316 KB answer = YES
4 Correct 1 ms 212 KB answer = NO
5 Correct 1 ms 212 KB answer = YES
6 Correct 1 ms 212 KB answer = YES
7 Correct 1 ms 212 KB answer = YES
8 Correct 1 ms 212 KB answer = YES
9 Correct 1 ms 212 KB answer = NO
10 Correct 1 ms 212 KB answer = YES
11 Correct 1 ms 212 KB answer = YES
12 Correct 1 ms 212 KB answer = NO
13 Correct 1 ms 320 KB answer = YES
14 Correct 1 ms 212 KB answer = YES
15 Correct 1 ms 316 KB answer = YES
16 Correct 1 ms 212 KB answer = YES
17 Correct 1 ms 212 KB answer = YES
18 Correct 1 ms 212 KB answer = YES
19 Correct 1 ms 212 KB answer = YES
20 Correct 1 ms 212 KB answer = YES
21 Correct 1 ms 212 KB answer = YES
22 Correct 1 ms 212 KB answer = NO
23 Correct 1 ms 212 KB answer = NO
24 Correct 1 ms 320 KB answer = YES
25 Correct 1 ms 316 KB answer = YES
26 Correct 1 ms 212 KB answer = YES
27 Correct 1 ms 212 KB answer = YES
28 Correct 1 ms 212 KB answer = YES
29 Correct 1 ms 212 KB answer = YES
30 Correct 1 ms 212 KB answer = NO
31 Correct 1 ms 212 KB answer = YES
32 Correct 1 ms 212 KB answer = YES
33 Correct 2 ms 212 KB answer = YES
34 Correct 1 ms 316 KB answer = YES
35 Correct 1 ms 212 KB answer = YES
36 Correct 1 ms 212 KB answer = YES
37 Correct 2 ms 340 KB answer = YES
38 Correct 1 ms 212 KB answer = YES
39 Correct 4 ms 340 KB answer = YES
40 Correct 3 ms 340 KB answer = YES
41 Correct 3 ms 340 KB answer = NO
42 Correct 6 ms 340 KB answer = YES
43 Correct 8 ms 328 KB answer = YES
44 Correct 7 ms 324 KB answer = YES
45 Correct 7 ms 328 KB answer = YES
46 Correct 4 ms 320 KB answer = YES
47 Correct 3 ms 340 KB answer = YES
48 Correct 7 ms 328 KB answer = YES
49 Correct 96 ms 1188 KB answer = YES
50 Correct 25 ms 1508 KB answer = YES
51 Correct 72 ms 1484 KB answer = YES
52 Correct 21 ms 1492 KB answer = NO
53 Correct 8 ms 340 KB answer = YES
54 Correct 18 ms 456 KB answer = YES
55 Correct 40 ms 724 KB answer = YES
56 Correct 97 ms 1184 KB answer = YES
57 Correct 92 ms 1088 KB answer = YES
58 Correct 70 ms 980 KB answer = YES
59 Correct 41 ms 1032 KB answer = YES
60 Correct 91 ms 1144 KB answer = YES
61 Correct 31 ms 768 KB answer = YES
62 Correct 65 ms 7984 KB answer = NO
63 Correct 59 ms 7992 KB answer = YES
64 Correct 68 ms 7884 KB answer = NO
65 Correct 76 ms 7956 KB answer = YES
66 Correct 14 ms 472 KB answer = YES

Subtask #5
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB answer = YES
2 Correct 1 ms 316 KB answer = YES
3 Correct 1 ms 316 KB answer = YES
4 Correct 1 ms 212 KB answer = NO
5 Correct 1 ms 212 KB answer = YES
6 Correct 1 ms 212 KB answer = YES
7 Correct 1 ms 212 KB answer = YES
8 Correct 1 ms 212 KB answer = YES
9 Correct 1 ms 212 KB answer = NO
10 Correct 1 ms 212 KB answer = YES
11 Correct 1 ms 212 KB answer = YES
12 Correct 1 ms 212 KB answer = NO
13 Correct 1 ms 320 KB answer = YES
14 Correct 1 ms 212 KB answer = YES
15 Correct 1 ms 316 KB answer = YES
16 Correct 1 ms 212 KB answer = YES
17 Correct 1 ms 212 KB answer = YES
18 Correct 1 ms 212 KB answer = YES
19 Correct 1 ms 212 KB answer = YES
20 Correct 1 ms 212 KB answer = YES
21 Correct 1 ms 212 KB answer = YES
22 Correct 1 ms 212 KB answer = NO
23 Correct 1 ms 212 KB answer = NO
24 Correct 1 ms 320 KB answer = YES
25 Correct 1 ms 316 KB answer = YES
26 Correct 1 ms 212 KB answer = YES
27 Correct 1 ms 212 KB answer = YES
28 Correct 1 ms 212 KB answer = YES
29 Correct 1 ms 212 KB answer = YES
30 Correct 1 ms 212 KB answer = NO
31 Correct 1 ms 212 KB answer = YES
32 Correct 1 ms 212 KB answer = YES
33 Correct 2 ms 212 KB answer = YES
34 Correct 1 ms 316 KB answer = YES
35 Correct 1 ms 212 KB answer = YES
36 Correct 1 ms 212 KB answer = YES
37 Correct 2 ms 340 KB answer = YES
38 Correct 1 ms 212 KB answer = YES
39 Correct 4 ms 340 KB answer = YES
40 Correct 3 ms 340 KB answer = YES
41 Correct 3 ms 340 KB answer = NO
42 Correct 6 ms 340 KB answer = YES
43 Correct 8 ms 328 KB answer = YES
44 Correct 7 ms 324 KB answer = YES
45 Correct 7 ms 328 KB answer = YES
46 Correct 4 ms 320 KB answer = YES
47 Correct 3 ms 340 KB answer = YES
48 Correct 7 ms 328 KB answer = YES
49 Correct 96 ms 1188 KB answer = YES
50 Correct 25 ms 1508 KB answer = YES
51 Correct 72 ms 1484 KB answer = YES
52 Correct 21 ms 1492 KB answer = NO
53 Correct 8 ms 340 KB answer = YES
54 Correct 18 ms 456 KB answer = YES
55 Correct 40 ms 724 KB answer = YES
56 Correct 97 ms 1184 KB answer = YES
57 Correct 92 ms 1088 KB answer = YES
58 Correct 70 ms 980 KB answer = YES
59 Correct 41 ms 1032 KB answer = YES
60 Correct 91 ms 1144 KB answer = YES
61 Correct 31 ms 768 KB answer = YES
62 Correct 65 ms 7984 KB answer = NO
63 Correct 59 ms 7992 KB answer = YES
64 Correct 68 ms 7884 KB answer = NO
65 Correct 76 ms 7956 KB answer = YES
66 Correct 14 ms 472 KB answer = YES
67 Correct 296 ms 14556 KB answer = YES
68 Correct 650 ms 14456 KB answer = YES
69 Correct 654 ms 14456 KB answer = YES
70 Correct 187 ms 19016 KB answer = YES
71 Correct 642 ms 14672 KB answer = YES
72 Execution timed out 1049 ms 8760 KB Time limit exceeded
73 Halted 0 ms 0 KB -