仙度瑞拉快点跑-CSDN博客

原创 acwing 291

#include <bits/stdc++.h>#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)#define _zero(a) memset(a, 0, sizeof(a))#define _far(a) memset(a, 0x3f,sizeof (a))#define __far(a) memset(a, -0x3f,sizeof (a))#define far 0x3f3f3f3f#define .

2022-03-10 21:22:17 221

原创每日一题摘桃子

#include <bits/stdc++.h>#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)#define _zero(a) memset(a, 0, sizeof(a))#define _far(a) memset(a, 0x3f,sizeof (a))#define __far(a) memset(a, -0x3f,sizeof (a))#define far 0x3f3f3f3f#define .

2022-03-07 21:55:54 321

原创每日一题 Minimum Or Spanning Tree

#include <bits/stdc++.h>#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)#define _zero(a) memset(a, 0, sizeof(a))#define _far(a) memset(a, 0x3f,sizeof (a))#define __far(a) memset(a, -0x3f,sizeof (a))#define far 0x3f3f3f3f#define .

2022-03-07 21:55:00 252

原创 acwing 242

#include <bits/stdc++.h>#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)#define _zero(a) memset(a, 0, sizeof(a))#define _far(a) memset(a, 0x3f,sizeof (a))#define __far(a) memset(a, -0x3f,sizeof (a))#define far 0x3f3f3f3f#define .

2022-02-21 21:48:06 471

原创 acwing 241

#include <bits/stdc++.h>#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)#define _zero(a) memset(a, 0, sizeof(a))#define _far(a) memset(a, 0x3f,sizeof (a))#define __far(a) memset(a, -0x3f,sizeof (a))#define far 0x3f3f3f3f#define .

2022-02-20 22:24:26 443

原创 acwing 285

#include <bits/stdc++.h>using namespace std;const int N = 6100;bool v[N];int head[N], e[N], ver[N], tot;int n;int f[N][2];int h[N];void add(int x, int y){ ++ tot; ver[tot] = y; e[tot] = head[x]; head[x] = tot;}void dp(.

2022-02-12 21:46:42 296

原创 acwing 349

#include <bits/stdc++.h>#define int long long#define PII pair<int, int >using namespace std;const int N = 1100;const int mod = (1 << 31) - 1;int a[N][N];int n, m;int d[N];bool v[N];int cnt[N];void read(){ cin >>.

2022-02-11 22:02:07 315

原创 acwing 347

#include <bits/stdc++.h>using namespace std;const int N = 30;int n, s;int a[N][N], d[N], tree[N][N];int conn[N];bool v[N];int ans, deg, cnt;void read(){ cin >> n; map<string, int> mp; mp["Park"] = 1; string s1.

2022-02-10 18:43:21 288

原创 acwing 346

#include <bits/stdc++.h>#define int long longusing namespace std;const int N = 6100;int n;struct rec {int x, y, z;} e[6100];int fa[6100], s[6100];int ans;bool operator <(rec a, rec b){ return a.z < b.z;}int get(int x){ .

2022-02-08 18:00:20 370

原创 acwing 341

#include <bits/stdc++.h>using namespace std;const int N = 1e5 + 100, M = 5e5 + 100;int head1[N], ver1[M], e1[M], tot1;int head2[N], ver2[M], e2[M], tot2;int d1[N], d2[N];bool v1[N], v2[N];int price[N];int n, m;void add1(int x, int y){.

2022-02-07 02:17:37 108

原创 acwing 340

#include <bits/stdc++.h>#define PII pair<int, int>using namespace std;const int N = 1100, M = 21000, L = 1000000;int head[N], ver[M], w[M], e[M], tot;int f[N][N];bool v[N][N];queue<PII> q;int n, m, k;void add(int x, int y, in.

2022-02-06 18:08:51 424

原创 acwing 851

#include <bits/stdc++.h>using namespace std;const int N = 1e5 + 100, M = 1e5 + 100;int n, m;int head[N], ver[M], w[M], e[M], tot;int d[N];int v[N];queue<int> q;void add(int x, int y, int z){ ++ tot; ver[tot] = y; w[tot]...

2022-02-05 16:14:49 250

原创 acwing 850

#include <bits/stdc++.h>#define PII pair<int, int>using namespace std;const int N = 1.5e5 + 100, M = 1.5e5 + 100;int head[N], ver[M], e[M], w[M], tot;int n, m, d[N];bool vist[N];priority_queue<PII> q;void add(int x, int y, in.

2022-02-05 02:07:35 210

原创 acwing 849

#include <bits/stdc++.h>using namespace std;const int N = 510;int n, m;int a[N][N];int dist[N];bool vist[N];int main(){ cin >> n >> m; memset(a, 0x3f3f3f3f, sizeof a); for (int i = 1; i <= m; i ++) { .

2022-02-05 01:45:47 534

原创 acwing 283

#include <bits/stdc++.h>#define int long longusing namespace std;int n;char s[60];int a[60];int f[60][60][2];signed main(){ cin >> n; for (int i = 1; i <= n; i ++) cin >> s[i] >> a[i]; vector<int&.

2022-02-03 19:52:54 62

原创 acwing 282

#include <bits/stdc++.h>using namespace std;const int maxn = 310;int n;int a[maxn];int f[maxn][maxn];int sum[maxn];int main(){ cin >> n; for (int i = 1; i <= n; i ++) cin >> a[i]; memset(sum, 0, sizeof sum); .

2022-02-03 15:04:19 6246

原创 acwing 275

#include <bits/stdc++.h>using namespace std;const int N = 60;int g[N][N];int f[N + N][N][N];int n, m;int main(){ cin >> n >> m; for (int i = 1; i <= n; i ++) for (int j = 1; j <= m; j ++) cin >> g[i].

2022-01-26 22:48:40 370

原创 acwing 274

#include <bits/stdc++.h>using namespace std;const int N = 210, M = 1010;int l, n;int c[N][N];int a[M];int f[M][N][N];signed main(){ scanf("%d%d", &l, &n); for (int i = 1; i <= l; i ++) for (int j = 1; j <=.

2022-01-25 18:25:38 413

原创 acwing 273

#include <bits/stdc++.h>#define int long longusing namespace std;const int maxn = 2010;int n;int a[maxn], b[maxn];int f[maxn][maxn];signed main (){ scanf("%lld", &n); for (int i = 1; i <= n; i ++) { cin >> a[.

2022-01-25 02:39:45 156

原创 acwing 238

#include <bits/stdc++.h>#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)#define _zero(a) memset(a, 0, sizeof(a))#define endl '\n'#define int long long#define mp make_pair#define PII pair<int, int>#define x first#define y.

2022-01-19 16:20:52 297