# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
427568 | amoo_safar | Sky Walking (IOI19_walk) | C++17 | 504 ms | 33572 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 "walk.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
using namespace std;
typedef pair <int, int> pii;
typedef long long ll;
const int N = 1e5 + 10;
int n, m;
vector<int> x, h, l, r, y;
int Get_Max(int l, int r){ // [l, r]
// cerr << ""
if(r < l) return -1;
return h[l];
int mx = h[l];
for(int i = l; i <= r; i++)
mx = max(mx, h[i]);
return mx;
}
vector<pii> G[N];
void Add_Edge(int a, int b){
# | 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... |