oj.uz

Submission #750830

# Submission time Handle Problem Language Result Execution time Memory
750830 2023-05-30T11:03:21 Z doowey Nicelines (RMI20_nicelines) C++14
82.6335 / 100
 66 ms 320 KB 
#include <bits/stdc++.h>
#include "nice_lines.h"

using namespace std;

typedef long double ld;
typedef pair<ld, ld> pdd;

#define fi first
#define se second
#define mp make_pair

const int X = (int)2e4 + 4;
const int B = X * 1ll * X;
const ld EPS = 1e-5;

bool on_line(ld x0, ld y0, ld x1, ld y1, ld x2, ld y2){
    return abs((x2 - x1) * (y1 - y0) - (y2 - y1) * (x1 - x0)) < EPS;
}

vector<int> aa, bb;

void solve(int lef, int rig, ld la, ld ra){
    if(la < 0.0){
        la = query(X, (ld)lef - 0.5);
    }
    if(ra < 0.0){
        ra = query(X, (ld)rig + 0.5);
    }
    if(lef == rig){
        ld ma = query(X, lef);
        if(on_line(lef - 0.5, la, lef, ma, rig + 0.5, ra)) return;
        int B = (lef % X + X) % X;
        if(B > (int)1e4) B = -(X-B);
        int A = (lef - B) / X;
        //cout << lef << " " << A << " " << B << "\n";
        aa.push_back(A);
        bb.push_back(B);
        return;
    }
    int mid = lef + (rig - lef) / 2;
    ld ma = query(X, (ld)mid + 0.5);
    if(on_line(lef - 0.5, la, mid + 0.5, ma, rig + 0.5, ra)) return;
    solve(lef, mid, la, ma);
    solve(mid + 1, rig, ma, ra);

}

void solve(int subtask_id, int N) {
    /*
    printf("subtask_id = %d, N = %d\n", subtask_id, N);
    printf("query(0, 0) = %Lf\n", query(0, 0));
    printf("query(1, 1) = %Lf\n", query(1, 1));
    */
    solve(-B, B, -1.0, -1.0);
    the_lines_are(aa, bb);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 300 KB Output is correct
2 Correct 4 ms 208 KB Output is correct
3 Correct 4 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 208 KB Output is correct
2 Correct 8 ms 208 KB Output is correct
3 Correct 3 ms 208 KB Output is correct
4 Correct 4 ms 296 KB Output is correct

Subtask #4
12.5550843926 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 66 ms 320 KB Output is partially correct
2 Partially correct 54 ms 296 KB Output is partially correct
3 Partially correct 56 ms 292 KB Output is partially correct
4 Partially correct 65 ms 292 KB Output is partially correct

Subtask #5
21.2370181289 / 23.0

# Verdict Execution time Memory Grader output
1 Partially correct 28 ms 208 KB Output is partially correct
2 Partially correct 19 ms 208 KB Output is partially correct
3 Partially correct 19 ms 208 KB Output is partially correct
4 Partially correct 20 ms 208 KB Output is partially correct

Subtask #6
17.8414357158 / 27.0

# Verdict Execution time Memory Grader output
1 Partially correct 66 ms 320 KB Output is partially correct
2 Partially correct 54 ms 296 KB Output is partially correct
3 Partially correct 56 ms 292 KB Output is partially correct
4 Partially correct 65 ms 292 KB Output is partially correct
5 Partially correct 28 ms 208 KB Output is partially correct
6 Partially correct 19 ms 208 KB Output is partially correct
7 Partially correct 19 ms 208 KB Output is partially correct
8 Partially correct 20 ms 208 KB Output is partially correct
9 Partially correct 46 ms 292 KB Output is partially correct
10 Partially correct 65 ms 296 KB Output is partially correct
11 Partially correct 62 ms 292 KB Output is partially correct
12 Partially correct 53 ms 300 KB Output is partially correct