「已注销」-CSDN博客

原创 T1002 Business (35分)

#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>using namespace std;const int inf = 0x7FFFFFFF;const int maxn = 60;int N;struct Pro{ int ben...

2020-01-02 01:49:38 532

原创 T1001 Battle Over Cities - Hard Version (35分)

#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>using namespace std;const int inf = 0x7FFFFFFF;const int maxv = 510, maxe = 2e5;int N, M;int ...

2020-01-02 00:34:11 229

原创 T1001 Battle Over Cities - Hard Version (35分)

#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>using namespace std;const int inf = (1<<31)-10;const int maxv = 510, maxe = 2e5;int N, M;...

2020-01-01 23:38:04 173

原创 A1121 Damn Single (25 分)

#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <map>using namespace std;const int maxn = 100010;int N, M;int a[maxn], pres[ma...

2019-08-27 23:10:32 105

原创 A1120 Friend Numbers (20 分)

#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <queue>using namespace std;const int maxn = 40;struct Node{ int x, h, pos; in...

2019-08-27 23:09:26 104

原创 A1119 Pre- and Post-order Traversals (30 分)

#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <vector>using namespace std;const int maxn = 40;int N;int pre[maxn], post[maxn...

2019-08-27 19:54:09 110

原创 A1118 Birds in Forest (25 分)

#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <set>using namespace std;const int inf = (1 << 31) - 10;const int maxn = ...

2019-08-27 19:53:36 136

原创 A1117 Eddington Number (25 分)

#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>using namespace std;const int maxn = 100010;int N;int a[maxn];int main() { scanf("%d", &...

2019-08-27 19:52:37 125

原创 A1116 Come on! Let's C (20 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <cstdio>#include <vector>using namespace std;const int maxn = 10010; int ...

2019-08-27 19:51:53 152

原创 A1115 Counting Nodes in a BST (30 分)

#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <vector>using namespace std;const int maxn = 1010;struct Node{ int x; int l, ...

2019-08-27 02:25:13 90

原创 A1114 Family Property (25 分)

#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <set>using namespace std;const int inf = (1 << 31) - 10;const int maxn = ...

2019-08-27 02:23:18 141

原创 A1113 Integer Set Partition (25 分)

#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>using namespace std;const int maxn = 100010;int N;int a[maxn], acc[maxn];int sum1, sum2;int ...

2019-08-27 02:22:21 96 1

原创 A1112 Stucked Keyboard (20 分)

#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <vector>using namespace std;int K;int main() { //freopen("1.txt", "r", stdin);...

2019-08-27 02:20:14 127

原创 A1108 Finding Average (20 分)

#include <iostream>#include <algorithm>#include <cmath>#include <vector>#include <queue>#include <stack>using namespace std;typedef long long ll;const int ...

2019-08-26 22:33:38 168

原创 AGroup Photo

#include <iostream>#include <algorithm>#include <cmath>#include <vector>#include <queue>#include <stack>using namespace std;typedef long long ll;const int ...

2019-08-26 22:27:56 579

原创 A1110 Complete Binary Tree (25 分)

#include <iostream>#include <algorithm>#include <cmath>#include <vector>#include <queue>#include <stack>using namespace std;const int inf = (1 << 31) ...

2019-08-26 22:26:29 98

原创 A1111 Online Map (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>#include <stack>using namespace std;const i...

2019-08-26 22:24:47 155

原创 A1105 Spiral Matrix (25 分)

#include <iostream>#include <algorithm>#include <cstring>#include <cmath>using namespace std;const int maxn = 10010;int N, m, n;int a[maxn];int used[110][110], mat[110...

2019-08-23 18:15:08 132

原创 A1026 Table Tennis (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <queue>using namespace std;const int inf = (1 << 31) - 10;const int maxn =...

2019-08-23 16:54:04 133

原创 A1014 Waiting in Line (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <queue>using namespace std;const int inf = (1 << 31) - 10;const int maxn =...

2019-08-23 02:00:43 196

原创 A1017 Queueing at Bank (25 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>#include <map>using namespace std;const int...

2019-08-23 02:00:04 212

原创 A1087 All Roads Lead to Rome (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>#include <map>using namespace std;const int...

2019-08-22 18:22:17 170

原创 A1072 Gas Station (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;const int inf = 1000000;const...

2019-08-22 16:54:40 115

原创 A1030 Travel Plan (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;const int inf = 10000000;cons...

2019-08-22 02:48:30 179

原创 A1018 Public Bike Management (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;const int inf = 10000000;cons...

2019-08-22 02:07:11 122

原创 A1003 Emergency (25 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;const int inf = 1000000;const...

2019-08-21 21:44:42 309

原创 A1076 Forwards on Weibo (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;const int maxn = 1010;vector&...

2019-08-21 16:00:39 59

原创 A1034 Head of a Gang (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <map>#include <set>using namespace std;const int m...

2019-08-21 02:45:33 86

原创 1021 Deepest Root (25 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>using namespace std;const int maxn = 10010;vector<int> G[maxn], te...

2019-08-21 00:46:00 154

原创 A1013 Battle Over Cities (25 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>using namespace std;const int maxn = 1010;vector<int> G[maxn];int...

2019-08-20 21:31:32 166

原创 A1098 Insertion or Heap Sort (25 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;int N;int a[110], b[110];int...

2019-08-20 16:03:46 56

原创 A1107 Social Clusters (30 分)

//并查集，省时#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;const int maxn = 1100...

2019-08-20 14:21:58 100

原创 A1066 Root of AVL Tree (25 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;struct Node{ int key; int h,...

2019-08-20 02:04:43 67

原创 A1099 Build A Binary Search Tree (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;struct Node{ int key; int le...

2019-08-20 00:24:20 45

原创 A1064 Complete Binary Search Tree (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>using namespace std;int N;int a[1010], CBT[1010];int p = 0;void inOrder(int root){ if(root &g...

2019-08-20 00:02:10 84

原创 A1043 Is It a Binary Search Tree (25 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;struct Node{ int key; int le...

2019-08-19 21:38:25 82

原创 A1053 Path of Equal Weight (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;struct Node{ int w; vector&l...

2019-08-19 15:13:05 112

原创 A1004 Counting Leaves (30 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;struct Node{ int layer; vect...

2019-08-19 14:06:48 89

原创 A1106 Lowest Price in Supply Chain (25 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;const int inf = (1<<31) ...

2019-08-19 13:05:13 78

原创 A1094 The Largest Generation (25 分)

#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <vector>#include <queue>using namespace std;struct Node{ int layer; vect...

2019-08-19 00:58:48 110

空空如也

空空如也