oj.uz

Submission #267160

# Submission time Handle Problem Language Result Execution time Memory
267160 2020-08-15T22:25:44 Z shrek12357 Pipes (BOI13_pipes) C++14
100 / 100
 307 ms 35320 KB 
#include<iostream>
#include<stdio.h>
#include<vector>
#include<cmath>
#include<queue>
#include<string.h>
#include<map>
#include<set>
#include<algorithm>
#include<stack>
#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],deg[N];
bool vis[N],cycle;
vector < vector < pi > > graph(N);
vector < pi > neo;
 
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];
    }
 
    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;
        }
    }
    else
    {
        ll nodes = n;
        stack < pi > s;
 
        rep(i,1,n+1)
        {
            deg[i] = graph[i].size();
 
            if(deg[i] == 1)
            {
                vis[i] = true;
                s.push(mp(i,graph[i][0].second));
            }
        }
 
        while(!s.empty())
        {
            nodes--;
            ll cur = s.top().first;
            ll e = s.top().second;
            s.pop();
            deg[cur]--;
 
          //  cout << cur << " " << e << endl;
            val[e] = ar[cur];
 
       //     cout << deg[1] <<endl;
 
            rep(i,0,graph[cur].size())
            {
                ll v = graph[cur][i].first;
 
                if(deg[v] <= 1)
                    continue;
 
                ar[v] -= val[e];
 
                deg[v]--;
                graph[v].erase(find(graph[v].begin(),graph[v].end(),mp(cur,graph[cur][i].second)));
 
             //   cout << v << " " << deg[v] << endl;
 
                if(deg[v] == 1)
                {
                    vis[v] = true;
                    s.push(mp(v,graph[v][0].second));
                }
            }
        }
 
        ll st = 1;
 
        while(vis[st])
        {
            st++;
        }
 
        ll start = st;
 
        while(!vis[start])
        {
            pi potential;
            bool found = false;
            rep(i,0,graph[st].size())
            {
                ll v =  graph[st][i].first;
 
                if(!vis[v])
                {
                    if(v == start)
                    {
                        potential = mp(st,graph[st][i].second);
                        continue;
                    }
 
                    found = true;
                    neo.push_back(mp(st,graph[st][i].second));
                    vis[v] = true;
                    st = v;
                    break;
                }
            }
 
            if(!found)
            {
                vis[start] = true;
                neo.push_back(potential);
                st = start;
            }
        }
 
        if((neo.size())%2==0)
        {
            cout << 0 << endl;
        }
        else
        {
            ll s = 0;
 
            rep(i,0,neo.size())
            {
                s += ar[neo[i].first]*pow(-1,i%2);
            }
 
            val[neo[neo.size()-1].second] = s/2;
            val[neo[0].second] = ar[neo[0].first] - s/2;
 
            rep(i,1,neo.size()-1)
            {
                val[neo[i].second] =ar[neo[i].first]  - val[neo[i-1].second];
            }
 
            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:14:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 | #define rep(i,a,b) for(int i = a;i < b;i++)
......
   27 |     rep(i,0,graph[cur].size())
      |         ~~~~~~~~~~~~~~~~~~~~~       
pipes.cpp:27:5: note: in expansion of macro 'rep'
   27 |     rep(i,0,graph[cur].size())
      |     ^~~
pipes.cpp: In function 'int main()':
pipes.cpp:14:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 | #define rep(i,a,b) for(int i = a;i < b;i++)
......
  106 |             rep(i,0,graph[cur].size())
      |                 ~~~~~~~~~~~~~~~~~~~~~
pipes.cpp:106:13: note: in expansion of macro 'rep'
  106 |             rep(i,0,graph[cur].size())
      |             ^~~
pipes.cpp:14:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 | #define rep(i,a,b) for(int i = a;i < b;i++)
......
  141 |             rep(i,0,graph[st].size())
      |                 ~~~~~~~~~~~~~~~~~~~~
pipes.cpp:141:13: note: in expansion of macro 'rep'
  141 |             rep(i,0,graph[st].size())
      |             ^~~
pipes.cpp:14:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 | #define rep(i,a,b) for(int i = a;i < b;i++)
......
  177 |             rep(i,0,neo.size())
      |                 ~~~~~~~~~~~~~~      
pipes.cpp:177:13: note: in expansion of macro 'rep'
  177 |             rep(i,0,neo.size())
      |             ^~~
pipes.cpp:14:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 | #define rep(i,a,b) for(int i = a;i < b;i++)
......
  185 |             rep(i,1,neo.size()-1)
      |                 ~~~~~~~~~~~~~~~~    
pipes.cpp:185:13: note: in expansion of macro 'rep'
  185 |             rep(i,1,neo.size()-1)
      |             ^~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 5 ms 2816 KB Output is correct
4 Correct 278 ms 11384 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 2 ms 2688 KB Output is correct
9 Correct 4 ms 2816 KB Output is correct
10 Correct 5 ms 2816 KB Output is correct
11 Correct 5 ms 2816 KB Output is correct
12 Correct 5 ms 2816 KB Output is correct
13 Correct 221 ms 9592 KB Output is correct
14 Correct 263 ms 10964 KB Output is correct
15 Correct 292 ms 11512 KB Output is correct
16 Correct 240 ms 10160 KB Output is correct
17 Correct 293 ms 11428 KB Output is correct
18 Correct 281 ms 11384 KB Output is correct
19 Correct 287 ms 14456 KB Output is correct
20 Correct 3 ms 2816 KB Output is correct
21 Correct 5 ms 2816 KB Output is correct
22 Correct 304 ms 11408 KB Output is correct
23 Correct 219 ms 9592 KB Output is correct
24 Correct 290 ms 11384 KB Output is correct
25 Correct 239 ms 10048 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 5 ms 2816 KB Output is correct
3 Correct 77 ms 12916 KB Output is correct
4 Correct 65 ms 10232 KB Output is correct
5 Correct 67 ms 9976 KB Output is correct
6 Correct 254 ms 35320 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 3 ms 2688 KB Output is correct
9 Correct 2 ms 2688 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 3 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 6 ms 2816 KB Output is correct
16 Correct 5 ms 2816 KB Output is correct
17 Correct 2 ms 2816 KB Output is correct
18 Correct 3 ms 2816 KB Output is correct
19 Correct 2 ms 2816 KB Output is correct
20 Correct 3 ms 2816 KB Output is correct
21 Correct 3 ms 2944 KB Output is correct
22 Correct 5 ms 2816 KB Output is correct
23 Correct 234 ms 11832 KB Output is correct
24 Correct 286 ms 13592 KB Output is correct
25 Correct 64 ms 12916 KB Output is correct
26 Correct 50 ms 10232 KB Output is correct
27 Correct 52 ms 10232 KB Output is correct
28 Correct 52 ms 10616 KB Output is correct
29 Correct 197 ms 29236 KB Output is correct
30 Correct 281 ms 13148 KB Output is correct
31 Correct 287 ms 14060 KB Output is correct
32 Correct 294 ms 13200 KB Output is correct
33 Correct 65 ms 13288 KB Output is correct
34 Correct 54 ms 10408 KB Output is correct
35 Correct 53 ms 10232 KB Output is correct
36 Correct 51 ms 10360 KB Output is correct
37 Correct 244 ms 35296 KB Output is correct
38 Correct 296 ms 13340 KB Output is correct
39 Correct 283 ms 13028 KB Output is correct
40 Correct 287 ms 13544 KB Output is correct
41 Correct 73 ms 14064 KB Output is correct
42 Correct 66 ms 10232 KB Output is correct
43 Correct 54 ms 10232 KB Output is correct
44 Correct 53 ms 9976 KB Output is correct
45 Correct 216 ms 31792 KB Output is correct
46 Correct 294 ms 13040 KB Output is correct
47 Correct 307 ms 13624 KB Output is correct
48 Correct 291 ms 14188 KB Output is correct
49 Correct 72 ms 12132 KB Output is correct
50 Correct 61 ms 10232 KB Output is correct
51 Correct 49 ms 10232 KB Output is correct
52 Correct 70 ms 10360 KB Output is correct
53 Correct 208 ms 31224 KB Output is correct
54 Correct 300 ms 13040 KB Output is correct