Submission #776975

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
776975	2023-07-08T12:52:38 Z	marvinthang	Meetings 2 (JOI21_meetings2)	C++17	0 / 100	4 ms	5036 KB

meetings2

/*************************************
*    author: marvinthang             *
*    created: 08.07.2023 19:22:52    *
*************************************/

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

// end of template

const int MAX = 2e5 + 5;

int N;
vector <int> adj[MAX];

void init(void) {
	cin >> N;
	FOR(i, 1, N) {
		int u, v; cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
}

int res[MAX], treeSize[MAX];
bool used[MAX];

void calcSize(int u, int par) {
	treeSize[u] = 1;
	for (int v: adj[u]) if (!used[v] && v != par) {
		calcSize(v, u);
		treeSize[u] += treeSize[v];
	}
}

int findCentroid(int u, int par, int n) {
	for (int v: adj[u]) if (!used[v] && v != par && treeSize[v] > n / 2) {
		treeSize[u] = n - treeSize[v];
		return findCentroid(v, u, n);
	}
	return u;
}

int mx[MAX];
pair <int, int> best[MAX];

void dfs(int u, int par, int d) {
	maximize(mx[treeSize[u]], d);
	for (int v: adj[u]) if (!used[v] && v != par) dfs(v, u, d + 1);
}

void solve(int u) {
	calcSize(u, 0);
	int n = treeSize[u];
	u = findCentroid(u, 0, n);
	REP(i, n) best[i] = make_pair(-N, -N);
	for (int v: adj[u]) if (!used[v]) {
		dfs(v, u, 1);
		REPD(i, treeSize[v]) maximize(mx[i], mx[i + 1]);
		REP(i, treeSize[v] + 1) {
			if (best[i].fi < mx[i]) {
				best[i].se = best[i].fi;
				best[i].fi = mx[i];
			} else maximize(best[i].se, mx[i]);
			if (i <= n - treeSize[v]) maximize(res[i], mx[i]);
			mx[i] = 0;
		}
	}
	REP(i, n) maximize(res[i], best[i].fi + best[i].se);
}

void process(void) {
	solve(1);
	FORE(i, 1, N) cout << (i & 1 ? 1 : res[i / 2] + 1) << '\n';
}

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

Compilation message

meetings2.cpp: In function 'int main()':
meetings2.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
meetings2.cpp:115:2: note: in expansion of macro 'file'
  115 |  file("meetings2");
      |  ^~~~
meetings2.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
meetings2.cpp:115:2: note: in expansion of macro 'file'
  115 |  file("meetings2");
      |  ^~~~

Subtask #1
0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4948 KB	Output is correct
2	Correct	2 ms	4948 KB	Output is correct
3	Correct	2 ms	4948 KB	Output is correct
4	Correct	3 ms	4948 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	3 ms	4948 KB	Output is correct
7	Correct	2 ms	4948 KB	Output is correct
8	Correct	3 ms	4948 KB	Output is correct
9	Correct	2 ms	4948 KB	Output is correct
10	Correct	3 ms	4948 KB	Output is correct
11	Correct	3 ms	4948 KB	Output is correct
12	Correct	3 ms	4948 KB	Output is correct
13	Correct	2 ms	4948 KB	Output is correct
14	Correct	2 ms	4948 KB	Output is correct
15	Correct	2 ms	4948 KB	Output is correct
16	Correct	4 ms	5024 KB	Output is correct
17	Correct	3 ms	4948 KB	Output is correct
18	Correct	2 ms	4948 KB	Output is correct
19	Correct	3 ms	4948 KB	Output is correct
20	Incorrect	3 ms	5036 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #2
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4948 KB	Output is correct
2	Correct	2 ms	4948 KB	Output is correct
3	Correct	2 ms	4948 KB	Output is correct
4	Correct	3 ms	4948 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	3 ms	4948 KB	Output is correct
7	Correct	2 ms	4948 KB	Output is correct
8	Correct	3 ms	4948 KB	Output is correct
9	Correct	2 ms	4948 KB	Output is correct
10	Correct	3 ms	4948 KB	Output is correct
11	Correct	3 ms	4948 KB	Output is correct
12	Correct	3 ms	4948 KB	Output is correct
13	Correct	2 ms	4948 KB	Output is correct
14	Correct	2 ms	4948 KB	Output is correct
15	Correct	2 ms	4948 KB	Output is correct
16	Correct	4 ms	5024 KB	Output is correct
17	Correct	3 ms	4948 KB	Output is correct
18	Correct	2 ms	4948 KB	Output is correct
19	Correct	3 ms	4948 KB	Output is correct
20	Incorrect	3 ms	5036 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3
0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4948 KB	Output is correct
2	Correct	2 ms	4948 KB	Output is correct
3	Correct	2 ms	4948 KB	Output is correct
4	Correct	3 ms	4948 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	3 ms	4948 KB	Output is correct
7	Correct	2 ms	4948 KB	Output is correct
8	Correct	3 ms	4948 KB	Output is correct
9	Correct	2 ms	4948 KB	Output is correct
10	Correct	3 ms	4948 KB	Output is correct
11	Correct	3 ms	4948 KB	Output is correct
12	Correct	3 ms	4948 KB	Output is correct
13	Correct	2 ms	4948 KB	Output is correct
14	Correct	2 ms	4948 KB	Output is correct
15	Correct	2 ms	4948 KB	Output is correct
16	Correct	4 ms	5024 KB	Output is correct
17	Correct	3 ms	4948 KB	Output is correct
18	Correct	2 ms	4948 KB	Output is correct
19	Correct	3 ms	4948 KB	Output is correct
20	Incorrect	3 ms	5036 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Submission #776975

Compilation message

Subtask #1 0 / 4.0

Subtask #2 0 / 16.0

Subtask #3 0 / 80.0

Subtask #1
0 / 4.0

Subtask #2
0 / 16.0

Subtask #3
0 / 80.0