Misha and Vasya participated in a Codeforces contest. Unfortunately, each of them solved only one problem, though successfully submitted it at the first attempt. Misha solved the problem that costs a points and Vasya solved the problem that costs b points. Besides, Misha submitted the problem c minutes after the contest started and Vasya submitted the problem d minutes after the contest started. As you know, on Codeforces the cost of a problem reduces as a round continues. That is, if you submit a problem that costs p points tminutes after the contest started, you get 
points.
Misha and Vasya are having an argument trying to find out who got more points. Help them to find out the truth.
The first line contains four integers a, b, c, d (250 ≤ a, b ≤ 3500, 0 ≤ c, d ≤ 180).
It is guaranteed that numbers a and b are divisible by 250 (just like on any real Codeforces round).
Output on a single line:
"Misha" (without the quotes), if Misha got more points than Vasya.
"Vasya" (without the quotes), if Vasya got more points than Misha.
"Tie" (without the quotes), if both of them got the same number of points.
500 1000 20 30
Vasya
1000 1000 1 1
Tie
1500 1000 176 177
Misha
#include<bits/stdc++.h> using namespace std; #define ll __int64 #define mod 1000000007 #define pi (4*atan(1.0)) const int N=1e5+10,M=4e6+10,inf=1e9+10; int main() { int a,b,c,d; scanf("%d%d%d%d",&a,&b,&c,&d); int m1=max(3*a/10,a-(a*c)/250); int m2=max(3*b/10,b-(b*d)/250); if(m1>m2) printf("Misha "); else if(m1==m2) printf("Tie "); else printf("Vasya "); return 0; }
Misha hacked the Codeforces site. Then he decided to let all the users change their handles. A user can now change his handle any number of times. But each new handle must not be equal to any handle that is already used or that was used at some point.
Misha has a list of handle change requests. After completing the requests he wants to understand the relation between the original and the new handles of the users. Help him to do that.
The first line contains integer q (1 ≤ q ≤ 1000), the number of handle change requests.
Next q lines contain the descriptions of the requests, one per line.
Each query consists of two non-empty strings old and new, separated by a space. The strings consist of lowercase and uppercase Latin letters and digits. Strings old and new are distinct. The lengths of the strings do not exceed 20.
The requests are given chronologically. In other words, by the moment of a query there is a single person with handle old, and handlenew is not used and has not been used by anyone.
In the first line output the integer n — the number of users that changed their handles at least once.
In the next n lines print the mapping between the old and the new handles of the users. Each of them must contain two strings, old andnew, separated by a space, meaning that before the user had handle old, and after all the requests are completed, his handle is new. You may output lines in any order.
Each user who changes the handle must occur exactly once in this description.
5
Misha ILoveCodeforces
Vasya Petrov
Petrov VasyaPetrov123
ILoveCodeforces MikeMirzayanov
Petya Ivanov
3
Petya Ivanov
Misha MikeMirzayanov
Vasya VasyaPetrov123
思路:map模拟下就好；
#include<bits/stdc++.h> using namespace std; #define ll __int64 #define mod 1000000007 #define pi (4*atan(1.0)) const int N=1e3+10,M=4e6+10,inf=1e9+10; string a[N]; string b[N]; map<string,string>m; int main() { int x; scanf("%d",&x); for(int i=1;i<=x;i++) cin>>a[i]>>b[i]; for(int i=x;i>=1;i--) { m[a[i]]=b[i]; while(m[b[i]]!="") { m[a[i]]=m[b[i]]; m[b[i]]=""; } } int ans=0; for(int i=1;i<=x;i++) if(m[a[i]]!="") ans++; cout<<ans<<endl; for(int i=1;i<=x;i++) if(m[a[i]]!="") cout<<a[i]<<" "<<m[a[i]]<<endl; return 0; }
Let's define a forest as a non-directed acyclic graph (also without loops and parallel edges). One day Misha played with the forest consisting of n vertices. For each vertex v from 0 to n - 1 he wrote down two integers, degreev and sv, were the first integer is the number of vertices adjacent to vertex v, and the second integer is the XOR sum of the numbers of vertices adjacent to v (if there were no adjacent vertices, he wrote down 0).
Next day Misha couldn't remember what graph he initially had. Misha has values degreev and sv left, though. Help him find the number of edges and the edges of the initial graph. It is guaranteed that there exists a forest that corresponds to the numbers written by Misha.
The first line contains integer n (1 ≤ n ≤ 216), the number of vertices in the graph.
The i-th of the next lines contains numbers degreei and si (0 ≤ degreei ≤ n - 1, 0 ≤ si < 216), separated by a space.
In the first line print number m, the number of edges of the graph.
Next print m lines, each containing two distinct numbers, a and b (0 ≤ a ≤ n - 1, 0 ≤ b ≤ n - 1), corresponding to edge (a, b).
Edges can be printed in any order; vertices of the edge can also be printed in any order.
3
2 3
1 0
1 0
2
1 0
2 0
2
1 1
1 0
1
0 1
The XOR sum of numbers is the result of bitwise adding numbers modulo 2. This operation exists in many modern programming languages. For example, in languages C++, Java and Python it is represented as "^", and in Pascal — as "xor".
思路：总是有度数为1的节点，裸拓扑；
坑点，多个联通块；
#include<bits/stdc++.h> using namespace std; #define ll __int64 #define mod 1000000007 #define pi (4*atan(1.0)) const int N=1e5+10,M=4e6+10,inf=1e9+10; vector<int>v[N]; int du[N]; int sum[N]; priority_queue<int>q; int main() { int n; ll ans=0; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d%d",&du[i],&sum[i]); ans+=du[i]; if(du[i]==1) q.push(i); } while(!q.empty()) { int x=q.top(); q.pop(); if(du[x]==0) continue; du[x]--; v[x].push_back(sum[x]); du[sum[x]]--; sum[sum[x]]^=x; if(du[sum[x]]==1) q.push(sum[x]); } printf("%lld ",ans/2); for(int i=0;i<n;i++) { for(int t=0;t<v[i].size();t++) printf("%d %d ",i,v[i][t]); } return 0; } /* 4 1 1 1 0 1 3 1 2 */