oj.uz

Submission #1030512

# Submission time Handle Problem Language Result Execution time Memory
1030512 2024-07-22T06:14:49 Z 12345678 Graph (BOI20_graph) C++17
0 / 100
 2 ms 2820 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5;

int n, m, u, v, w, a[nx], b[nx], f, vs[nx];
double res[nx];
vector<pair<int, int>> d[nx];
vector<int> comp;
set<double> s;

void dfs(int u, int p)
{
    vs[u]=1;
    comp.push_back(u);
    for (auto [v, w]:d[u])
    {
        if (v==p) continue;
        if (vs[v])
        {
            int sma=a[u]+a[v], smb=b[u]+b[v];
            if (sma==0&&b[u]+b[v]==w) continue;
            else if (sma==0&&b[u]+b[v]!=w)
            {
                f=1;
                break;
            }
            smb=w-smb;
            s.insert(((double)smb)/((double)sma));
        }
        else
        {
            a[v]=-a[u];
            b[v]=w-b[u];
            dfs(v, u);
        }
    }
}
int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=m; i++) cin>>u>>v>>w, d[u].push_back({v, w}), d[v].push_back({u, w});
    for (int i=1; i<=n; i++)
    {
        if (!vs[i])
        {
            comp.clear();
            s.clear();
            a[i]=1;
            dfs(i, i);
            if (s.size()>1) f=1;
            else if (s.size()==1)
            {
                double vl=*s.begin();
                for (auto x:comp) res[x]=a[x]*vl+b[x];
            }
            else
            {
                vector<double> v;
                for (auto x:comp) if (a[x]!=0) v.push_back((double)(-b[x])/(double)a[x]);
                sort(v.begin(), v.end());
                pair<double, double> mn={DBL_MAX, 0};
                for (auto k:v)
                {
                    double tmp=0;
                    for (auto x:comp) tmp+=abs(a[x]*k+b[x]);
                    mn=min(mn, {tmp, k});
                }
                for (auto x:comp) res[x]=mn.second*a[x]+b[x];
            }
        }
    }
    if (f) return cout<<"NO\n", 0;
    cout<<"YES\n";
    for (int i=1; i<=n; i++) cout<<setprecision(8)<<res[i]<<' ';
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB answer = YES
2 Correct 1 ms 2652 KB answer = YES
3 Correct 2 ms 2652 KB answer = YES
4 Correct 1 ms 2652 KB answer = NO
5 Correct 1 ms 2652 KB answer = YES
6 Correct 1 ms 2648 KB answer = YES
7 Correct 1 ms 2652 KB answer = YES
8 Correct 1 ms 2652 KB answer = YES
9 Correct 1 ms 2820 KB answer = NO
10 Correct 1 ms 2816 KB answer = YES
11 Correct 2 ms 2652 KB answer = YES
12 Correct 1 ms 2652 KB answer = NO
13 Correct 1 ms 2652 KB answer = YES
14 Correct 1 ms 2652 KB answer = YES
15 Correct 1 ms 2648 KB answer = YES
16 Correct 1 ms 2652 KB answer = YES
17 Correct 1 ms 2652 KB answer = YES
18 Incorrect 1 ms 2652 KB Sum of endpoints for edge (1; 1) differs from the expected value 1.
19 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB answer = YES
2 Correct 1 ms 2652 KB answer = YES
3 Correct 2 ms 2652 KB answer = YES
4 Correct 1 ms 2652 KB answer = NO
5 Correct 1 ms 2652 KB answer = YES
6 Correct 1 ms 2648 KB answer = YES
7 Correct 1 ms 2652 KB answer = YES
8 Correct 1 ms 2652 KB answer = YES
9 Correct 1 ms 2820 KB answer = NO
10 Correct 1 ms 2816 KB answer = YES
11 Correct 2 ms 2652 KB answer = YES
12 Correct 1 ms 2652 KB answer = NO
13 Correct 1 ms 2652 KB answer = YES
14 Correct 1 ms 2652 KB answer = YES
15 Correct 1 ms 2648 KB answer = YES
16 Correct 1 ms 2652 KB answer = YES
17 Correct 1 ms 2652 KB answer = YES
18 Incorrect 1 ms 2652 KB Sum of endpoints for edge (1; 1) differs from the expected value 1.
19 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB answer = YES
2 Correct 1 ms 2652 KB answer = YES
3 Correct 2 ms 2652 KB answer = YES
4 Correct 1 ms 2652 KB answer = NO
5 Correct 1 ms 2652 KB answer = YES
6 Correct 1 ms 2648 KB answer = YES
7 Correct 1 ms 2652 KB answer = YES
8 Correct 1 ms 2652 KB answer = YES
9 Correct 1 ms 2820 KB answer = NO
10 Correct 1 ms 2816 KB answer = YES
11 Correct 2 ms 2652 KB answer = YES
12 Correct 1 ms 2652 KB answer = NO
13 Correct 1 ms 2652 KB answer = YES
14 Correct 1 ms 2652 KB answer = YES
15 Correct 1 ms 2648 KB answer = YES
16 Correct 1 ms 2652 KB answer = YES
17 Correct 1 ms 2652 KB answer = YES
18 Incorrect 1 ms 2652 KB Sum of endpoints for edge (1; 1) differs from the expected value 1.
19 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB answer = YES
2 Correct 1 ms 2652 KB answer = YES
3 Correct 2 ms 2652 KB answer = YES
4 Correct 1 ms 2652 KB answer = NO
5 Correct 1 ms 2652 KB answer = YES
6 Correct 1 ms 2648 KB answer = YES
7 Correct 1 ms 2652 KB answer = YES
8 Correct 1 ms 2652 KB answer = YES
9 Correct 1 ms 2820 KB answer = NO
10 Correct 1 ms 2816 KB answer = YES
11 Correct 2 ms 2652 KB answer = YES
12 Correct 1 ms 2652 KB answer = NO
13 Correct 1 ms 2652 KB answer = YES
14 Correct 1 ms 2652 KB answer = YES
15 Correct 1 ms 2648 KB answer = YES
16 Correct 1 ms 2652 KB answer = YES
17 Correct 1 ms 2652 KB answer = YES
18 Incorrect 1 ms 2652 KB Sum of endpoints for edge (1; 1) differs from the expected value 1.
19 Halted 0 ms 0 KB -

Subtask #5
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB answer = YES
2 Correct 1 ms 2652 KB answer = YES
3 Correct 2 ms 2652 KB answer = YES
4 Correct 1 ms 2652 KB answer = NO
5 Correct 1 ms 2652 KB answer = YES
6 Correct 1 ms 2648 KB answer = YES
7 Correct 1 ms 2652 KB answer = YES
8 Correct 1 ms 2652 KB answer = YES
9 Correct 1 ms 2820 KB answer = NO
10 Correct 1 ms 2816 KB answer = YES
11 Correct 2 ms 2652 KB answer = YES
12 Correct 1 ms 2652 KB answer = NO
13 Correct 1 ms 2652 KB answer = YES
14 Correct 1 ms 2652 KB answer = YES
15 Correct 1 ms 2648 KB answer = YES
16 Correct 1 ms 2652 KB answer = YES
17 Correct 1 ms 2652 KB answer = YES
18 Incorrect 1 ms 2652 KB Sum of endpoints for edge (1; 1) differs from the expected value 1.
19 Halted 0 ms 0 KB -