oj.uz

Submission #943151

# Submission time Handle Problem Language Result Execution time Memory
943151 2024-03-11T08:44:41 Z Tuanlinh123 Nicelines (RMI20_nicelines) C++17
84.7783 / 100
 47 ms 856 KB 
#include "nice_lines.h"
#include<bits/stdc++.h>
#define ll int
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
#define sz(a) ((ll)(a).size())
using namespace std;
mt19937_64 rng(170306);
ll random(ll l, ll r){return l+rng()%(r-l+1);}
const ld eps=1e-7;
void solve(ll subtask_id, ll n) 
{
    ll V=1e4, X=V*2+1;
    auto calc=[&](ld y){return query(X, y);};
    vector <ll> va, vb;
    function<void(ld, ld, ld, ld)> DnC=[&](ld l, ld r, ld fl, ld fr)
    {
        ld mid=(l+r)/2, fm=calc(mid);
        if (abs((fl+fr)/2-fm)<eps) return;
        if ((r-l)<1.0)
        {
            long double c=(calc(r+0.1)-fr-fl+calc(l-0.1))/2;
            long double d=sqrtl(max<long double>(0.0, 0.1*0.1-c*c));
            int a=round(d/c);
            if (mid<-eps) a=-a;
            int b=round(mid-X*a);
            va.push_back(a);
            vb.push_back(b);
            return;
        }
        DnC(l, mid, fl, fm), DnC(mid, r, fm, fr);
        return;
    };
    ld l=-V*X-V, r=V*X+V;
    if (n==3) l+=random(1, 10), r-=random(1, 10);
    DnC(l, r, calc(l), calc(r));
    the_lines_are(va, vb);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 456 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 1 ms 452 KB Output is correct
4 Correct 1 ms 444 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 448 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 688 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 2 ms 692 KB Output is correct
4 Correct 2 ms 440 KB Output is correct

Subtask #4
14.1680454266 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 30 ms 452 KB Output is partially correct
2 Partially correct 32 ms 460 KB Output is partially correct
3 Partially correct 28 ms 856 KB Output is partially correct
4 Partially correct 38 ms 448 KB Output is partially correct

Subtask #5
21.1229526994 / 23.0

# Verdict Execution time Memory Grader output
1 Partially correct 11 ms 440 KB Output is partially correct
2 Partially correct 13 ms 440 KB Output is partially correct
3 Partially correct 12 ms 452 KB Output is partially correct
4 Partially correct 11 ms 704 KB Output is partially correct

Subtask #6
18.4873202739 / 27.0

# Verdict Execution time Memory Grader output
1 Partially correct 30 ms 452 KB Output is partially correct
2 Partially correct 32 ms 460 KB Output is partially correct
3 Partially correct 28 ms 856 KB Output is partially correct
4 Partially correct 38 ms 448 KB Output is partially correct
5 Partially correct 11 ms 440 KB Output is partially correct
6 Partially correct 13 ms 440 KB Output is partially correct
7 Partially correct 12 ms 452 KB Output is partially correct
8 Partially correct 11 ms 704 KB Output is partially correct
9 Partially correct 38 ms 616 KB Output is partially correct
10 Partially correct 42 ms 436 KB Output is partially correct
11 Partially correct 40 ms 440 KB Output is partially correct
12 Partially correct 47 ms 696 KB Output is partially correct