oj.uz

답안 #772790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
772790 2023-07-04T11:19:58 Z marvinthang Two Currencies (JOI23_currencies) C++17
100 / 100
 514 ms 34188 KB 
/*************************************
*    author: marvinthang             *
*    created: 04.07.2023 17:42:26    *
*************************************/

#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--; )
#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 << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// index from 0
template <class T = int>
    struct Fenwick {

        T *bit = nullptr;
        int n;

        Fenwick(int _n = 0) {
            resize(_n);
        }

        void reset(void) {
            fill(bit, bit + 1 + n, T(0));
        }

        void resize(int _n) {
            if (bit != nullptr) delete[] bit;
            n = _n;
            bit = new T[n + 1];
            reset();
        }

        void update(int i, T val) {
            assert(0 <= i);
            ++i;
            for (; i <= n; i += i & -i) bit[i] += val;
        }

        T get(int i) {
            if (i < 0) return T(0);
            ++i;
            i = min(i, n);
            T res(0);
            for (; i > 0; i -= i & -i)
                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 MAX = 1e5 + 5;
const int LOG = 20;

int N, M, Q, tin[MAX], tout[MAX];
vector <int> adj[MAX];
pair <int, int> edges[MAX];
vector <pair <int, int>> events;
int anc[MAX][LOG], depth[MAX], res[MAX];
int U[MAX], V[MAX], X[MAX], lca[MAX];
long long Y[MAX];

void init(void) {
	cin >> N >> M >> Q;
	REP(i, N - 1) {
		int u, v; cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
		edges[i] = make_pair(u, v);
	}
}

void dfs(int u) {
	static int timeDfs = 0;
	tin[u] = timeDfs++;
	depth[u] = depth[anc[u][0]] + 1;
	FOR(i, 1, LOG) anc[u][i] = anc[anc[u][i - 1]][i - 1];
	for (int v: adj[u]) if (v != anc[u][0]) {
		anc[v][0] = u;
		dfs(v);
	}
	tout[u] = timeDfs;
}

int get_lca(int u, int v) {
	if (depth[u] < depth[v]) swap(u, v);
	REPD(i, LOG) if (depth[anc[u][i]] >= depth[v]) u = anc[u][i];
	if (u == v) return u;
	REPD(i, LOG) if (anc[u][i] != anc[v][i]) {
		u = anc[u][i];
		v = anc[v][i];
	}
	return anc[u][0];
}

Fenwick <int> cnt;
Fenwick <long long> sum;

void add(int p, int v) {
	int w = events[p].fi * v;
	p = events[p].se;
	cnt.update(tin[p], -v);
	cnt.update(tout[p], v);
	sum.update(tin[p], w);
	sum.update(tout[p], -w);
}

int calc(int i) {
	long long s = sum.get(tin[U[i]]) + sum.get(tin[V[i]]) - 2 * sum.get(tin[lca[i]]);
	if (s <= Y[i]) {
		int c = cnt.get(tin[U[i]]) + cnt.get(tin[V[i]]) - 2 * cnt.get(tin[lca[i]]);
		return max(-1, X[i] - c);
	}
	return -2;
}

void solve(int l, int r, const vector <int> &q) {
	if (q.empty()) return;
	if (r - l == 1) {
		for (int i: q) res[i] = calc(i);
		if (r == M) {
			add(l, 1);
			for (int i: q) maximize(res[i], calc(i));
			add(l, -1);
		}
		return;
	}
	int m = l + r >> 1;
	FOR(i, l, m) add(i, 1);
	vector <int> ql, qr;
	for (int i: q) (calc(i) == -2 ? ql : qr).push_back(i);
	solve(m, r, qr);
	FOR(i, l, m) add(i, -1);
	solve(l, m, ql);
}

void process(void) {
	dfs(1);
	sum.resize(N);
	cnt.resize(N);
	REP(i, M) {
		int p, c; cin >> p >> c; --p;
		p = anc[edges[p].fi][0] == edges[p].se ? edges[p].fi : edges[p].se;
		events.emplace_back(c, p);
		cnt.update(tin[p], +1);
		cnt.update(tout[p], -1);
	}
	sort(ALL(events));
	vector <int> q;
	REP(i, Q) {
		cin >> U[i] >> V[i] >> X[i] >> Y[i];
		lca[i] = get_lca(U[i], V[i]);
		q.push_back(i);
	}
	solve(0, M, q);
	REP(i, Q) cout << res[i] << '\n';
}

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

Compilation message

currencies.cpp: In function 'void solve(int, int, const std::vector<int>&)':
currencies.cpp:185:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  185 |  int m = l + r >> 1;
      |          ~~^~~
currencies.cpp: In function 'int main()':
currencies.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:218:2: note: in expansion of macro 'file'
  218 |  file("currencies");
      |  ^~~~
currencies.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:218:2: note: in expansion of macro 'file'
  218 |  file("currencies");
      |  ^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 5 ms 3068 KB Output is correct
6 Correct 6 ms 3156 KB Output is correct
7 Correct 5 ms 3028 KB Output is correct
8 Correct 6 ms 3212 KB Output is correct
9 Correct 6 ms 3156 KB Output is correct
10 Correct 6 ms 3156 KB Output is correct
11 Correct 6 ms 3208 KB Output is correct
12 Correct 6 ms 3156 KB Output is correct
13 Correct 6 ms 3284 KB Output is correct
14 Correct 6 ms 3216 KB Output is correct
15 Correct 6 ms 3156 KB Output is correct
16 Correct 6 ms 3156 KB Output is correct
17 Correct 6 ms 3216 KB Output is correct
18 Correct 6 ms 3156 KB Output is correct
19 Correct 8 ms 3216 KB Output is correct
20 Correct 6 ms 3156 KB Output is correct
21 Correct 6 ms 3212 KB Output is correct
22 Correct 10 ms 3280 KB Output is correct
23 Correct 6 ms 3156 KB Output is correct
24 Correct 6 ms 3212 KB Output is correct
25 Correct 5 ms 3216 KB Output is correct
26 Correct 6 ms 3156 KB Output is correct
27 Correct 4 ms 3156 KB Output is correct
28 Correct 5 ms 3156 KB Output is correct
29 Correct 5 ms 3156 KB Output is correct
30 Correct 6 ms 3156 KB Output is correct
31 Correct 6 ms 3216 KB Output is correct
32 Correct 6 ms 3156 KB Output is correct
33 Correct 8 ms 3328 KB Output is correct
34 Correct 6 ms 3284 KB Output is correct
35 Correct 6 ms 3284 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 6 ms 3028 KB Output is correct
3 Correct 6 ms 3156 KB Output is correct
4 Correct 7 ms 3156 KB Output is correct
5 Correct 297 ms 25928 KB Output is correct
6 Correct 374 ms 23948 KB Output is correct
7 Correct 334 ms 25336 KB Output is correct
8 Correct 279 ms 23604 KB Output is correct
9 Correct 267 ms 23268 KB Output is correct
10 Correct 446 ms 27480 KB Output is correct
11 Correct 423 ms 27520 KB Output is correct
12 Correct 415 ms 27552 KB Output is correct
13 Correct 412 ms 27584 KB Output is correct
14 Correct 427 ms 27460 KB Output is correct
15 Correct 466 ms 33752 KB Output is correct
16 Correct 489 ms 34060 KB Output is correct
17 Correct 506 ms 33204 KB Output is correct
18 Correct 484 ms 27708 KB Output is correct
19 Correct 472 ms 27708 KB Output is correct
20 Correct 514 ms 27692 KB Output is correct
21 Correct 409 ms 28448 KB Output is correct
22 Correct 425 ms 28624 KB Output is correct
23 Correct 388 ms 28568 KB Output is correct
24 Correct 395 ms 28540 KB Output is correct
25 Correct 352 ms 27812 KB Output is correct
26 Correct 358 ms 28340 KB Output is correct
27 Correct 356 ms 28092 KB Output is correct
28 Correct 235 ms 28008 KB Output is correct
29 Correct 241 ms 28716 KB Output is correct
30 Correct 277 ms 27772 KB Output is correct
31 Correct 325 ms 28020 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 6 ms 3156 KB Output is correct
3 Correct 6 ms 3284 KB Output is correct
4 Correct 6 ms 3212 KB Output is correct
5 Correct 263 ms 30936 KB Output is correct
6 Correct 289 ms 30236 KB Output is correct
7 Correct 313 ms 24932 KB Output is correct
8 Correct 468 ms 34040 KB Output is correct
9 Correct 464 ms 34188 KB Output is correct
10 Correct 445 ms 34044 KB Output is correct
11 Correct 391 ms 34052 KB Output is correct
12 Correct 374 ms 34152 KB Output is correct
13 Correct 372 ms 34084 KB Output is correct
14 Correct 265 ms 34016 KB Output is correct
15 Correct 269 ms 33980 KB Output is correct
16 Correct 336 ms 34180 KB Output is correct
17 Correct 288 ms 34116 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 5 ms 3068 KB Output is correct
6 Correct 6 ms 3156 KB Output is correct
7 Correct 5 ms 3028 KB Output is correct
8 Correct 6 ms 3212 KB Output is correct
9 Correct 6 ms 3156 KB Output is correct
10 Correct 6 ms 3156 KB Output is correct
11 Correct 6 ms 3208 KB Output is correct
12 Correct 6 ms 3156 KB Output is correct
13 Correct 6 ms 3284 KB Output is correct
14 Correct 6 ms 3216 KB Output is correct
15 Correct 6 ms 3156 KB Output is correct
16 Correct 6 ms 3156 KB Output is correct
17 Correct 6 ms 3216 KB Output is correct
18 Correct 6 ms 3156 KB Output is correct
19 Correct 8 ms 3216 KB Output is correct
20 Correct 6 ms 3156 KB Output is correct
21 Correct 6 ms 3212 KB Output is correct
22 Correct 10 ms 3280 KB Output is correct
23 Correct 6 ms 3156 KB Output is correct
24 Correct 6 ms 3212 KB Output is correct
25 Correct 5 ms 3216 KB Output is correct
26 Correct 6 ms 3156 KB Output is correct
27 Correct 4 ms 3156 KB Output is correct
28 Correct 5 ms 3156 KB Output is correct
29 Correct 5 ms 3156 KB Output is correct
30 Correct 6 ms 3156 KB Output is correct
31 Correct 6 ms 3216 KB Output is correct
32 Correct 6 ms 3156 KB Output is correct
33 Correct 8 ms 3328 KB Output is correct
34 Correct 6 ms 3284 KB Output is correct
35 Correct 6 ms 3284 KB Output is correct
36 Correct 1 ms 2644 KB Output is correct
37 Correct 6 ms 3028 KB Output is correct
38 Correct 6 ms 3156 KB Output is correct
39 Correct 7 ms 3156 KB Output is correct
40 Correct 297 ms 25928 KB Output is correct
41 Correct 374 ms 23948 KB Output is correct
42 Correct 334 ms 25336 KB Output is correct
43 Correct 279 ms 23604 KB Output is correct
44 Correct 267 ms 23268 KB Output is correct
45 Correct 446 ms 27480 KB Output is correct
46 Correct 423 ms 27520 KB Output is correct
47 Correct 415 ms 27552 KB Output is correct
48 Correct 412 ms 27584 KB Output is correct
49 Correct 427 ms 27460 KB Output is correct
50 Correct 466 ms 33752 KB Output is correct
51 Correct 489 ms 34060 KB Output is correct
52 Correct 506 ms 33204 KB Output is correct
53 Correct 484 ms 27708 KB Output is correct
54 Correct 472 ms 27708 KB Output is correct
55 Correct 514 ms 27692 KB Output is correct
56 Correct 409 ms 28448 KB Output is correct
57 Correct 425 ms 28624 KB Output is correct
58 Correct 388 ms 28568 KB Output is correct
59 Correct 395 ms 28540 KB Output is correct
60 Correct 352 ms 27812 KB Output is correct
61 Correct 358 ms 28340 KB Output is correct
62 Correct 356 ms 28092 KB Output is correct
63 Correct 235 ms 28008 KB Output is correct
64 Correct 241 ms 28716 KB Output is correct
65 Correct 277 ms 27772 KB Output is correct
66 Correct 325 ms 28020 KB Output is correct
67 Correct 2 ms 2644 KB Output is correct
68 Correct 6 ms 3156 KB Output is correct
69 Correct 6 ms 3284 KB Output is correct
70 Correct 6 ms 3212 KB Output is correct
71 Correct 263 ms 30936 KB Output is correct
72 Correct 289 ms 30236 KB Output is correct
73 Correct 313 ms 24932 KB Output is correct
74 Correct 468 ms 34040 KB Output is correct
75 Correct 464 ms 34188 KB Output is correct
76 Correct 445 ms 34044 KB Output is correct
77 Correct 391 ms 34052 KB Output is correct
78 Correct 374 ms 34152 KB Output is correct
79 Correct 372 ms 34084 KB Output is correct
80 Correct 265 ms 34016 KB Output is correct
81 Correct 269 ms 33980 KB Output is correct
82 Correct 336 ms 34180 KB Output is correct
83 Correct 288 ms 34116 KB Output is correct
84 Correct 319 ms 23644 KB Output is correct
85 Correct 323 ms 20012 KB Output is correct
86 Correct 261 ms 19428 KB Output is correct
87 Correct 421 ms 27380 KB Output is correct
88 Correct 442 ms 27464 KB Output is correct
89 Correct 411 ms 27408 KB Output is correct
90 Correct 405 ms 27276 KB Output is correct
91 Correct 438 ms 27404 KB Output is correct
92 Correct 443 ms 31672 KB Output is correct
93 Correct 473 ms 32976 KB Output is correct
94 Correct 470 ms 27588 KB Output is correct
95 Correct 477 ms 27736 KB Output is correct
96 Correct 479 ms 27780 KB Output is correct
97 Correct 470 ms 27680 KB Output is correct
98 Correct 387 ms 28536 KB Output is correct
99 Correct 369 ms 28480 KB Output is correct
100 Correct 409 ms 28540 KB Output is correct
101 Correct 372 ms 28508 KB Output is correct
102 Correct 380 ms 28012 KB Output is correct
103 Correct 368 ms 28136 KB Output is correct
104 Correct 356 ms 28152 KB Output is correct
105 Correct 247 ms 27652 KB Output is correct
106 Correct 264 ms 27736 KB Output is correct
107 Correct 304 ms 27696 KB Output is correct
108 Correct 291 ms 27784 KB Output is correct