# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
870158 | vjudge1 | Deda (COCI17_deda) | C++14 | 33 ms | 65536 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 <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define f first
#define s second
#define mk make_pair
#define dg cout << "------------------" << endl
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int M = 1e6 + 7;
const int N = 1e5 + 7;
int Point[N], Ans, n, m;
pair <int, int> Ar[N];
ordered_set adj[M];
vector <int> node;
map <int, int> mp;
char Ml[N];
void update(int u, int w) {
if (u < 1) return;
adj[u].insert(w), update(u / 2, w);
}
void Segment(int u, int w, int ul, int ur) {
if (ul >= w) {
node.push_back(u);
return;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |