oj.uz

Submission #942850

# Submission time Handle Problem Language Result Execution time Memory
942850 2024-03-11T05:20:48 Z vjudge1 Nicelines (RMI20_nicelines) C++17
72.0757 / 100
 42 ms 2072 KB 
#include "nice_lines.h"

#include <bits/stdc++.h>
using namespace std;

void solve(int subtask_id, int n) {
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    auto rand = [&](int l, int r) { return uniform_int_distribution<int>(l, r - 1)(rng); };
    const long double EPS = 1e-8;
    const int CL = -10000, CR = 10000;

    auto [a, b] = [&]() -> pair<vector<int>, vector<int>> {
        map<array<long long, 2>, long double> memorize;
        auto f = [&](long long x, long long y) {
            if (memorize.count({x, y})) return memorize[{x, y}];
            return memorize[{x, y}] = query(x, y + 1) - query(x, y);
        };
        vector<int> a, b;
        long long x = rand(50, 90);
        long long last = -1e6;
        for (int i = 0; i < n; i++) {
            long long l = last + 1, r = 1e6;
            while (l < r) {
                long long m = (l + r) >> 1;
                if (abs(f(x, m) - f(x, last)) > EPS) r = m;
                else l = m + 1;
            }
            long long y = l;
            long double d = abs(f(x, y) - f(x, last)) / 2;
            int _a = round(sqrt(1.0 / d / d - 1.0));
            int c = rand(1, 10);
            if (abs(f(x + c, y + c * _a) - f(x + c, y + c * _a - 1)) < EPS) _a *= -1;
            int _b = y - _a * x;
            a.push_back(_a);
            b.push_back(_b);
            last = y;
        }
        return make_pair(a, b);
    }();

    the_lines_are(a, b);
}

Compilation message

nicelines.cpp: In function 'void solve(int, int)':
nicelines.cpp:10:15: warning: unused variable 'CL' [-Wunused-variable]
   10 |     const int CL = -10000, CR = 10000;
      |               ^~
nicelines.cpp:10:28: warning: unused variable 'CR' [-Wunused-variable]
   10 |     const int CL = -10000, CR = 10000;
      |                            ^~

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 444 KB Output is correct
4 Correct 1 ms 440 KB Output is correct

Subtask #2
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 692 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

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

Subtask #4
13.484892686 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 34 ms 1716 KB Output is partially correct
2 Partially correct 42 ms 1292 KB Output is partially correct
3 Partially correct 35 ms 1788 KB Output is partially correct
4 Partially correct 37 ms 1984 KB Output is partially correct

Subtask #5
21.4634715565 / 23.0

# Verdict Execution time Memory Grader output
1 Partially correct 10 ms 952 KB Output is partially correct
2 Partially correct 10 ms 1212 KB Output is partially correct
3 Partially correct 11 ms 960 KB Output is partially correct
4 Partially correct 9 ms 1204 KB Output is partially correct

Subtask #6
19.1272973535 / 27.0

# Verdict Execution time Memory Grader output
1 Partially correct 34 ms 1716 KB Output is partially correct
2 Partially correct 42 ms 1292 KB Output is partially correct
3 Partially correct 35 ms 1788 KB Output is partially correct
4 Partially correct 37 ms 1984 KB Output is partially correct
5 Partially correct 10 ms 952 KB Output is partially correct
6 Partially correct 10 ms 1212 KB Output is partially correct
7 Partially correct 11 ms 960 KB Output is partially correct
8 Partially correct 9 ms 1204 KB Output is partially correct
9 Partially correct 36 ms 2072 KB Output is partially correct
10 Partially correct 32 ms 1996 KB Output is partially correct
11 Partially correct 37 ms 1764 KB Output is partially correct
12 Partially correct 40 ms 1328 KB Output is partially correct