# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
733261 | puppy | 송신탑 (IOI22_towers) | C++17 | 4089 ms | 5424 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 "towers.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <queue>
using namespace std;
namespace {
int N, K;
int H[100005];
}
void init(int N, std::vector<int> H) {
::N = N;
::K = -1;
for (int i = 0; i < N; i++) {
::H[i] = H[i];
}
}
int dp[100005];
struct maxseg
{
vector<int> tree;
maxseg(int n)
{
int sz = 1 << ((int)ceil(log2(n))+1);
tree.resize(sz);
}
int init(int s, int e, int node, vector<int> &vc)
Compilation message (stderr)
# | 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... |