oj.uz

Submission #367364

# Submission time Handle Problem Language Result Execution time Memory
367364 2021-02-17T00:23:07 Z jainbot27 Graph (BOI20_graph) C++17
0 / 100
 3 ms 2668 KB 
#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 1e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;
const double eps = 1e-6;

double ans[mxN];
int a[mxN], b[mxN];
vpii adj[mxN];
int n, m;
vector<double> vals;
vi cur, al;

void bad(){
    cout<<"NO\n";
    exit(0);
}

void dfs(int u, int A, int B){
    if(a[u]==0){
        a[u] = A, b[u] = B;
        cur.pb(u); al.pb(A*B);
        trav(v, adj[u]) dfs(v.f, -A, v.s-B);
    }
    else if(a[u]!=A||b[u]!=B){
        if(a[u]==A) bad();
        vals.pb(1.0*(B-b[u])/(a[u]-A));
    }
}

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    F0R(i, m){
        int e1, e2, e3; cin >> e1 >> e2 >> e3; e1--; e2--; 
        adj[e1].pb({e2, e3}); adj[e2].pb({e1, e3});
    }
    F0R(i, n){
        if(a[i]==0){
            dfs(i, 1, 0);
            if(siz(vals)){
                sort(all(vals));
                if((vals[0]-vals.back())>eps) bad();
                trav(q, cur) ans[q] = vals[0]*a[q]+b[q];

            }
            else{
                sort(all(al));
                trav(q, cur) ans[q] = -al[siz(al)/2]*a[q]+b[q];
            }
        }
    }
    cout << "YES\n";
    F0R(i, n) cout << ans[i] << ' ';
    cout << nl;
    return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 17.0

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

Subtask #4
0 / 24.0

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

Subtask #5
0 / 42.0

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