oj.uz

Submission #78682

# Submission time Handle Problem Language Result Execution time Memory
78682 2018-10-07T13:27:53 Z Charis02 Pipes (BOI13_pipes) C++14
65 / 100
 343 ms 119032 KB 
#include<iostream>
#include<stdio.h>
#include<vector>
#include<cmath>
#include<queue>
#include<string.h>
#include<map>
#include<set>
#include<algorithm>
#define ll long long
#define pi pair < ll,ll >
#define mp(a,b) make_pair(a,b)
#define rep(i,a,b) for(int i = a;i < b;i++)
#define N 100004
#define INF 1e9+7

using namespace std;

ll n,m,ar[N],val[N];
vector < vector < pi > > graph(N);

void solvetree(ll cur,ll par,ll edge)
{
    rep(i,0,graph[cur].size())
    {
        ll v = graph[cur][i].first;

        if(v == par)
            continue;

        solvetree(v,cur,graph[cur][i].second);

        ar[cur] -= val[graph[cur][i].second];
    }

//    cout << cur << " " << par << " " << edge << " " << ar[cur] <<endl;

    val[edge] = ar[cur];

    return;
}

int main()
{
    ios_base::sync_with_stdio(false);

    cin >> n >> m;

    rep(i,1,n+1)
    {
        cin >> ar[i];
    }

    rep(i,0,m)
    {
        ll a,b;
        cin >> a >> b;
        graph[a].push_back(mp(b,i));
        graph[b].push_back(mp(a,i));
    }

    if(m > n)
    {
        cout << 0 << endl;
        return 0;
    }
    else if(m == n-1)
    {
        solvetree(1,1,m);

        rep(i,0,m)
        {
            cout << 2*val[i] << endl;
        }
    }

    return 0;
}

Compilation message

pipes.cpp: In function 'void solvetree(long long int, long long int, long long int)':
pipes.cpp:13:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i,a,b) for(int i = a;i < b;i++)
pipes.cpp:24:9:
     rep(i,0,graph[cur].size())
         ~~~~~~~~~~~~~~~~~~~~~       
pipes.cpp:24:5: note: in expansion of macro 'rep'
     rep(i,0,graph[cur].size())
     ^~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 5 ms 2936 KB Output is correct
3 Correct 6 ms 2936 KB Output is correct
4 Correct 343 ms 11740 KB Output is correct
5 Correct 4 ms 11740 KB Output is correct
6 Correct 4 ms 11740 KB Output is correct
7 Correct 4 ms 11740 KB Output is correct
8 Correct 4 ms 11740 KB Output is correct
9 Correct 6 ms 11740 KB Output is correct
10 Correct 6 ms 11740 KB Output is correct
11 Correct 6 ms 11740 KB Output is correct
12 Correct 6 ms 11740 KB Output is correct
13 Correct 176 ms 11740 KB Output is correct
14 Correct 223 ms 14220 KB Output is correct
15 Correct 222 ms 16084 KB Output is correct
16 Correct 209 ms 16396 KB Output is correct
17 Correct 218 ms 19020 KB Output is correct
18 Correct 229 ms 20764 KB Output is correct
19 Correct 251 ms 25284 KB Output is correct
20 Correct 4 ms 25284 KB Output is correct
21 Correct 6 ms 25284 KB Output is correct
22 Correct 229 ms 25284 KB Output is correct
23 Correct 179 ms 25284 KB Output is correct
24 Correct 245 ms 26772 KB Output is correct
25 Correct 186 ms 26772 KB Output is correct

Subtask #2
35.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 26772 KB Output isn't correct
2 Incorrect 4 ms 26772 KB Output isn't correct
3 Incorrect 55 ms 28012 KB Output isn't correct
4 Correct 57 ms 29876 KB Output is correct
5 Correct 65 ms 31380 KB Output is correct
6 Correct 266 ms 58088 KB Output is correct
7 Incorrect 4 ms 58088 KB Output isn't correct
8 Incorrect 4 ms 58088 KB Output isn't correct
9 Incorrect 4 ms 58088 KB Output isn't correct
10 Correct 4 ms 58088 KB Output is correct
11 Correct 4 ms 58088 KB Output is correct
12 Correct 4 ms 58088 KB Output is correct
13 Correct 4 ms 58088 KB Output is correct
14 Incorrect 4 ms 58088 KB Output isn't correct
15 Incorrect 4 ms 58088 KB Output isn't correct
16 Incorrect 4 ms 58088 KB Output isn't correct
17 Incorrect 4 ms 58088 KB Output isn't correct
18 Correct 4 ms 58088 KB Output is correct
19 Correct 5 ms 58088 KB Output is correct
20 Correct 4 ms 58088 KB Output is correct
21 Correct 5 ms 58088 KB Output is correct
22 Incorrect 4 ms 58088 KB Output isn't correct
23 Incorrect 52 ms 58088 KB Output isn't correct
24 Incorrect 56 ms 58088 KB Output isn't correct
25 Incorrect 55 ms 58088 KB Output isn't correct
26 Correct 56 ms 58088 KB Output is correct
27 Correct 59 ms 58088 KB Output is correct
28 Correct 57 ms 58088 KB Output is correct
29 Correct 197 ms 67356 KB Output is correct
30 Incorrect 66 ms 67356 KB Output isn't correct
31 Incorrect 56 ms 67356 KB Output isn't correct
32 Incorrect 63 ms 67356 KB Output isn't correct
33 Incorrect 56 ms 67356 KB Output isn't correct
34 Correct 56 ms 67356 KB Output is correct
35 Correct 59 ms 67356 KB Output is correct
36 Correct 55 ms 67356 KB Output is correct
37 Correct 316 ms 89708 KB Output is correct
38 Incorrect 66 ms 89708 KB Output isn't correct
39 Incorrect 58 ms 89708 KB Output isn't correct
40 Incorrect 86 ms 89708 KB Output isn't correct
41 Incorrect 60 ms 89708 KB Output isn't correct
42 Correct 63 ms 89708 KB Output is correct
43 Correct 61 ms 89708 KB Output is correct
44 Correct 56 ms 89708 KB Output is correct
45 Correct 201 ms 103352 KB Output is correct
46 Incorrect 58 ms 103352 KB Output isn't correct
47 Incorrect 56 ms 103352 KB Output isn't correct
48 Incorrect 58 ms 103352 KB Output isn't correct
49 Incorrect 55 ms 103352 KB Output isn't correct
50 Correct 55 ms 103352 KB Output is correct
51 Correct 54 ms 103352 KB Output is correct
52 Correct 60 ms 103352 KB Output is correct
53 Correct 227 ms 119032 KB Output is correct
54 Incorrect 58 ms 119032 KB Output isn't correct