oj.uz

답안 #213203

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
213203 2020-03-25T08:56:59 Z eriksuenderhauf 별자리 3 (JOI20_constellation3) C++11
100 / 100
 359 ms 104556 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define trav(x,a) for (const auto& x: a)
#define sz(x) (int)(x).size()
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int _i = 0; _i < (n); _i++) ni(a[_i])
#define nal(a, n) for (int _i = 0; _i < (n); _i++) nl(a[_i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
const int N = 1e6 + 5;
const double eps = 1e-9;

#define log2(x) (31 - __builtin_clz(x))

struct sparse_table {
  int n;
  vector<int> a;
  vector<vector<int>> st;
  int combine(int dl, int dr) {
    return a[dl] > a[dr] ? dl : dr;
  }
  sparse_table() {}
  sparse_table(vector<int> & a) : n(a.size()), a(a), st(log2(n) + 1, vector<int>(n)) {
    for (int i = 0; i < n; i++)
      st[0][i] = i;
    for (int j = 1; 1 << j <= n; j++)
      for (int i = 0; i + (1 << j) <= n; i++)
        st[j][i] = combine(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
  }
  // query the data on the range [l, r[
  int query(int l, int r) {
    int s = log2(r - l);
    return combine(st[s][l], st[s][r - (1 << s)]);
  }
};

multiset<pll> stX[N];
ll dp1[N], dp2[N];

void join(int i, pll jj) {
  int j = jj.nd;
  if (j < 0 || i == j) return;
  if (sz(stX[j]) > sz(stX[i]))
    swap(stX[i], stX[j]), swap(dp1[i], dp1[j]), swap(dp2[i], dp2[j]);
  trav(x, stX[j])
    stX[i].insert({x.st, x.nd - dp1[j] + dp1[i]});
  dp2[i] += dp2[j] + dp1[j];
  return;
}

pll dfs(int l, int r, int i, sparse_table& s) {
  if (l > r) return {0, -1};
  int id = l;
  if (l != r) {
    id = s.query(l, r+1);
    int mx = s.a[id];
    join(id, dfs(l, id - 1, mx, s));
    join(id, dfs(id + 1, r, mx, s));
  }
  while (!stX[id].empty() && stX[id].begin()->st <= i) {
    dp1[id] = max(dp1[id], stX[id].begin()->nd);
    stX[id].erase(stX[id].begin());
  }
  return {dp1[id] + dp2[id], id};
}

int main() {
  int n; ni(n);
  vector<int> a(n+1);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  int m; ni(m);
  ll ans = 0;
  for (int i = 1; i <= m; i++) {
    int x, y, c; scanf("%d %d %d", &x, &y, &c);
    stX[x].insert({y, c});
    ans += c;
  }
  sparse_table s(a);
  printf("%lld\n", ans - dfs(1, n, n+1, s).st);
  return 0;
}

Compilation message

constellation3.cpp: In function 'int main()':
constellation3.cpp:10:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
constellation3.cpp:92:10: note: in expansion of macro 'ni'
   int n; ni(n);
          ^~
constellation3.cpp:95:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &a[i]);
     ~~~~~^~~~~~~~~~~~~
constellation3.cpp:10:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
constellation3.cpp:97:10: note: in expansion of macro 'ni'
   int m; ni(m);
          ^~
constellation3.cpp:100:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int x, y, c; scanf("%d %d %d", &x, &y, &c);
                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 47360 KB Output is correct
2 Correct 29 ms 47488 KB Output is correct
3 Correct 29 ms 47360 KB Output is correct
4 Correct 28 ms 47224 KB Output is correct
5 Correct 29 ms 47360 KB Output is correct
6 Correct 29 ms 47232 KB Output is correct
7 Correct 28 ms 47360 KB Output is correct
8 Correct 29 ms 47360 KB Output is correct
9 Correct 29 ms 47352 KB Output is correct
10 Correct 29 ms 47360 KB Output is correct
11 Correct 29 ms 47360 KB Output is correct
12 Correct 28 ms 47360 KB Output is correct
13 Correct 29 ms 47360 KB Output is correct
14 Correct 29 ms 47360 KB Output is correct
15 Correct 29 ms 47352 KB Output is correct
16 Correct 30 ms 47360 KB Output is correct
17 Correct 30 ms 47360 KB Output is correct
18 Correct 29 ms 47360 KB Output is correct
19 Correct 29 ms 47360 KB Output is correct
20 Correct 29 ms 47360 KB Output is correct
21 Correct 29 ms 47352 KB Output is correct
22 Correct 29 ms 47360 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 47360 KB Output is correct
2 Correct 29 ms 47488 KB Output is correct
3 Correct 29 ms 47360 KB Output is correct
4 Correct 28 ms 47224 KB Output is correct
5 Correct 29 ms 47360 KB Output is correct
6 Correct 29 ms 47232 KB Output is correct
7 Correct 28 ms 47360 KB Output is correct
8 Correct 29 ms 47360 KB Output is correct
9 Correct 29 ms 47352 KB Output is correct
10 Correct 29 ms 47360 KB Output is correct
11 Correct 29 ms 47360 KB Output is correct
12 Correct 28 ms 47360 KB Output is correct
13 Correct 29 ms 47360 KB Output is correct
14 Correct 29 ms 47360 KB Output is correct
15 Correct 29 ms 47352 KB Output is correct
16 Correct 30 ms 47360 KB Output is correct
17 Correct 30 ms 47360 KB Output is correct
18 Correct 29 ms 47360 KB Output is correct
19 Correct 29 ms 47360 KB Output is correct
20 Correct 29 ms 47360 KB Output is correct
21 Correct 29 ms 47352 KB Output is correct
22 Correct 29 ms 47360 KB Output is correct
23 Correct 30 ms 47616 KB Output is correct
24 Correct 30 ms 47616 KB Output is correct
25 Correct 30 ms 47608 KB Output is correct
26 Correct 31 ms 47616 KB Output is correct
27 Correct 31 ms 47616 KB Output is correct
28 Correct 30 ms 47616 KB Output is correct
29 Correct 30 ms 47616 KB Output is correct
30 Correct 31 ms 47616 KB Output is correct
31 Correct 31 ms 47616 KB Output is correct
32 Correct 31 ms 47744 KB Output is correct
33 Correct 30 ms 47744 KB Output is correct
34 Correct 31 ms 47744 KB Output is correct
35 Correct 31 ms 47744 KB Output is correct
36 Correct 31 ms 47744 KB Output is correct
37 Correct 32 ms 47736 KB Output is correct
38 Correct 30 ms 47736 KB Output is correct
39 Correct 31 ms 47744 KB Output is correct
40 Correct 31 ms 47736 KB Output is correct
41 Correct 30 ms 47744 KB Output is correct
42 Correct 31 ms 47744 KB Output is correct
43 Correct 31 ms 47744 KB Output is correct
44 Correct 32 ms 47608 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 47360 KB Output is correct
2 Correct 29 ms 47488 KB Output is correct
3 Correct 29 ms 47360 KB Output is correct
4 Correct 28 ms 47224 KB Output is correct
5 Correct 29 ms 47360 KB Output is correct
6 Correct 29 ms 47232 KB Output is correct
7 Correct 28 ms 47360 KB Output is correct
8 Correct 29 ms 47360 KB Output is correct
9 Correct 29 ms 47352 KB Output is correct
10 Correct 29 ms 47360 KB Output is correct
11 Correct 29 ms 47360 KB Output is correct
12 Correct 28 ms 47360 KB Output is correct
13 Correct 29 ms 47360 KB Output is correct
14 Correct 29 ms 47360 KB Output is correct
15 Correct 29 ms 47352 KB Output is correct
16 Correct 30 ms 47360 KB Output is correct
17 Correct 30 ms 47360 KB Output is correct
18 Correct 29 ms 47360 KB Output is correct
19 Correct 29 ms 47360 KB Output is correct
20 Correct 29 ms 47360 KB Output is correct
21 Correct 29 ms 47352 KB Output is correct
22 Correct 29 ms 47360 KB Output is correct
23 Correct 30 ms 47616 KB Output is correct
24 Correct 30 ms 47616 KB Output is correct
25 Correct 30 ms 47608 KB Output is correct
26 Correct 31 ms 47616 KB Output is correct
27 Correct 31 ms 47616 KB Output is correct
28 Correct 30 ms 47616 KB Output is correct
29 Correct 30 ms 47616 KB Output is correct
30 Correct 31 ms 47616 KB Output is correct
31 Correct 31 ms 47616 KB Output is correct
32 Correct 31 ms 47744 KB Output is correct
33 Correct 30 ms 47744 KB Output is correct
34 Correct 31 ms 47744 KB Output is correct
35 Correct 31 ms 47744 KB Output is correct
36 Correct 31 ms 47744 KB Output is correct
37 Correct 32 ms 47736 KB Output is correct
38 Correct 30 ms 47736 KB Output is correct
39 Correct 31 ms 47744 KB Output is correct
40 Correct 31 ms 47736 KB Output is correct
41 Correct 30 ms 47744 KB Output is correct
42 Correct 31 ms 47744 KB Output is correct
43 Correct 31 ms 47744 KB Output is correct
44 Correct 32 ms 47608 KB Output is correct
45 Correct 268 ms 78320 KB Output is correct
46 Correct 258 ms 77816 KB Output is correct
47 Correct 277 ms 77960 KB Output is correct
48 Correct 255 ms 78064 KB Output is correct
49 Correct 269 ms 77576 KB Output is correct
50 Correct 267 ms 77324 KB Output is correct
51 Correct 264 ms 77704 KB Output is correct
52 Correct 270 ms 78200 KB Output is correct
53 Correct 264 ms 77812 KB Output is correct
54 Correct 343 ms 92268 KB Output is correct
55 Correct 348 ms 90624 KB Output is correct
56 Correct 338 ms 89992 KB Output is correct
57 Correct 351 ms 89872 KB Output is correct
58 Correct 345 ms 93704 KB Output is correct
59 Correct 344 ms 93708 KB Output is correct
60 Correct 180 ms 90472 KB Output is correct
61 Correct 346 ms 104556 KB Output is correct
62 Correct 342 ms 92808 KB Output is correct
63 Correct 334 ms 99704 KB Output is correct
64 Correct 337 ms 102024 KB Output is correct
65 Correct 338 ms 92672 KB Output is correct
66 Correct 359 ms 102656 KB Output is correct