# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129167 | doowey | Long Mansion (JOI17_long_mansion) | C++14 | 525 ms | 56568 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.
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ld, ld> pdd;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N = (int)5e5 + 9;
int value[N * 4 + 512];
void modify(int node,int cl, int cr, int p, int v){
if(cl == cr){
value[node] = v;
return;
}
int mid = (cl + cr) / 2;
if(mid >= p)
modify(node * 2, cl, mid, p, v);
else
modify(node * 2 + 1, mid + 1, cr, p, v);
value[node] = min(value[node * 2], value[node * 2 + 1]);
# | 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... |