oj.uz

Submission #776593

# Submission time Handle Problem Language Result Execution time Memory
776593 2023-07-08T05:09:27 Z marvinthang Reconstruction Project (JOI22_reconstruction) C++17
100 / 100
 599 ms 224544 KB 
/*************************************
*    author: marvinthang             *
*    created: 08.07.2023 11:56:43    *
*************************************/

#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 << '}'; }

struct DisjointSet {
    
    int n, *lab = nullptr;

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

    void reset(void) {
        memset(lab, -1, (n + 1) * sizeof(int));
    }

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

    int find(int u) {
        assert(u <= n);
        return lab[u] < 0 ? u : lab[u] = find(lab[u]);
    }

    bool connected(int u, int v) { return find(u) == find(v); }
    bool isRoot(int u) { return lab[u] < 0; }
    int size(int u) { return -lab[find(u)]; }

    bool join(int u, int v) {
        if ((u = find(u)) == (v = find(v))) return false;
        if (lab[u] > lab[v]) swap(u, v);
        lab[u] += lab[v];
        lab[v] = u;
        return true;
    }

};

using DSU = DisjointSet;

// end of template

const int MAX = 1e5 + 5;

int N, M, Q;
tuple <int, int, int> edges[MAX];

void init(void) {
	cin >> N >> M;
	REP(i, M) {
		int u, v, w; cin >> u >> v >> w;
		edges[i] = make_tuple(w, u, v);
	}
	cin >> Q;
}

void process(void) {
	DSU dsu(N);
	vector <int> id;
	sort(edges, edges + M);
	long long sum = 0;
	int cnt = 0;
	vector <tuple <int, int, int>> add;
	REP(i, M) {
		auto [w, u, v] = edges[i];
		add.emplace_back(w, -2 * w, 2);
		if (dsu.join(u, v)) {
			sum += w;
			--cnt;
			id.push_back(i);
			continue;
		}
		DSU d(N);
		d.join(u, v);
		REPD(j, id.size()) {
			auto [c, a, b] = edges[id[j]];
			if (!d.join(a, b)) {
				add.emplace_back((c + w + 1) / 2, c + w, -2);
				id.erase(id.begin() + j);
				id.push_back(i);
				break;
			}
		}
	}
	sort(ALL(add));
	int i = 0;
	while (Q--) {
		int x; cin >> x;
		while (i < add.size() && get<0>(add[i]) <= x) {
			sum += get<1>(add[i]);
			cnt += get<2>(add[i]);
			++i;
		}
		cout << sum + 1LL * x * cnt << '\n';
	}
}

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

Compilation message

reconstruction.cpp: In function 'void process()':
reconstruction.cpp:131:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |   while (i < add.size() && get<0>(add[i]) <= x) {
      |          ~~^~~~~~~~~~~~
reconstruction.cpp: In function 'int main()':
reconstruction.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
reconstruction.cpp:142:2: note: in expansion of macro 'file'
  142 |  file("reconstruction");
      |  ^~~~
reconstruction.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
reconstruction.cpp:142:2: note: in expansion of macro 'file'
  142 |  file("reconstruction");
      |  ^~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 1 ms 328 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 1 ms 328 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 385 ms 201860 KB Output is correct
21 Correct 233 ms 201716 KB Output is correct
22 Correct 239 ms 201732 KB Output is correct
23 Correct 267 ms 201744 KB Output is correct
24 Correct 319 ms 201812 KB Output is correct
25 Correct 361 ms 201776 KB Output is correct
26 Correct 412 ms 201712 KB Output is correct
27 Correct 383 ms 201868 KB Output is correct
28 Correct 371 ms 201720 KB Output is correct
29 Correct 230 ms 201856 KB Output is correct
30 Correct 377 ms 201760 KB Output is correct
31 Correct 387 ms 201700 KB Output is correct
32 Correct 394 ms 201752 KB Output is correct
33 Correct 380 ms 201900 KB Output is correct
34 Correct 254 ms 201896 KB Output is correct
35 Correct 381 ms 201780 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 431 ms 222548 KB Output is correct
5 Correct 435 ms 222508 KB Output is correct
6 Correct 406 ms 222416 KB Output is correct
7 Correct 278 ms 224364 KB Output is correct
8 Correct 265 ms 224464 KB Output is correct
9 Correct 242 ms 224492 KB Output is correct
10 Correct 412 ms 222636 KB Output is correct
11 Correct 247 ms 224544 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 1 ms 328 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 146 ms 23196 KB Output is correct
21 Correct 144 ms 23296 KB Output is correct
22 Correct 141 ms 23332 KB Output is correct
23 Correct 158 ms 23312 KB Output is correct
24 Correct 149 ms 23244 KB Output is correct
25 Correct 146 ms 23252 KB Output is correct
26 Correct 148 ms 23204 KB Output is correct
27 Correct 146 ms 23224 KB Output is correct
28 Correct 146 ms 23252 KB Output is correct
29 Correct 142 ms 23228 KB Output is correct
30 Correct 144 ms 23328 KB Output is correct
31 Correct 148 ms 23120 KB Output is correct
32 Correct 145 ms 23752 KB Output is correct
33 Correct 151 ms 23116 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 1 ms 328 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 385 ms 201860 KB Output is correct
21 Correct 233 ms 201716 KB Output is correct
22 Correct 239 ms 201732 KB Output is correct
23 Correct 267 ms 201744 KB Output is correct
24 Correct 319 ms 201812 KB Output is correct
25 Correct 361 ms 201776 KB Output is correct
26 Correct 412 ms 201712 KB Output is correct
27 Correct 383 ms 201868 KB Output is correct
28 Correct 371 ms 201720 KB Output is correct
29 Correct 230 ms 201856 KB Output is correct
30 Correct 377 ms 201760 KB Output is correct
31 Correct 387 ms 201700 KB Output is correct
32 Correct 394 ms 201752 KB Output is correct
33 Correct 380 ms 201900 KB Output is correct
34 Correct 254 ms 201896 KB Output is correct
35 Correct 381 ms 201780 KB Output is correct
36 Correct 406 ms 202104 KB Output is correct
37 Correct 259 ms 202176 KB Output is correct
38 Correct 241 ms 202216 KB Output is correct
39 Correct 300 ms 202160 KB Output is correct
40 Correct 326 ms 202152 KB Output is correct
41 Correct 362 ms 202208 KB Output is correct
42 Correct 385 ms 202224 KB Output is correct
43 Correct 377 ms 202104 KB Output is correct
44 Correct 416 ms 202172 KB Output is correct
45 Correct 213 ms 202160 KB Output is correct
46 Correct 378 ms 202232 KB Output is correct
47 Correct 377 ms 202216 KB Output is correct
48 Correct 401 ms 202104 KB Output is correct
49 Correct 384 ms 202212 KB Output is correct
50 Correct 230 ms 202360 KB Output is correct
51 Correct 388 ms 202216 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 1 ms 328 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 385 ms 201860 KB Output is correct
21 Correct 233 ms 201716 KB Output is correct
22 Correct 239 ms 201732 KB Output is correct
23 Correct 267 ms 201744 KB Output is correct
24 Correct 319 ms 201812 KB Output is correct
25 Correct 361 ms 201776 KB Output is correct
26 Correct 412 ms 201712 KB Output is correct
27 Correct 383 ms 201868 KB Output is correct
28 Correct 371 ms 201720 KB Output is correct
29 Correct 230 ms 201856 KB Output is correct
30 Correct 377 ms 201760 KB Output is correct
31 Correct 387 ms 201700 KB Output is correct
32 Correct 394 ms 201752 KB Output is correct
33 Correct 380 ms 201900 KB Output is correct
34 Correct 254 ms 201896 KB Output is correct
35 Correct 381 ms 201780 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 328 KB Output is correct
39 Correct 431 ms 222548 KB Output is correct
40 Correct 435 ms 222508 KB Output is correct
41 Correct 406 ms 222416 KB Output is correct
42 Correct 278 ms 224364 KB Output is correct
43 Correct 265 ms 224464 KB Output is correct
44 Correct 242 ms 224492 KB Output is correct
45 Correct 412 ms 222636 KB Output is correct
46 Correct 247 ms 224544 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 146 ms 23196 KB Output is correct
49 Correct 144 ms 23296 KB Output is correct
50 Correct 141 ms 23332 KB Output is correct
51 Correct 158 ms 23312 KB Output is correct
52 Correct 149 ms 23244 KB Output is correct
53 Correct 146 ms 23252 KB Output is correct
54 Correct 148 ms 23204 KB Output is correct
55 Correct 146 ms 23224 KB Output is correct
56 Correct 146 ms 23252 KB Output is correct
57 Correct 142 ms 23228 KB Output is correct
58 Correct 144 ms 23328 KB Output is correct
59 Correct 148 ms 23120 KB Output is correct
60 Correct 145 ms 23752 KB Output is correct
61 Correct 151 ms 23116 KB Output is correct
62 Correct 406 ms 202104 KB Output is correct
63 Correct 259 ms 202176 KB Output is correct
64 Correct 241 ms 202216 KB Output is correct
65 Correct 300 ms 202160 KB Output is correct
66 Correct 326 ms 202152 KB Output is correct
67 Correct 362 ms 202208 KB Output is correct
68 Correct 385 ms 202224 KB Output is correct
69 Correct 377 ms 202104 KB Output is correct
70 Correct 416 ms 202172 KB Output is correct
71 Correct 213 ms 202160 KB Output is correct
72 Correct 378 ms 202232 KB Output is correct
73 Correct 377 ms 202216 KB Output is correct
74 Correct 401 ms 202104 KB Output is correct
75 Correct 384 ms 202212 KB Output is correct
76 Correct 230 ms 202360 KB Output is correct
77 Correct 388 ms 202216 KB Output is correct
78 Correct 525 ms 221492 KB Output is correct
79 Correct 394 ms 223520 KB Output is correct
80 Correct 431 ms 222420 KB Output is correct
81 Correct 437 ms 222512 KB Output is correct
82 Correct 462 ms 221568 KB Output is correct
83 Correct 517 ms 221432 KB Output is correct
84 Correct 524 ms 221464 KB Output is correct
85 Correct 540 ms 221436 KB Output is correct
86 Correct 539 ms 221424 KB Output is correct
87 Correct 359 ms 223064 KB Output is correct
88 Correct 525 ms 221624 KB Output is correct
89 Correct 566 ms 221460 KB Output is correct
90 Correct 537 ms 221528 KB Output is correct
91 Correct 541 ms 221408 KB Output is correct
92 Correct 366 ms 224424 KB Output is correct
93 Correct 599 ms 222592 KB Output is correct