oj.uz

Submission #943129

# Submission time Handle Problem Language Result Execution time Memory
943129 2024-03-11T08:36:49 Z Tuanlinh123 Nicelines (RMI20_nicelines) C++17
77.0067 / 100
 50 ms 948 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;

const ld eps=1e-7;
void solve(ll subtask_id, ll n) 
{
    ll V=1e4, X=V*3;
    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-(3e4)*a);
            va.push_back(a);
            vb.push_back(b);
            return;
        }
        DnC(l, mid, fl, fm), DnC(mid, r, fm, fr);
        return;
    };
    ld l=-3e8-2e4, r=3e8+2e4;
    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 428 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 1 ms 448 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 704 KB Output is correct
4 Correct 1 ms 448 KB Output is correct

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Incorrect 1 ms 444 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #4
13.8909043548 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 28 ms 448 KB Output is partially correct
2 Partially correct 28 ms 436 KB Output is partially correct
3 Partially correct 27 ms 444 KB Output is partially correct
4 Partially correct 30 ms 440 KB Output is partially correct

Subtask #5
21.0223067303 / 23.0

# Verdict Execution time Memory Grader output
1 Partially correct 11 ms 448 KB Output is partially correct
2 Partially correct 11 ms 452 KB Output is partially correct
3 Partially correct 12 ms 948 KB Output is partially correct
4 Partially correct 16 ms 444 KB Output is partially correct

Subtask #6
18.0934882272 / 27.0

# Verdict Execution time Memory Grader output
1 Partially correct 28 ms 448 KB Output is partially correct
2 Partially correct 28 ms 436 KB Output is partially correct
3 Partially correct 27 ms 444 KB Output is partially correct
4 Partially correct 30 ms 440 KB Output is partially correct
5 Partially correct 11 ms 448 KB Output is partially correct
6 Partially correct 11 ms 452 KB Output is partially correct
7 Partially correct 12 ms 948 KB Output is partially correct
8 Partially correct 16 ms 444 KB Output is partially correct
9 Partially correct 34 ms 680 KB Output is partially correct
10 Partially correct 38 ms 444 KB Output is partially correct
11 Partially correct 50 ms 444 KB Output is partially correct
12 Partially correct 46 ms 448 KB Output is partially correct