# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
777674 | 79brue | Card Scoring (CCO19_day2problem1) | C++17 | 354 ms | 42200 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;
typedef long long ll;
const double eps = 1e-9;
int k;
inline double pow(ll x){
return k==4 ? x*x : x*sqrt(x);
}
struct dat{
ll x; double y;
dat(){}
dat(ll x, double y): x(x), y(y){} /// 원점에 해당하는 (x, y)
double get(ll v){
return pow(v-x+1)+y;
}
};
int n;
int arr[1000002];
int ord[1000002], cnt[1000002];
vector<dat> vec[1000002];
double DP[1000002];
ll cross(dat &a, dat &b, ll x){ /// a보다 b가 더 크게 되는 시점
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |