# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16956 | erdemkiraz | UFO (IZhO14_ufo) | C++98 | 1259 ms | 205152 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.
#ifdef D
#include "header.h"
#else
#include "bits/stdc++.h"
#endif
using namespace std;
#define type(x) __typeof((x).begin())
#define foreach(i, x) for(type(x) i = (x).begin(); i != (x).end(); i++)
typedef long long ll;
typedef pair < int, int > ii;
const int inf = 1e9 + 333;
const ll linf = 1e18 + 333;
const int N = 1e6 + 5;
int n, m, r, k, p;
class tree{ public:
int n;
vector < int > t;
void init(int n) {
this -> n = n;
t.resize(n * 4 + 5, 0);
}
void update(int x, int l, int r, int x1, int k) {
if(l == r) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |