fork download
  1. //Lib
  2. #include<cstdio>
  3. #include<cstring>
  4. #include<cstdlib>
  5. #include<cmath>
  6. #include<ctime>
  7.  
  8. #include<iostream>
  9. #include<algorithm>
  10. #include<vector>
  11. #include<string>
  12. #include<queue>
  13. #include<set>
  14. #include<map>
  15. using namespace std;
  16. //Macro
  17. #define rep(i,a,b) for(int i=a,tt=b;i<=tt;++i)
  18. #define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
  19. #define erep(i,e,x) for(int i=x;i;i=e[i].next)
  20. #define irep(i,x) for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
  21. #define read() (strtol(ipos,&ipos,10))
  22. #define sqr(x) ((x)*(x))
  23. #define pb push_back
  24. #define PS system("pause");
  25. typedef long long ll;
  26. typedef pair<int,int> pii;
  27. const int oo=~0U>>1;
  28. const double inf=1e100;
  29. const double eps=1e-6;
  30. string name="", in=".in", out=".out";
  31. //Var
  32. struct E
  33. {
  34. int next,node;
  35. }e[400008];
  36. int vis[100008],h[100008],vc[100008],ec[100008];
  37. int n,m,color,cnt,tot;
  38. void add(int a,int b){e[++tot].next=h[a];e[tot].node=b;h[a]=tot;}
  39. void DFS(int u)
  40. {
  41. vis[u]=color;cnt++;
  42. erep(i,e,h[u])
  43. if(!vis[e[i].node])
  44. DFS(e[i].node);
  45. }
  46. void Init()
  47. {
  48. scanf("%d%d",&n,&m);int a,b;
  49. rep(i,1,m)scanf("%d%d",&a,&b),add(a,b),add(b,a);
  50. }
  51. void Work()
  52. {
  53. rep(i,1,n)if(!vis[i])
  54. {
  55. color++;cnt=0;DFS(i);
  56. if(cnt<3){printf("NIE\n");return;}
  57. vc[color]=cnt;
  58. }
  59. rep(i,1,n)
  60. erep(j,e,h[i])ec[vis[i]]++;
  61. rep(i,1,color)if((ec[i]>>1)<vc[i]){printf("NIE\n");return;}
  62. printf("TAK\n");
  63. }
  64. int main()
  65. {
  66. // freopen((name+in).c_str(),"r",stdin);
  67. // freopen((name+out).c_str(),"w",stdout);
  68. Init();
  69. Work();
  70. return 0;
  71. }
Not running #stdin #stdout 0s 0KB
stdin
Standard input is empty
stdout
Standard output is empty