oj.uz

Submission #943450

# Submission time Handle Problem Language Result Execution time Memory
943450 2024-03-11T13:24:03 Z abcvuitunggio Nicelines (RMI20_nicelines) C++17
84.0067 / 100
 41 ms 856 KB 
#include "nice_lines.h"
#include <bits/stdc++.h>
#define ld long double
#define int long long
using namespace std;
const int x=1e5;
const ld eps=1e-9;
vector <int32_t> a,b;
void dnc(ld l, ld r, ld lo, ld hi){
    ld mid=(l+r)/2,m=query(x,mid);
    if (ceil(l)>floor(r))
        return;
    if (abs((lo+hi)/2-m)<eps)
        return;
    if (r-l<1){
        int y=floor(r);
        int B=(y%x+x)%x;
        if (B>10000)
            B-=x;
        int A=(y-B)/x;
        a.push_back(A);
        b.push_back(B);
        return;
    }
    dnc(l,mid,lo,m);
    dnc(mid,r,m,hi);
}
void solve(int32_t subtask_id, int32_t N){
    ld L=-1e9-1e4,R=1e9+1e4+1e-6;
    dnc(L,R,query(x,L),query(x,R));
    the_lines_are(a,b);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 1 ms 436 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 444 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 1 ms 692 KB Output is correct

Subtask #3
7.0 / 7.0

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

Subtask #4
13.8909043548 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 36 ms 432 KB Output is partially correct
2 Partially correct 38 ms 856 KB Output is partially correct
3 Partially correct 29 ms 684 KB Output is partially correct
4 Partially correct 32 ms 680 KB Output is partially correct

Subtask #5
21.0223067303 / 23.0

# Verdict Execution time Memory Grader output
1 Partially correct 11 ms 696 KB Output is partially correct
2 Partially correct 11 ms 432 KB Output is partially correct
3 Partially correct 14 ms 432 KB Output is partially correct
4 Partially correct 11 ms 688 KB Output is partially correct

Subtask #6
18.0934882272 / 27.0

# Verdict Execution time Memory Grader output
1 Partially correct 36 ms 432 KB Output is partially correct
2 Partially correct 38 ms 856 KB Output is partially correct
3 Partially correct 29 ms 684 KB Output is partially correct
4 Partially correct 32 ms 680 KB Output is partially correct
5 Partially correct 11 ms 696 KB Output is partially correct
6 Partially correct 11 ms 432 KB Output is partially correct
7 Partially correct 14 ms 432 KB Output is partially correct
8 Partially correct 11 ms 688 KB Output is partially correct
9 Partially correct 41 ms 436 KB Output is partially correct
10 Partially correct 38 ms 432 KB Output is partially correct
11 Partially correct 39 ms 684 KB Output is partially correct
12 Partially correct 36 ms 440 KB Output is partially correct