# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
680516 | whqkrtk04 | Factories (JOI14_factories) | C++14 | 35 ms | 984 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 "factories.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
#define fi first
#define se second
const int INF = 1e9+1;
const int P = 1000000007;
const ll LLINF = (ll)1e18+1;
class segtree {
private:
int n;
vector<int> modi, chk;
vector<ll> seg, lazy, dep;
void upd_node(int i) {
if(!chk[i]) {
chk[i] = 1;
modi.push_back(i);
}
}
void init(int i, int s, int e, vector<ll> &B) {
seg[i] = lazy[i] = LLINF;
chk[i] = 0;
if(s+1 == e) dep[i] = B[s];
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... |