# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950731 | Dec0Dedd | Radio Towers (IOI22_towers) | C++17 | 17 ms | 15956 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 "towers.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 2e3+10;
int n, hx[N], mx[N][N];
void init(int _n, vector<int> _h) {
n=_n;
for (int i=1; i<=n; ++i) hx[i]=_h[i-1];
for (int i=1; i<=n; ++i) {
mx[i][i]=hx[i];
for (int j=i+1; j<=n; ++j) mx[i][j]=max(mx[i][j-1], hx[j]);
}
}
vector<int> G[N];
bool vis[N];
int dfs(int v) {
vis[v]=true;
int res=1;
for (auto u : G[v]) {
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |