# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
628040 | BackNoob | Toll (BOI17_toll) | C++14 | 167 ms | 29048 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 ll long long
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
const int mxN = 2e5 + 227;
const int inf = 1e9 + 7;
int n;
int m;
int q;
int k;
vector<pair<int, int>> adj[mxN];
int idx[mxN];
int lvl[mxN];
struct SegmentTree{
struct Node{
int f[5][5];
int lef;
int rig;
};
int n;
vector<Node> t;
Node base;
SegmentTree(){}
SegmentTree(int _n){
# | 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... |