oj.uz

Submission #283428

# Submission time Handle Problem Language Result Execution time Memory
283428 2020-08-25T18:15:08 Z Atill83 Pipes (BOI13_pipes) C++14
97.4074 / 100
 291 ms 42476 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, m;
pii edg[MAXN];
int c[MAXN];
vector<pii> adj[MAXN];
int sz[MAXN];
ll ans[MAXN];
bool vis[MAXN];
int remd;
void dfs(int v){
    sz[v]--;
    for(pii j: adj[v]){
        //cerr<<v<<" "<<j.ff<<endl;
        if(sz[j.ff] <= 0) continue;
        ans[j.ss] = 2*c[v];
        c[j.ff] -= c[v];
        c[v] = 0;
        sz[j.ff]--;
        remd--;
        if(sz[j.ff] == 1){
            dfs(j.ff);
        }
    }
}



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

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n>>m;
    remd = m;

    for(int i = 0; i < n; i++){
        cin>>c[i + 1];
    }
    if(n == 2){
        if(c[1] == c[2]){
            cout<<c[1]<<endl;
        }else{
            cout<<0<<endl;
        }
        return 0;
    }
    for(int i = 0; i < m; i++){
        int a, b;
        cin>>a>>b;
        adj[a].push_back({b, i});
        adj[b].push_back({a, i});
        sz[a]++;
        sz[b]++;
    }

    for(int i = 1; i <= n; i++){
        if(sz[i] == 1){
            //cout<<i<<endl;
            dfs(i);
        }
    }
    int kal = 0;
    int bir = -1;
    for(int i = 1; i <= n; i++){
        //cout<<c[i]<<" ";
        if(sz[i]){
            kal++;
            bir = i;
        }
    }
    //cout<<endl<<kal<<endl;
    //cerr<<kal<<endl;
    if(kal == 0){
        bool tru = 1;
        for(int i = 1; i <= n; i++){
            tru = (tru && c[i] == 0);
        }
        if(tru){
            for(int i = 0; i < m; i++){
                cout<<ans[i]<<endl;
            }
        }else{
            cout<<0<<endl;
        }
    }else if(remd > kal || kal % 2 == 0){
        cout<<0<<endl;
    }else{

        int cur = bir;
        for(pii j: adj[cur]){
            if(sz[j.ff] != 0){
               cur = j.ff; 
            }
        }
        int idx = 0;
        int top = 0, last = -1;
        while(cur != bir){
            if(idx % 2){
                top -= c[cur];
            }else{
                top += c[cur];
            }
            idx++;
            
            for(pii nx: adj[cur]){
                if(nx.ff == last) continue;
                if(sz[nx.ff] > 0){
                    last = cur;
                    cur = nx.ff;
                
                    break;
                }
            }
        }
        //cerr<<top<<endl;
        for(pii j: adj[bir]){
            if(j.ff == last) continue; 
            if(sz[j.ff] > 0){
                if((top +c[bir] ) % 2 != 0){
                    cout<<0<<endl;
                    return 0;
                }
               int deg = (top + c[bir]) / 2;
               ans[j.ss] = 2*deg;
               cur = j.ff;
               c[j.ff] -= deg;
               break;
            }
        }
        last = bir;
        while(cur != bir){
            for(pii nx: adj[cur]){
                if(nx.ff == last) continue;
                if(sz[nx.ff] > 0){
                    ans[nx.ss] = 2*c[cur];
                    c[nx.ff] -= c[cur];
                    last = cur;
                    cur = nx.ff;

                    break;
                }
            }
        }
        for(int i = 1; i <= m; i++){
            cout<<ans[i - 1]<<endl;
        }
    }


    

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 6 ms 7424 KB Output is correct
4 Correct 76 ms 14712 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 6 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 6 ms 7424 KB Output is correct
10 Correct 6 ms 7424 KB Output is correct
11 Correct 6 ms 7552 KB Output is correct
12 Correct 6 ms 7552 KB Output is correct
13 Correct 62 ms 13304 KB Output is correct
14 Correct 78 ms 14328 KB Output is correct
15 Correct 77 ms 14712 KB Output is correct
16 Correct 67 ms 13708 KB Output is correct
17 Correct 77 ms 14712 KB Output is correct
18 Correct 77 ms 14712 KB Output is correct
19 Correct 80 ms 15224 KB Output is correct
20 Correct 5 ms 7424 KB Output is correct
21 Correct 6 ms 7424 KB Output is correct
22 Correct 77 ms 14712 KB Output is correct
23 Correct 58 ms 13176 KB Output is correct
24 Correct 75 ms 14712 KB Output is correct
25 Correct 64 ms 13560 KB Output is correct

Subtask #2
67.4074074074 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 6 ms 7552 KB Output is correct
3 Correct 63 ms 13816 KB Output is correct
4 Correct 71 ms 13816 KB Output is correct
5 Correct 64 ms 13944 KB Output is correct
6 Runtime error 291 ms 42476 KB Execution killed with signal 11
7 Correct 6 ms 7424 KB Output is correct
8 Correct 6 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 5 ms 7552 KB Output is correct
11 Correct 5 ms 7424 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 6 ms 7424 KB Output is correct
14 Correct 5 ms 7424 KB Output is correct
15 Correct 6 ms 7552 KB Output is correct
16 Correct 6 ms 7424 KB Output is correct
17 Correct 5 ms 7424 KB Output is correct
18 Correct 6 ms 7424 KB Output is correct
19 Correct 5 ms 7424 KB Output is correct
20 Correct 6 ms 7424 KB Output is correct
21 Correct 6 ms 7552 KB Output is correct
22 Correct 6 ms 7552 KB Output is correct
23 Correct 77 ms 13048 KB Output is correct
24 Correct 110 ms 14460 KB Output is correct
25 Correct 58 ms 13688 KB Output is correct
26 Correct 59 ms 13816 KB Output is correct
27 Correct 58 ms 13688 KB Output is correct
28 Correct 65 ms 14456 KB Output is correct
29 Correct 200 ms 24952 KB Output is correct
30 Correct 84 ms 15608 KB Output is correct
31 Correct 86 ms 14200 KB Output is correct
32 Correct 79 ms 14712 KB Output is correct
33 Correct 59 ms 13944 KB Output is correct
34 Correct 57 ms 13816 KB Output is correct
35 Correct 60 ms 13816 KB Output is correct
36 Correct 73 ms 14092 KB Output is correct
37 Runtime error 265 ms 42236 KB Execution killed with signal 11
38 Correct 86 ms 15224 KB Output is correct
39 Correct 88 ms 14584 KB Output is correct
40 Correct 91 ms 14456 KB Output is correct
41 Correct 61 ms 13688 KB Output is correct
42 Correct 60 ms 13852 KB Output is correct
43 Correct 59 ms 13688 KB Output is correct
44 Correct 64 ms 13944 KB Output is correct
45 Correct 179 ms 25340 KB Output is correct
46 Correct 82 ms 15920 KB Output is correct
47 Correct 93 ms 14456 KB Output is correct
48 Correct 98 ms 14200 KB Output is correct
49 Correct 60 ms 13816 KB Output is correct
50 Correct 70 ms 13896 KB Output is correct
51 Correct 62 ms 13948 KB Output is correct
52 Correct 60 ms 13692 KB Output is correct
53 Correct 204 ms 25592 KB Output is correct
54 Correct 100 ms 15608 KB Output is correct