# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
697094 | amunduzbaev | Long Distance Coach (JOI17_coach) | C++17 | 292 ms | 56176 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"
using namespace std;
#define ar array
typedef long long ll;
#define int ll
const int N = 4e5 + 5;
const int inf = 1e18;
int MX;
struct line{
int m, b;
line(): m(0), b(0){ }
line(int m, int b): m(m), b(b){ }
int operator * (const int& x) const {
return x * m + b;
}
};
struct ST{
line tree[N << 2];
int q[N], sz;
void init(int sz_, vector<int>& Q){
for(int i=0;i<(N << 2);i++) tree[i] = line(MX, inf);
sz = sz_;
for(int i=0;i<sz;i++) q[i] = Q[i];
}
# | 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... |