Xlint101

分类

acceleration(18) ACM模板(26) java(3) kotlin(2) stars(1) 日记(1) 未归档(30) 真·随笔(10) 配置(1) 题解(1)

/ 注册

全部文章（共93篇）

delay

A Gentle Introduction to Deep Learning for Graphs tutorial introduction to Deep Learning for Graphs what's deep learning for Graph? abstract Th...

2020-03-08

0 167

writing: improvised lecture

An improvised lecture adapted from articles in textbook first thing i will say is that an important influence on people's ability to cope with stress ...

2020-03-07

0 203

writing: a lesson about coronavirus epidemic

Under the situation where the novel coronavirus pneumonia epidemic is on the rampage, I used to consider the upcoming stories to be no more than a joi...

2020-03-01

0 284

RMQ

1 D void initRMQ(int n) { int MAX=(int)log2(n); FOR(i,1,n) { f[i][0]=a[i]; } FOR(j,1,MAX) { FOR(i,1,n) if (i+(1<<(j-1))<=n)...

RMQ

2020-02-25

0 225

kruscal

#include<bits/stdc++.h> using namespace std; const int maxn=2e5+10; int fi[maxn],ne[maxn],v[maxn],w[maxn]; struct re { int x,y,z; }; re a[maxn]...

图论

2020-02-22

0 184

dijkstra

void dijk(int sta) { FOR(i,1,n) dis[i]=inf; dis[sta]=0; priority_queue<Pair,vector<Pair>,greater<Pair> >q; q.push(MP(dis[sta],s...

图论

2020-02-22

0 203

ORIGIN

#include <bits/stdc++.h> //#define endl '\n' #define lose {printf("NO\n");return;} #define win {printf("YES\n");return;} #de...

2020-02-19

0 267

LCA

for distance or ancestor #include <bits/stdc++.h> #define FOR(I, A, B) for (int I = (A); I <= (B); ++I) #define PER(I, A, B) for (int I = (A...

图论

2020-02-17

0 260

线段树和其他

BIT int tr[maxn]; void add(int x, int t) { for(int i=x; i<=n; i+=(i&(-i))) (tr[i]+=t)%=mod; } int get(int x) { int ret=0; for(i...

树

2020-02-03

0 221

组合数

递推公式求解C(n, m)%p 费马小定理的转换线性求inv和fac #include<bits/stdc++.h> #define ll long long #define asd cout<<"!"<<endl using...

数学

2020-02-02

0 312