oj.uz

답안 #221970

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
221970 2020-04-11T15:59:55 Z infinite_iq Pipes (BOI13_pipes) C++14
74.0741 / 100
 867 ms 91256 KB 
    #define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
    #include <bits/stdc++.h>
    using namespace std;
    #define sqr 340
    #define mid (l+r)/2
    #define pb push_back
    #define ppb pop_back
    #define fi first
    #define se second
    #define lb lower_bound
    #define ub upper_bound
    #define ins insert
    #define era erase
    #define C continue
    #define mem(dp,i) memset(dp,i,sizeof(dp))
    #define mset multiset
    typedef long long ll;
    typedef short int si;
    typedef long double ld;
    typedef pair<int,int> pi;
    typedef pair<ll,ll> pll;
    typedef vector<int> vi;
    typedef vector<ll> vll;
    typedef vector<pi> vpi;
    typedef vector<pll> vpll;
    const ll inf=1e18;
    const ld pai=acos(-1);
    ll n , m , all ;
    set<pll>v[500009];
    ll val[500009] , ans[500009] , ret[500009] , VAL[500009] ,done[500009];;
    ll start ;
    ll calc(int node , ll p ){
            done [node] = 1 ;
            ll ret = 0 ;
            for ( auto u : v[node] ) {
                    if ( done [u.fi] ) C ;
                    ret = calc ( u.fi , val[u.fi] - p) ;
                    break ;
            }
      done [node] = 0 ;
            return ret + p ;
    }
    void solve ( int node) {
            done [node] = 1 ;
            ll out = 0 ;
            for ( auto u : v[node] ) {
                    if ( done [u.fi] ) C ;
                    val[u.fi] -= val[node] ;
                    ans [ u.se ] = val[node];
                    solve( u.fi ) ;
                    out = 1 ;
                    break;
            }
            if ( !out ) {
                    for ( auto u :v[node] ) {
                            if ( u.fi == start ) {
                                    ans [ u.se ] = val[ node];
                                    break ;
                            }
                    }
            }
    }
    int main () {
            mem ( ret , -1 ) ;
            cin >> n >> m ;
            for ( int i = 0 ; i < n ; i ++ ) cin >> val[i] ;
            for ( int i = 0 ; i < m ; i ++ ) {
                    int a , b ;
                    cin >> a >> b ;
                    a -- , b -- ;
                    v[a].ins( { b , i } ) ;
                    v[b].ins( { a , i } ) ;
            }
            if ( m > n ) {
                    cout << 0 << endl ;
                    exit ( 0 ) ;
            }
            set<pll>s;
            for ( int i = 0 ; i < n ; i ++ ) {
                    s.ins ( { v[i].size() , i } ) ;
            }
            while ( ( s.size() && s.begin()->fi==1 ) ) {
                    int node = s.begin() -> se ;
              done [node] = 1 ;
                    int to = v[node].begin() -> fi ;
                    int id = v[node].begin() -> se ;
                    s.era(s.begin());
                    v[node].era( v[node].begin() );
                    s.era ( { v[to].size() , to } ) ;
                    v[to].era( { node , id } ) ;
                    if ( v[to].size() ) s.ins ( { v[to].size() , to } ) ;
                    ans [ id ] = -val [ node ] ;
                    val [ to ] += -val[node];
                    val [ node ] = 0 ;
            }
            if ( s.size() && s.size() % 2 == 0 ) cout << 0 << endl , exit ( 0 ) ;
            if ( !s.size() ) {
                    for ( int i = 0 ; i < m ; i ++ ) {
                            cout << -1ll*ans [i] *2ll << endl ;
                    }
                    exit ( 0 ) ;
            }
            for ( auto u : s ) all += val[u.se] ;
            all /= 2;
            start = s.begin()->se;
            val[start] = all - calc ( 0 , 0 ) ;
            solve(0);
            for ( int i = 0 ;i < m ;i ++ ) cout << -1ll*ans[i]*2ll << endl;
    }

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 27776 KB Output is correct
2 Correct 21 ms 27776 KB Output is correct
3 Correct 25 ms 27904 KB Output is correct
4 Correct 531 ms 49184 KB Output is correct
5 Correct 21 ms 27776 KB Output is correct
6 Correct 21 ms 27776 KB Output is correct
7 Correct 21 ms 27776 KB Output is correct
8 Correct 21 ms 27776 KB Output is correct
9 Correct 24 ms 27904 KB Output is correct
10 Correct 25 ms 27904 KB Output is correct
11 Correct 24 ms 27904 KB Output is correct
12 Correct 25 ms 27904 KB Output is correct
13 Correct 414 ms 44792 KB Output is correct
14 Correct 509 ms 48100 KB Output is correct
15 Correct 536 ms 49400 KB Output is correct
16 Correct 453 ms 46024 KB Output is correct
17 Correct 540 ms 49400 KB Output is correct
18 Correct 521 ms 49272 KB Output is correct
19 Correct 492 ms 49400 KB Output is correct
20 Correct 21 ms 27776 KB Output is correct
21 Correct 24 ms 27904 KB Output is correct
22 Correct 553 ms 49324 KB Output is correct
23 Correct 423 ms 44792 KB Output is correct
24 Correct 533 ms 49272 KB Output is correct
25 Correct 449 ms 45816 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 27776 KB Output isn't correct
2 Incorrect 24 ms 28032 KB Output isn't correct
3 Correct 259 ms 47608 KB Output is correct
4 Correct 203 ms 41208 KB Output is correct
5 Correct 174 ms 40696 KB Output is correct
6 Correct 867 ms 91256 KB Output is correct
7 Incorrect 21 ms 27776 KB Output isn't correct
8 Incorrect 21 ms 27776 KB Output isn't correct
9 Correct 22 ms 27776 KB Output is correct
10 Correct 22 ms 27776 KB Output is correct
11 Correct 21 ms 27776 KB Output is correct
12 Correct 21 ms 27776 KB Output is correct
13 Correct 21 ms 27776 KB Output is correct
14 Incorrect 23 ms 27768 KB Output isn't correct
15 Incorrect 24 ms 27904 KB Output isn't correct
16 Incorrect 24 ms 27904 KB Output isn't correct
17 Correct 25 ms 27904 KB Output is correct
18 Correct 22 ms 27904 KB Output is correct
19 Correct 23 ms 27904 KB Output is correct
20 Correct 22 ms 27904 KB Output is correct
21 Correct 24 ms 28152 KB Output is correct
22 Incorrect 24 ms 27904 KB Output isn't correct
23 Incorrect 395 ms 46968 KB Output isn't correct
24 Incorrect 492 ms 50936 KB Output isn't correct
25 Correct 274 ms 47736 KB Output is correct
26 Correct 196 ms 41080 KB Output is correct
27 Correct 176 ms 40952 KB Output is correct
28 Correct 193 ms 41900 KB Output is correct
29 Correct 661 ms 78584 KB Output is correct
30 Incorrect 452 ms 49016 KB Output isn't correct
31 Incorrect 462 ms 51960 KB Output isn't correct
32 Incorrect 506 ms 49784 KB Output isn't correct
33 Correct 262 ms 48856 KB Output is correct
34 Correct 178 ms 41080 KB Output is correct
35 Correct 177 ms 40952 KB Output is correct
36 Correct 187 ms 41208 KB Output is correct
37 Correct 845 ms 91116 KB Output is correct
38 Incorrect 472 ms 50764 KB Output isn't correct
39 Incorrect 518 ms 49272 KB Output isn't correct
40 Incorrect 477 ms 49248 KB Output isn't correct
41 Correct 209 ms 48888 KB Output is correct
42 Correct 178 ms 41208 KB Output is correct
43 Correct 176 ms 41080 KB Output is correct
44 Correct 173 ms 40696 KB Output is correct
45 Correct 768 ms 83704 KB Output is correct
46 Incorrect 494 ms 50620 KB Output isn't correct
47 Incorrect 458 ms 49144 KB Output isn't correct
48 Incorrect 457 ms 51964 KB Output isn't correct
49 Correct 299 ms 47608 KB Output is correct
50 Correct 188 ms 41208 KB Output is correct
51 Correct 178 ms 41080 KB Output is correct
52 Correct 177 ms 40824 KB Output is correct
53 Correct 781 ms 84852 KB Output is correct
54 Incorrect 458 ms 49144 KB Output isn't correct