oj.uz

Submission #207267

# Submission time Handle Problem Language Result Execution time Memory
207267 2020-03-06T20:58:14 Z MvC Pipes (BOI13_pipes) C++11
65 / 100
 99 ms 19316 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=5e5+50;
const int mod=1e9+7;
using namespace std;
int n,m,i,ex[nmax],ey[nmax],deg[nmax],vl[nmax],vl1[nmax],rs[nmax],viz[nmax],g[nmax],cur,x,y,st;
vector<int>vc,a[nmax];
queue<int>q;
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m;
	if(m>n)rc(0);
	for(i=1;i<=n;i++)cin>>g[i];
	for(i=1;i<=m;i++)
	{
		cin>>ex[i]>>ey[i];
		a[ex[i]].pb(i);
		a[ey[i]].pb(i);
	}
	for(i=1;i<=n;i++)
	{
		deg[i]=(int)a[i].size();
		if(deg[i]==1)q.push(i),viz[i]=1;
	}
	while(!q.empty())
	{
		x=q.front();
		q.pop();
		for(i=0;i<(int)a[x].size();i++)
		{
			y=ex[a[x][i]]^ey[a[x][i]]^x;
			if(!deg[y])continue;
			rs[a[x][i]]=2*(g[x]-vl[x]);
			vl[y]+=g[x]-vl[x];
			vl[x]=g[x];
			deg[y]--;
			deg[x]--;
			if(deg[y]==1)
			{
				viz[y]=1;
				q.push(y);
			}
		}
	}
	x=0;
	for(i=1;i<=n;i++)if(deg[i])x=i;
	st=x;
	while(1)
	{
		viz[x]=1;
		for(i=0;i<(int)a[x].size();i++)
		{
			y=ex[a[x][i]]^ey[a[x][i]]^x;
			if((!deg[y] || viz[y]) && y!=st)continue;
			vc.pb(a[x][i]);
			x=y;
			break;
		}
		if(st==x)break;
	}
	if((int)vc.size()&1)rc(0);
	for(i=1;i<=n;i++)vl1[i]=vl[i];
	x=st;
	for(i=0;i<(int)vc.size();i++)
	{
		y=ex[vc[i]]^ey[vc[i]]^x;
		vl1[y]+=g[x]-vl1[x];
		vl1[x]=g[x];
		x=y;
	}
	cur=(g[x]-vl1[x])/2;
	x=st;
	for(i=0;i<(int)vc.size();i++)
	{
		y=ex[vc[i]]^ey[vc[i]]^x;
		cur+=g[x]-vl[x];
		vl[y]+=cur;
		vl[x]+=cur;
		rs[vc[i]]=2*cur;
		cur=0;
		x=y;
	}
	for(i=1;i<=m;i++)cout<<rs[i]<<'\n';
	return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12152 KB Output is correct
2 Correct 12 ms 12156 KB Output is correct
3 Correct 13 ms 12152 KB Output is correct
4 Correct 97 ms 19164 KB Output is correct
5 Correct 13 ms 12152 KB Output is correct
6 Correct 14 ms 12152 KB Output is correct
7 Correct 12 ms 12152 KB Output is correct
8 Correct 12 ms 12152 KB Output is correct
9 Correct 13 ms 12152 KB Output is correct
10 Correct 13 ms 12280 KB Output is correct
11 Correct 13 ms 12152 KB Output is correct
12 Correct 13 ms 12152 KB Output is correct
13 Correct 69 ms 17760 KB Output is correct
14 Correct 82 ms 18740 KB Output is correct
15 Correct 89 ms 19160 KB Output is correct
16 Correct 75 ms 18168 KB Output is correct
17 Correct 91 ms 19164 KB Output is correct
18 Correct 87 ms 19164 KB Output is correct
19 Correct 99 ms 18808 KB Output is correct
20 Correct 12 ms 12152 KB Output is correct
21 Correct 13 ms 12152 KB Output is correct
22 Correct 88 ms 19160 KB Output is correct
23 Correct 72 ms 17656 KB Output is correct
24 Correct 90 ms 19160 KB Output is correct
25 Correct 71 ms 17996 KB Output is correct

Subtask #2
35.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 12152 KB Output isn't correct
2 Incorrect 14 ms 12152 KB Output isn't correct
3 Incorrect 95 ms 18940 KB Output isn't correct
4 Correct 12 ms 12024 KB Output is correct
5 Correct 13 ms 12028 KB Output is correct
6 Correct 12 ms 12024 KB Output is correct
7 Incorrect 12 ms 12152 KB Output isn't correct
8 Incorrect 12 ms 12152 KB Output isn't correct
9 Incorrect 12 ms 12152 KB Output isn't correct
10 Correct 13 ms 12024 KB Output is correct
11 Correct 13 ms 12152 KB Output is correct
12 Correct 13 ms 12024 KB Output is correct
13 Correct 13 ms 12024 KB Output is correct
14 Incorrect 13 ms 12024 KB Output isn't correct
15 Incorrect 14 ms 12280 KB Output isn't correct
16 Incorrect 13 ms 12152 KB Output isn't correct
17 Incorrect 15 ms 12152 KB Output isn't correct
18 Correct 13 ms 12204 KB Output is correct
19 Correct 12 ms 12024 KB Output is correct
20 Correct 13 ms 12024 KB Output is correct
21 Correct 12 ms 12024 KB Output is correct
22 Incorrect 15 ms 12152 KB Output isn't correct
23 Incorrect 65 ms 17400 KB Output isn't correct
24 Incorrect 80 ms 18424 KB Output isn't correct
25 Incorrect 92 ms 18932 KB Output isn't correct
26 Correct 13 ms 12024 KB Output is correct
27 Correct 13 ms 12028 KB Output is correct
28 Correct 12 ms 12024 KB Output is correct
29 Correct 13 ms 12024 KB Output is correct
30 Incorrect 86 ms 18460 KB Output isn't correct
31 Incorrect 80 ms 18680 KB Output isn't correct
32 Incorrect 85 ms 18296 KB Output isn't correct
33 Incorrect 93 ms 19316 KB Output isn't correct
34 Correct 13 ms 12024 KB Output is correct
35 Correct 12 ms 12024 KB Output is correct
36 Correct 12 ms 12024 KB Output is correct
37 Correct 13 ms 12152 KB Output is correct
38 Incorrect 92 ms 18520 KB Output isn't correct
39 Incorrect 84 ms 18364 KB Output isn't correct
40 Incorrect 80 ms 18424 KB Output isn't correct
41 Incorrect 99 ms 19316 KB Output isn't correct
42 Correct 13 ms 12024 KB Output is correct
43 Correct 12 ms 12152 KB Output is correct
44 Correct 13 ms 12024 KB Output is correct
45 Correct 12 ms 12024 KB Output is correct
46 Incorrect 80 ms 18424 KB Output isn't correct
47 Incorrect 83 ms 18424 KB Output isn't correct
48 Incorrect 81 ms 18696 KB Output isn't correct
49 Incorrect 82 ms 18816 KB Output isn't correct
50 Correct 12 ms 12024 KB Output is correct
51 Correct 13 ms 12024 KB Output is correct
52 Correct 12 ms 12024 KB Output is correct
53 Correct 14 ms 12024 KB Output is correct
54 Incorrect 83 ms 18296 KB Output isn't correct