| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 58597 |
2018-07-18T11:21:19 Z |
Batrr |
Pipes (BOI13_pipes) |
C++14 |
|
458 ms |
50988 KB |
#include <bits/stdc++.h>
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
*/
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define IOS ios_base::sync_with_stdio(0);
using namespace std;
const ll maxn=5e5+123,inf=1e18,mod=1e9+7,N=360360,LOG=20;
vector< pair<int,int> >g[maxn],G[maxn],path;
ll n,m,cnt[maxn],ans[maxn],a[maxn],mm;
bitset<maxn>used;
void dfs(int v,int st){
used[v]=1;
for(int i=0;i<G[v].size();i++){
int to=G[v][i].f;
if(to==st)
path.pb(G[v][i]);
if(!used[to]){
path.pb(G[v][i]);
dfs(to,st);
}
}
}
int main(){
#ifdef LOCAL
freopen ("test.in", "r", stdin);
#endif
IOS
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=m;i++){
int v,u;
cin>>v>>u;
g[v].pb({u,i});
g[u].pb({v,i});
}
queue<int>q;
for(int i=1;i<=n;i++){
cnt[i]=g[i].size();
if(cnt[i]==1)
q.push(i);
}
while(!q.empty()){
int v=q.front();
q.pop();
used[v]=1;
for(auto to:g[v])
if(!used[to.f]){
cnt[to.f]--;
if(cnt[to.f]==1)
q.push(to.f);
ans[to.s]=a[v]*2;
a[to.f]-=a[v];
}
}
mm=0;
for(int v=1;v<=n;v++){
if(used[v])
continue;
for(auto to:g[v])
if(!used[to.f]){
mm++;
G[v].pb(to);
}
}
for(int i=1;i<=n;i++)
if(!used[i] && G[i].size()!=2)
m=-1;
if( n==used.count()){
bool ok=1;
for(int i=1;i<=n;i++)
if(a[i]!=0)
ok=0;
if(!ok)
cout<<0,exit(0);
for(int i=1;i<=m;i++)
cout<<ans[i]<<endl;
return 0;
}
if( (n-used.count())%2==0 || mm!=n-used.count())
cout<<0,exit(0);
for(int i=1;i<=n;i++)
if(!used[i]){
dfs(i,i);
if( (n-used.count())!=0 )
cout<<0,exit(0);
ll x=0;
for(int i=0;i<path.size();i++){
if(i%2==0)
x+=a[path[i].f];
else
x-=a[path[i].f];
}
a[path[path.size()-1].f]-=x;
a[path[0].f]-=x;
for(int i=1;i<path.size();i++){
a[path[i].f]-=a[path[i-1].f];
a[path[i-1].f]-=a[path[i-1].f];
}
bool ok=1;
for(int i=1;i<=n;i++)
if(a[i]!=0)
ok=0;
if(!ok)
cout<<0,exit(0);
for(int i=1;i<=m;i++)
cout<<ans[i]<<endl;
break;
}
}
Compilation message
pipes.cpp: In function 'void dfs(int, int)':
pipes.cpp:22:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<G[v].size();i++){
~^~~~~~~~~~~~
pipes.cpp: In function 'int main()':
pipes.cpp:79:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if( n==used.count()){
~^~~~~~~~~~~~~~
pipes.cpp:90:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if( (n-used.count())%2==0 || mm!=n-used.count())
~~^~~~~~~~~~~~~~~~
pipes.cpp:98:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<path.size();i++){
~^~~~~~~~~~~~
pipes.cpp:106:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=1;i<path.size();i++){
~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
22 ms |
23800 KB |
Output isn't correct |
| 2 |
Incorrect |
21 ms |
23912 KB |
Output isn't correct |
| 3 |
Incorrect |
27 ms |
23964 KB |
Output isn't correct |
| 4 |
Incorrect |
126 ms |
30252 KB |
Output isn't correct |
| 5 |
Incorrect |
25 ms |
30252 KB |
Output isn't correct |
| 6 |
Incorrect |
26 ms |
30252 KB |
Output isn't correct |
| 7 |
Incorrect |
27 ms |
30252 KB |
Output isn't correct |
| 8 |
Incorrect |
26 ms |
30252 KB |
Output isn't correct |
| 9 |
Incorrect |
21 ms |
30252 KB |
Output isn't correct |
| 10 |
Incorrect |
20 ms |
30252 KB |
Output isn't correct |
| 11 |
Incorrect |
22 ms |
30252 KB |
Output isn't correct |
| 12 |
Incorrect |
22 ms |
30252 KB |
Output isn't correct |
| 13 |
Incorrect |
82 ms |
30252 KB |
Output isn't correct |
| 14 |
Incorrect |
86 ms |
30252 KB |
Output isn't correct |
| 15 |
Incorrect |
92 ms |
30420 KB |
Output isn't correct |
| 16 |
Incorrect |
82 ms |
30420 KB |
Output isn't correct |
| 17 |
Incorrect |
93 ms |
30420 KB |
Output isn't correct |
| 18 |
Incorrect |
90 ms |
30436 KB |
Output isn't correct |
| 19 |
Incorrect |
121 ms |
30436 KB |
Output isn't correct |
| 20 |
Incorrect |
29 ms |
30436 KB |
Output isn't correct |
| 21 |
Incorrect |
26 ms |
30436 KB |
Output isn't correct |
| 22 |
Incorrect |
93 ms |
30532 KB |
Output isn't correct |
| 23 |
Incorrect |
117 ms |
30532 KB |
Output isn't correct |
| 24 |
Incorrect |
131 ms |
30532 KB |
Output isn't correct |
| 25 |
Incorrect |
77 ms |
30532 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
28 ms |
30532 KB |
Output isn't correct |
| 2 |
Incorrect |
21 ms |
30532 KB |
Output isn't correct |
| 3 |
Correct |
115 ms |
31052 KB |
Output is correct |
| 4 |
Correct |
155 ms |
32168 KB |
Output is correct |
| 5 |
Correct |
130 ms |
32168 KB |
Output is correct |
| 6 |
Correct |
458 ms |
50964 KB |
Output is correct |
| 7 |
Incorrect |
30 ms |
50964 KB |
Output isn't correct |
| 8 |
Incorrect |
25 ms |
50964 KB |
Output isn't correct |
| 9 |
Correct |
28 ms |
50964 KB |
Output is correct |
| 10 |
Correct |
25 ms |
50964 KB |
Output is correct |
| 11 |
Correct |
23 ms |
50964 KB |
Output is correct |
| 12 |
Correct |
22 ms |
50964 KB |
Output is correct |
| 13 |
Correct |
21 ms |
50964 KB |
Output is correct |
| 14 |
Incorrect |
27 ms |
50964 KB |
Output isn't correct |
| 15 |
Incorrect |
24 ms |
50964 KB |
Output isn't correct |
| 16 |
Incorrect |
26 ms |
50964 KB |
Output isn't correct |
| 17 |
Correct |
26 ms |
50964 KB |
Output is correct |
| 18 |
Correct |
25 ms |
50964 KB |
Output is correct |
| 19 |
Correct |
29 ms |
50964 KB |
Output is correct |
| 20 |
Correct |
27 ms |
50964 KB |
Output is correct |
| 21 |
Correct |
22 ms |
50964 KB |
Output is correct |
| 22 |
Incorrect |
24 ms |
50964 KB |
Output isn't correct |
| 23 |
Incorrect |
133 ms |
50964 KB |
Output isn't correct |
| 24 |
Incorrect |
146 ms |
50964 KB |
Output isn't correct |
| 25 |
Correct |
128 ms |
50964 KB |
Output is correct |
| 26 |
Correct |
96 ms |
50964 KB |
Output is correct |
| 27 |
Correct |
136 ms |
50964 KB |
Output is correct |
| 28 |
Correct |
144 ms |
50964 KB |
Output is correct |
| 29 |
Correct |
343 ms |
50964 KB |
Output is correct |
| 30 |
Incorrect |
98 ms |
50964 KB |
Output isn't correct |
| 31 |
Incorrect |
98 ms |
50964 KB |
Output isn't correct |
| 32 |
Incorrect |
99 ms |
50964 KB |
Output isn't correct |
| 33 |
Correct |
132 ms |
50964 KB |
Output is correct |
| 34 |
Correct |
131 ms |
50964 KB |
Output is correct |
| 35 |
Correct |
123 ms |
50964 KB |
Output is correct |
| 36 |
Correct |
153 ms |
50964 KB |
Output is correct |
| 37 |
Correct |
436 ms |
50988 KB |
Output is correct |
| 38 |
Incorrect |
168 ms |
50988 KB |
Output isn't correct |
| 39 |
Incorrect |
123 ms |
50988 KB |
Output isn't correct |
| 40 |
Incorrect |
138 ms |
50988 KB |
Output isn't correct |
| 41 |
Correct |
156 ms |
50988 KB |
Output is correct |
| 42 |
Correct |
177 ms |
50988 KB |
Output is correct |
| 43 |
Correct |
121 ms |
50988 KB |
Output is correct |
| 44 |
Correct |
133 ms |
50988 KB |
Output is correct |
| 45 |
Correct |
297 ms |
50988 KB |
Output is correct |
| 46 |
Incorrect |
138 ms |
50988 KB |
Output isn't correct |
| 47 |
Incorrect |
129 ms |
50988 KB |
Output isn't correct |
| 48 |
Incorrect |
129 ms |
50988 KB |
Output isn't correct |
| 49 |
Correct |
117 ms |
50988 KB |
Output is correct |
| 50 |
Correct |
138 ms |
50988 KB |
Output is correct |
| 51 |
Correct |
128 ms |
50988 KB |
Output is correct |
| 52 |
Correct |
118 ms |
50988 KB |
Output is correct |
| 53 |
Correct |
382 ms |
50988 KB |
Output is correct |
| 54 |
Incorrect |
131 ms |
50988 KB |
Output isn't correct |
