temp2
//https://drive.google.com/drive/folders/1jpkE2jz0UaxAVG3gE6Itk6LbKEqWLDW5 #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std ; using namespace __gnu_pbds ; #define ordered_set tree < ll, null_type , less < ll > , rb_tree_tag , tree_order_statistics_node_update > //order_of_key (k) : Number of items strictly smaller than k . //find_by_order(k) : K-th element in a set (counting from zero). (returns to an iterator) #define ll long long int #define llu unsigned long long int #define pi 3.14159265359 #define lcm ( x , y ) (x / gcd (x, y)) * y #define sin ( x ) sin ((x / 180.0 ) * pi ) #define cos ( x ) cos ((x / 180.0 ) * pi ) #define tan ( x ) tan ((x / 180.0 ) * pi ) #define len ( x1 , y1 , x2 , y2 ) hypot (x1 - x2, y1 - y2) #define sorta ( v ) sort ( v . begin (), v . end ()) #define sortd ( v ) sort ( v . begin (), v . end (), greater <>()) #...