Starry

#include<bits/stdc++.h> using namespace std; using ll =long long ; const int maxn=5e5+9; struct Node{ int l,r,v; }tr[maxn<<2]; int gcd(int ma,int mi){return mi?gcd(mi,ma%mi):ma;} int a[maxn],n,m,cnt; void build(int l,int r,int now){

有思路但老是被否，自己却难以implement #include <bits/stdc++.h> /* #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/hash_policy.hpp> */ using namespace std; const double eps = 1e-10; const double pi = 3.1415926535897932384626433832795; const

乱搞 #include <bits/stdc++.h> /* #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/hash_policy.hpp> */ using namespace std; const double eps = 1e-10; const double pi = 3.1415926535897932384626433832795; const double eln = 2.

看错题面，还写挂每个格子对应id的式子 #include <bits/stdc++.h> /* #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/hash_policy.hpp> */ using namespace std; const double eps = 1e-10; const double pi = 3.1415926535897932384626433832795; const dou

老是看错题。。。。 #include <bits/stdc++.h> /* #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/hash_policy.hpp> */ using namespace std; const double eps = 1e-10; const double pi = 3.1415926535897932384626433832795; const double eln &#