[AMPPZ 2013]Bytehattan

 1 #include <cstdio>
 2 const int size=2250225;
 3 
 4 namespace IOspace
 5 {
 6     inline char getch()
 7     {
 8         register char ch;
 9         do ch=getchar(); while (ch!=‘E‘ && ch!=‘N‘);
10         return ch;
11     }
12     inline int getint()
13     {
14         register int num=0;
15         register char ch;
16         do ch=getchar(); while (ch<‘0‘ || ch>‘9‘);
17         do num=num*10+ch-‘0‘, ch=getchar(); while (ch>=‘0‘ && ch<=‘9‘);
18         return num;
19     }
20     inline void putint(bool num)
21     {
22         if (num==0) printf("TAK\n");
23         else printf("NIE\n");
24     }
25 }
26 
27 int n, k;
28 inline void swap(int & x, int & y) {int t=x; x=y; y=t;}
29 
30 struct node
31 {
32     int x, y;
33     inline node() {}
34     inline node(int _x, int _y):x(_x), y(_y) {}
35 };
36 inline int f(int x, int y) {if (x==0 || x==n || y==0 || y==n) return 0; return (x-1)*(n-1)+y;}
37 inline node getedge();
38 
39 int r[size];
40 inline void prepare() {for (int i=0;i<n*n;i++) r[i]=i;}
41 int find(int x) {return r[x]==x?x:r[x]=find(r[x]);}
42 inline void merge(int x, int y) {x=find(x); y=find(y); r[x]=y;}
43 
44 int main()
45 {
46     bool ans;
47     node T, N;
48 
49     n=IOspace::getint(), k=IOspace::getint();
50     prepare();
51     ans=0;
52     for (int i=1;i<=k;i++)
53     {
54         T=getedge(); N=getedge();
55         if (ans) T=N;
56         ans=find(T.x)==find(T.y);
57         IOspace::putint(ans);
58         merge(T.x, T.y);
59     }
60 
61     return 0;
62 }
63 
64 inline node getedge()
65 {
66     int x=IOspace::getint(), y=IOspace::getint();
67     char c=IOspace::getch();
68     if (c==‘N‘) return node(f(x-1, y), f(x, y));
69     if (c==‘E‘) return node(f(x, y-1), f(x, y));
70 }