oj.uz

Submission #709305

# Submission time Handle Problem Language Result Execution time Memory
709305 2023-03-13T10:44:53 Z awu Discharging (NOI20_discharging) C++14
36 / 100
 1000 ms 173584 KB 
#include <bits/extc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")

#define int long long
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define debug(x) do{auto y = x; cout << #x << " = " << y << endl;}while(0)
// #define endl "\n"
#define unordered_map __gnu_pbds::gp_hash_table
using pii = pair<int, int>;

const int inf = 1ll << 60;
const int MOD = 1e9 + 7;

int fastlog2(int x) {
  return 63 - __builtin_clzll(x);
}

struct sparsetable {
  vector<vector<int>> t;
  sparsetable() {}
  sparsetable(vector<int>& a) {
    int n = a.size();
    t.resize(fastlog2(n) + 1, vector<int>(n));
    t[0] = a;
    for(int i = 1; i <= fastlog2(n); i++) {
      for(int j = 0; j + (1 << i) <= n; j++) {
        t[i][j] = max(t[i - 1][j], t[i - 1][j + (1 << (i - 1))]);
      }
    }
  }
  int query(int ql, int qr) {
    int lg = fastlog2(qr - ql);
    return max(t[lg][ql], t[lg][qr - (1 << lg)]);
  }
};
int n;
sparsetable st;

int eval(pii f, int x) {
  if(x >= f.f) return inf;
  return (n - x) * st.query(x, f.f) + f.s;
}

// struct lichao {
//   int tl, tr;
//   pii f;
//   lichao *lc, *rc;
//   void insert(pii f2) {
//     int tm = (tl + tr) / 2;
//     if(eval(f2, tm) < eval(f, tm)) swap(f, f2);
//     if(tl + 1 == tr) return;
//     if(eval(f2, tl) <= eval(f, tl)) {
//       if(!lc) {
//         lc = new lichao{tl, tm, f2};
//       } else {
//         lc->insert(f2);
//       }
//     }
//     if(eval(f2, tr - 1) <= eval(f, tr - 1)) {
//       if(!rc) {
//         rc = new lichao{tm, tr, f2};
//       } else {
//         rc->insert(f2);
//       }
//     }
//   }
//   int query(int x) {
//     int tm = (tl + tr) / 2;
//     int res = eval(f, x);
//     if(x < tm && lc) return min(res, lc->query(x));
//     if(x >= tm && rc) return min(res, rc->query(x));
//     return res;
//   }
// };

struct lichao {
  vector<pii> fs;
  void insert(pii f2) {
    fs.push_back(f2);
  }
  int query(int x) {
    int res = inf;
    for(auto f : fs) {
      res = min(res, eval(f, x));
    }
    return res;
  }
};

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  vector<int> t(n);
  for(int i = 0; i < n; i++) {
    cin >> t[i];
  }
  st = sparsetable(t);
  vector<int> dp(n);
  // lichao lct{0, n, {n, 0}};
  lichao lct{{{n, 0}}};
  for(int i = n - 1; i >= 0; i--) {
    dp[i] = lct.query(i);
    lct.insert({i, dp[i]});
  }
  cout << dp[0] << endl;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 468 KB Output is correct
2 Correct 4 ms 468 KB Output is correct
3 Correct 5 ms 468 KB Output is correct
4 Correct 4 ms 516 KB Output is correct
5 Correct 4 ms 528 KB Output is correct
6 Correct 4 ms 468 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 5 ms 468 KB Output is correct
10 Correct 4 ms 468 KB Output is correct
11 Correct 5 ms 468 KB Output is correct
12 Correct 7 ms 468 KB Output is correct
13 Correct 4 ms 468 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 4 ms 516 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 468 KB Output is correct
2 Correct 4 ms 468 KB Output is correct
3 Correct 5 ms 468 KB Output is correct
4 Correct 4 ms 516 KB Output is correct
5 Correct 4 ms 528 KB Output is correct
6 Correct 4 ms 468 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 5 ms 468 KB Output is correct
10 Correct 4 ms 468 KB Output is correct
11 Correct 5 ms 468 KB Output is correct
12 Correct 7 ms 468 KB Output is correct
13 Correct 4 ms 468 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 4 ms 516 KB Output is correct
16 Execution timed out 1082 ms 173584 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1075 ms 173488 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 4 ms 468 KB Output is correct
16 Correct 4 ms 468 KB Output is correct
17 Correct 5 ms 468 KB Output is correct
18 Correct 4 ms 516 KB Output is correct
19 Correct 4 ms 528 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 4 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 5 ms 468 KB Output is correct
24 Correct 4 ms 468 KB Output is correct
25 Correct 5 ms 468 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 4 ms 468 KB Output is correct
28 Correct 5 ms 468 KB Output is correct
29 Correct 4 ms 516 KB Output is correct
30 Correct 4 ms 468 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 7 ms 468 KB Output is correct
33 Correct 5 ms 448 KB Output is correct
34 Correct 4 ms 468 KB Output is correct
35 Correct 5 ms 468 KB Output is correct
36 Correct 4 ms 460 KB Output is correct
37 Correct 4 ms 468 KB Output is correct
38 Correct 4 ms 468 KB Output is correct
39 Correct 5 ms 468 KB Output is correct
40 Correct 4 ms 468 KB Output is correct
41 Correct 5 ms 468 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 4 ms 468 KB Output is correct
44 Correct 4 ms 468 KB Output is correct
45 Correct 5 ms 468 KB Output is correct
46 Correct 4 ms 468 KB Output is correct
47 Correct 4 ms 468 KB Output is correct
48 Correct 4 ms 468 KB Output is correct
49 Correct 4 ms 468 KB Output is correct
50 Correct 4 ms 468 KB Output is correct

Subtask #6
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 4 ms 468 KB Output is correct
16 Correct 4 ms 468 KB Output is correct
17 Correct 5 ms 468 KB Output is correct
18 Correct 4 ms 516 KB Output is correct
19 Correct 4 ms 528 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 4 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 5 ms 468 KB Output is correct
24 Correct 4 ms 468 KB Output is correct
25 Correct 5 ms 468 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 4 ms 468 KB Output is correct
28 Correct 5 ms 468 KB Output is correct
29 Correct 4 ms 516 KB Output is correct
30 Execution timed out 1082 ms 173584 KB Time limit exceeded
31 Halted 0 ms 0 KB -