| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 136175 | jovan_b | trapezoid (balkan11_trapezoid) | C++17 | 527 ms | 28744 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 long long ll;
typedef long double ld;
const int MOD = 30013;
int a[100005], b[100005], c[100005], d[100005];
map <int, int> u;
pair <int, int> niz[200005];
int dp[100005];
int brn[100005];
struct drvo{
int val;
int br;
} seg[1000000];
void upd(int node, int l, int r, int x, int val){
if(l > x || r < x) return;
if(l == r){
seg[node].val = dp[val];
seg[node].br = brn[val];
return;
}
int mid = (l+r)/2;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||