```cpp #include using namespace std; int n,t; struct cow { int s,e; friend bool operator = l) && (R r) || (R = p) { update(u * 2,nl,nmid,p,x); } else { update(u…

注意这里double精度不够，要用long double

```cpp #include #define int long long using namespace std; int n,m,cnt; int mp[110][110],f[110][110]; int mov[8][2] = {{0,1},{0,-1},{1,1},{1,0},{1,-1},{-1,1},{-…

```cpp #include using namespace std; long long a,b; long long x,y; signed main() { cin >> a >> b >> x >> y; if (max(abs(a),abs(x)) * max(abs(b),abs(y)) <= INT_M…

在讨论《dijkstra 邻接表 链式前向星性能差距大且TLE》回复：

@[Poole_tea](luogu://user/668379) 过了，谢谢 还有想问一下判断vis的两种方法有什么区别吗

在讨论《dijkstra 邻接表 链式前向星性能差距大且TLE》回复：

@[Poole_tea](luogu://user/668379) 把longlong改int只能快不到10ms https://www.luogu.com.cn/record/194097919 https://www.luogu.com.cn/record/194480155

dijkstra 邻接表做法：开O2 84pts 不开O2 48pts ```cpp #include #define int long long using namespace std; struct edge { int v,w; }; struct pt { int length,num; friend bool…