№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
A: Security check in websites that want to prevent robots, just print "security"
B: The first 25 contests in codeforces, contests 15, 20, and 21 was unrated, so print NO if the contest was unrated, otherwise print YES
C: Every testcase will give you n numbers, where $$$n = PI_i$$$, so $$$n1 = 3$$$, $$$n2 = 1$$$, $$$n3 = 4$$$, and so on.., Print the product of numbers
D: Print any number that is guranteed that it won't come in the sequence, for example 0 or -1
E: Print any positive number (I don't know)
F: Print largest prime factor, don't calculate it, just put if
G: The image shows that he is a color blind, n is the length, s1 is what person sees, s2 is what is the real colors. Print YES if the person only sees the red color correctly.
H: Complex probabilities problem, because all the numbers are random (idk the solution)
I: Check if the bracket sequence is balanced, Consider letters "bdfhklt" as open bracket, and letters "gjpqy" as closed bracket, ignore other letters
J: Write "please" in any lettercase, and judge will give you AC
Recently, I solved 342E - Xenia and Tree using Sqrt decomposition.
The problem have two types of queries:
I thought, what will be the solution if there is query: Color node $$$x$$$ blue?
I'm not sure if this is solvable using centroid decomposition, but is there another way?
I thought long time ago, why std
doesn't have a segment_tree
class? so I decided to create a similar one.
My template is a class in an STD-similar way, supporting lazy propagation.
A quick example on how does it look like:
#include <bits/stdc++.h>
using namespace std;
// Put the template here :)
using namespace alg;
segment_tree<int, merge_min> st;
int main() {
int n, q;
cin >> n;
st.set_out(INT_MAX);
st.resize(n);
for (int i = 0; i < n; i++)
cin >> st.values[i];
st.build();
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
l--, r--;
cout << st.get(l, r) << '\n';
}
}
Just like that!!
It's available on a GitHub gist
So, what is your opinion about it? and how can I improve it?
Название |
---|