結果
| 問題 | No.2258 The Jikka Tree |
| ユーザー |
👑  Nachia
|
| 提出日時 | 2023-03-31 17:59:49 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 870 ms / 4,000 ms |
| コード長 | 22,634 bytes |
| コンパイル時間 | 2,045 ms |
| コンパイル使用メモリ | 120,800 KB |
| 実行使用メモリ | 94,984 KB |
| 最終ジャッジ日時 | 2024-09-23 01:58:09 |
| 合計ジャッジ時間 | 35,125 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 2 ms
5,376 KB |
| testcase_02 | AC | 2 ms
5,376 KB |
| testcase_03 | AC | 7 ms
5,376 KB |
| testcase_04 | AC | 10 ms
5,376 KB |
| testcase_05 | AC | 8 ms
5,376 KB |
| testcase_06 | AC | 8 ms
5,376 KB |
| testcase_07 | AC | 10 ms
5,376 KB |
| testcase_08 | AC | 8 ms
5,376 KB |
| testcase_09 | AC | 11 ms
5,376 KB |
| testcase_10 | AC | 10 ms
5,376 KB |
| testcase_11 | AC | 10 ms
5,376 KB |
| testcase_12 | AC | 10 ms
5,376 KB |
| testcase_13 | AC | 10 ms
5,376 KB |
| testcase_14 | AC | 8 ms
5,376 KB |
| testcase_15 | AC | 9 ms
5,376 KB |
| testcase_16 | AC | 6 ms
5,376 KB |
| testcase_17 | AC | 10 ms
5,376 KB |
| testcase_18 | AC | 8 ms
5,376 KB |
| testcase_19 | AC | 8 ms
5,376 KB |
| testcase_20 | AC | 130 ms
7,732 KB |
| testcase_21 | AC | 131 ms
9,380 KB |
| testcase_22 | AC | 79 ms
5,376 KB |
| testcase_23 | AC | 69 ms
5,376 KB |
| testcase_24 | AC | 109 ms
6,312 KB |
| testcase_25 | AC | 129 ms
7,432 KB |
| testcase_26 | AC | 136 ms
7,544 KB |
| testcase_27 | AC | 152 ms
9,900 KB |
| testcase_28 | AC | 154 ms
9,712 KB |
| testcase_29 | AC | 140 ms
8,368 KB |
| testcase_30 | AC | 132 ms
7,592 KB |
| testcase_31 | AC | 111 ms
8,468 KB |
| testcase_32 | AC | 91 ms
5,376 KB |
| testcase_33 | AC | 118 ms
9,016 KB |
| testcase_34 | AC | 599 ms
81,196 KB |
| testcase_35 | AC | 499 ms
81,116 KB |
| testcase_36 | AC | 506 ms
94,472 KB |
| testcase_37 | AC | 504 ms
88,840 KB |
| testcase_38 | AC | 530 ms
81,484 KB |
| testcase_39 | AC | 626 ms
81,020 KB |
| testcase_40 | AC | 588 ms
81,104 KB |
| testcase_41 | AC | 603 ms
81,320 KB |
| testcase_42 | AC | 634 ms
81,332 KB |
| testcase_43 | AC | 579 ms
81,132 KB |
| testcase_44 | AC | 623 ms
81,180 KB |
| testcase_45 | AC | 579 ms
85,000 KB |
| testcase_46 | AC | 514 ms
85,896 KB |
| testcase_47 | AC | 512 ms
86,796 KB |
| testcase_48 | AC | 637 ms
81,088 KB |
| testcase_49 | AC | 522 ms
81,116 KB |
| testcase_50 | AC | 530 ms
94,984 KB |
| testcase_51 | AC | 481 ms
89,220 KB |
| testcase_52 | AC | 508 ms
81,084 KB |
| testcase_53 | AC | 620 ms
81,236 KB |
| testcase_54 | AC | 625 ms
81,888 KB |
| testcase_55 | AC | 646 ms
81,792 KB |
| testcase_56 | AC | 660 ms
81,408 KB |
| testcase_57 | AC | 662 ms
82,020 KB |
| testcase_58 | AC | 646 ms
81,084 KB |
| testcase_59 | AC | 867 ms
82,016 KB |
| testcase_60 | AC | 559 ms
80,984 KB |
| testcase_61 | AC | 641 ms
94,604 KB |
| testcase_62 | AC | 590 ms
88,844 KB |
| testcase_63 | AC | 602 ms
81,112 KB |
| testcase_64 | AC | 755 ms
81,192 KB |
| testcase_65 | AC | 829 ms
81,116 KB |
| testcase_66 | AC | 854 ms
81,688 KB |
| testcase_67 | AC | 870 ms
83,044 KB |
| testcase_68 | AC | 843 ms
81,268 KB |
| testcase_69 | AC | 851 ms
81,592 KB |
| testcase_70 | AC | 353 ms
59,800 KB |
| testcase_71 | AC | 88 ms
5,376 KB |
| testcase_72 | AC | 140 ms
6,144 KB |
| testcase_73 | AC | 166 ms
7,740 KB |
| testcase_74 | AC | 211 ms
10,048 KB |
| testcase_75 | AC | 378 ms
81,492 KB |
ソースコード
#line 2 "nachia\\graph\\graph.hpp"
#include <vector>
#include <utility>
#include <cassert>
#line 4 "nachia\\array\\csr-array.hpp"
#include <algorithm>
namespace nachia{
template<class Elem>
class CsrArray{
public:
struct ListRange{
using iterator = typename std::vector<Elem>::iterator;
iterator begi, endi;
iterator begin() const { return begi; }
iterator end() const { return endi; }
int size() const { return (int)std::distance(begi, endi); }
Elem& operator[](int i) const { return begi[i]; }
};
struct ConstListRange{
using iterator = typename std::vector<Elem>::const_iterator;
iterator begi, endi;
iterator begin() const { return begi; }
iterator end() const { return endi; }
int size() const { return (int)std::distance(begi, endi); }
const Elem& operator[](int i) const { return begi[i]; }
};
private:
int m_n;
std::vector<Elem> m_list;
std::vector<int> m_pos;
public:
CsrArray() : m_n(0), m_list(), m_pos() {}
static CsrArray Construct(int n, std::vector<std::pair<int, Elem>> items){
CsrArray res;
res.m_n = n;
std::vector<int> buf(n+1, 0);
for(auto& [u,v] : items){ ++buf[u]; }
for(int i=1; i<=n; i++) buf[i] += buf[i-1];
res.m_list.resize(buf[n]);
for(int i=(int)items.size()-1; i>=0; i--){
res.m_list[--buf[items[i].first]] = std::move(items[i].second);
}
res.m_pos = std::move(buf);
return res;
}
static CsrArray FromRaw(std::vector<Elem> list, std::vector<int> pos){
CsrArray res;
res.m_n = pos.size() - 1;
res.m_list = std::move(list);
res.m_pos = std::move(pos);
return res;
}
ListRange operator[](int u) { return ListRange{ m_list.begin() + m_pos[u], m_list.begin() + m_pos[u+1] }; }
ConstListRange operator[](int u) const { return ConstListRange{ m_list.begin() + m_pos[u], m_list.begin() + m_pos[u+1] }; }
int size() const { return m_n; }
int fullSize() const { return (int)m_list.size(); }
};
} // namespace nachia
#line 6 "nachia\\graph\\graph.hpp"
namespace nachia{
struct Graph {
public:
struct Edge{
int from, to;
void reverse(){ std::swap(from, to); }
};
using Base = std::vector<std::pair<int, int>>;
Graph(int n = 0, bool undirected = false, int m = 0) : m_n(n), m_e(m), m_isUndir(undirected) {}
Graph(int n, const std::vector<std::pair<int, int>>& edges, bool undirected = false) : m_n(n), m_isUndir(undirected){
m_e.resize(edges.size());
for(std::size_t i=0; i<edges.size(); i++) m_e[i] = { edges[i].first, edges[i].second };
}
template<class Cin>
static Graph Input(Cin& cin, int n, bool undirected, int m, bool offset = 0){
Graph res(n, undirected, m);
for(int i=0; i<m; i++){
int u, v; cin >> u >> v;
res[i].from = u - offset;
res[i].to = v - offset;
}
return res;
}
int numVertices() const noexcept { return m_n; }
int numEdges() const noexcept { return int(m_e.size()); }
int addNode() noexcept { return m_n++; }
int addEdge(int from, int to){ m_e.push_back({ from, to }); return numEdges() - 1; }
Edge& operator[](int ei) noexcept { return m_e[ei]; }
const Edge& operator[](int ei) const noexcept { return m_e[ei]; }
Edge& at(int ei) { return m_e.at(ei); }
const Edge& at(int ei) const { return m_e.at(ei); }
auto begin(){ return m_e.begin(); }
auto end(){ return m_e.end(); }
auto begin() const { return m_e.begin(); }
auto end() const { return m_e.end(); }
bool isUndirected() const noexcept { return m_isUndir; }
void reverseEdges() noexcept { for(auto& e : m_e) e.reverse(); }
void contract(int newV, const std::vector<int>& mapping){
assert(numVertices() == int(mapping.size()));
for(int i=0; i<numVertices(); i++) assert(0 <= mapping[i] && mapping[i] < newV);
for(auto& e : m_e){ e.from = mapping[e.from]; e.to = mapping[e.to]; }
}
std::vector<Graph> induce(int num, const std::vector<int>& mapping) const {
int n = numVertices();
assert(n == int(mapping.size()));
for(int i=0; i<n; i++) assert(-1 <= mapping[i] && mapping[i] < num);
std::vector<int> indexV(n), newV(num);
for(int i=0; i<n; i++) if(mapping[i] >= 0) indexV[i] = newV[mapping[i]]++;
std::vector<Graph> res; res.reserve(num);
for(int i=0; i<num; i++) res.emplace_back(newV[i], isUndirected());
for(auto e : m_e) if(mapping[e.from] == mapping[e.to] && mapping[e.to] >= 0) res[mapping[e.to]].addEdge(indexV[e.from], indexV[e.to]);
return res;
}
CsrArray<int> getEdgeIndexArray(bool undirected) const {
std::vector<std::pair<int, int>> src;
src.reserve(numEdges() * (undirected ? 2 : 1));
for(int i=0; i<numEdges(); i++){
auto e = operator[](i);
src.emplace_back(e.from, i);
if(undirected) src.emplace_back(e.to, i);
}
return CsrArray<int>::Construct(numVertices(), src);
}
CsrArray<int> getEdgeIndexArray() const { return getEdgeIndexArray(isUndirected()); }
CsrArray<int> getAdjacencyArray(bool undirected) const {
std::vector<std::pair<int, int>> src;
src.reserve(numEdges() * (undirected ? 2 : 1));
for(auto e : m_e){
src.emplace_back(e.from, e.to);
if(undirected) src.emplace_back(e.to, e.from);
}
return CsrArray<int>::Construct(numVertices(), src);
}
CsrArray<int> getAdjacencyArray() const { return getAdjacencyArray(isUndirected()); }
private:
int m_n;
std::vector<Edge> m_e;
bool m_isUndir;
};
} // namespace nachia
#line 7 "nachia\\tree\\static-top-tree.hpp"
#include <tuple>
namespace nachia{
class StaticTopTree{
public:
struct Node{
int p = -1;
int l = -1;
int r = -1;
int boundaryS = -1;
int boundaryT = -1;
enum Type{ TyCompress, TyRake1, TyRake2, TyEdge } ty = TyEdge;
};
StaticTopTree(Graph tree, int root = 0){
int n = tree.numVertices();
m_n = n;
std::vector<int> parent;
std::vector<int> parentEdge;
assert(tree.numEdges() == n-1);
assert(0 <= root && root < n);
m_root = root;
if(tree.numVertices() == 1){ m_n = 1; return; }
nachia::CsrArray<int> adj = tree.getAdjacencyArray(true);
parent.assign(n, -2);
parentEdge.assign(n, -1);
std::vector<int> bfs = {m_root};
bfs.reserve(n);
parent[m_root] = -1;
for(int i=0; i<(int)bfs.size(); i++){
int p = bfs[i];
for(int nx : adj[p]) if(parent[nx] == -2){
parent[nx] = p;
bfs.push_back(nx);
}
}
for(int i=0; i<n; i++) assert(parent[i] != -2); // not connected
for(int i=0; i<n-1; i++){
auto& e = tree[i];
if(parent[e.from] == e.to) e.reverse();
parentEdge[e.to] = i;
}
adj = tree.getAdjacencyArray(false);
std::vector<int> nd(n, 1);
for(int i=n-1; i>=1; i--) nd[parent[bfs[i]]] += nd[bfs[i]];
for(int p=0; p<n; p++) for(int e=1; e<adj[p].size(); e++) if(nd[adj[p][0]] < nd[adj[p][e]]) std::swap(adj[p][0], adj[p][e]);
m_node.resize(n*2-3);
for(int i=0; i<n-1; i++) m_node[i].ty = Node::TyEdge;
std::vector<int> troot(n, -1);
int trp = n*2-3;
troot[bfs[0]] = --trp;
for(int s : bfs) if(parent[s] < 0 || adj[parent[s]][0] != s){
struct SzNode { int sz, vid, nx; };
std::vector<SzNode> sznode;
std::vector<int> Hid = {0};
std::vector<int> boundarySize;
if(parent[s] >= 0){
sznode.push_back({ 1, parentEdge[s], adj[parent[s]][0] });
Hid.push_back(Hid.back()+1);
}
for(int p=s; ; p=adj[p][0]){
if(adj[p].size() == 0) break;
for(int e=1; e<adj[p].size(); e++){
if(adj[adj[p][e]].size() == 0) sznode.push_back({ 1, parentEdge[adj[p][e]], adj[p][e] });
else sznode.push_back({ nd[adj[p][e]], -1, adj[p][e] });
Hid.push_back(Hid.back());
}
sznode.push_back({ 1, parentEdge[adj[p][0]], adj[p][0] });
Hid.push_back(Hid.back() + 1);
}
boundarySize.assign(sznode.size()+1, 0);
for(int i=0; i<(int)sznode.size(); i++) boundarySize[i+1] = boundarySize[i] + sznode[i].sz;
struct QueNode{ int p, l, r; };
std::vector<QueNode> Que = { { troot[s], 0, (int)sznode.size() } };
Que.reserve(sznode.size() * 2);
for(int i=0; i<(int)Que.size(); i++){
int tp = Que[i].p, l = Que[i].l, r = Que[i].r;
if(r-l == 1){
troot[sznode[l].nx] = tp;
continue;
}
int m = Que[i].l;
while(boundarySize[m] - boundarySize[l] < boundarySize[r] - boundarySize[m+1]) m++;
if(Hid[l] == Hid[m]) m_node[tp].ty = Node::TyRake2;
else if(Hid[m] == Hid[r]) m_node[tp].ty = Node::TyRake1;
else m_node[tp].ty = Node::TyCompress;
int pl = (m-l == 1) ? sznode[l].vid : -1;
if(pl == -1) pl = --trp;
int pr = (r-m == 1) ? sznode[m].vid : -1;
if(pr == -1) pr = --trp;
m_node[tp].l = pl;
m_node[tp].r = pr;
m_node[pl].p = tp;
m_node[pr].p = tp;
Que.push_back({ pl, l, m });
Que.push_back({ pr, m, r });
}
}
for(int i=0; i<n-1; i++){
if(parent[tree[i].from] == tree[i].to) tree[i].reverse();
m_node[i].boundaryS = tree[i].from;
m_node[i].boundaryT = tree[i].to;
}
m_handle.assign(n, -1);
for(int i=n-1; i<n*2-3; i++){
auto& v = m_node[i];
auto& vl = m_node[v.l];
auto& vr = m_node[v.r];
switch(v.ty){
case Node::TyCompress :
v.boundaryS = vl.boundaryS;
v.boundaryT = vr.boundaryT;
m_handle[vl.boundaryT] = i;
break;
case Node::TyRake1 :
v.boundaryS = vl.boundaryS;
v.boundaryT = vl.boundaryT;
m_handle[vr.boundaryT] = i;
break;
case Node::TyRake2 :
v.boundaryS = vr.boundaryS;
v.boundaryT = vr.boundaryT;
m_handle[vl.boundaryT] = i;
break;
case Node::TyEdge :
break;
}
}
}
StaticTopTree() : StaticTopTree(Graph(2, {std::make_pair(0,1)})) {}
int handleOfVtx(int nodeid) const { return m_handle[nodeid]; }
Node getNode(int nodeid) const { return m_node[nodeid]; }
int numVertices() const { return m_n; }
int numNodes() const { return (int)m_node.size(); }
private:
int m_n;
int m_root;
std::vector<Node> m_node;
std::vector<int> m_handle;
};
} // namespace nachia
#line 2 "nachia\\misc\\fastio.hpp"
#include <cstdio>
#include <cctype>
#include <cstdint>
#include <string>
namespace nachia{
struct CInStream{
private:
static const unsigned int INPUT_BUF_SIZE = 1 << 17;
unsigned int p = INPUT_BUF_SIZE;
static char Q[INPUT_BUF_SIZE];
public:
using MyType = CInStream;
char seekChar(){
if(p == INPUT_BUF_SIZE){
size_t len = fread(Q, 1, INPUT_BUF_SIZE, stdin);
if(len != INPUT_BUF_SIZE) Q[len] = '\0';
p = 0;
}
return Q[p];
}
void skipSpace(){ while(isspace(seekChar())) p++; }
uint32_t nextU32(){
skipSpace();
uint32_t buf = 0;
while(true){
char tmp = seekChar();
if('9' < tmp || tmp < '0') break;
buf = buf * 10 + (tmp - '0');
p++;
}
return buf;
}
int32_t nextI32(){
skipSpace();
if(seekChar() == '-'){ p++; return (int32_t)(-nextU32()); }
return (int32_t)nextU32();
}
uint64_t nextU64(){
skipSpace();
uint64_t buf = 0;
while(true){
char tmp = seekChar();
if('9' < tmp || tmp < '0') break;
buf = buf * 10 + (tmp - '0');
p++;
}
return buf;
}
int64_t nextI64(){
skipSpace();
if(seekChar() == '-'){ p++; return (int64_t)(-nextU64()); }
return (int64_t)nextU64();
}
char nextChar(){ skipSpace(); char buf = seekChar(); p++; return buf; }
std::string nextToken(){
skipSpace();
std::string buf;
while(true){
char ch = seekChar();
if(isspace(ch) || ch == '\0') break;
buf.push_back(ch);
p++;
}
return buf;
}
MyType& operator>>(unsigned int& dest){ dest = nextU32(); return *this; }
MyType& operator>>(int& dest){ dest = nextI32(); return *this; }
MyType& operator>>(unsigned long& dest){ dest = nextU64(); return *this; }
MyType& operator>>(long& dest){ dest = nextI64(); return *this; }
MyType& operator>>(unsigned long long& dest){ dest = nextU64(); return *this; }
MyType& operator>>(long long& dest){ dest = nextI64(); return *this; }
MyType& operator>>(std::string& dest){ dest = nextToken(); return *this; }
MyType& operator>>(char& dest){ dest = nextChar(); return *this; }
} cin;
struct FastOutputTable{
char LZ[1000][4] = {};
char NLZ[1000][4] = {};
constexpr FastOutputTable(){
using u32 = uint_fast32_t;
for(u32 d=0; d<1000; d++){
LZ[d][0] = ('0' + d / 100 % 10);
LZ[d][1] = ('0' + d / 10 % 10);
LZ[d][2] = ('0' + d / 1 % 10);
LZ[d][3] = '\0';
}
for(u32 d=0; d<1000; d++){
u32 i = 0;
if(d >= 100) NLZ[d][i++] = ('0' + d / 100 % 10);
if(d >= 10) NLZ[d][i++] = ('0' + d / 10 % 10);
if(d >= 1) NLZ[d][i++] = ('0' + d / 1 % 10);
NLZ[d][i++] = '\0';
}
}
};
struct COutStream{
private:
using u32 = uint32_t;
using u64 = uint64_t;
using MyType = COutStream;
static const u32 OUTPUT_BUF_SIZE = 1 << 17;
static char Q[OUTPUT_BUF_SIZE];
static constexpr FastOutputTable TB = FastOutputTable();
u32 p = 0;
static constexpr u32 P10(u32 d){ return d ? P10(d-1)*10 : 1; }
static constexpr u64 P10L(u32 d){ return d ? P10L(d-1)*10 : 1; }
template<class T, class U> static void Fil(T& m, U& l, U x){ m = l/x; l -= m*x; }
void next_dig9(u32 x){
u32 y;
Fil(y, x, P10(6));
nextCstr(TB.LZ[y]);
Fil(y, x, P10(3));
nextCstr(TB.LZ[y]); nextCstr(TB.LZ[x]);
}
public:
void nextChar(char c){
Q[p++] = c;
if(p == OUTPUT_BUF_SIZE){ fwrite(Q, p, 1, stdout); p = 0; }
}
void nextEoln(){ nextChar('\n'); }
void nextCstr(const char* s){ while(*s) nextChar(*(s++)); }
void nextU32(uint32_t x){
u32 y = 0;
if(x >= P10(9)){
Fil(y, x, P10(9));
nextCstr(TB.NLZ[y]); next_dig9(x);
}
else if(x >= P10(6)){
Fil(y, x, P10(6));
nextCstr(TB.NLZ[y]);
Fil(y, x, P10(3));
nextCstr(TB.LZ[y]); nextCstr(TB.LZ[x]);
}
else if(x >= P10(3)){
Fil(y, x, P10(3));
nextCstr(TB.NLZ[y]); nextCstr(TB.LZ[x]);
}
else if(x >= 1) nextCstr(TB.NLZ[x]);
else nextChar('0');
}
void nextI32(int32_t x){
if(x >= 0) nextU32(x);
else{ nextChar('-'); nextU32((u32)-x); }
}
void nextU64(uint64_t x){
u32 y = 0;
if(x >= P10L(18)){
Fil(y, x, P10L(18));
nextU32(y);
Fil(y, x, P10L(9));
next_dig9(y); next_dig9(x);
}
else if(x >= P10L(9)){
Fil(y, x, P10L(9));
nextU32(y); next_dig9(x);
}
else nextU32(x);
}
void nextI64(int64_t x){
if(x >= 0) nextU64(x);
else{ nextChar('-'); nextU64((u64)-x); }
}
void writeToFile(bool flush = false){
fwrite(Q, p, 1, stdout);
if(flush) fflush(stdout);
p = 0;
}
COutStream(){ Q[0] = 0; }
~COutStream(){ writeToFile(); }
MyType& operator<<(unsigned int tg){ nextU32(tg); return *this; }
MyType& operator<<(unsigned long tg){ nextU64(tg); return *this; }
MyType& operator<<(unsigned long long tg){ nextU64(tg); return *this; }
MyType& operator<<(int tg){ nextI32(tg); return *this; }
MyType& operator<<(long tg){ nextI64(tg); return *this; }
MyType& operator<<(long long tg){ nextI64(tg); return *this; }
MyType& operator<<(const std::string& tg){ nextCstr(tg.c_str()); return *this; }
MyType& operator<<(const char* tg){ nextCstr(tg); return *this; }
MyType& operator<<(char tg){ nextChar(tg); return *this; }
} cout;
char CInStream::Q[INPUT_BUF_SIZE];
char COutStream::Q[OUTPUT_BUF_SIZE];
} // namespace nachia
#line 3 "Main.cpp"
#line 6 "Main.cpp"
#include <iostream>
int main(){
using nachia::cin;
using nachia::cout;
int N; cin >> N;
nachia::Graph tree(N, true);
for(int i=0; i<N-1; i++){
int u, v; cin >> u >> v;
tree.addEdge(u, v);
}
std::vector<int> A(N);
for(int i=0; i<N; i++){ cin >> A[i]; A[i] *= 2; }
if(N == 1){
int Q; cin >> Q;
for(int i=0; i<Q; i++) cout << "0\n";
return 0;
}
auto st = nachia::StaticTopTree(tree);
std::vector<std::vector<std::pair<int, int>>> frac(st.numNodes());
std::vector<std::vector<long long>> fracsum(st.numNodes());
using NodeTy = nachia::StaticTopTree::Node::Type;
auto dfs = [&](auto& dfs, int p) -> std::vector<int> {
auto v = st.getNode(p);
if(v.ty == v.TyEdge){
fracsum[p] = {0};
return {};
}
int mid = -1;
if(v.ty == NodeTy::TyCompress) mid = st.getNode(v.l).boundaryT;
if(v.ty == NodeTy::TyRake1) mid = st.getNode(v.r).boundaryT;
if(v.ty == NodeTy::TyRake2) mid = st.getNode(v.l).boundaryT;
auto P = dfs(dfs, v.l);
auto Q = dfs(dfs, v.r);
int iP = 0, iQ = 0, iC = 0;
int f = P.size() + Q.size() + 1;
std::vector<int> res(f);
std::vector<std::pair<int, int>> fract(f+1);
for(int ff=0; ff<f; ff++){
bool getc = false;
bool getp = false;
if(iP == (int)P.size() && iQ == (int)Q.size()){ getc = true; }
else{
if(iP == (int)P.size()) getp = false;
else if(iQ == (int)Q.size()) getp = true;
else getp = P[iP] < Q[iQ];
int nxi = getp ? P[iP] : Q[iQ];
if(iC == 0 && mid < nxi) getc = true;
}
fract[ff+1] = fract[ff];
if(getc){
res[ff] = mid; iC = 1;
}
else{
(getp ? fract[ff+1].first : fract[ff+1].second)++;
res[ff] = (getp ? P[iP++] : Q[iQ++]);
}
}
std::vector<long long> sum(f+1);
for(int i=0; i<f; i++) sum[i+1] = sum[i] + A[res[i]];
frac[p] = std::move(fract);
fracsum[p] = std::move(sum);
return res;
};
auto qarr = dfs(dfs, st.numNodes() - 1);
std::vector<long long> sumA(N+1);
for(int i=0; i<N; i++) sumA[i+1] = sumA[i] + A[i];
std::vector<int> addW(st.numNodes(), 0);
std::vector<long long> weightBuf(N);
auto QUERY = [&](int l, int r, int k, int delta) -> int {
auto WeightOfVtx = [l,r,k,delta,&A](int p) -> long long {
return ((l <= p && p < r) ? k + A[p] : 0) + ((delta == p) ? 1 : 0);
};
int nl = lower_bound(qarr.begin(), qarr.end(), l) - qarr.begin();
int nr = lower_bound(qarr.begin(), qarr.end(), r) - qarr.begin();
int nid = st.numNodes() - 1;
long long lwt = 0;
long long rwt = 0;
long long thres = (sumA[r] - sumA[l] + (long long)(r-l) * k + 1) / 2;
while(st.getNode(nid).ty != NodeTy::TyEdge){
auto node = st.getNode(nid);
auto nodel = st.getNode(node.l);
auto noder = st.getNode(node.r);
long long lwtt = 0, rwtt = 0;
int xl = frac[nid][nl].first, yl = frac[nid][nl].second;
int xr = frac[nid][nr].first, yr = frac[nid][nr].second;
long long xw = fracsum[node.l][xr] - fracsum[node.l][xl] + (long long)(xr - xl) * k + addW[node.l];
long long yw = fracsum[node.r][yr] - fracsum[node.r][yl] + (long long)(yr - yl) * k + addW[node.r];
switch(node.ty){
case NodeTy::TyCompress : {
lwtt = lwt + xw + WeightOfVtx(nodel.boundaryS);
rwtt = rwt + yw + WeightOfVtx(noder.boundaryT);
if(thres < lwtt){
nl = xl; nr = xr; nid = node.l;
rwt = rwtt;
}
else if(thres < rwtt){
nl = yl; nr = yr; nid = node.r;
lwt = lwtt;
}
else return nodel.boundaryT;
} break;
case NodeTy::TyRake1 : {
lwtt = lwt + xw + WeightOfVtx(nodel.boundaryS);
rwtt = rwt + yw + WeightOfVtx(noder.boundaryT);
if(thres < lwtt){
nl = xl; nr = xr; nid = node.l;
rwt = rwtt;
}
else if(thres < rwtt){
nl = yl; nr = yr; nid = node.r;
lwt = lwtt + rwt;
rwt = 0;
}
else return nodel.boundaryT;
} break;
case NodeTy::TyRake2 : {
lwtt = lwt + xw + WeightOfVtx(nodel.boundaryT);
rwtt = rwt + yw + WeightOfVtx(noder.boundaryT);
if(thres < lwtt){
nl = xl; nr = xr; nid = node.l;
lwt = rwtt + lwt;
rwt = 0;
}
else if(thres < rwtt){
nl = yl; nr = yr; nid = node.r;
lwt = lwtt;
}
else return nodel.boundaryS;
} break;
default: break;
}
}
auto fnode = st.getNode(nid);
lwt += WeightOfVtx(fnode.boundaryS);
rwt += WeightOfVtx(fnode.boundaryT);
return lwt > rwt ? fnode.boundaryS : fnode.boundaryT;
};
int Q; cin >> Q;
long long sumX = 0;
for(int q=0; q<Q; q++){
long long ap, bp, kp, delta; cin >> ap >> bp >> kp >> delta;
long long a = (ap + sumX % N) % N;
long long b = (bp + sumX % N * 2) % N;
long long k = (kp + sumX % 150001 * sumX % 150001) % 150001;
int l = std::min(a, b);
int r = std::max(a, b) + 1;
for(int p=st.handleOfVtx(delta); p>=0; p=st.getNode(p).p) addW[p]++;
int x = QUERY(l, r, k*2, delta);
for(int p=st.handleOfVtx(delta); p>=0; p=st.getNode(p).p) addW[p]--;
sumX += x;
cout << x << '\n';
}
return 0;
}