# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
548001 | Amylopectin | Pipes (BOI13_pipes) | C++14 | 208 ms | 53128 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
const long long mxn = 6e5 + 10;
struct we
{
long long to,num;
};
queue<long long> qu;
vector<struct we> pa[mxn] = {};
long long patva[mxn] = {},nva[mxn] = {},ind[mxn] = {},u[mxn] = {},upa[mxn] = {},sta = 0,li[mxn] = {},pnu[mxn] = {};
long long re(long long cn,long long be,long long cou)
{
long long i,j,fn,cnu;
u[cn] = 1;
li[cou] = cn;
for(i=0; i<pa[cn].size(); i++)
{
fn = pa[cn][i].to;
cnu = pa[cn][i].num;
if(cou > 1 && fn == li[0])
{
pnu[cou] = cnu;
}
if(u[fn] == 1)
continue;
pnu[cou] = cnu;
re(fn,cn,cou+1);
}
}
int main()
{
long long i,j,n,m,cn,cm,fn,fm,cou = 0,cnu,of,cyn,st,su,csu;
scanf("%lld %lld",&n,&m);
for(i=1; i<=n; i++)
{
scanf("%lld",&nva[i]);
}
for(j=0; j<m; j++)
{
scanf("%lld %lld",&cn,&cm);
pa[cn].push_back({cm,j});
pa[cm].push_back({cn,j});
ind[cn] ++;
ind[cm] ++;
}
if(m > n)
{
printf("0\n");
return 0;
}
for(i=1; i<=n; i++)
{
if(ind[i] == 1)
{
qu.push(i);
u[i] = 1;
cou ++;
}
}
if(m == n-1)
{
while(!qu.empty())
{
cn = qu.front();
qu.pop();
// of = 1;
for(i=0; i<pa[cn].size(); i++)
{
fn = pa[cn][i].to;
cnu = pa[cn][i].num;
if(upa[cnu] == 1)
continue;
upa[cnu] = 1;
// of = 0;
ind[fn] --;
patva[cnu] = nva[cn];
nva[fn] -= nva[cn];
if(u[fn] == 1)
{
if(nva[fn] != 0)
{
printf("0\n");
return 0;
}
}
if(ind[fn] == 1)
{
u[fn] = 1;
qu.push(fn);
cou ++;
}
}
// if(of == 1)
// {
// if()
// }
}
for(i=0; i<m; i++)
{
printf("%lld\n",patva[i] * 2);
}
}
else
{
while(!qu.empty())
{
cn = qu.front();
qu.pop();
for(i=0; i<pa[cn].size(); i++)
{
fn = pa[cn][i].to;
cnu = pa[cn][i].num;
if(upa[cnu] == 1)
continue;
upa[cnu] = 1;
ind[fn] --;
patva[cnu] = nva[cn];
nva[fn] -= nva[cn];
if(ind[fn] == 1)
{
u[fn] = 1;
qu.push(fn);
cou ++;
}
}
}
cyn = n-cou;
if(cyn%2 == 0)
{
printf("0\n");
return 0;
}
su = 0;
for(i=1; i<=n; i++)
{
if(u[i] == 0)
{
su += nva[i];
st = i;
}
}
if(su % 2 == 1)
{
printf("0\n");
return 0;
}
re(st,-1,0);
csu = 0;
for(i=cyn-1; i>0; i-=2)
{
csu += nva[li[i]];
}
patva[pnu[0]] = su/2 - csu;
for(i=1; i<cyn; i++)
{
patva[pnu[i]] = nva[li[i]] - patva[pnu[i-1]];
}
if(patva[pnu[0]] + patva[pnu[cyn-1]] != nva[li[0]])
{
printf("0\n");
return 0;
}
for(i=0; i<m; i++)
{
printf("%lld\n",patva[i] * 2);
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |