CodeForces 412D Giving Awards
来源:互联网 发布:js 组合式继承 编辑:程序博客网 时间:2024/05/21 17:05
The employees of the R1 company often spend time together: they watch football, they go camping, they solve contests. So, it's no big deal that sometimes someone pays for someone else.
Today is the day of giving out money rewards. The R1 company CEO will invite employees into his office one by one, rewarding each one for the hard work this month. The CEO knows who owes money to whom. And he also understands that if he invites personx to his office for a reward, and then immediately invite persony, who has lent some money to person x, then they can meet. Of course, in such a situation, the joy of personx from his brand new money reward will be much less. Therefore, the R1 CEO decided to invite the staff in such an order that the described situation will not happen for any pair of employees invited one after another.
However, there are a lot of employees in the company, and the CEO doesn't have a lot of time. Therefore, the task has been assigned to you. Given the debt relationships between all the employees, determine in which order they should be invited to the office of the R1 company CEO, or determine that the described order does not exist.
The first line contains space-separated integers n andm — the number of employees in R1 and the number of debt relations. Each of the following m lines contains two space-separated integersai,bi(1 ≤ ai, bi ≤ n; ai ≠ bi), these integers indicate that the person number ai owes money to a person a numberbi. Assume that all the employees are numbered from 1 ton.
It is guaranteed that each pair of people p,q is mentioned in the input data at most once. In particular, the input data will not contain pairsp, q andq, p simultaneously.
Print -1 if the described order does not exist. Otherwise, print the permutation ofn distinct integers. The first number should denote the number of the person who goes to the CEO office first, the second number denote the person who goes second and so on.
If there are multiple correct orders, you are allowed to print any of them.
2 11 2
2 1
3 31 22 33 1
2 1 3
#include <iostream>#include <vector>#include <string.h>using namespace std;vector<int> g[30005];int vis[30005];void dfs(int u){ if(vis[u]) return; vis[u]=1; for(int i=0;i<g[u].size();i++) dfs(g[u][i]); cout<<u<<" "<<endl;}int main(){ int n,m; while(cin>>n>>m) { memset(vis,0,sizeof(vis)); while(m--) { int a,b; cin>>a>>b; g[a].push_back(b); } for(int i=1;i<=n;i++) { if(!vis[i]) dfs(i); } cout<<endl; } return 0;}
- CodeForces 412D Giving Awards
- Codeforces 412D Giving Awards(拓扑排序)
- CodeForces 412D - Giving Awards (dfs)
- Codeforces D. Giving Awards 412 题解
- Codeforces D. Giving Awards 412(DFS)
- codeforces 412D. Giving Awards (dfs)
- Codeforces 421D Giving Awards 策略题
- CF D. Giving Awards(dfs)
- CF 412 D Giving Awards(拓扑排序)
- Coder-Strike 2014 - Round 1 D. Giving Awards
- CodeForces 412(A,B,C,D,E)
- codeforces 412 D Dynamic Problem Scoring
- Giving Feedback
- CodeForces 617D CodeForces 617D
- CodeForces 101D
- CodeForces 103D
- CodeForces 222D Olympiad
- codeforces 242d
- android vpn pptp 自动切换VPN
- spring中的IOC和AOP
- dictionary实例的解析和强制解析
- Android之封装支付宝支付
- json解析数据 再讲数据转化成json
- CodeForces 412D Giving Awards
- RCP handler配置enableWhen,activeWhen
- 九.SQL server 事务、锁与游标问题
- iOS 动画
- java中最容易用错的关系运算符==
- ARM_s5pv210_arm_7(下)
- 中级动态规划训练(1)
- 基于maven和hudson打造持续集成环境
- SQLServer 编写存储过程或是脚本文件时,有时会遇到的一个错误