Report Page

BOCA	The 2025 ICPC Latin America Championship - Programadores de América 2025 - PdA \| SCORE \| RUNS \| TASKS \| CLARIFICATIONS \| STATISTICS \|

Clarification List

#	Site	User	Time	Problem	Status	Judge (Site)	Question	Answer
306787601	1	1010132	8	C	answeredall	judge1 (1)	Can we assume that the coat is washed in one day?	Yes.
368225902	1	1010126	110	A	answered	judge0 (1)	Is the combination u, v and c unique for each testcase?	No response.
410098903	1	1010111	180	G	answered	judge1 (1)	DESCUBRA O QUE ESTA ERRADO NA MINHA SEG TREE DINAMICA POR FAVOR #include <bits/stdc++.h> using namespace std; const long long MAX = 1e18 + 2e9; vector<int> l, r; vector<long long> lz, mn, mx; int create() { mx.push_back(0); lz.push_back(0); mn.push_back(0); l.push_back(0); r.push_back(0); return mx.size() - 1; } void push(long long pos, long long L, long long R) { if(pos == 0) return; if(lz[pos]) { mn[pos] += lz[pos]; mx[pos] += lz[pos]; if(L != R) { if(l[pos] == 0) { int aux = create(); l[pos] = aux; } if(r[pos] == 0) { int aux = create(); r[pos] = aux; } lz[l[pos]] += lz[pos]; lz[r[pos]] += lz[pos]; } } lz[pos] = 0; } void update(long long pos, long long L, long long R, long long p, long long q, long long val) { if(pos == 0) return; push(pos, L, R); if(q < L or p > R) return; if(p <= L and R <= q) { lz[pos] += val; push(pos, L, R); return; } long long mid = (L + R) >> 1; if(l[pos] == 0) { int aux = create(); l[pos] = aux; } if(r[pos] == 0) { int aux = create(); r[pos] = aux; } update(l[pos], L, mid, p, q, val); update(r[pos], mid + 1, R, p, q, val); mx[pos] = max(mx[l[pos]], mx[r[pos]]); mn[pos] = min(mn[l[pos]], mn[r[pos]]); } pair<long long, long long> query(int pos, long long L, long long R, long long p, long long q) { if(pos == 0) return make_pair(MAX, 0); push(pos, L, R); if(q < L or p > R) return make_pair(MAX, 0); if(p <= L and R <= q) { return make_pair(mn[pos], mx[pos]); } long long mid = (L + R) >> 1; auto ql = query(l[pos], L, mid, p, q); auto qr = query(r[pos], mid + 1, R, p, q); return make_pair(min(ql.first, ql.second), max(ql.second, qr.second)); } int main() { ios_base::sync_with	It is your task.
438747404	1	1010102	228	B	answered	judge0 (1)	Is there an issue with B? Our submission has been running for a long time	Please share the run id for us to investigate.
442561005	1	1010131	234	E	answered	judge0 (1)	is the output of the first case correct?	No response.
452845706	1	1010130	251	A	answered	judge1 (1)	The pair (u, v) is a distinct (and should be counted) as (v, u)?	Read the statement.
453164307	1	1010111	252	General	answered	judge13 (1)	can Z be negative? aka can we point the telescope to the ground?	No response.
453366908	1	1010111	252	J	answered	judge1 (1)	with the correct problem now: can Z be negative? aka can we point the telescope to the ground?	Read the statement.
481014709	1	1010111	298	General	answered	judge1 (1)	lip arcanjo please help me #include <bits/stdc++.h> using namespace std; const long long MAX = 1e18 + 2e9; vector<int> l, r; vector<long long> lz, mn, mx; int create() { mx.push_back(0); lz.push_back(0); mn.push_back(0); l.push_back(0); r.push_back(0); return mx.size() - 1; } void push(long long pos, long long L, long long R) { if(pos == 0) return; if(lz[pos]) { mn[pos] += lz[pos]; mx[pos] += lz[pos]; if(L != R) { if(l[pos] == 0) { int aux = create(); l[pos] = aux; } if(r[pos] == 0) { int aux = create(); r[pos] = aux; } lz[l[pos]] += lz[pos]; lz[r[pos]] += lz[pos]; } } lz[pos] = 0; } void update(long long pos, long long L, long long R, long long p, long long q, long long val) { if(pos == 0) return; push(pos, L, R); if(q < L or p > R) return; if(p <= L and R <= q) { lz[pos] += val; push(pos, L, R); return; } long long mid = (L + R) >> 1; if(l[pos] == 0) { int aux = create(); l[pos] = aux; } if(r[pos] == 0) { int aux = create(); r[pos] = aux; } update(l[pos], L, mid, p, q, val); update(r[pos], mid + 1, R, p, q, val); mx[pos] = max(mx[l[pos]], mx[r[pos]]); mn[pos] = min(mn[l[pos]], mn[r[pos]]); } pair<long long, long long> query(int pos, long long L, long long R, long long p, long long q) { if(pos == 0) return make_pair(MAX, 0); push(pos, L, R); if(q < L or p > R) return make_pair(MAX, 0); if(p <= L and R <= q) { return make_pair(mn[pos], mx[pos]); } long long mid = (L + R) >> 1; auto ql = query(l[pos], L, mid, p, q); auto qr = query(r[pos], mid + 1, R, p, q); return make_pair(min(ql.first, ql.second), max(ql.second, qr.second)); }	Sorry, I am not him.