Submission #44074910

---

Source Code Expand

// Problem: G - Avoid Straight Line
// Contest: AtCoder - UNIQUE VISION Programming Contest 2023 Summer(AtCoder Beginner Contest 312)
// URL: https://atcoder.jp/contests/abc312/tasks/abc312_g
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define rep1(i, l, r) for (int i = l; i <= int(r); ++i)
#define rep2(i, l, r) for (int i = l; i >= int(r); --i)
#define cop(i, l, r, a, b) rep1(i, l, r) a[i] = b[i]
#define rep(i, x) for (int i = pnt[x]; i; i = nxt[i])
#define rer(i, l, r, a) rep1(i, l, r) read(a[i])
#define ptc putchar
#define il inline
#define eb emplace_back
#define ef emplace_front
#define mp make_pair
#define fst first
#define snd second
#define sqr(x) ((x) * (x))
#define ls(x) x << 1
#define rs(x) x << 1 | 1
#define YES ptc('Y'), ptc('E'), ptc('S'), ptc('\n')
#define Yes ptc('Y'), ptc('e'), ptc('s'), ptc('\n')
#define NO ptc('N'), ptc('O'), ptc('\n')
#define No ptc('N'), ptc('o'), ptc('\n')
#define rout return 0
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// typedef __int128 bll;
// typedef unsigned __int128 ubll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5 + 10, inf = ~0U >> 2, INF = ~0U >> 1;
const int LOGN = log2(MAXN) + 1;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
namespace stupid_lrc {
	template <typename T> il bool read(T &x) {
		x = 0; bool f = false; char ch;
		while (!isdigit(ch = getchar())) {
			f ^= !(ch ^ '-');
			if (ch == EOF) return false;
		}
		while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch & 15), ch = getchar();
		if (f) x = ~x + 1; return true;
	}
	il int read() {int x; read(x); return x;}

	template <typename T> il bool read(pair <T, T> &x) {return read(x.fst) && read(x.snd);}

	template <typename T, typename ...L>
	il bool read(T &x, L &...y) {return read(x) && read(y...);}

	template <typename T> il T lowbit(const T &x) {return x & -x;}
}
using namespace stupid_lrc;
int n, siz[MAXN], d[MAXN]; ll ans, p;
vector <int> lnk[MAXN];

il void add(const int &x, const int &y) {
	lnk[x].eb(y); lnk[y].eb(x);
}

il void dfs(int x, int p) {
	siz[x] = 1; d[x] = d[p] + 1;
	for (auto v : lnk[x]) if (v ^ p) dfs(v, x), siz[x] += siz[v];
}

int main() {
	read(n); ans = 1ll * n * (n - 1) * (n - 2) / 6;
	rep1(i, 2, n) add(read(), read());
	dfs(1, 0);
	rep1(i, 1, n) for (auto t : lnk[i]) {
		int s = d[i] > d[t] ? siz[i] : siz[t];
		p += 1ll * s * (n - s);
	} p >>= 1;
	ans -= p; ans += 1ll * n * (n - 1) / 2;
	printf("%lld", ans);
	rout;
}
 

Submission Info

Compile Error

./Main.cpp: In function ‘bool stupid_lrc::read(T&)’:
./Main.cpp:48:3: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   48 |   if (f) x = ~x + 1; return true;
      |   ^~
./Main.cpp:48:22: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   48 |   if (f) x = ~x + 1; return true;
      |                      ^~~~~~

Judge Result