Submission #462450

# Submission time Handle Problem Language Result Execution time Memory
462450 2021-08-10T14:48:57 Z Yeboi Pipes (BOI13_pipes) C++14
62.2222 / 100
557 ms 36968 KB
#include <bits/stdc++.h>
#define ll long long
#define mod 998244353
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define rep(i,s) for(ll i=0; i<s ; i++)
#define f(i,a,b) for(ll i(a); i<b ; i++)
const ll INF = 1000000000000000000;
const ll N = 100001;
const ll MOD = 1000000007;
const ll modi = 1000000007;
const ll MAXN = 10000000000;    
const ll rootval = 319;
using namespace std;

ll upedge[N];
ll ngood[N];
vector<ll> adj[N];
ll arr[N];
ll par[N];
ll n;
void dfs1(ll v, ll p){
    ll sum = 0;
    for(auto u : adj[v]){
        if(u == p){
            continue;
        }
        else{
            if(upedge[u] == -1){
                dfs1(u,v);
                sum += upedge[u];
            }
        }
    }
    upedge[v] = arr[v] - sum;
}
void dfs2(ll v, ll p){
    ll sum = 0;
    for(auto u : adj[v]){
        if(u == p || ngood[u] == -1){
            continue;
        }
        else{
            if(upedge[u] == -1){
                dfs2(u,v);
                sum += upedge[u];
            }
        }
    }
    upedge[v] = arr[v] - sum;
}
void parents(ll v, ll p){
    for(auto u : adj[v]){
        if(u == p){
            continue;
        }
        else{
            par[u] = v;
            parents(u,v);
        }
    }
}
void parents2(ll v, ll p){
    for(auto u : adj[v]){
        if(u == p || ngood[u] == -1){
            continue;
        }
        else{
            par[u] = v;
            parents2(u,v);
        }
    }
}
vector<bool> visited;
vector<ll> parent;
ll cycle_start, cycle_end;

bool dfs(ll v, ll par) { // passing vertex and its parent vertex
    visited[v] = true;
    for (ll u : adj[v]) {
        if(u == par) continue; // skipping edge to parent vertex
        if (visited[u]) {
            cycle_end = v;
            cycle_start = u;
            return true;
        }
        parent[u] = v;
        if (dfs(u, parent[u]))
            return true;
    }
    return false;
}

vector<ll> find_cycle() {
    visited.assign(n, false);
    parent.assign(n, -1);
    cycle_start = -1;
    vector<ll> cycle;
    for (ll v = 0; v < n; v++) {
        if (!visited[v] && dfs(v, parent[v]))
            break;
    }

    if (cycle_start == -1) {
        return cycle;
    } else {
        vector<ll> cycle;
        cycle.push_back(cycle_start);
        for (ll v = cycle_end; v != cycle_start; v = parent[v]){
            cycle.push_back(v);
        }
        reverse(cycle.begin(), cycle.end());
        return cycle;
    }
}
int main(){
    fastio();
    ll m;
    cin >> n >> m;
    vector<pair<ll,ll>> edges;
    rep(i,n){
        cin >> arr[i];
        upedge[i] = -1;
    }
    rep(i,m){
        ll u,v;
        cin >> u >> v;
        --u,--v;
        adj[u].push_back(v);
        adj[v].push_back(u);
        edges.push_back(make_pair(u,v));
    }
    if(m == n-1){
        ll root = 0;
        rep(i,n){
            if(adj[i].size() != 1){
                root = i;
                break;
            }
        }
        rep(i,n){
            if(adj[i].size() == 1){
                upedge[i] = arr[i];
            }
        }
        dfs1(root,-1);
        parents(root,-1);
        par[root] = -1;
        map<pair<ll,ll>,ll> mp;
        rep(i,n){
            if(par[i] == -1){
                continue;
            }
            else{
                mp[{i,par[i]}] = upedge[i];
                mp[{par[i],i}] = upedge[i];
            }
        }
        rep(i,edges.size()){
            ll u = edges[i].first;
            ll v = edges[i].second;
            cout << 2*mp[{u,v}] << endl;
        }
    }
    else if(m == n){
        // one cycle exists so just find that one cycle done?
        vector<ll> cycle = find_cycle();
        rep(i,cycle.size()){
            ngood[cycle[i]] = -1;
        }
        if(cycle.size() % 2 == 0){
            cout << 0 << endl;
        }
        else{
            rep(j,cycle.size()){
                ll i = cycle[j];
                    dfs2(i,-1);
                    parents2(i,-1);
                    par[i] = -1;
            }
            map<pair<ll,ll>,ll> mp;
            map<pair<ll,ll>,ll> mp2;
            rep(i,n){
                if(par[i] != -1){
                    mp[{par[i],i}] = upedge[i];
                    mp[{i,par[i]}] = upedge[i];
                    mp2[{par[i],i}] = 2*upedge[i];
                    mp2[{i,par[i]}] = 2*upedge[i];
                }
            }
            rep(i,cycle.size()){
                for(auto u : adj[cycle[i]]){
                    if(ngood[u] == -1){
                        continue;
                    }
                    else{
                        arr[cycle[i]] = arr[cycle[i]] - mp[{cycle[i],u}];
                    }
                }
            }
            ll val = arr[cycle[0]];
            f(i,1,cycle.size()){
                if(i%2 == 1){
                    val += arr[cycle[i]];
                }
                else{
                    val = val - arr[cycle[i]];
                }
            }
            mp2[{cycle[0],cycle[1]}] = val;
            f(i,1,cycle.size()-1){
                mp2[{cycle[i],cycle[i+1]}] = 2*arr[cycle[i]] - mp2[{cycle[i-1],cycle[i]}];
                mp2[{cycle[i+1],cycle[i]}] = mp2[{cycle[i],cycle[i+1]}];
            }
            mp2[{cycle[cycle.size()-1],cycle[0]}] = 2*arr[cycle[cycle.size()-1]] - mp2[{cycle[cycle.size()-1],cycle[cycle.size()-2]}];
            mp2[{cycle[0],cycle[cycle.size()-1]}] = mp2[{cycle[cycle.size()-1],cycle[0]}];
            rep(i,edges.size()){
                cout << mp2[{edges[i].first,edges[i].second}] << endl;
            }
        }
    }
    else if(m > n){
        cout << 0 << endl;
    }
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:5:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i,s) for(ll i=0; i<s ; i++)
......
  158 |         rep(i,edges.size()){
      |             ~~~~~~~~~~~~~~     
pipes.cpp:158:9: note: in expansion of macro 'rep'
  158 |         rep(i,edges.size()){
      |         ^~~
pipes.cpp:5:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i,s) for(ll i=0; i<s ; i++)
......
  167 |         rep(i,cycle.size()){
      |             ~~~~~~~~~~~~~~     
pipes.cpp:167:9: note: in expansion of macro 'rep'
  167 |         rep(i,cycle.size()){
      |         ^~~
pipes.cpp:5:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i,s) for(ll i=0; i<s ; i++)
......
  174 |             rep(j,cycle.size()){
      |                 ~~~~~~~~~~~~~~ 
pipes.cpp:174:13: note: in expansion of macro 'rep'
  174 |             rep(j,cycle.size()){
      |             ^~~
pipes.cpp:5:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i,s) for(ll i=0; i<s ; i++)
......
  190 |             rep(i,cycle.size()){
      |                 ~~~~~~~~~~~~~~ 
pipes.cpp:190:13: note: in expansion of macro 'rep'
  190 |             rep(i,cycle.size()){
      |             ^~~
pipes.cpp:6:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | #define f(i,a,b) for(ll i(a); i<b ; i++)
......
  201 |             f(i,1,cycle.size()){
      |               ~~~~~~~~~~~~~~~~  
pipes.cpp:201:13: note: in expansion of macro 'f'
  201 |             f(i,1,cycle.size()){
      |             ^
pipes.cpp:6:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | #define f(i,a,b) for(ll i(a); i<b ; i++)
......
  210 |             f(i,1,cycle.size()-1){
      |               ~~~~~~~~~~~~~~~~~~
pipes.cpp:210:13: note: in expansion of macro 'f'
  210 |             f(i,1,cycle.size()-1){
      |             ^
pipes.cpp:5:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i,s) for(ll i=0; i<s ; i++)
......
  216 |             rep(i,edges.size()){
      |                 ~~~~~~~~~~~~~~ 
pipes.cpp:216:13: note: in expansion of macro 'rep'
  216 |             rep(i,edges.size()){
      |             ^~~
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2636 KB Output isn't correct
2 Incorrect 2 ms 2636 KB Output isn't correct
3 Incorrect 6 ms 2808 KB Output isn't correct
4 Incorrect 361 ms 23652 KB Output isn't correct
5 Incorrect 3 ms 2636 KB Output isn't correct
6 Incorrect 3 ms 2764 KB Output isn't correct
7 Incorrect 2 ms 2636 KB Output isn't correct
8 Incorrect 2 ms 2636 KB Output isn't correct
9 Incorrect 6 ms 2892 KB Output isn't correct
10 Incorrect 5 ms 2808 KB Output isn't correct
11 Incorrect 5 ms 2808 KB Output isn't correct
12 Incorrect 4 ms 2892 KB Output isn't correct
13 Incorrect 280 ms 19432 KB Output isn't correct
14 Incorrect 364 ms 22540 KB Output isn't correct
15 Incorrect 353 ms 23784 KB Output isn't correct
16 Incorrect 288 ms 20644 KB Output isn't correct
17 Incorrect 353 ms 23688 KB Output isn't correct
18 Incorrect 348 ms 23732 KB Output isn't correct
19 Incorrect 429 ms 27124 KB Output isn't correct
20 Incorrect 3 ms 2636 KB Output isn't correct
21 Incorrect 5 ms 2764 KB Output isn't correct
22 Incorrect 389 ms 23728 KB Output isn't correct
23 Incorrect 284 ms 19508 KB Output isn't correct
24 Incorrect 401 ms 23752 KB Output isn't correct
25 Incorrect 271 ms 20248 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2636 KB Output is correct
2 Correct 6 ms 2892 KB Output is correct
3 Correct 96 ms 13740 KB Output is correct
4 Correct 62 ms 9512 KB Output is correct
5 Correct 74 ms 9644 KB Output is correct
6 Correct 305 ms 26396 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 3 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Incorrect 2 ms 2636 KB Output isn't correct
15 Correct 5 ms 2844 KB Output is correct
16 Correct 4 ms 2892 KB Output is correct
17 Correct 2 ms 2808 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 3 ms 2764 KB Output is correct
22 Correct 5 ms 3020 KB Output is correct
23 Incorrect 365 ms 27336 KB Output isn't correct
24 Correct 557 ms 33836 KB Output is correct
25 Correct 62 ms 13748 KB Output is correct
26 Correct 66 ms 9520 KB Output is correct
27 Correct 49 ms 9448 KB Output is correct
28 Correct 56 ms 9940 KB Output is correct
29 Correct 245 ms 22152 KB Output is correct
30 Incorrect 533 ms 35440 KB Output isn't correct
31 Incorrect 454 ms 31160 KB Output isn't correct
32 Correct 516 ms 36512 KB Output is correct
33 Correct 113 ms 14784 KB Output is correct
34 Correct 55 ms 9524 KB Output is correct
35 Correct 63 ms 9472 KB Output is correct
36 Correct 58 ms 9804 KB Output is correct
37 Correct 214 ms 26364 KB Output is correct
38 Correct 497 ms 34396 KB Output is correct
39 Correct 521 ms 36696 KB Output is correct
40 Correct 512 ms 34120 KB Output is correct
41 Correct 67 ms 16824 KB Output is correct
42 Correct 55 ms 9392 KB Output is correct
43 Correct 58 ms 9328 KB Output is correct
44 Correct 49 ms 9652 KB Output is correct
45 Correct 166 ms 23188 KB Output is correct
46 Incorrect 483 ms 36968 KB Output isn't correct
47 Correct 457 ms 33992 KB Output is correct
48 Correct 423 ms 31320 KB Output is correct
49 Correct 59 ms 11948 KB Output is correct
50 Correct 50 ms 9576 KB Output is correct
51 Correct 52 ms 9624 KB Output is correct
52 Correct 50 ms 9364 KB Output is correct
53 Correct 175 ms 23300 KB Output is correct
54 Incorrect 494 ms 35940 KB Output isn't correct