# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18459 | tlwpdus | Split the sequence (APIO14_sequence) | C++98 | 835 ms | 88200 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
O(NK) ....?
*/
#include<stdio.h>
#include<algorithm>
using namespace std;
typedef long long ll;
struct fr { // p/q -> 진짜로 만들어야만 했을까
ll p, q;
fr(ll p = 0, ll q = 1):p(p),q(q){}
inline bool operator < (const fr &A) const {return (q*A.q>0)?(p*A.q<q*A.p):(p*A.q>q*A.p);}
inline bool operator == (const fr &A) const {return p*A.q==q*A.p;}
inline bool operator <= (const fr &A) const {return (*this)<A||(*this)==A;}
inline bool operator > (const fr &A) const {return !((*this)<=A);}
inline bool operator < (const ll &A) const {return (*this)<fr(A,1);}
inline bool operator == (const ll &A) const {return (*this)==fr(A,1);}
inline bool operator > (const ll &A) const {return (*this)>fr(A,1);}
};
struct line {
ll a, b;
int idx;
line(ll a=0, ll b=0, int idx=0):a(a),b(b),idx(idx){}
fr operator * (const line &A) const {return fr(b-A.b,A.a-a);}
};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |