A. Friends or Not
来源:互联网 发布:android加载数据动画 编辑:程序博客网 时间:2024/06/05 20:46
Polycarpus has a hobby — he develops an unusual social network. His work is almost completed, and there is only one more module to implement — the module which determines friends. Oh yes, in this social network one won't have to add friends manually! Pairs of friends are deduced in the following way. Let's assume that user A sent user B a message at time t1, and user B sent user A a message at time t2. If 0 < t2 - t1 ≤ d, then user B's message was an answer to user A's one. Users A and B are considered to be friends if Aanswered at least one B's message or B answered at least one A's message.
You are given the log of messages in chronological order and a number d. Find all pairs of users who will be considered to be friends.
The first line of the input contains two integers n and d (1 ≤ n, d ≤ 1000). The next n lines contain the messages log. The i-th line contains one line of the log formatted as "Ai Bi ti" (without the quotes), which means that user Ai sent a message to user Bi at time ti (1 ≤ i ≤ n). Ai and Bi are non-empty strings at most 20 characters long, consisting of lowercase letters ('a' ... 'z'), and ti is an integer (0 ≤ ti ≤ 10000). It is guaranteed that the lines are given in non-decreasing order of ti's and that no user sent a message to himself. The elements in the lines are separated by single spaces.
In the first line print integer k — the number of pairs of friends. In the next k lines print pairs of friends as "Ai Bi" (without the quotes). You can print users in pairs and the pairs themselves in any order. Each pair must be printed exactly once.
4 1vasya petya 1petya vasya 2anya ivan 2ivan anya 4
1petya vasya
1 1000a b 0
0
In the first sample test case Vasya and Petya are friends because their messages' sending times are one second apart. Anya and Ivan are not, because their messages' sending times differ by more than one second.
解题说明:题目的意思是通过判断两个人之间应答时间差来判断两个人是否是好友关系。用数组a,b表示两个人,用c,d两个数组存储好友关系,获取时间之后相减判断范围即可。
#include <iostream>#include<algorithm>#include<cstdio>#include<cmath>#include<cstring>#include<cstdlib>using namespace std;int main(){int i, j, p, n, T, k = 0, flag;char a[1001][25], b[1001][25], c[1001][25], d[1001][25];int t[1001];scanf("%d %d", &n, &T);for (i = 0; i < n; i++){scanf("%s %s %d", a[i], b[i], &t[i]);}for (i = 0; i < n - 1; i++){for (j = i + 1; j < n && t[j] - t[i] <= T; j++){if ((t[j] - t[i]) && !(strcmp(a[i], b[j])) && !(strcmp(b[i], a[j]))) {flag = 1;for (p = 0; p < k; p++){if ((!(strcmp(a[i], c[p])) && !(strcmp(b[i], d[p]))) ||(!(strcmp(a[i], d[p])) && !(strcmp(b[i], c[p])))) {flag = 0;break;}}if (flag) {strcpy(c[k], a[i]);strcpy(d[k], b[i]);k++;}break;}}}printf("%d\n", k);for (i = 0; i < k; i++){printf("%s %s\n", c[i], d[i]);}return 0;}
- A. Friends or Not
- codeforces 159A Friends or Not
- BNUOJ 14407 friends or not 水题写得bug很多
- is not a class or namespace name
- PureMVC or not?It's a problem
- Is this a good times or not
- check a tree is balanced or not
- is not a class or namespace name
- not a signal or slot declaration
- error: not a class or struct name
- POJ 3119 Friends or Enemies?
- Thanks a new friends
- A. Dima and Friends
- does not exist or is not a readable directory
- ..\TestApp does not exist or is not a readable directory
- To Be a Coder or Not, That's a Question!
- cannot be resolved or is not a type
- is not a class or namespace name解决方法
- 配置管理(可参考用于hadoop集群部署)
- Oracle的体系结构与容易混淆的概念
- VMware workstation unrecoverable error(vmx)
- 如何做好游戏开发项目基本需求分析
- c/c++: uint8_t uint16_t uint32_t uint64_t size_t ssize_t数据类型
- A. Friends or Not
- java多态性Overload和Override的区别
- 将十六进制转成十进制字符串显示
- 游戏开发优化之路 之 Unity3D 渲染统计窗口
- HTTP状态码大全
- 决定开始写微博了
- Android支付接入(一):支付宝
- Android支付接入(二):移动游戏基地
- Android支付接入(三):电信爱游…