oj.uz

Submission #942715

# Submission time Handle Problem Language Result Execution time Memory
942715 2024-03-11T03:28:31 Z marvinthang Nicelines (RMI20_nicelines) C++17
79.6075 / 100
 45 ms 696 KB 
/*************************************
*    author: marvinthang             *
*    created: 11.03.2024 09:22:47    *
*************************************/

#include "nice_lines.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

#define double long double
const double EPS = 1e-6;
const int MAX_C = 1e4;
const int PX = 2e4 + 1;

void solve(int subtask_id, int n) {
    auto collinear = [&] (double x0, double y0, double x1,double y1, double x2, double y2) {
        x1 -= x0; y1 -= y0; x2 -= x0; y2 -= y0;
        return abs(x1 * y2 - x2 * y1) <= EPS;
    };
    vector <int> aa, bb;
    function<void(int, int, double, double)> solve = [&] (int l, int r, double val_l, double val_r) {
        if (l == r) {
            if (collinear(l - 0.5, val_l, l, query(PX, l), r + 0.5, val_r)) return;
            int b = l % PX;
            if (b < 0) b += PX;
            if (b > MAX_C) b -= PX;
            aa.push_back((l - b) / PX);
            bb.push_back(b);
            return;
        }
        int m = l + (r - l) / 2;
        double val_m = query(PX, m + 0.5);
        if (collinear(l - 0.5, val_l, m + 0.5, val_m, r + 0.5, val_r)) return;
        solve(l, m, val_l, val_m);
        solve(m + 1, r, val_m, val_r);
    };
    int r = PX * MAX_C + MAX_C;
    int l = -r;
    solve(l, r, query(PX, l - 0.5), query(PX, r + 0.5));
    the_lines_are(aa, bb);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 440 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 436 KB Output is correct

Subtask #2
13.0 / 13.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
11.3190352164 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 44 ms 432 KB Output is partially correct
2 Partially correct 39 ms 688 KB Output is partially correct
3 Partially correct 28 ms 452 KB Output is partially correct
4 Partially correct 45 ms 696 KB Output is partially correct

Subtask #5
21.2034694733 / 23.0

# Verdict Execution time Memory Grader output
1 Partially correct 10 ms 436 KB Output is partially correct
2 Partially correct 11 ms 440 KB Output is partially correct
3 Partially correct 10 ms 432 KB Output is partially correct
4 Partially correct 10 ms 444 KB Output is partially correct

Subtask #6
16.0849447812 / 27.0

# Verdict Execution time Memory Grader output
1 Partially correct 44 ms 432 KB Output is partially correct
2 Partially correct 39 ms 688 KB Output is partially correct
3 Partially correct 28 ms 452 KB Output is partially correct
4 Partially correct 45 ms 696 KB Output is partially correct
5 Partially correct 10 ms 436 KB Output is partially correct
6 Partially correct 11 ms 440 KB Output is partially correct
7 Partially correct 10 ms 432 KB Output is partially correct
8 Partially correct 10 ms 444 KB Output is partially correct
9 Partially correct 36 ms 432 KB Output is partially correct
10 Partially correct 39 ms 448 KB Output is partially correct
11 Partially correct 32 ms 692 KB Output is partially correct
12 Partially correct 34 ms 692 KB Output is partially correct