oj.uz

Submission #842418

# Submission time Handle Problem Language Result Execution time Memory
842418 2023-09-02T21:02:01 Z Benq Longest Trip (IOI23_longesttrip) C++17
85 / 100
 11 ms 864 KB 
#include "longesttrip.h"

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;

using ll = long long;
using db = long double;  // or double, if TL is tight
using str = string;      // yay python!

// pairs
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
#define mp make_pair
#define f first
#define s second

#define tcT template <class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT > using V = vector<T>;
tcT, size_t SZ > using AR = array<T, SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pi>;
using vpl = V<pl>;
using vpd = V<pd>;

// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()

#define lb lower_bound
#define ub upper_bound
tcT > int lwb(V<T> &a, const T &b) { return int(lb(all(a), b) - bg(a)); }
tcT > int upb(V<T> &a, const T &b) { return int(ub(all(a), b) - bg(a)); }

// loops
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a : x)

const int MOD = (int)1e9 + 7;  // 998244353;
const int MX = (int)2e5 + 5;
const ll BIG = 1e18;  // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1, 0, -1, 0}, dy[4]{0, 1, 0, -1};  // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;

// bitwise ops
// also see https://gcc.gnu.org/onlinedocs/gcc/Other-Builtins.html
constexpr int pct(int x) { return __builtin_popcount(x); }  // # of bits set
constexpr int bits(int x) {  // assert(x >= 0); // make C++11 compatible until
	                         // USACO updates ...
	return x == 0 ? 0 : 31 - __builtin_clz(x);
}  // floor(log2(x))
constexpr int p2(int x) { return 1 << x; }
constexpr int msk2(int x) { return p2(x) - 1; }

ll cdiv(ll a, ll b) {
	return a / b + ((a ^ b) > 0 && a % b);
}  // divide a by b rounded up
ll fdiv(ll a, ll b) {
	return a / b - ((a ^ b) < 0 && a % b);
}  // divide a by b rounded down

tcT > bool ckmin(T &a, const T &b) {
	return b < a ? a = b, 1 : 0;
}  // set a = min(a,b)
tcT > bool ckmax(T &a, const T &b) {
	return a < b ? a = b, 1 : 0;
}  // set a = max(a,b)

tcTU > T fstTrue(T lo, T hi, U f) {
	++hi;
	assert(lo <= hi);  // assuming f is increasing
	while (lo < hi) {  // find first index such that f is true
		T mid = lo + (hi - lo) / 2;
		f(mid) ? hi = mid : lo = mid + 1;
	}
	return lo;
}
tcTU > T lstTrue(T lo, T hi, U f) {
	--lo;
	assert(lo <= hi);  // assuming f is decreasing
	while (lo < hi) {  // find first index such that f is true
		T mid = lo + (hi - lo + 1) / 2;
		f(mid) ? lo = mid : hi = mid - 1;
	}
	return lo;
}
tcT > void remDup(vector<T> &v) {  // sort and remove duplicates
	sort(all(v));
	v.erase(unique(all(v)), end(v));
}
tcTU > void safeErase(T &t, const U &u) {
	auto it = t.find(u);
	assert(it != end(t));
	t.erase(it);
}

inline namespace IO {
#define SFINAE(x, ...)                                                         \
	template <class, class = void> struct x : std::false_type {};              \
	template <class T> struct x<T, std::void_t<__VA_ARGS__>> : std::true_type {}

SFINAE(DefaultI, decltype(std::cin >> std::declval<T &>()));
SFINAE(DefaultO, decltype(std::cout << std::declval<T &>()));
SFINAE(IsTuple, typename std::tuple_size<T>::type);
SFINAE(Iterable, decltype(std::begin(std::declval<T>())));

template <class T> constexpr char Space(const T &) {
	return (Iterable<T>::value or IsTuple<T>::value) ? '\n' : ' ';
}

template <auto &is> struct Reader {
	template <class T> void Impl(T &t) {
		if constexpr (DefaultI<T>::value) is >> t;
		else if constexpr (Iterable<T>::value) {
			for (auto &x : t) Impl(x);
		} else if constexpr (IsTuple<T>::value) {
			std::apply([this](auto &...args) { (Impl(args), ...); }, t);
		} else static_assert(IsTuple<T>::value, "No matching type for read");
	}
	template <class... Ts> void read(Ts &...ts) { ((Impl(ts)), ...); }
};

template <class... Ts> void re(Ts &...ts) { Reader<cin>{}.read(ts...); }
#define def(t, args...)                                                        \
	t args;                                                                    \
	re(args);

template <auto &os, bool debug> struct Writer {
	string comma() const { return debug ? "," : ""; }
	template <class T> void Impl(T const &t) const {
		if constexpr (DefaultO<T>::value) os << t;
		else if constexpr (Iterable<T>::value) {
			if (debug) os << '{';
			int i = 0;
			for (auto &&x : t)
				((i++) ? (os << comma() << Space(x), Impl(x)) : Impl(x));
			if (debug) os << '}';
		} else if constexpr (IsTuple<T>::value) {
			if (debug) os << '(';
			std::apply(
			    [this](auto const &...args) {
				    int i = 0;
				    (((i++) ? (os << comma() << " ", Impl(args)) : Impl(args)),
				     ...);
			    },
			    t);
			if (debug) os << ')';
		} else static_assert(IsTuple<T>::value, "No matching type for print");
	}
	template <class T> void ImplWrapper(T const &t) const {
		if (debug) os << "\033[0;31m";
		Impl(t);
		if (debug) os << "\033[0m";
	}
	template <class... Ts> void print(Ts const &...ts) const {
		((Impl(ts)), ...);
	}
	template <class F, class... Ts>
	void print_with_sep(const std::string &sep, F const &f,
	                    Ts const &...ts) const {
		ImplWrapper(f), ((os << sep, ImplWrapper(ts)), ...), os << '\n';
	}
	void print_with_sep(const std::string &) const { os << '\n'; }
};

template <class... Ts> void pr(Ts const &...ts) {
	Writer<cout, false>{}.print(ts...);
}
template <class... Ts> void ps(Ts const &...ts) {
	Writer<cout, false>{}.print_with_sep(" ", ts...);
}
}  // namespace IO

inline namespace Debug {
template <typename... Args> void err(Args... args) {
	Writer<cerr, true>{}.print_with_sep(" | ", args...);
}

void err_prefix(str func, int line, string args) {
	cerr << "\033[0;31m\u001b[1mDEBUG\033[0m"
	     << " | "
	     << "\u001b[34m" << func << "\033[0m"
	     << ":"
	     << "\u001b[34m" << line << "\033[0m"
	     << " - "
	     << "[" << args << "] = ";
}

#ifdef LOCAL
#define dbg(args...) err_prefix(__FUNCTION__, __LINE__, #args), err(args)
#else
#define dbg(...)
#endif

const auto beg_time = std::chrono::high_resolution_clock::now();
// https://stackoverflow.com/questions/47980498/accurate-c-c-clock-on-a-multi-core-processor-with-auto-overclock?noredirect=1&lq=1
double time_elapsed() {
	return chrono::duration<double>(std::chrono::high_resolution_clock::now() -
	                                beg_time)
	    .count();
}
}  // namespace Debug

inline namespace FileIO {
void setIn(str s) { freopen(s.c_str(), "r", stdin); }
void setOut(str s) { freopen(s.c_str(), "w", stdout); }
void setIO(str s = "") {
	cin.tie(0)->sync_with_stdio(0);  // unsync C / C++ I/O streams
	cout << fixed << setprecision(12);
	// cin.exceptions(cin.failbit);
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) setIn(s + ".in"), setOut(s + ".out");  // for old USACO
}
}  // namespace FileIO

std::vector<int> longest_trip(int N, int D) {
	vi ord(N);
	iota(all(ord), 0);
	shuffle(all(ord), rng);
	vi path1{ord[0]}, path2{ord[1]};
	bool not_connected = false;
	FOR(i, 2, N) {
		if (rng() & 1) swap(path1, path2);
		if (are_connected({path1.bk}, {ord[i]})) {
			path1.pb(ord[i]);
			not_connected = false;
		} else {
			if (not_connected) {
				path2.pb(ord[i]);
			} else {
				if (are_connected({path2.bk}, {ord[i]})) {
					path2.pb(ord[i]);
				} else {
					reverse(all(path2));
					path1.ins(end(path1), all(path2));
					path2 = {ord[i]};
					not_connected = false;
				}
			}
		}
	}
	// dbg(path1, path2);
	if (sz(path1) < sz(path2)) swap(path1, path2);
	if (!are_connected(path1, path2)) return path1;
	FOR(i, 1, 5) {
		if (are_connected({path1.bk}, {path2.ft})) {
			path1.ins(end(path1), all(path2));
			return path1;
		}
		if (i & 1) reverse(all(path1));
		if (i & 2) reverse(all(path2));
	}
	int l1 = 0, r1 = sz(path1);
	int l2 = 0, r2 = sz(path2);
	while (r2 - l2 > 1) {
		int m2 = (l2 + r2) / 2;
		if (are_connected(vi(begin(path1) + l1, begin(path1) + r1),
		                  vi(begin(path2) + l2, begin(path2) + m2))) {
			r2 = m2;
		} else {
			l2 = m2;
		}
	}
	while (r1 - l1 > 1) {
		int m1 = (l1 + r1) / 2;
		if (are_connected(vi(begin(path1) + l1, begin(path1) + m1),
		                  vi(begin(path2) + l2, begin(path2) + r2))) {
			r1 = m1;
		} else {
			l1 = m1;
		}
	}
	rotate(begin(path1), l1 + all(path1));
	reverse(all(path1));
	rotate(begin(path2), l2 + all(path2));
	path1.ins(end(path1), all(path2));
	return path1;
}

Compilation message

longesttrip.cpp: In function 'void FileIO::setIn(str)':
longesttrip.cpp:244:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  244 | void setIn(str s) { freopen(s.c_str(), "r", stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
longesttrip.cpp: In function 'void FileIO::setOut(str)':
longesttrip.cpp:245:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  245 | void setOut(str s) { freopen(s.c_str(), "w", stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 760 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 5 ms 444 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 452 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 5 ms 604 KB Output is correct
11 Correct 4 ms 600 KB Output is correct
12 Correct 4 ms 444 KB Output is correct
13 Correct 4 ms 604 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 440 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 6 ms 600 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 5 ms 604 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 448 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 5 ms 600 KB Output is correct
21 Correct 5 ms 444 KB Output is correct
22 Correct 5 ms 864 KB Output is correct
23 Correct 6 ms 608 KB Output is correct
24 Correct 5 ms 600 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 6 ms 440 KB Output is correct
31 Correct 6 ms 344 KB Output is correct
32 Correct 6 ms 344 KB Output is correct
33 Correct 5 ms 600 KB Output is correct
34 Correct 6 ms 440 KB Output is correct
35 Correct 6 ms 600 KB Output is correct
36 Correct 5 ms 344 KB Output is correct
37 Correct 7 ms 444 KB Output is correct
38 Correct 7 ms 504 KB Output is correct
39 Correct 7 ms 344 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 7 ms 344 KB Output is correct
42 Correct 7 ms 344 KB Output is correct
43 Correct 10 ms 600 KB Output is correct
44 Correct 8 ms 344 KB Output is correct
45 Correct 10 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 11 ms 344 KB Output is correct
48 Correct 9 ms 344 KB Output is correct
49 Correct 9 ms 344 KB Output is correct
50 Correct 5 ms 456 KB Output is correct
51 Correct 8 ms 612 KB Output is correct
52 Correct 7 ms 344 KB Output is correct
53 Correct 6 ms 604 KB Output is correct
54 Correct 7 ms 604 KB Output is correct
55 Correct 7 ms 604 KB Output is correct
56 Correct 6 ms 616 KB Output is correct
57 Correct 8 ms 448 KB Output is correct
58 Correct 7 ms 448 KB Output is correct
59 Correct 9 ms 600 KB Output is correct
60 Correct 8 ms 856 KB Output is correct
61 Correct 7 ms 436 KB Output is correct
62 Correct 7 ms 444 KB Output is correct
63 Correct 7 ms 344 KB Output is correct
64 Correct 7 ms 600 KB Output is correct

Subtask #4
45.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 4 ms 440 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 444 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 4 ms 444 KB Output is correct
12 Correct 5 ms 440 KB Output is correct
13 Correct 5 ms 440 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 5 ms 700 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 6 ms 344 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 6 ms 444 KB Output is correct
27 Correct 6 ms 436 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 6 ms 444 KB Output is correct
30 Correct 6 ms 856 KB Output is correct
31 Correct 7 ms 696 KB Output is correct
32 Correct 9 ms 596 KB Output is correct
33 Correct 8 ms 340 KB Output is correct
34 Correct 7 ms 344 KB Output is correct
35 Correct 7 ms 344 KB Output is correct
36 Correct 7 ms 344 KB Output is correct
37 Correct 5 ms 696 KB Output is correct
38 Correct 7 ms 440 KB Output is correct
39 Correct 7 ms 440 KB Output is correct
40 Correct 6 ms 600 KB Output is correct
41 Correct 7 ms 604 KB Output is correct
42 Correct 6 ms 600 KB Output is correct
43 Correct 5 ms 452 KB Output is correct
44 Correct 5 ms 700 KB Output is correct
45 Correct 6 ms 444 KB Output is correct
46 Correct 5 ms 708 KB Output is correct
47 Correct 5 ms 444 KB Output is correct
48 Correct 6 ms 604 KB Output is correct
49 Correct 7 ms 444 KB Output is correct
50 Correct 6 ms 600 KB Output is correct
51 Correct 7 ms 600 KB Output is correct
52 Correct 6 ms 344 KB Output is correct
53 Correct 7 ms 344 KB Output is correct
54 Correct 6 ms 600 KB Output is correct
55 Correct 7 ms 344 KB Output is correct
56 Correct 7 ms 436 KB Output is correct
57 Correct 8 ms 436 KB Output is correct
58 Correct 7 ms 344 KB Output is correct
59 Correct 7 ms 344 KB Output is correct
60 Correct 8 ms 696 KB Output is correct
61 Correct 6 ms 344 KB Output is correct
62 Correct 5 ms 448 KB Output is correct
63 Correct 7 ms 600 KB Output is correct
64 Partially correct 7 ms 604 KB Output is partially correct
65 Partially correct 8 ms 440 KB Output is partially correct
66 Partially correct 7 ms 600 KB Output is partially correct
67 Partially correct 8 ms 344 KB Output is partially correct
68 Partially correct 9 ms 756 KB Output is partially correct
69 Partially correct 6 ms 852 KB Output is partially correct
70 Partially correct 8 ms 608 KB Output is partially correct
71 Correct 6 ms 600 KB Output is correct
72 Partially correct 10 ms 440 KB Output is partially correct
73 Partially correct 8 ms 444 KB Output is partially correct
74 Partially correct 7 ms 448 KB Output is partially correct
75 Partially correct 9 ms 344 KB Output is partially correct
76 Partially correct 8 ms 448 KB Output is partially correct
77 Correct 10 ms 600 KB Output is correct
78 Partially correct 10 ms 444 KB Output is partially correct
79 Partially correct 9 ms 600 KB Output is partially correct
80 Partially correct 7 ms 600 KB Output is partially correct
81 Partially correct 7 ms 344 KB Output is partially correct
82 Partially correct 7 ms 600 KB Output is partially correct