| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 462462 |
2021-08-10T14:56:11 Z |
Yeboi |
Pipes (BOI13_pipes) |
C++14 |
|
537 ms |
36512 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?
rep(i,n){
if(adj[i].size() == 1){
upedge[i] = arr[i];
}
}
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++)
......
172 | rep(i,cycle.size()){
| ~~~~~~~~~~~~~~
pipes.cpp:172:9: note: in expansion of macro 'rep'
172 | 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++)
......
179 | rep(j,cycle.size()){
| ~~~~~~~~~~~~~~
pipes.cpp:179:13: note: in expansion of macro 'rep'
179 | 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++)
......
195 | rep(i,cycle.size()){
| ~~~~~~~~~~~~~~
pipes.cpp:195:13: note: in expansion of macro 'rep'
195 | 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++)
......
206 | f(i,1,cycle.size()){
| ~~~~~~~~~~~~~~~~
pipes.cpp:206:13: note: in expansion of macro 'f'
206 | 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++)
......
215 | f(i,1,cycle.size()-1){
| ~~~~~~~~~~~~~~~~~~
pipes.cpp:215:13: note: in expansion of macro 'f'
215 | 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++)
......
221 | rep(i,edges.size()){
| ~~~~~~~~~~~~~~
pipes.cpp:221:13: note: in expansion of macro 'rep'
221 | rep(i,edges.size()){
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2684 KB |
Output is correct |
| 3 |
Correct |
4 ms |
2764 KB |
Output is correct |
| 4 |
Correct |
329 ms |
23184 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 6 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 7 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 9 |
Correct |
4 ms |
2764 KB |
Output is correct |
| 10 |
Correct |
4 ms |
2764 KB |
Output is correct |
| 11 |
Correct |
4 ms |
2764 KB |
Output is correct |
| 12 |
Correct |
5 ms |
2892 KB |
Output is correct |
| 13 |
Correct |
259 ms |
18996 KB |
Output is correct |
| 14 |
Correct |
328 ms |
22160 KB |
Output is correct |
| 15 |
Correct |
354 ms |
23224 KB |
Output is correct |
| 16 |
Correct |
281 ms |
20156 KB |
Output is correct |
| 17 |
Correct |
334 ms |
23088 KB |
Output is correct |
| 18 |
Correct |
344 ms |
23232 KB |
Output is correct |
| 19 |
Correct |
338 ms |
26544 KB |
Output is correct |
| 20 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 21 |
Correct |
4 ms |
2764 KB |
Output is correct |
| 22 |
Correct |
389 ms |
23228 KB |
Output is correct |
| 23 |
Correct |
254 ms |
18992 KB |
Output is correct |
| 24 |
Correct |
334 ms |
23452 KB |
Output is correct |
| 25 |
Correct |
268 ms |
19752 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 2 |
Correct |
4 ms |
2892 KB |
Output is correct |
| 3 |
Correct |
56 ms |
13236 KB |
Output is correct |
| 4 |
Correct |
55 ms |
8972 KB |
Output is correct |
| 5 |
Correct |
50 ms |
9172 KB |
Output is correct |
| 6 |
Correct |
219 ms |
25904 KB |
Output is correct |
| 7 |
Correct |
2 ms |
2636 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 |
2 ms |
2636 KB |
Output is correct |
| 12 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2636 KB |
Output is correct |
| 14 |
Incorrect |
2 ms |
2636 KB |
Output isn't correct |
| 15 |
Correct |
4 ms |
2892 KB |
Output is correct |
| 16 |
Correct |
6 ms |
2892 KB |
Output is correct |
| 17 |
Correct |
2 ms |
2764 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 |
2 ms |
2764 KB |
Output is correct |
| 22 |
Correct |
5 ms |
3008 KB |
Output is correct |
| 23 |
Incorrect |
350 ms |
26804 KB |
Output isn't correct |
| 24 |
Correct |
462 ms |
33368 KB |
Output is correct |
| 25 |
Correct |
60 ms |
13256 KB |
Output is correct |
| 26 |
Correct |
49 ms |
9068 KB |
Output is correct |
| 27 |
Correct |
50 ms |
8852 KB |
Output is correct |
| 28 |
Correct |
52 ms |
9516 KB |
Output is correct |
| 29 |
Correct |
168 ms |
21704 KB |
Output is correct |
| 30 |
Incorrect |
439 ms |
35036 KB |
Output isn't correct |
| 31 |
Incorrect |
429 ms |
30596 KB |
Output isn't correct |
| 32 |
Correct |
537 ms |
36040 KB |
Output is correct |
| 33 |
Correct |
57 ms |
14260 KB |
Output is correct |
| 34 |
Correct |
62 ms |
9036 KB |
Output is correct |
| 35 |
Correct |
68 ms |
9008 KB |
Output is correct |
| 36 |
Correct |
63 ms |
9264 KB |
Output is correct |
| 37 |
Correct |
219 ms |
25904 KB |
Output is correct |
| 38 |
Correct |
474 ms |
33976 KB |
Output is correct |
| 39 |
Correct |
466 ms |
36288 KB |
Output is correct |
| 40 |
Correct |
445 ms |
33696 KB |
Output is correct |
| 41 |
Correct |
77 ms |
16284 KB |
Output is correct |
| 42 |
Correct |
56 ms |
8876 KB |
Output is correct |
| 43 |
Correct |
51 ms |
8916 KB |
Output is correct |
| 44 |
Correct |
50 ms |
9116 KB |
Output is correct |
| 45 |
Correct |
186 ms |
22664 KB |
Output is correct |
| 46 |
Incorrect |
478 ms |
36512 KB |
Output isn't correct |
| 47 |
Correct |
454 ms |
33588 KB |
Output is correct |
| 48 |
Correct |
405 ms |
31004 KB |
Output is correct |
| 49 |
Correct |
52 ms |
11428 KB |
Output is correct |
| 50 |
Correct |
50 ms |
9088 KB |
Output is correct |
| 51 |
Correct |
56 ms |
9232 KB |
Output is correct |
| 52 |
Correct |
49 ms |
8928 KB |
Output is correct |
| 53 |
Correct |
176 ms |
22792 KB |
Output is correct |
| 54 |
Incorrect |
467 ms |
35484 KB |
Output isn't correct |
