# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
480868 | duchung | timeismoney (balkan11_timeismoney) | C++17 | 269 ms | 1352 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define ii pair<int , int>
#define dd pair<double , double>
#define iiii pair<ii , dd>
const int N = 205;
const double EPS = 1e-9;
int n , m;
vector<iiii> edges;
double tmp , slope;
int parent[N] , level[N];
double val(iiii tmp)
{
return slope * tmp.second.first + (1 - slope) * tmp.second.second;
}
bool cmp(iiii x , iiii y)
{
return val(x) + EPS < val(y);
}
int find_set(int u)
{
return u == parent[u] ? u : parent[u] = find_set(parent[u]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |