No commit message

gzshawnliang · Aug 8, 2019 · f4e7aa8 · f4e7aa8
1 parent a266cfc
commit f4e7aa8
Show file tree

Hide file tree

Showing 2 changed files with 17 additions and 7 deletions.
diff --git a/myCpps/maps.cpp b/myCpps/maps.cpp
@@ -2,7 +2,7 @@
 
 using namespace std;
 
-ifstream fin("maps.in");
+ifstream fin("lineSweep.in");
 ofstream fout("maps.out");
 
 const int inf = INT_MAX / 2;
@@ -51,7 +51,12 @@ int main()
         set<double> _set;
         for (int i = 0; i <= n - 1; ++i)
         {
-            fin >> a_t[i].x1 >> a_t[i].y1 >> a_t[i].x2 >> a_t[i].y2;
+            double t1, t2, t3, t4; fin >> t1 >> t2 >> t3 >> t4;
+            a_t[i].x1 = min(t1, t3);
+            a_t[i].y1 = min(t2, t4);
+            a_t[i].x2 = max(t1, t3);
+            a_t[i].y2 = max(t2, t4);
+
             _set.insert(a_t[i].x1);
             _set.insert(a_t[i].y1);
             _set.insert(a_t[i].x2);
@@ -88,7 +93,7 @@ int main()
         sort(l.begin(), l.end());
 
         int sizeL = l.size();
-        vector<double> h(itod.size() + 1, 0.0);
+        vector<double> h(sizeL, 0.0);
         for (int i = 0; i <= sizeL - 2; ++i)
         {
             int nowX = l[i].x, nextX = l[i + 1].x;
@@ -127,7 +132,7 @@ int main()
         //ans = (int)(ans * 100.0 + 0.5) / 100.0;
 
         fout << "Test case #" << t << '\n';
-        fout << "Total explored area: " << ans << '\n';
+        fout << "Total explored area: " << ans << "\n\n";
 
     }
     return 0;

diff --git a/myCpps/mapsOJ.cpp b/myCpps/mapsOJ.cpp
@@ -51,7 +51,12 @@ int main()
         set<double> _set;
         for (int i = 0; i <= n - 1; ++i)
         {
-            cin >> a_t[i].x1 >> a_t[i].y1 >> a_t[i].x2 >> a_t[i].y2;
+            double t1, t2, t3, t4; cin >> t1 >> t2 >> t3 >> t4;
+            a_t[i].x1 = min(t1, t3);
+            a_t[i].y1 = min(t2, t4);
+            a_t[i].x2 = max(t1, t3);
+            a_t[i].y2 = max(t2, t4);
+
             _set.insert(a_t[i].x1);
             _set.insert(a_t[i].y1);
             _set.insert(a_t[i].x2);
@@ -88,7 +93,7 @@ int main()
         sort(l.begin(), l.end());
 
         int sizeL = l.size();
-        vector<double> h(itod.size() + 1, 0.0);
+        vector<double> h(sizeL, 0.0);
         for (int i = 0; i <= sizeL - 2; ++i)
         {
             int nowX = l[i].x, nextX = l[i + 1].x;
@@ -126,7 +131,7 @@ int main()
 
 
         cout << "Test case #" << t << '\n';
-        cout << "Total explored area: " << ans << '\n';
+        cout << "Total explored area: " << ans << "\n\n";
 
     }
    	cout.flush();