oj.uz

답안 #932163

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932163 2024-02-23T04:02:34 Z Ghulam_Junaid Graph (BOI20_graph) C++17
0 / 100
 2 ms 4440 KB 
#include <bits/stdc++.h>
using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 1e5 + 10;
int n, m;
bool vis[N];

vector<double> poss;
vector<int> path;
vector<pair<int, double>> g[N];

double val[N], ans[N];

void getpath(int v){
    vis[v] = 1;
    path.push_back(v);
    for (auto [u, w] : g[v])
        if (!vis[u]) getpath(u);
}

void dfs(int v){
    vis[v] = 1;
    for (auto [u, w] : g[v]){
        if (vis[u]){
            if (val[u] == w - val[v])
                continue;
            val[u] = 1e9;
            return;
        }
        
        val[u] = w - val[v];
        dfs(u);
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> n >> m;
    for (int i = 0; i < m; i ++){
        int u, v, w;
        cin >> u >> v >> w;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }

    poss.push_back(0);
    poss.push_back(0.5);
    poss.push_back(-0.5);

    for (int i = 1; i <= n; i ++){
        if (vis[i]) continue;

        path.clear();
        getpath(i);

        long double mn = 1e9;
        int sz = path.size();
        for (int r = 0; r < 50; r ++){
            for (double x : poss){
                for (int v : path)
                    vis[v] = 0;

                int ind = rng() % sz;
                int node = path[ind];

                if (!r) node = i;

                val[node] = x;
                dfs(node);

                long double sm = 0;
                for (int v : path)
                    sm += abs(val[v]);

                if (mn > sm){
                    mn = sm;
                    for (int v : path)
                        ans[v] = val[v];
                }
            }
        }

        for (int v : path) vis[v] = 1;

        if (mn == 1e9){
            cout << "NO" << endl;
            return 0;
        }
    }

    cout << "YES" << endl;
    for (int i = 1; i <= n; i ++)
        cout << ans[i] << " ";
    cout << endl;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4188 KB answer = YES
2 Correct 1 ms 4188 KB answer = YES
3 Correct 1 ms 4188 KB answer = YES
4 Correct 1 ms 4188 KB answer = NO
5 Correct 1 ms 4188 KB answer = YES
6 Correct 1 ms 4188 KB answer = YES
7 Correct 1 ms 4188 KB answer = YES
8 Correct 2 ms 4440 KB answer = YES
9 Correct 1 ms 4184 KB answer = NO
10 Correct 2 ms 4184 KB answer = YES
11 Correct 1 ms 4184 KB answer = YES
12 Correct 2 ms 4440 KB answer = NO
13 Correct 2 ms 4188 KB answer = YES
14 Correct 1 ms 4188 KB answer = YES
15 Correct 1 ms 4188 KB answer = YES
16 Correct 2 ms 4188 KB answer = YES
17 Correct 1 ms 4188 KB answer = YES
18 Correct 2 ms 4184 KB answer = YES
19 Incorrect 2 ms 4188 KB jury has the better answer: jans = YES, pans = NO
20 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4188 KB answer = YES
2 Correct 1 ms 4188 KB answer = YES
3 Correct 1 ms 4188 KB answer = YES
4 Correct 1 ms 4188 KB answer = NO
5 Correct 1 ms 4188 KB answer = YES
6 Correct 1 ms 4188 KB answer = YES
7 Correct 1 ms 4188 KB answer = YES
8 Correct 2 ms 4440 KB answer = YES
9 Correct 1 ms 4184 KB answer = NO
10 Correct 2 ms 4184 KB answer = YES
11 Correct 1 ms 4184 KB answer = YES
12 Correct 2 ms 4440 KB answer = NO
13 Correct 2 ms 4188 KB answer = YES
14 Correct 1 ms 4188 KB answer = YES
15 Correct 1 ms 4188 KB answer = YES
16 Correct 2 ms 4188 KB answer = YES
17 Correct 1 ms 4188 KB answer = YES
18 Correct 2 ms 4184 KB answer = YES
19 Incorrect 2 ms 4188 KB jury has the better answer: jans = YES, pans = NO
20 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4188 KB answer = YES
2 Correct 1 ms 4188 KB answer = YES
3 Correct 1 ms 4188 KB answer = YES
4 Correct 1 ms 4188 KB answer = NO
5 Correct 1 ms 4188 KB answer = YES
6 Correct 1 ms 4188 KB answer = YES
7 Correct 1 ms 4188 KB answer = YES
8 Correct 2 ms 4440 KB answer = YES
9 Correct 1 ms 4184 KB answer = NO
10 Correct 2 ms 4184 KB answer = YES
11 Correct 1 ms 4184 KB answer = YES
12 Correct 2 ms 4440 KB answer = NO
13 Correct 2 ms 4188 KB answer = YES
14 Correct 1 ms 4188 KB answer = YES
15 Correct 1 ms 4188 KB answer = YES
16 Correct 2 ms 4188 KB answer = YES
17 Correct 1 ms 4188 KB answer = YES
18 Correct 2 ms 4184 KB answer = YES
19 Incorrect 2 ms 4188 KB jury has the better answer: jans = YES, pans = NO
20 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4188 KB answer = YES
2 Correct 1 ms 4188 KB answer = YES
3 Correct 1 ms 4188 KB answer = YES
4 Correct 1 ms 4188 KB answer = NO
5 Correct 1 ms 4188 KB answer = YES
6 Correct 1 ms 4188 KB answer = YES
7 Correct 1 ms 4188 KB answer = YES
8 Correct 2 ms 4440 KB answer = YES
9 Correct 1 ms 4184 KB answer = NO
10 Correct 2 ms 4184 KB answer = YES
11 Correct 1 ms 4184 KB answer = YES
12 Correct 2 ms 4440 KB answer = NO
13 Correct 2 ms 4188 KB answer = YES
14 Correct 1 ms 4188 KB answer = YES
15 Correct 1 ms 4188 KB answer = YES
16 Correct 2 ms 4188 KB answer = YES
17 Correct 1 ms 4188 KB answer = YES
18 Correct 2 ms 4184 KB answer = YES
19 Incorrect 2 ms 4188 KB jury has the better answer: jans = YES, pans = NO
20 Halted 0 ms 0 KB -

Subtask #5
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4188 KB answer = YES
2 Correct 1 ms 4188 KB answer = YES
3 Correct 1 ms 4188 KB answer = YES
4 Correct 1 ms 4188 KB answer = NO
5 Correct 1 ms 4188 KB answer = YES
6 Correct 1 ms 4188 KB answer = YES
7 Correct 1 ms 4188 KB answer = YES
8 Correct 2 ms 4440 KB answer = YES
9 Correct 1 ms 4184 KB answer = NO
10 Correct 2 ms 4184 KB answer = YES
11 Correct 1 ms 4184 KB answer = YES
12 Correct 2 ms 4440 KB answer = NO
13 Correct 2 ms 4188 KB answer = YES
14 Correct 1 ms 4188 KB answer = YES
15 Correct 1 ms 4188 KB answer = YES
16 Correct 2 ms 4188 KB answer = YES
17 Correct 1 ms 4188 KB answer = YES
18 Correct 2 ms 4184 KB answer = YES
19 Incorrect 2 ms 4188 KB jury has the better answer: jans = YES, pans = NO
20 Halted 0 ms 0 KB -