# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
274900 | toonewbie | Split the sequence (APIO14_sequence) | C++17 | 213 ms | 131076 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.
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
//#define endl '\n'
#define ll long long
#define pll pair<ll,ll>
#define pi pair<int,int>
using namespace std;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int MAXN = 1e9+1;
const int N = 1005;
struct Line{
ll m, b, id;
ll eval(ll x) {
return m*x + b;
}
};
struct node{
node *l, *r;
Line ln;
node(node* _l, node* _r, Line _ln):
l(_l), r(_r), ln(_ln) {};
};
typedef node* pnode;
Compilation message (stderr)
# | 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... |