#undef _GLIBCXX_DEBUG // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
#pragma GCC target("movbe") // byte swap
#pragma GCC target("aes,pclmul,rdrnd") // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
#define enablell 1
typedef long long ll;
typedef unsigned long long ull;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<ull> vull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;
#define PBDS 0
#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
uint32_t clz(uint32_t x) { return _lzcnt_u32(x); }
uint32_t ctz(uint32_t x) { return _tzcnt_u32(x); }
#define bswap64(x) _byteswap_uint64(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin_popcount(x)
uint32_t clz(uint32_t x) { return __builtin_clz(x); }
uint32_t ctz(uint32_t x) { return __builtin_ctzll(x); }
#define bswap64(x) __builtin_bswap64(x)
#define gc() getchar_unlocked()
#if PBDS
using namespace __gnu_pbds;
// lower_bound is now upper_bound and vice versa (multiset). generally a bit broken
template<typename T> using indexed_multiset = tree<int, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct chash { // large odd number for C
const uint64_t C = ll(4e18 * acos(0)) | 71;
ll operator()(ll x) const { return __builtin_bswap64(x * C); }
};
template<typename T, typename U> using fast_map = __gnu_pbds::gp_hash_table<T, U, chash>;
template<typename T> using fast_set = __gnu_pbds::gp_hash_table<T, null_type, chash>;
template<typename T, typename H> using fast_set_h = __gnu_pbds::gp_hash_table<T, null_type, H>;
#endif
#endif
#define FAST_INPUT 0
#define FILE_TC 0
#if FILE_TC && _LOCAL
//ifstream filein("E:\\desktop\\code\\repos\\Comp prog\\x64\\Debug\\in.txt");
ifstream filein("C:\\users\\matis\\source\\repos\\Comp Prog\\x64\\Debug\\1.in");
//ifstream filein("E:\\downloads\\test_data\\test_data\\005-case05.in");
//ifstream filein("E:\\desktop\\po-repos\\swedish-olympiad-2023\\online\\tomtplanering\\data\\secret\\group10\\010-case10.in");
#define cin filein
void fast() {}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif
#if FAST_INPUT && !FILE_TC
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) && c != ' ' && c != '\n') { if (c == EOF) { v = -1; return; } v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
inline void read(int& u, int& v, int& k) { read(u); read(v); read(k); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
inline void readline(string& s) { char c; while ((c = gc()) != EOF && c != '\n') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if(!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debif(expr) ;
#define debassert(expr) ;
#endif
#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))
#define ceildiv(x,y) ((x + y - 1) / y)
template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }
vector<string> split(string s, string d) { size_t k = 0, n, e = d.length(); string t; vector<string> r; while ((n = s.find(d, k)) != string::npos) { t = s.substr(k, n - k); k = n + e; r.push_back(t); } r.push_back(s.substr(k)); return r; }
ll binpow(ll a, ll b) { ll res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } // For a < 2^31
#if 1
auto Start = chrono::high_resolution_clock::now();
void resettimer() { Start = chrono::high_resolution_clock::now(); }
int elapsedmillis() { return chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count(); }
random_device rd;
mt19937 rng(rd());
template<typename T, typename U> inline int randint(T lo, U hi) { return uniform_int_distribution<int>((int)lo, (int)hi)(rng); } // [lo,hi]
template<typename T> inline T randel(vector<T>& v) { return v[uniform_int_distribution<int>(int(0), int(v.size()) - int(1))(rng)]; } // [lo,hi]
#endif
const ll mod = 1e9 + 7;
vp2 dirs = { {0,1},{0,-1},{1,0},{-1,0}, {0,0} };
int up[int(1e5 + 10)][18];
int weight(int u, int p, int d, vvp2& edges, vi& depth)
{
up[u][0] = p;
depth[u] = d;
int ret = u;
repe(e, edges[u])
{
if (e.first == p) continue;
int k = weight(e.first, u, d+1, edges, depth);
e.second = k;
ret = min(ret, k);
}
return ret;
}
void mark(int u, int p, int& cnt, int& ret, vvp2& edges, vi& isblack)
{
repe(e, edges[u]) if (e.first != p) mark(e.first, u, cnt, ret, edges, isblack);
if (cnt&&!isblack[u])
{
ret = u;
isblack[u] = 1;
cnt--;
}
}
int prioritycnt = inf;
void givepriority(int u, int p, vvp2& edges, vi& priority)
{
repe(e, edges[u]) if (e.first != p) givepriority(e.first, u, edges, priority);
priority[u] = prioritycnt--;
}
int32_t main()
{
fast();
dread2(int, n, q);
vvi edges(n);
vvp2 weightededges(n);
int root = -1;
rep(i, n)
{
dread(int, p);
if (p == 0)
{
root = i;
continue;
}
p--;
edges[i].emplace_back(p);
edges[p].emplace_back(i);
weightededges[i].emplace_back(p,inf);
weightededges[p].emplace_back(i,inf);
}
vi depth(n);
weight(root, root, 0, weightededges, depth);
vi priority(n, inf * 2);
rep(i, n)
{
sort(all(weightededges[i]), [](p2& a, p2& b)
{
return a.second < b.second;
});
}
givepriority(root, root, weightededges, priority);
repp(d, 1, 18)
{
rep(i, n)
{
up[i][d] = up[up[i][d - 1]][d - 1];
}
}
priority_queue<p2> pq;
rep(i, n)
{
pq.emplace(priority[i], i);
}
vi isblack(n);
while (q--)
{
dread2(int, t, v);
if (t==1)
{
int last = -1;
rep(i, v)
{
p2 a = pq.top();
pq.pop();
last = a.second;
isblack[a.second] = 1;
}
cout << last+1 << "\n";
}
else
{
v--;
int d = depth[v];
per(d, 18)
{
if (isblack[up[v][d]])
{
v = up[v][d];
}
}
isblack[v] = 0;
pq.emplace(priority[v], v);
cout << d-depth[v] << "\n";
}
}
quit;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
94 ms |
21716 KB |
Output is correct |
| 3 |
Correct |
67 ms |
21972 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
596 KB |
Output is correct |
| 7 |
Correct |
1 ms |
596 KB |
Output is correct |
| 8 |
Correct |
1 ms |
596 KB |
Output is correct |
| 9 |
Correct |
5 ms |
1620 KB |
Output is correct |
| 10 |
Correct |
19 ms |
5720 KB |
Output is correct |
| 11 |
Correct |
90 ms |
21764 KB |
Output is correct |
| 12 |
Correct |
77 ms |
21960 KB |
Output is correct |
| 13 |
Correct |
91 ms |
21752 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
6992 KB |
Output is correct |
| 2 |
Correct |
144 ms |
34096 KB |
Output is correct |
| 3 |
Correct |
92 ms |
31684 KB |
Output is correct |
| 4 |
Correct |
49 ms |
10448 KB |
Output is correct |
| 5 |
Correct |
47 ms |
10452 KB |
Output is correct |
| 6 |
Correct |
44 ms |
10568 KB |
Output is correct |
| 7 |
Correct |
47 ms |
9484 KB |
Output is correct |
| 8 |
Correct |
28 ms |
6992 KB |
Output is correct |
| 9 |
Correct |
131 ms |
33924 KB |
Output is correct |
| 10 |
Correct |
144 ms |
34124 KB |
Output is correct |
| 11 |
Correct |
130 ms |
34132 KB |
Output is correct |
| 12 |
Correct |
139 ms |
32500 KB |
Output is correct |
| 13 |
Correct |
106 ms |
31804 KB |
Output is correct |
| 14 |
Correct |
89 ms |
31684 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
63 ms |
17168 KB |
Output is correct |
| 2 |
Correct |
156 ms |
33288 KB |
Output is correct |
| 3 |
Correct |
114 ms |
28860 KB |
Output is correct |
| 4 |
Correct |
101 ms |
27256 KB |
Output is correct |
| 5 |
Correct |
100 ms |
27468 KB |
Output is correct |
| 6 |
Correct |
99 ms |
27444 KB |
Output is correct |
| 7 |
Correct |
105 ms |
26740 KB |
Output is correct |
| 8 |
Correct |
112 ms |
28876 KB |
Output is correct |
| 9 |
Correct |
149 ms |
34064 KB |
Output is correct |
| 10 |
Correct |
172 ms |
34268 KB |
Output is correct |
| 11 |
Correct |
161 ms |
34280 KB |
Output is correct |
| 12 |
Correct |
151 ms |
33248 KB |
Output is correct |
| 13 |
Correct |
181 ms |
36152 KB |
Output is correct |
| 14 |
Correct |
118 ms |
31700 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
169 ms |
34168 KB |
Output is correct |
| 2 |
Correct |
166 ms |
33228 KB |
Output is correct |
| 3 |
Correct |
136 ms |
35992 KB |
Output is correct |
| 4 |
Correct |
165 ms |
34108 KB |
Output is correct |
| 5 |
Correct |
165 ms |
34248 KB |
Output is correct |
| 6 |
Correct |
132 ms |
34296 KB |
Output is correct |
| 7 |
Correct |
160 ms |
33252 KB |
Output is correct |
| 8 |
Correct |
123 ms |
35956 KB |
Output is correct |
| 9 |
Correct |
90 ms |
31656 KB |
Output is correct |
