Description
给你n个小球,从左到右编号依次为1,2,3,4,5,6.........n排成一行。现在有以下2种操作:A x y表示把编号为x小球移动到编号为y的小球的左边(和y相邻)。Q x为询问编号为x的小球左边的球号,如果x左边没有小球的话输出"cyk666"。
Input
第一行输入一个T,表示有T组测试数据。(1<=T<=100)
随后每一组测试数据第一行是两个整数N,M,其中N表示球的个数(1 随后有M行询问,第一个字符是操作类型s。
当s为'A'时,输入x,y表示把编号为x小球移动到编号为y的小球的左边。
当s为'Q'时,输入x表示询问小球x左边的球号。保证(1<=x<=N,1<=y<=N,1<=N<=100000)
Output
输出每次询问的球号,如果这样的小球不存在,输出"cyk666"(不包括引号)。
Sample
Input
1 6 5 A 1 2 A 1 4 A 3 5 Q 5 Q 2
Output
3 cyk666
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef struct node
{
int data;
struct node *next;
}node;
node *create(node *&head, int n)
{
node *p, *tail;
head = (node *)malloc(sizeof(node));
head -> next = NULL;
tail = head;
for(int i = 1; i <= n; i++)
{
p = (node *)malloc(sizeof(node));
p -> data = i;
p -> next = NULL;
tail -> next = p;
tail = p;
}
return head;
}
void f1(node *head, int x, int y)
{
node *p = head;
node *q = head;
node *s;
s = (node *)malloc(sizeof(node));
s -> next = NULL;
s -> data = x;
while(p -> next != NULL)
{
if(p -> next -> data == x)
{
break;
}
p = p -> next;
}
while(q -> next != NULL)
{
if(q -> next -> data == y)
{
break;
}
q = q -> next;
}
if(p -> next -> next != q -> next)
{
p -> next = p -> next -> next;
s -> next = q -> next;
q -> next = s;
}
}
void f2(node *head, int x)
{
int flag = 0;
node *p = head -> next;
while(p != NULL && p -> next != NULL)
{
if(p -> next -> data == x)
{
flag = 1;
break;
}
p = p -> next;
}
if(flag == 1)printf("%d\n", p -> data);
else printf("cyk666\n");
}
int main()
{
int t, n, m, x, y, z;
char c;
scanf("%d", &t);
while(t--)
{
scanf("%d %d", &n, &m);
node *l = create(l, n);
while(m--)
{
getchar();
scanf("%c", &c);
if(c == 'A')
{
scanf("%d %d", &x, &y);
f1(l, x, y);
}
else if(c == 'Q')
{
scanf("%d", &z);
f2(l, z);
}
}
}
return 0;
}