fix 1628

Author: japersik

task_14_1628/1628.cpp

@@ -1,19 +1,19 @@
 #include <algorithm>
+#include <set>
 #include <iostream>
 #include <vector>
-#include <set>
 using namespace std;
 
-bool compare_y(pair<int, int> a, pair<int, int> b) {
-    if (a.second != b.second) return a.second<b.second;
-    return a.first < b.first;
-}
-
 bool compare_x(pair<int, int> a, pair<int, int> b) {
     if (a.first != b.first) return a.first<b.first;
     return a.second < b.second;
 }
 
+bool compare_y(pair<int, int> a, pair<int, int> b) {
+    if (a.second != b.second) return a.second<b.second;
+    return a.first < b.first;
+}
+
 int counter;
 int main() {
     int N, M, K;
@@ -27,6 +27,7 @@ int main() {
         cell.push_back(make_pair(x, y));
     }
 
+
     for (int i = 1; i <= M; i++) {
         cell.push_back(make_pair(0, i));
         cell.push_back(make_pair(N + 1, i));
@@ -39,6 +40,15 @@ int main() {
 
     K += (M + N) * 2;
 
+    sort(cell.begin(), cell.begin() + K, compare_x);
+    for (int i = 0; i < K ; i++) {
+        int space = cell[i + 1].second - cell[i].second;
+        if (space == 2)
+            S.insert(make_pair(cell[i].first, cell[i].second + 1));
+        else if (cell[i].first == cell[i + 1].first && space > 2) 
+            counter ++;
+    }
+
     sort(cell.begin(), cell.begin() + K, compare_y);
     for (int i = 0; i < K; i++) {
         int space = cell[i + 1].first - cell[i].first;
@@ -49,16 +59,8 @@ int main() {
         else if (cell[i].second == cell[i + 1].second && space > 2)
             counter ++;
     }
-    
-    sort(cell.begin(), cell.begin() + K, compare_x);
-    for (int i = 0; i < K ; i++) {
-        int space = cell[i + 1].second - cell[i].second;
-        if (space == 2)
-            S.insert(make_pair(cell[i].first, cell[i].second + 1));
-        else if (cell[i].first == cell[i + 1].first && space > 2) 
-            counter ++;
-    }
 
     cout << counter << endl;
+
     return 0;
-}
+}