Task: | Company Queries II |
Sender: | htoik |
Submission time: | 2024-10-24 17:14:06 +0300 |
Language: | C++ (C++20) |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.00 s | details |
#2 | ACCEPTED | 0.00 s | details |
#3 | ACCEPTED | 0.00 s | details |
#4 | ACCEPTED | 0.00 s | details |
#5 | ACCEPTED | 0.00 s | details |
#6 | ACCEPTED | 0.86 s | details |
#7 | ACCEPTED | 0.71 s | details |
#8 | ACCEPTED | 0.90 s | details |
#9 | ACCEPTED | 0.81 s | details |
#10 | ACCEPTED | 0.80 s | details |
#11 | ACCEPTED | 0.00 s | details |
#12 | ACCEPTED | 0.89 s | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:58:19: warning: comparison of integer expressions of different signedness: 'int' and 'ull' {aka 'long long unsigned int'} [-Wsign-compare] 58 | for(int i=0; i<q; i++){ | ~^~
Code
#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef unsigned long long ull;#include <bit>ll n;ll d[2*200000+1];ll f[2*200000+1];ll e[2*(2*200000+1)];ll didx = 0;#define logn_max 20ll rmq[2*(2*200000+1)*logn_max];map<ll,vector<ll>> adj;void dfs(ll a, ll di){d[a] = di;f[a] = didx;e[didx++] = a;if(adj.count(a)){for(auto b : adj[a]){dfs(b, di+1);e[didx++] = a;}}}void makermq() {for(ll i=0; i<didx; i++){rmq[i*logn_max + 0] = i;}for(ll j=1; (1<<j)<=didx; j++){for(ll i=0; i+(1<<j)<=didx; i++){ll l = rmq[i*logn_max + j - 1];ll r = rmq[(i + (1 << (j - 1)))*logn_max + (j-1)];ll ln = e[l];ll rn = e[r];rmq[i*logn_max + j] = d[ln] < d[rn] ? l : r;}}}int main() {ull q;cin >> n >> q;for(int i=0; i<n-1; i++){int b;cin >> b;adj[b].push_back(i+2);}dfs(1, 1);makermq();for(int i=0; i<q; i++){ll qa, qb;cin >> qa >> qb;ll a = f[qa];ll b = f[qb];if (a > b) swap(a, b);ll l = b - a + 1;ll k = floor(log2(l));ll li = rmq[a * logn_max + k];ll ri = rmq[(b - (1 << k) + 1) * logn_max + k];int ln = e[li];int rn = e[ri];cout << e[(d[ln] < d[rn]) ? li : ri] << endl;}}
Test details
Test 1
Verdict: ACCEPTED
input |
---|
10 10 1 2 3 4 5 6 7 8 9 6 9 8 10 10 3 ... |
correct output |
---|
6 8 3 1 8 ... |
user output |
---|
6 8 3 1 8 ... |
Test 2
Verdict: ACCEPTED
input |
---|
10 10 1 1 1 1 1 1 1 1 1 1 7 3 4 4 1 ... |
correct output |
---|
1 1 1 1 1 ... |
user output |
---|
1 1 1 1 1 ... |
Test 3
Verdict: ACCEPTED
input |
---|
10 10 1 1 1 1 2 3 4 4 1 1 8 2 7 8 3 ... |
correct output |
---|
1 1 1 1 1 ... |
user output |
---|
1 1 1 1 1 ... |
Test 4
Verdict: ACCEPTED
input |
---|
10 10 1 1 3 1 2 2 5 3 9 7 2 7 6 3 9 ... |
correct output |
---|
2 2 3 1 1 ... |
user output |
---|
2 2 3 1 1 ... |
Test 5
Verdict: ACCEPTED
input |
---|
10 10 1 2 3 2 5 3 2 2 4 6 1 1 3 1 9 ... |
correct output |
---|
1 1 1 2 2 ... |
user output |
---|
1 1 1 2 2 ... |
Test 6
Verdict: ACCEPTED
input |
---|
200000 200000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
74862 8750 16237 72298 58111 ... |
user output |
---|
74862 8750 16237 72298 58111 ... Truncated |
Test 7
Verdict: ACCEPTED
input |
---|
200000 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1 1 1 1 1 ... |
user output |
---|
1 1 1 1 1 ... Truncated |
Test 8
Verdict: ACCEPTED
input |
---|
200000 200000 1 2 1 2 3 2 1 6 3 1 10 12 13 4... |
correct output |
---|
1 2 2 2 1 ... |
user output |
---|
1 2 2 2 1 ... Truncated |
Test 9
Verdict: ACCEPTED
input |
---|
200000 200000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
2796 633 633 151 2690 ... |
user output |
---|
2796 633 633 151 2690 ... Truncated |
Test 10
Verdict: ACCEPTED
input |
---|
200000 200000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
365 73 103 365 216 ... |
user output |
---|
365 73 103 365 216 ... Truncated |
Test 11
Verdict: ACCEPTED
input |
---|
2 4 1 1 1 1 2 2 1 ... |
correct output |
---|
1 1 1 2 |
user output |
---|
1 1 1 2 |
Test 12
Verdict: ACCEPTED
input |
---|
200000 200000 1 1 2 3 4 5 6 7 8 9 10 11 12 1... |
correct output |
---|
27468 6353 27468 6353 6353 ... |
user output |
---|
27468 6353 27468 6353 6353 ... Truncated |