| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 78929 | 2018-10-09T16:15:53 Z | Charis02 | Pipes (BOI13_pipes) | C++14 | 1000 ms | 62372 KB |
/*
solution is the same as described here: https://boi2013.informatik-olympiade.de/wp-content/uploads/2013/05/pipes-spoiler.pdf
*/
#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;
vector < pi > edges;
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));
edges.push_back(mp(a,b));
}
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
{
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())
{
ll cur = s.top().first;
ll e = s.top().second;
s.pop();
val[e] = ar[cur];
rep(i,0,graph[cur].size())
{
ll v = graph[cur][i].first;
if(vis[v])
continue;
ar[v] -= val[e];
deg[v]--;
graph[v].erase(find(graph[v].begin(),graph[v].end(),mp(v,graph[v][i].second)));
if(deg[v] == 1)
{
s.push(mp(v,graph[v][0].second));
}
}
}
ll st = 1;
while(vis[st])
{
st++;
}
ll start = st;
while(!vis[start])
{
rep(i,0,graph[st].size())
{
ll v= graph[st][i].first;
if(!vis[v])
{
neo.push_back(mp(st,graph[st][i].second));
vis[v] = true;
st = v;
break;
}
}
}
/* cout << neo.size() << endl;
rep(i,0,neo.size())
{
cout << neo[i].first << " " << ar[neo[i].first] << endl;
}
*/
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;
}
/*
3 3
1 3 2
1 2
1 3
2 3
4 4
1 3 2 -4
1 2
4 3
2 3
2 4
*/
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 4 ms | 2680 KB | Output is correct |
| 2 | Correct | 4 ms | 2944 KB | Output is correct |
| 3 | Correct | 6 ms | 3004 KB | Output is correct |
| 4 | Correct | 235 ms | 13220 KB | Output is correct |
| 5 | Correct | 4 ms | 13220 KB | Output is correct |
| 6 | Correct | 4 ms | 13220 KB | Output is correct |
| 7 | Correct | 4 ms | 13220 KB | Output is correct |
| 8 | Correct | 4 ms | 13220 KB | Output is correct |
| 9 | Correct | 6 ms | 13220 KB | Output is correct |
| 10 | Correct | 6 ms | 13220 KB | Output is correct |
| 11 | Correct | 6 ms | 13220 KB | Output is correct |
| 12 | Correct | 7 ms | 13220 KB | Output is correct |
| 13 | Correct | 187 ms | 13220 KB | Output is correct |
| 14 | Correct | 225 ms | 15572 KB | Output is correct |
| 15 | Correct | 238 ms | 17684 KB | Output is correct |
| 16 | Correct | 201 ms | 17812 KB | Output is correct |
| 17 | Correct | 231 ms | 20656 KB | Output is correct |
| 18 | Correct | 249 ms | 22172 KB | Output is correct |
| 19 | Correct | 271 ms | 26820 KB | Output is correct |
| 20 | Correct | 4 ms | 26820 KB | Output is correct |
| 21 | Correct | 6 ms | 26820 KB | Output is correct |
| 22 | Correct | 223 ms | 26820 KB | Output is correct |
| 23 | Correct | 179 ms | 26820 KB | Output is correct |
| 24 | Correct | 240 ms | 28164 KB | Output is correct |
| 25 | Correct | 197 ms | 28164 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 4 ms | 28164 KB | Output isn't correct |
| 2 | Incorrect | 5 ms | 28164 KB | Output isn't correct |
| 3 | Correct | 81 ms | 31308 KB | Output is correct |
| 4 | Correct | 70 ms | 31428 KB | Output is correct |
| 5 | Correct | 64 ms | 32644 KB | Output is correct |
| 6 | Correct | 316 ms | 62372 KB | Output is correct |
| 7 | Incorrect | 4 ms | 62372 KB | Output isn't correct |
| 8 | Execution timed out | 1078 ms | 62372 KB | Time limit exceeded |
| 9 | Correct | 4 ms | 62372 KB | Output is correct |
| 10 | Correct | 4 ms | 62372 KB | Output is correct |
| 11 | Correct | 4 ms | 62372 KB | Output is correct |
| 12 | Correct | 4 ms | 62372 KB | Output is correct |
| 13 | Correct | 4 ms | 62372 KB | Output is correct |
| 14 | Incorrect | 5 ms | 62372 KB | Output isn't correct |
| 15 | Incorrect | 4 ms | 62372 KB | Output isn't correct |
| 16 | Incorrect | 4 ms | 62372 KB | Output isn't correct |
| 17 | Correct | 5 ms | 62372 KB | Output is correct |
| 18 | Correct | 5 ms | 62372 KB | Output is correct |
| 19 | Correct | 4 ms | 62372 KB | Output is correct |
| 20 | Correct | 4 ms | 62372 KB | Output is correct |
| 21 | Correct | 5 ms | 62372 KB | Output is correct |
| 22 | Incorrect | 4 ms | 62372 KB | Output isn't correct |
| 23 | Incorrect | 61 ms | 62372 KB | Output isn't correct |
| 24 | Incorrect | 80 ms | 62372 KB | Output isn't correct |
| 25 | Correct | 76 ms | 62372 KB | Output is correct |
| 26 | Correct | 90 ms | 62372 KB | Output is correct |
| 27 | Correct | 68 ms | 62372 KB | Output is correct |
| 28 | Correct | 68 ms | 62372 KB | Output is correct |
| 29 | Correct | 255 ms | 62372 KB | Output is correct |
| 30 | Incorrect | 68 ms | 62372 KB | Output isn't correct |
| 31 | Incorrect | 74 ms | 62372 KB | Output isn't correct |
| 32 | Incorrect | 80 ms | 62372 KB | Output isn't correct |
| 33 | Correct | 76 ms | 62372 KB | Output is correct |
| 34 | Correct | 67 ms | 62372 KB | Output is correct |
| 35 | Correct | 71 ms | 62372 KB | Output is correct |
| 36 | Correct | 70 ms | 62372 KB | Output is correct |
| 37 | Correct | 299 ms | 62372 KB | Output is correct |
| 38 | Incorrect | 72 ms | 62372 KB | Output isn't correct |
| 39 | Execution timed out | 1088 ms | 62372 KB | Time limit exceeded |
| 40 | Incorrect | 80 ms | 62372 KB | Output isn't correct |
| 41 | Correct | 68 ms | 62372 KB | Output is correct |
| 42 | Correct | 71 ms | 62372 KB | Output is correct |
| 43 | Correct | 66 ms | 62372 KB | Output is correct |
| 44 | Correct | 83 ms | 62372 KB | Output is correct |
| 45 | Correct | 241 ms | 62372 KB | Output is correct |
| 46 | Incorrect | 72 ms | 62372 KB | Output isn't correct |
| 47 | Incorrect | 71 ms | 62372 KB | Output isn't correct |
| 48 | Incorrect | 68 ms | 62372 KB | Output isn't correct |
| 49 | Execution timed out | 1084 ms | 62372 KB | Time limit exceeded |
| 50 | Correct | 69 ms | 62372 KB | Output is correct |
| 51 | Correct | 106 ms | 62372 KB | Output is correct |
| 52 | Correct | 65 ms | 62372 KB | Output is correct |
| 53 | Correct | 262 ms | 62372 KB | Output is correct |
| 54 | Incorrect | 67 ms | 62372 KB | Output isn't correct |