# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
106561 | Hideo | Monkey and Apple-trees (IZhO12_apple) | C++14 | 558 ms | 159768 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 ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define vi vector < int >
#define vl vector < ll >
#define pi pair < int, int >
#define pii pair < int, pi >
#define vii vector < pi >
const int N = 1e5 + 7;
const int INF = 1e9;
int n, c, x;
struct ST{
int l, r, s, val;
ST(){
l = r = s = val = 0;
}
};
ST t[100 * N];
void push (int v, int l, int r){
if (l != r){
if (!t[v].l)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |