# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114337 | sebinkim | Iqea (innopolis2018_final_C) | C++14 | 551 ms | 49896 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;
typedef pair <int, int> pii;
struct cpnt{
int p, y, d;
cpnt() {}
cpnt(int p, int y, int d) : p(p), y(y), d(d) {}
};
struct minseg{
int T[303030];
int sz = 1 << 17;
minseg()
{
int i;
for(i=0; i<sz+sz; i++){
T[i] = 1e9;
}
}
void update(int p, int v)
{
p += sz;
T[p] = min(T[p], v);
Compilation message (stderr)
# | 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... |