# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330610 | MetB | Salesman (IOI09_salesman) | C++14 | 855 ms | 23960 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>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const int N = 2000001;
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;
int n, U, D, s, maxx;
struct SegTree {
int t[N], start;
void build (int n) {
start = 1;
while (start < n) start <<= 1;
fill (t, t + 2 * start, -1e9);
}
void update (int x, int d) {
x += start;
t[x] = d;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |