AND20211201

题解

dfs(1) 总结(28) 数据结构(1) 未归档(1) 洛谷(1)

/ 注册

全部文章 / 题解（共113篇）

果壳游戏

">using namespace std; int a[110][3]; int main() { int t; cin >>t; for(int i = 0; i < t; i ++) { cin >> a[i][0]...

2022-03-29

1 333

水桶传递序列

">using namespace std; #define x first #define y second int main() { char s[11][11]; pair<int,int> a, b, c; for(int i = 0; i < 10...

2022-03-28

0 273

社交距离I

">using namespace std; const int N = 1e5 + 10; int p[N]; int main() { int n; string s; cin >> n >> s; int cnt = 0; for...

2022-03-28

0 403

三角形

">#include<algorithm> using namespace std; const int N = 110; pair<int,int> a[N]; #define x first #define y second int main() { int n;...

2022-03-27

0 240

困牛放牧

">#include<algorithm> using namespace std; int a[3]; int main() { for(int i = 0; i < 3; i ++)cin >>a[i]; sort(a, a + 3); in...

2022-03-27

0 341

连通块中点的数量

">using namespace std; const int N = 1e5 + 10; int p[N], len[N]; int find(int x)//返回x的祖宗节点 + 路径压缩 { if(p[x]!=x) p[x] = find(p[x]); return p[x]...

2022-03-26

1 301

整数拼接

">using namespace std; const int N = 1e5 + 10; typedef long long LL; int a[N]; LL s[11][N]; int main() { LL n, k; cin >> n >>k; ...

2022-03-24

1 227

走方格

">using namespace std; int n, m; int t[100][100]; int ans; int dx[] ={1,0}, dy[] = {0, 1}; int dfs(int st, int ed) { for(int i = 0; i < 2; i ++...

动态规划

2022-03-24

1 203

牛的学术圈

">#include<algorithm> using namespace std; const int N = 1e5 + 10; int c[N]; int n, l, h; typedef pair<int, int> PII; #define x first #def...

2022-03-24

0 262

池塘计数

">#include<queue> using namespace std; #define x first #define y second int n, m; const int N = 1010; char s[N][N]; bool t[N][N]; int ans; typed...

2022-03-23

1 457