E. Little Pony and Summer Sun Celebration
time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Twilight Sparkle learnt that the evil Nightmare Moon would return during the upcoming Summer Sun Celebration after one thousand years of imprisonment on the moon. She tried to warn her mentor Princess Celestia, but the princess ignored her and sent her to Ponyville
to check on the preparations for the celebration.

Twilight Sparkle wanted to track the path of Nightmare Moon. Unfortunately, she didn't know the exact path. What she knew is the parity of the number of times that each place Nightmare Moon visited. Can you help Twilight Sparkle to restore any path that is
consistent with this information?

Ponyville can be represented as an undirected graph (vertices are places, edges are roads between places) without self-loops and multi-edges. The path can start and end at any place (also it can be empty). Each place can be visited multiple times. The path
must not visit more than 4n places.

Input

The first line contains two integers n and m (2 ≤ n ≤ 105; 0 ≤ m ≤ 105)
— the number of places and the number of roads in Ponyville. Each of the following m lines contains two integers ui, vi (1 ≤ ui, vi ≤ nui ≠ vi),
these integers describe a road between places ui and vi.

The next line contains n integers: x1, x2, ..., xn (0 ≤ xi ≤ 1) —
the parity of the number of times that each place must be visited. If xi = 0,
then the i-th place must be visited even number of times, else it must be visited odd number of times.

Output

Output the number of visited places k in the first line (0 ≤ k ≤ 4n).
Then output k integers — the numbers of places in the order of path. Ifxi = 0,
then the i-th place must appear in the path even number of times, else i-th
place must appear in the path odd number of times. Note, that given road system has no self-loops, therefore any two neighbouring places in the path must be distinct.

If there is no required path, output -1. If there multiple possible paths, you can output any of them.

Sample test(s)
input
3 2
1 2
2 3
1 1 1
output
3
1 2 3
input
5 7
1 2
1 3
1 4
1 5
3 4
3 5
4 5
0 1 0 1 0
output
10
2 1 3 4 5 4 5 4 3 1
input
2 0
0 0
output
0

题目大意:

给出一张图,有N个点,M条边,并给出每一个点要求訪问次数的奇偶性。,要求输出訪问路径。

解法:

首先我们能够明白一点,这就是一个图的遍历,找一个点,设为起点,建立一个搜索遍历树,对于树每个点,我们全然能够控制奇偶性,如果:

眼下訪问的点为v。父节点为fa,如若点v不符合当前的奇偶性。则就让父节点到v绕一次,这样 odd[v] ^= 1, fa[v] ^= 1,这样我们能够全然保证全然控制子节点,将不符合要求的奇偶性调整成符合要求的奇偶性。同一时候父节点的奇偶性也在改变。

通过上述的操作,我们能够每次保证子节点的奇偶性符合要求,然而父节点的奇偶性如若不符合要求,则能够通过调整父节点 与 父节点的父节点来调整奇偶性。这样我们就能够奇偶性传递,终于传递到根节点。

根节点如若不符合该怎样调整呢?因为我们是走遍历树。到达叶节点还要回来的,意味着我们要走至少两次根节点。一次是出发。一次是最后一次回归。我们能够将根节点 r1 调整到根节点的当中一个子节点r2,使得奇偶性再次得到调整

代码:

#include <cstdio>
#include <vector>
#define N_max 123456 using namespace std; int n, m, fa[N_max], want[N_max];
int Odd_n, Odd_x, haveOdd[N_max];
vector <int> G[N_max], ans; int getf(int x) {
return (fa[x] == x) ? x : fa[x] = getf(fa[x]);
}
void addedge(int x, int y) {
G[x].push_back(y);
} void init() {
scanf("%d%d", &n, &m); for (int i = 1; i <= n; i++) fa[i] = i;
for (int i = 1; i <= m; i++) {
int x, y; scanf("%d%d", &x, &y); int tmpx=getf(x);
int tmpy=getf(y);
if (tmpx != tmpy) {
fa[tmpx] = tmpy;
addedge(x, y);
addedge(y, x);
}
} for (int i = 1; i <= n; i++) {
scanf("%d", &want[i]); if (want[i]) haveOdd[getf(i)] = 1;
} for (int i = 1; i <= n; i++)
if (haveOdd[i]) {
Odd_n++;
Odd_x = i;
}
} void dfs(int now, int pre) {
ans.push_back(now);
want[now] ^= 1; for (int i = 0; i < G[now].size(); i++) {
int nex = G[now][i];
if (nex == pre) continue; dfs(nex, now);
ans.push_back(now);
want[now] ^= 1; if (want[nex]) {
ans.push_back(nex);
want[nex] ^= 1;
ans.push_back(now);
want[now] ^= 1;
}
}
} void solve() {
if (Odd_n == 0) {
printf("0\n");
return;
} if (Odd_n > 1) {
printf("-1\n");
return;
} dfs(Odd_x, -1);
int x = 0;
if (want[Odd_x]) x=1; printf("%d\n", ans.size() - x);
for (int i = x; i < ans.size(); i++)
printf("%d ", ans[i]);
} int main() {
init();
solve();
}

版权声明:本文博客原创文章,博客,未经同意,不得转载。

codeforces Round #259(div2) E解决报告的更多相关文章

  1. codeforces Round #259(div2) D解决报告

    D. Little Pony and Harmony Chest time limit per test 4 seconds memory limit per test 256 megabytes i ...

  2. codeforces Round #260(div2) D解决报告

    D. A Lot of Games time limit per test 1 second memory limit per test 256 megabytes input standard in ...

  3. codeforces Round #259(div2) C解题报告

    C. Little Pony and Expected Maximum time limit per test 1 second memory limit per test 256 megabytes ...

  4. codeforces Round #258(div2) D解题报告

    D. Count Good Substrings time limit per test 2 seconds memory limit per test 256 megabytes input sta ...

  5. Codeforces Round #259(div2)C(数学期望)

    数学题. 关键是求最大值为k时有多少种情况,结果是kn-(k-1)n-1.可以这么想:每一次都从1至k里选,共kn种,这里需要再减去每一次都从1至k-1里面选的情况.当然也可以分类计数法:按出现几次k ...

  6. codeforces Round #258(div2) C解题报告

    C. Predict Outcome of the Game time limit per test 2 seconds memory limit per test 256 megabytes inp ...

  7. Codeforces Round#320 Div2 解题报告

    Codeforces Round#320 Div2 先做个标题党,骗骗访问量,结束后再来写咯. codeforces 579A Raising Bacteria codeforces 579B Fin ...

  8. Codeforces Round #539 div2

    Codeforces Round #539 div2 abstract I 离散化三连 sort(pos.begin(), pos.end()); pos.erase(unique(pos.begin ...

  9. 【前行】◇第3站◇ Codeforces Round #512 Div2

    [第3站]Codeforces Round #512 Div2 第三题莫名卡半天……一堆细节没处理,改一个发现还有一个……然后就炸了,罚了一啪啦时间 Rating又掉了……但是没什么,比上一次好多了: ...

随机推荐

  1. EF 执行视图

    IEnumerable<V_stocks> summary = db.Database.SqlQuery<V_stocks>("SELECT * FROM dbo.V ...

  2. ThinkPHP 连接Oracle的配置写法,(使用Oci扩展而非PDO的写法)

    測试了非常多遍,TP官网根本就没有给出正确的写法,并且网上搜索到的全都是错误的. 跟踪代码.终于找出了正确的配置写法,备份例如以下.(by default7#zbphp.com) 'DB_TYPE' ...

  3. POJ 1205 Water Treatment Plants(递推)

    题意   建设一条河岸的污水处理系统  河岸有n个城市   每一个城市都能够自己处理污水 V   也能够把污水传到相邻的城市处理 >或<   除了你传给我我也传给你这样的情况   其他都是 ...

  4. lightoj1030(期望dp)

    有n个格子,初始的时候pos=1,然后丢骰子,然后新的pos为pos+骰子的点数,走到新的pos,可以捡走该pos上的黄金. 特殊的是,如果新的pos超过了n,那么是不会走的,要重新丢骰子. 所以要分 ...

  5. 【ArcGIS 10.2新特性】ArcGIS 10.2 for Desktop 新特性(二)

    4 三维 4.1 共享三维场景         用户能够将ArcScene文档导出为3D web场景,能够被加载到ArcGIS Online.Portal或本地Web服务器上并进行分享.这样,用户可以 ...

  6. abstract修改方法

    abstract这种方法修饰,主要用在抽象类和抽象方法. 抽象的类是不可实例化的比如 public abstract class Test{ } 他能够含有抽象的方法 public abstract ...

  7. c++堆栈实现

    A Stack is a data-structure that You can only add an element to the top of the Stack, andYou can onl ...

  8. OpenStack_Swift源代码分析——Ring基本原理及一致性Hash算法

    1.Ring的基本概念 Ring是swfit中最重要的组件.用于记录存储对象与物理位置之间的映射关系,当用户须要对Account.Container.Object操作时,就须要查询相应的Ring文件( ...

  9. fedora linux平台下搭建lighttpd+php+sqlite

    (一)lighttpd 1. 安装 yum install lighttpd 安装完毕后,系统中应该多了一个用户lighttpd和组lighttpd.这个用户,默认是不同意登陆的. 我们改动/etc/ ...

  10. JS window.open()财产

    一. Window 对象 Window 对象是 JavaScript 顶级对象层次. Window 对象表示一个浏览器窗口或帧. Window 在对象 <body> 或 <frame ...