oj.uz

Submission #684866

# Submission time Handle Problem Language Result Execution time Memory
684866 2023-01-22T17:47:45 Z peijar Constellation 3 (JOI20_constellation3) C++17
35 / 100
 1500 ms 119224 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
  bool first = true;
  string res = "[";
  for (const auto &x : v) {
    if (!first)
      res += ", ";
    first = false;
    res += to_string(x);
  }
  res += "]";
  return res;
}

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
  cout << ' ' << to_string(H);
  dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

template <class T> struct RMQ {
  vector<vector<T>> jmp;
  RMQ(const vector<T> &V) : jmp(1, V) {
    for (int pw = 1, k = 1; pw * 2 <= (int)V.size(); pw *= 2, ++k) {
      jmp.emplace_back((int)V.size() - pw * 2 + 1);
      for (int j = 0; j < (int)jmp[k].size(); ++j)
        jmp[k][j] = max(jmp[k - 1][j], jmp[k - 1][j + pw]);
    }
  }
  T query(int a, int b) { // [a, b)
    assert(a < b);
    int dep = 31 - __builtin_clz(b - a);
    return max(jmp[dep][a], jmp[dep][b - (1 << dep)]);
  }
};

template <class T> class Fenwick {
public:
  int lim;
  vector<T> bit;

  Fenwick(int n) : lim(n + 1), bit(lim) {}

  void upd(int pos, T val) {
    for (pos++; pos < lim; pos += pos & -pos)
      bit[pos] += val;
  }

  T sum(int r) { // < r
    T ret = 0;
    for (; r; r -= r & -r)
      ret += bit[r];
    return ret;
  }

  T sum(int l, int r) { // [l, r)
    return sum(r) - sum(l);
  }

  void rangeAdd(int deb, int fin, int x) { // [deb, fin)
    dbg(deb, fin, x);
    upd(deb, x);
    upd(fin, -x);
  }

  int point(int pos) { return sum(pos + 1); }
};

template <class T> using min_pq = priority_queue<T, vector<T>, greater<T>>;

signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int N;
  cin >> N;
  vector<int> height(N);
  for (int &x : height)
    cin >> x;
  vector<pair<int, int>> toRMQ;
  for (int i = 0; i < N; ++i)
    toRMQ.emplace_back(height[i], i);
  RMQ rmq(toRMQ);

  vector<vector<pair<int, int>>> onPos(N);
  int nbEtoiles;
  cin >> nbEtoiles;
  int totCost = 0;
  for (int i = 0; i < nbEtoiles; ++i) {
    int x, y, c;
    cin >> x >> y >> c;
    totCost += c;
    onPos[x - 1].emplace_back(y, c);
  }

  Fenwick<int> fen(N);

  auto DFS = [&](auto dfs, int deb, int fin,
                 int prevHeight) -> pair<min_pq<tuple<int, int, int>>, int> {
    auto [valMax, posMax] = rmq.query(deb, fin);
    min_pq<tuple<int, int, int>> toProcess;
    for (auto [y, c] : onPos[posMax])
      toProcess.emplace(y, posMax, c);

    int solFree = 0;
    int addL = 0, addR = 0;
    if (deb < posMax) {
      auto [toAdd, freeL] = dfs(dfs, deb, posMax, valMax);
      while (!toAdd.empty()) {
        toProcess.emplace(toAdd.top());
        toAdd.pop();
      }
      addL = freeL;
      solFree += freeL;
    }
    if (posMax + 1 < fin) {
      auto [toAdd, freeR] = dfs(dfs, posMax + 1, fin, valMax);
      while (!toAdd.empty()) {
        toProcess.emplace(toAdd.top());
        toAdd.pop();
      }
      addR = freeR;
      solFree += freeR;
    }
    fen.rangeAdd(posMax, fin, addL);
    fen.rangeAdd(deb, posMax + 1, addR);

    while (!toProcess.empty() and get<0>(toProcess.top()) <= prevHeight) {
      auto [y, x, c] = toProcess.top();
      toProcess.pop();
      int gain = c + fen.point(x);
      dbg(x, y, gain, fen.point(x));
      solFree = max(solFree, gain);
    }
    dbg(deb, fin, solFree);
    return pair(toProcess, solFree);
  };
  cout << totCost - DFS(DFS, 0, N, 1e18).second << endl;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 328 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 2 ms 720 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 2 ms 808 KB Output is correct
26 Correct 2 ms 852 KB Output is correct
27 Correct 2 ms 724 KB Output is correct
28 Correct 2 ms 724 KB Output is correct
29 Correct 2 ms 724 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 2 ms 724 KB Output is correct
32 Correct 49 ms 1308 KB Output is correct
33 Correct 36 ms 1220 KB Output is correct
34 Correct 29 ms 1108 KB Output is correct
35 Correct 27 ms 1108 KB Output is correct
36 Correct 47 ms 1292 KB Output is correct
37 Correct 44 ms 1280 KB Output is correct
38 Correct 2 ms 1364 KB Output is correct
39 Correct 3 ms 848 KB Output is correct
40 Correct 54 ms 1404 KB Output is correct
41 Correct 4 ms 852 KB Output is correct
42 Correct 3 ms 848 KB Output is correct
43 Correct 57 ms 1360 KB Output is correct
44 Correct 3 ms 852 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 2 ms 720 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 2 ms 808 KB Output is correct
26 Correct 2 ms 852 KB Output is correct
27 Correct 2 ms 724 KB Output is correct
28 Correct 2 ms 724 KB Output is correct
29 Correct 2 ms 724 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 2 ms 724 KB Output is correct
32 Correct 49 ms 1308 KB Output is correct
33 Correct 36 ms 1220 KB Output is correct
34 Correct 29 ms 1108 KB Output is correct
35 Correct 27 ms 1108 KB Output is correct
36 Correct 47 ms 1292 KB Output is correct
37 Correct 44 ms 1280 KB Output is correct
38 Correct 2 ms 1364 KB Output is correct
39 Correct 3 ms 848 KB Output is correct
40 Correct 54 ms 1404 KB Output is correct
41 Correct 4 ms 852 KB Output is correct
42 Correct 3 ms 848 KB Output is correct
43 Correct 57 ms 1360 KB Output is correct
44 Correct 3 ms 852 KB Output is correct
45 Correct 212 ms 73912 KB Output is correct
46 Correct 217 ms 73076 KB Output is correct
47 Correct 204 ms 72236 KB Output is correct
48 Correct 193 ms 73976 KB Output is correct
49 Correct 204 ms 71668 KB Output is correct
50 Correct 193 ms 71564 KB Output is correct
51 Correct 197 ms 71744 KB Output is correct
52 Correct 202 ms 73616 KB Output is correct
53 Correct 196 ms 73240 KB Output is correct
54 Execution timed out 1555 ms 119224 KB Time limit exceeded
55 Halted 0 ms 0 KB -