# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
836277 | mousebeaver | Meetings (IOI18_meetings) | C++14 | 86 ms | 13520 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.
#define ll long long
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
ll left(ll i)
{
return 2*i;
}
ll right(ll i)
{
return 2*i+1;
}
struct node
{
ll bleft;
ll bright;
ll bmax;
ll len;
};
node combine(node l, node r)
{
node output = {0, 0, 0, 0};
if(l.bleft == l.len)
{
output.bleft = l.bleft + r.bleft;
# | 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... |