# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677711 | benedict0724 | Seesaw (JOI22_seesaw) | C++17 | 1 ms | 212 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 <iostream>
#include <stack>
#include <string>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cassert>
using namespace std;
typedef long long ll;
double A[200002];
int N;
double solve(int i, double now)
{
double l, r;
l = min(A[i], now);
r = max(A[i], now);
int s = 1, e = N;
for(int i=1;i<N;i++)
{
double S = (now * (N - i + 1) - A[s]) / (N - i);
double E = (now * (N - i + 1) - A[e]) / (N - i);
if(max(r, S) - min(l, S) <= max(r, E) - min(l, E))
{
now = S;
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... |