oj.uz

Submission #882959

# Submission time Handle Problem Language Result Execution time Memory
882959 2023-12-04T09:23:05 Z marvinthang Constellation 3 (JOI20_constellation3) C++17
100 / 100
 330 ms 67404 KB 
/*************************************
*    author: marvinthang             *
*    created: 04.12.2023 16:03:56    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// index from 0
template <class T> struct Fenwick {
    int n; vector <T> bit;
    Fenwick(int _n = 0): n(_n), bit(n + 1, 0) {}
    void reset(void) { fill(bit.begin(), bit.end(), 0); }
    void resize(int _n) { bit.assign(_n + 1, 0); }
    void update(int i, T val) { for (++i; i <= n; i += i & -i) bit[i] += val; }
    T get(int i) {
        if (i < 0) return 0;
        T res(0);
        for (i = min(i + 1, n); i > 0; i &= i - 1) res += bit[i];
        return res;
    }
    int upper_bound(T val) {
        int res = 0;
        for (int i = __lg(n); i >= 0; --i) 
            if ((res | MASK(i)) <= n && val >= bit[res | MASK(i)]) res |= MASK(i), val -= bit[res];
        return res;
    }
    int lower_bound(T val) {
        int res = 0;
        for (int i = __lg(n); i >= 0; --i)
            if ((res | MASK(i)) <= n && val > bit[res | MASK(i)]) res |= MASK(i), val -= bit[res];
        return res;
    }
};

// end of template

const int LOG = 18;

void process(void) {
	int n; cin >> n;
	vector <int> a(n);
	stack <int> st;
	vector <array <int, LOG>> anc(n);
	REP(i, n) {
		cin >> a[i];
		int last = -1;
		while (!st.empty() && a[st.top()] < a[i]) {
			last = st.top();
			st.pop();
		}
		if (!st.empty()) anc[i][0] = st.top();
		else anc[i][0] = i;
		if (last != -1) anc[last][0] = i;
		st.push(i);
	}
	vector <vector <int>> adj(n);
	int rt = -1;
	REP(i, n) {
		if (anc[i][0] == i) rt = i;
		else adj[anc[i][0]].push_back(i);
	}
	vector <int> depth(n), tin(n), tout(n);
	int t = 0;
	function<void(int)> dfs = [&] (int u) {
		tin[u] = t++;
		FOR(i, 1, LOG) anc[u][i] = anc[anc[u][i - 1]][i - 1];
		for (int v: adj[u]) {
			depth[v] = depth[u] + 1;
			dfs(v);
		}
		tout[u] = t;
	};
	dfs(rt);
	int m; cin >> m;
	vector <vector <pair <int, int>>> stars(n);
	long long sum = 0;
	while (m--) {
		int x, y, c; cin >> x >> y >> c; --x;
		sum += c;
		int u = x;
		REPD(i, LOG) if (a[anc[u][i]] < y) u = anc[u][i];
		stars[u].emplace_back(x, c);
	}
	Fenwick <long long> bit(n);
	vector <long long> dp(n), sum_dp(n);
	function<void(int)> dfs2 = [&] (int u) {
		for (int v: adj[u]) {
			dfs2(v);
			sum_dp[u] += dp[v];
		}
		if ((int) adj[u].size() == 2) {
			REP(t, 2) {
				bit.update(tin[adj[u][t]], dp[adj[u][!t]]);
				bit.update(tout[adj[u][t]], -dp[adj[u][!t]]);
			}
		}
		dp[u] = sum_dp[u];
		for (auto [x, c]: stars[u]) {
			dp[u] = max(dp[u], bit.get(tin[x]) + c + sum_dp[x]);
		}
	};
	dfs2(rt);
	cout << sum - dp[rt] << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("JOI20_constellation3");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

constellation3.cpp: In function 'int main()':
constellation3.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
constellation3.cpp:143:2: note: in expansion of macro 'file'
  143 |  file("JOI20_constellation3");
      |  ^~~~
constellation3.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
constellation3.cpp:143:2: note: in expansion of macro 'file'
  143 |  file("JOI20_constellation3");
      |  ^~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 420 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 416 KB Output is correct
18 Correct 0 ms 440 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 512 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 420 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 416 KB Output is correct
18 Correct 0 ms 440 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 2 ms 856 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 2 ms 828 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 2 ms 860 KB Output is correct
33 Correct 2 ms 980 KB Output is correct
34 Correct 2 ms 856 KB Output is correct
35 Correct 2 ms 888 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 1 ms 860 KB Output is correct
38 Correct 2 ms 1116 KB Output is correct
39 Correct 2 ms 860 KB Output is correct
40 Correct 2 ms 860 KB Output is correct
41 Correct 2 ms 860 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 2 ms 1012 KB Output is correct
44 Correct 2 ms 860 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 420 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 416 KB Output is correct
18 Correct 0 ms 440 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 2 ms 856 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 2 ms 828 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 2 ms 860 KB Output is correct
33 Correct 2 ms 980 KB Output is correct
34 Correct 2 ms 856 KB Output is correct
35 Correct 2 ms 888 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 1 ms 860 KB Output is correct
38 Correct 2 ms 1116 KB Output is correct
39 Correct 2 ms 860 KB Output is correct
40 Correct 2 ms 860 KB Output is correct
41 Correct 2 ms 860 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 2 ms 1012 KB Output is correct
44 Correct 2 ms 860 KB Output is correct
45 Correct 212 ms 44740 KB Output is correct
46 Correct 191 ms 44416 KB Output is correct
47 Correct 208 ms 43876 KB Output is correct
48 Correct 187 ms 44760 KB Output is correct
49 Correct 210 ms 43380 KB Output is correct
50 Correct 176 ms 43568 KB Output is correct
51 Correct 185 ms 43416 KB Output is correct
52 Correct 210 ms 44732 KB Output is correct
53 Correct 194 ms 44372 KB Output is correct
54 Correct 330 ms 58984 KB Output is correct
55 Correct 273 ms 54096 KB Output is correct
56 Correct 275 ms 51208 KB Output is correct
57 Correct 292 ms 49672 KB Output is correct
58 Correct 179 ms 54740 KB Output is correct
59 Correct 214 ms 54192 KB Output is correct
60 Correct 146 ms 67404 KB Output is correct
61 Correct 175 ms 43992 KB Output is correct
62 Correct 263 ms 61524 KB Output is correct
63 Correct 186 ms 43188 KB Output is correct
64 Correct 167 ms 42580 KB Output is correct
65 Correct 323 ms 62224 KB Output is correct
66 Correct 172 ms 42580 KB Output is correct