Source code for submission s552

Go to diff to previous submission

fn.cpp

  1. #include <cstdio>
  2. #include <cstdlib>
  3. #include <cmath>
  4. #include <algorithm>
  5. #include <utility>
  6. #include <string>
  7. #include <deque>
  8. #include <list>
  9. #include <map>
  10. #include <queue>
  11. #include <set>
  12. #include <stack>
  13. #include <vector>
  14. using namespace std;
  15.  
  16. #define debug printf
  17. //#define debug blackhole
  18. void blackhole(...) {}
  19.  
  20. #define MAXN 20000
  21. int ADJ_N[MAXN];
  22. int V;
  23. int E;
  24.  
  25. void GO() {
  26. 	for (int i=0;i<MAXN;i++) {
  27. 		ADJ_N[i]=0;
  28. 	}
  29. 	for (int i = 0; i < E; i++) {
  30. 		int a, b;
  31. 		scanf("%d%d", &a, &b);
  32. 		ADJ_N[a]++;
  33. 		ADJ_N[b]++;
  34. 	}
  35.  
  36. 	int qq;
  37. 	for (qq=0;qq<V;qq++) {
  38. 		if (ADJ_N[qq] >= 4){
  39. 			printf("YES\n");
  40. 			break;
  41. 		}
  42. 	}
  43. 	if (qq==V) printf("NO\n");
  44. }
  45.  
  46. int main() {
  47. 	while (true) {
  48. 		if (scanf("%d%d", &V, &E) != 2) break;
  49. 		GO();
  50. 	}
  51. 	return 0;
  52. }
  53.  

Diff to submission s548

fn.cpp

--- c5.s548.cteam032.fn.cpp.0.fn.cpp
+++ c5.s552.cteam032.fn.cpp.0.fn.cpp
@@ -18,6 +18,5 @@
 void blackhole(...) {}
 
-#define MAXN 1400
-int ADJACENT[MAXN][MAXN];
+#define MAXN 20000
 int ADJ_N[MAXN];
 int V;
@@ -31,7 +30,5 @@
                 int a, b;
                 scanf("%d%d", &a, &b);
-                ADJACENT[a][ADJ_N[a]] = b;
                 ADJ_N[a]++;
-                ADJACENT[b][ADJ_N[b]] = a;
                 ADJ_N[b]++;
         }