Submission #67552819
Source Code Expand
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//
//
// S i r o t a n w a t c h e s o v e r y o u .
//
// ...Jggg+J+JJJg@NQmgJa.....,
// ....gH@@@@HHB""""7"YYYYHMMMMMMM@@@@@@@Hma,.
// ...JH@@MMHY"! ? __""YH@@@@N&...
// ..JH@@HY"~ _TW@@@Mme.
// .Jg@@#"= _TTM@@N..
// .Jg@@MY! ?T@@@h,.
// .-@@@B! (TM@@@L
// .(H@MY ?W@@@+
// .W@@@ .T@@@[
// .d@@M! .T@@N,
// .d@M@' -W@@o.
// (@@M\ ?M@N,
// -d@M% .., .., j@@b
// d@@M= TM9 ?MD W@@[
// .H@M: .W@H,
// H@Ht ,@@#
// (@@M~ .@@h.
// .@@M% ..gmHHJ. .JdHga. .H@@e
// j@@#_ .@@@@@@@b J@@@@@@@h. .H@@\
// d@@@ .4@@@@@@MF (@@@@@@@@ H@@b
// d@@[ ?"BMY"= .d@@@@H, ?TWHHY"! d@@e
// J@@b .JJJ-.., ,@@@@@@M% ......... -@@@M.
// ?@@M\ ?YHHM@@@@b .. .W@@HP X@@HMWY"= d@@@#
// ,@@@L. ?H@Ng&+gd@@#H@@NHaJ+gH@[ J@@@]
// X@@@[ ...... ?"YYYYY"" ?"YHHHB"^ ..... (@@@#
// WH@N+. .W@@@@MHB= .TWH@M@Hmc .H@@M~
// .H@@@@N, _!~ .d@@@N,
// .J@@#T@@@N, .d@@@@@@@b.
// (@@@@! .T@@@n, .(H@@@H>.W@@@x
// (@@@F 4@@@@MaJ. .d@@@@Y77 4@@@r
//.H@@P ?TM@@@@N... .-JH@HMY= d@@N,
//(@@@F ?"WM@@@MQa-,. .(J(JN@@M#" Z@@@L
// d@@H, (M@@@@@@@Ng&maJ.... .. ...J.J+W@@@@@@HY! .dH@b
// ?M@@@N&. ..(JW@@@MM"?7""TYHMH@@HH@@@@@HHHgkHagHa(mggdmmagH@H@@Q@@HMMMHY"7!TMM@@@HaJ,. ..H@@@M^
// ?"W@@@@MN@@@@@H@@MMY" _???!"= ?WMMBYYTMH=7""Y@""?"~^ _"YM@@@@@@@@MH@@@@@#"^
// ?77WMMMYB""! _7"WWMMMY"7=
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
#include <ranges>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <fstream>
#if 0
std::ifstream ifs("AHC050/in/0000.txt");
auto & scan_in = ifs;
#else
auto & scan_in = std::cin;
#endif
auto & scan_out = std::cout;
// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T & t) { scan_in >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First & first, Rest& ...rest) { scan_in >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T & t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First & first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T & t) { scan_in >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First & first, Rest& ...rest) { scan_in >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)scan_in>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)scan_in>>w;
// output
template<typename T>void MACRO_OUT(const T t) { scan_out << t; }
template<typename First, typename...Rest>void MACRO_OUT(const First first, const Rest...rest) { scan_out << first << ' '; MACRO_OUT(rest...); }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define FOUT(n, dist) scan_out<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) scan_out<<std::setw(n)<<std::setfill(c)<<(dist);
#define VOUT(v) {auto tv_(v); for(size_t w_ = 0; w_ < tv_.size(); ++w_) {OUT(tv_[w_]);if(w_+1<tv_.size()){SP}}}
#define EOUT(...) do{ OUT(__VA_ARGS__); BR; exit(0); }while(0)
#define SP scan_out<<' ';
#define TAB scan_out<<'\t';
#define BR scan_out<<'\n';
#define SPBR(w, n) scan_out<<(w + 1 == n ? '\n' : ' ');
#define ENDL scan_out<<std::endl;
#define FLUSH scan_out<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t: " << (dist) << '\n';}
// utility
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define REP(w, n) FOR(w, 0, n)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define RREP(w, n) RFOR(w, 0, n)
#define FORC(w, a, n) for(char w=(a);w<(n);++w)
#define REPC(w, n) FORC(w, 0, n)
template<class S, class T, class U> bool IN(S a, T x, U b) { return a <= x && x < b; }
template<class T> inline bool CHMAX(T & a, const T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool CHMIN(T & a, const T b) { if (a > b) { a = b; return true; } return false; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;
//
//std::ostream& operator<<(std::ostream& os, const __int128& t) {
// if (t >= 1000000000000000000) {
// os << (long long)(t / 1000000000000000000) << (long long)(t % 1000000000000000000);
// }
// else {
// os << (long long)t;
// }
// return os;
//}
template<typename S, typename T>
std::ostream & operator<<(std::ostream & os, const std::pair<S, T> & p) {
os << '(' << p.first << ',' << p.second << ')';
return os;
}
template<typename T>
std::ostream & operator<<(std::ostream & os, const std::vector<T> & v) {
os << '{';
for (size_t i = 0; i < v.size(); ++i) {
os << v[i];
if (i + 1 < v.size()) os << ',';
}
os << '}';
return os;
}
template<typename T>
std::ostream & operator<<(std::ostream & os, const std::set<T> & v) {
os << '{';
for (auto it = v.cbegin(); it != v.cend();) {
os << *it << (++it == v.cend() ? '}' : ',');
}
return os;
}
template<typename S, typename T>
std::ostream & operator<<(std::ostream & os, const std::map<S, T> & m) {
os << '{';
for (auto it = m.cbegin(); it != m.cend();) { os << it->first << ':' << it->second; ++it; os << (it != m.cend() ? ',' : '}'); }
return os;
}
template<typename T>
std::ostream & operator<<(std::ostream & os, std::queue<T> q) {
os << '<';
while (!q.empty()) { os << q.front(); q.pop(); os << (q.empty() ? '<' : ','); }
return os;
}
template<typename T>
std::ostream & operator<<(std::ostream & os, std::stack<T> q) {
os << '>';
while (!q.empty()) { os << q.top(); q.pop(); os << (q.empty() ? ']' : ','); }
return os;
}
namespace std {
template<typename S, typename T> class numeric_limits<pair<S, T>> {
public:
static constexpr pair<S, T> max() noexcept { return { numeric_limits<S>::max(), numeric_limits<T>::max() }; }
static constexpr pair<S, T> lowest() noexcept { return { numeric_limits<S>::lowest(), numeric_limits<T>::lowest() }; }
};
}
// type/const
using i64 = long long;
using u64 = unsigned long long;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
//using PAIR = std::pair<int, int>;
using PAIR = std::pair<i64, i64>;
constexpr int INFINT = (1 << 30) - 1; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr long long INFLL = 1LL << 60; // 1.15x10^18
constexpr long long INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr ld EPS = 1e-6;
constexpr int MOD = 998244353;
constexpr long double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto & x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto & b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto & x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto & b : a) FILL(b, val); }
// ------------>8------------------------>8------------
void calc() {
VAR(int, n, k);
VEC_ROW(int, n - 1, a, b);
auto encode = [&](int p, int i, int dir) { return p * 2 * (n - 1) + i * 2 + dir; }; // k * (n-1) * 2
auto decode = [&](int val) {
int p = val / (2 * (n - 1));
int i = val % (2 * (n - 1)) / 2;
int dir = val % 2;
return std::make_tuple(p, i, dir);
};
V<std::tuple<int, int, int>> decode_calc(k * (n - 1) * 2);
REP(i, decode_calc.size()) decode_calc[i] = decode(i);
std::vector<std::vector<std::pair<int, int>>> g(n);
REP(i, n - 1) {
--a[i]; --b[i];
g[a[i]].emplace_back(i, 1);
g[b[i]].emplace_back(i, 0);
}
V<int> dp(k * (n - 1) * 2, INFINT);
std::queue<int> que;
int add_cnt = 0;
REP(i, n - 1) {
if (a[i] == 0) {
dp[encode(0, i, 0)] = 0;
que.emplace(encode(0, i, 0));
++add_cnt;
}
if (b[i] == 0) {
dp[encode(0, i, 1)] = 0;
que.emplace(encode(0, i, 1));
++add_cnt;
}
if (add_cnt >= 2) break;
}
VV<int> calced_cnt(k, V<int>(n, 0));
while (!que.empty()) {
int cur = que.front(); que.pop();
auto [p, eid, dir] = decode_calc[cur];
int v = (dir == 0) ? a[eid] : b[eid];
if (calced_cnt[p][v] < 2) ++calced_cnt[p][v];
else continue;
for (auto [neid, ndir] : g[v]) {
if (p != 0 && eid == neid) continue;
int u = (ndir == 0) ? a[neid] : b[neid];
int to = encode((p + 1) % k, neid, ndir);
if (CHMIN(dp[to], dp[cur] + 1)) {
que.emplace(to);
}
}
}
//OUT("==========================================")BR;
//REP(p, k) {
// REP(i, n) {
// int val = dp[encode(p, i)];
// if (val == INFINT) val = -1;
// OUT(val)SPBR(i, n);
// }
//}
V<int> ans(n, INFINT);
REP(i, n - 1) {
REP(dir, 2) {
int v = (dir == 0) ? a[i] : b[i];
int val = encode(0, i, dir);
CHMIN(ans[v], dp[val]);
}
}
FOR(i, 1, n) {
if (ans[i] == INFINT) {
OUT(-1);
}
else {
OUT(ans[i] / k);
}
SPBR(i, n);
}
}
signed main() {
INIT;
VAR(int, Q);
REP(_, Q) {
calc();
}
return 0;
}
Submission Info
| Submission Time |
|
| Task |
F - Jump Traveling |
| User |
satanic0258 |
| Language |
C++ 23 (gcc 12.2) |
| Score |
525 |
| Code Size |
12595 Byte |
| Status |
AC |
| Exec Time |
383 ms |
| Memory |
159380 KiB |
Compile Error
Main.cpp:26:1: warning: multi-line comment [-Wcomment]
26 | // j@@#_ .@@@@@@@b J@@@@@@@h. .H@@\
| ^
Main.cpp: In function ‘void calc()’:
Main.cpp:113:37: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
113 | #define FOR(w, a, n) for(int w=(a);w<(n);++w)
| ^
Main.cpp:114:19: note: in expansion of macro ‘FOR’
114 | #define REP(w, n) FOR(w, 0, n)
| ^~~
Main.cpp:217:9: note: in expansion of macro ‘REP’
217 | REP(i, decode_calc.size()) decode_calc[i] = decode(i);
| ^~~
Main.cpp:251:29: warning: unused variable ‘u’ [-Wunused-variable]
251 | int u = (ndir == 0) ? a[neid] : b[neid];
| ^
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
525 / 525 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
00_sample_00.txt, 00_sample_01.txt |
| All |
00_sample_00.txt, 00_sample_01.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 02_test_00.txt, 02_test_01.txt, 02_test_02.txt, 02_test_03.txt, 02_test_04.txt, 02_test_05.txt, 02_test_06.txt, 02_test_07.txt, 03_test_00.txt, 03_test_01.txt, 03_test_02.txt, 03_test_03.txt, 03_test_04.txt, 03_test_05.txt, 03_test_06.txt, 03_test_07.txt, 04_test_00.txt, 04_test_01.txt, 04_test_02.txt, 04_test_03.txt, 04_test_04.txt, 05_test_00.txt, 05_test_01.txt, 05_test_02.txt, 05_test_03.txt, 05_test_04.txt, 05_test_05.txt, 05_test_06.txt, 05_test_07.txt, 06_test_00.txt, 06_test_01.txt, 06_test_02.txt, 07_test_00.txt, 07_test_01.txt, 07_test_02.txt, 07_test_03.txt, 07_test_04.txt, 07_test_05.txt, 07_test_06.txt, 07_test_07.txt, 07_test_08.txt, 07_test_09.txt |
| Case Name |
Status |
Exec Time |
Memory |
| 00_sample_00.txt |
AC |
1 ms |
3380 KiB |
| 00_sample_01.txt |
AC |
1 ms |
3416 KiB |
| 01_test_00.txt |
AC |
50 ms |
3480 KiB |
| 01_test_01.txt |
AC |
58 ms |
3556 KiB |
| 01_test_02.txt |
AC |
75 ms |
4660 KiB |
| 01_test_03.txt |
AC |
114 ms |
11176 KiB |
| 01_test_04.txt |
AC |
154 ms |
48684 KiB |
| 01_test_05.txt |
AC |
73 ms |
24736 KiB |
| 01_test_06.txt |
AC |
76 ms |
31732 KiB |
| 01_test_07.txt |
AC |
268 ms |
158628 KiB |
| 01_test_08.txt |
AC |
383 ms |
151912 KiB |
| 02_test_00.txt |
AC |
58 ms |
3624 KiB |
| 02_test_01.txt |
AC |
73 ms |
4252 KiB |
| 02_test_02.txt |
AC |
99 ms |
9948 KiB |
| 02_test_03.txt |
AC |
165 ms |
56228 KiB |
| 02_test_04.txt |
AC |
56 ms |
26636 KiB |
| 02_test_05.txt |
AC |
59 ms |
33148 KiB |
| 02_test_06.txt |
AC |
269 ms |
158968 KiB |
| 02_test_07.txt |
AC |
382 ms |
152092 KiB |
| 03_test_00.txt |
AC |
74 ms |
3492 KiB |
| 03_test_01.txt |
AC |
98 ms |
4300 KiB |
| 03_test_02.txt |
AC |
110 ms |
10660 KiB |
| 03_test_03.txt |
AC |
141 ms |
37548 KiB |
| 03_test_04.txt |
AC |
62 ms |
23848 KiB |
| 03_test_05.txt |
AC |
68 ms |
31004 KiB |
| 03_test_06.txt |
AC |
244 ms |
157300 KiB |
| 03_test_07.txt |
AC |
311 ms |
150120 KiB |
| 04_test_00.txt |
AC |
335 ms |
150372 KiB |
| 04_test_01.txt |
AC |
319 ms |
150368 KiB |
| 04_test_02.txt |
AC |
281 ms |
150116 KiB |
| 04_test_03.txt |
AC |
294 ms |
149960 KiB |
| 04_test_04.txt |
AC |
283 ms |
150048 KiB |
| 05_test_00.txt |
AC |
213 ms |
152256 KiB |
| 05_test_01.txt |
AC |
202 ms |
151708 KiB |
| 05_test_02.txt |
AC |
109 ms |
152512 KiB |
| 05_test_03.txt |
AC |
108 ms |
152456 KiB |
| 05_test_04.txt |
AC |
98 ms |
151928 KiB |
| 05_test_05.txt |
AC |
97 ms |
151684 KiB |
| 05_test_06.txt |
AC |
97 ms |
152552 KiB |
| 05_test_07.txt |
AC |
96 ms |
152828 KiB |
| 06_test_00.txt |
AC |
53 ms |
32892 KiB |
| 06_test_01.txt |
AC |
61 ms |
33660 KiB |
| 06_test_02.txt |
AC |
64 ms |
33612 KiB |
| 07_test_00.txt |
AC |
39 ms |
32900 KiB |
| 07_test_01.txt |
AC |
45 ms |
31340 KiB |
| 07_test_02.txt |
AC |
45 ms |
40036 KiB |
| 07_test_03.txt |
AC |
56 ms |
38240 KiB |
| 07_test_04.txt |
AC |
55 ms |
39424 KiB |
| 07_test_05.txt |
AC |
98 ms |
152268 KiB |
| 07_test_06.txt |
AC |
352 ms |
150196 KiB |
| 07_test_07.txt |
AC |
123 ms |
151968 KiB |
| 07_test_08.txt |
AC |
102 ms |
159380 KiB |
| 07_test_09.txt |
AC |
242 ms |
157316 KiB |