Submission #58468269

---

Source Code Expand

#include <bits/stdc++.h>

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
#define int long long
#define sz(s) (int)s.size()
#define sqrt sqrtl
using namespace __gnu_pbds;
typedef long long ll;
const int N = 2e5 + 10 ;
#define pb   push_back
#define all(x) x.begin(),x.end()
#define ln '\n'
#define endl '\n'
#define sz(v) (long long)v.size()
const int mod =  1000000007 ;
template<class T> using ordered_set =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;

//A.order_of_key(X)--> Finding No. of elements smaller than X
//A.find_by_order(X)--> iterator of element present at the Xth index
#define vll vector<ll>
#define fl(i,n) for(int i=0;i<n;i++)
#define double long double
double euclideanDistance(int x1, int y1, int x2, int y2) {
    return sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
}

void solve() {
    int n, s, t;
    cin >> n >> s >> t;

    vector<array<int, 4>> segments(n);
    for (int i = 0; i < n; i++) {
        cin >> segments[i][0] >> segments[i][1] >> segments[i][2] >> segments[i][3]; 
    }

    vector<int> perm(n);
    iota(perm.begin(), perm.end(), 0); 

    double min_time = 1e18;  
    do {
        double current_time = 0;
        int laser_x = 0, laser_y = 0; 

        for (int i = 0; i < n; i++) {
            int idx = perm[i];
            double move_time1 = euclideanDistance(laser_x, laser_y, segments[idx][0], segments[idx][1]) / s;
            double move_time2 = euclideanDistance(laser_x, laser_y, segments[idx][2], segments[idx][3]) / s;
            double print_time1 = euclideanDistance(segments[idx][0], segments[idx][1], segments[idx][2], segments[idx][3]) / t;
            double print_time2 = euclideanDistance(segments[idx][2], segments[idx][3], segments[idx][0], segments[idx][1]) / t;
            if (move_time1 + print_time1 < move_time2 + print_time2) {
                current_time += move_time1 + print_time1;
                laser_x = segments[idx][2];
                laser_y = segments[idx][3];
            } else {
                current_time += move_time2 + print_time2;
                laser_x = segments[idx][0];
                laser_y = segments[idx][1];
            }
        }
        min_time = min(min_time, current_time);

    } while (next_permutation(perm.begin(), perm.end()));

    cout << fixed << setprecision(30) << min_time << endl;
}
int32_t main(){
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
  int t=1; 

       while(t--)
       {
          solve();
       }

    return 0;
}

Submission Info

Compile Error

Main.cpp:17: warning: "sz" redefined
   17 | #define sz(v) (long long)v.size()
      | 
Main.cpp:8: note: this is the location of the previous definition
    8 | #define sz(s) (int)s.size()
      | 

Judge Result