1121

  1. #include<cmath>
  2. #include<map>
  3. #include<iostream>
  4. #include<cstring>
  5. #include<cstdio>
  6. #include<set>
  7. #include<vector>
  8. #include<queue>
  9. #include<stack>
  10. #include<algorithm>
  11. using namespace std;
  12. typedef long long ll;
  13. const int N = 1e6+5;
  14. const int INF = 0x3f3f3f3f;
  15. #define MP(x, y) make_pair(x, y)
  17. int pai[N];
  18. int a[N];
  19. int has[N];
  20. int ord[N];
  21. int main() {
  22.   int n;
  23.   while(~scanf("%d", &n)) {
  24.     memset(pai, -1, sizeof(pai));
  25.     for(int i = 0; i < n; ++i) {
  26.       int a, b; scanf("%d%d", &a, &b);
  27.       pai[a] = b; pai[b] = a;
  28.     }
  30.     int m; scanf("%d", &m);
  31.     for(int i = 0; i < m; ++i) {
  32.       scanf("%d", &a[i]);
  33.       has[a[i]] ++; if(pai[a[i]] != -1) has[pai[a[i]]] ++;
  34.     }
  35.     int tot = 0;
  36.     for(int i = 0; i < m; ++i) {
  37.       if(has[a[i]] == 1) {
  38.         ord[tot ++] = a[i];
  39.       }
  40.     }
  42.     sort(ord, ord + tot);
  43.     printf("%d\n", tot);
  44.     for(int i = 0; i < tot; ++i) {
  45.       if(i) printf(" ");
  46.       printf("%05d", ord[i]);
  47.     }
  48.     if(tot) printf("\n");
  49.   }
  50.   return 0;
  51. }

1122 我把爆搜都写完了，才发现这题的圈顺序是给定的，我爆搜就不删了

  1. #include<cmath>
  2. #include<map>
  3. #include<iostream>
  4. #include<cstring>
  5. #include<cstdio>
  6. #include<set>
  7. #include<vector>
  8. #include<queue>
  9. #include<stack>
  10. #include<algorithm>
  11. using namespace std;
  12. typedef long long ll;
  13. const int N = 205;
  14. const int INF = 0x3f3f3f3f;
  15. #define MP(x, y) make_pair(x, y)
  17. struct Node{
  18.   int to, nx;
  19. }E[N*N*2];
  20. int mp[N][N];
  21. int head[N], tot;
  22. void add(int fr, int to) {
  23.   E[tot].to = to; E[tot].nx = head[fr]; head[fr] = tot ++;
  24. }
  25. set<int> st;
  26. int suc;
  27. void dfs(int l, int r) {
  28.   printf("%d %d\n", l, r);
  29.   if(suc) return;
  30.   if(st.size() == 0) {
  31.     if(mp[l][r]) suc = 1;
  32.     return;
  33.   }
  34.   if(st.size() == 1) {
  35.     int tt = *st.begin();
  36.     if(mp[l][tt] && mp[r][tt]) {
  37.       suc = 1;
  38.     }
  39.     return;
  40.   }
  42.   vector<int> ch1; vector<int> ch2;
  43.   for(int i = head[l]; ~i; i = E[i].nx) {
  44.     if(st.find(E[i].to) != st.end()) {
  45.       ch1.push_back(E[i].to);
  46.     }
  47.   }
  48.   if(l == r) {
  49.     for(int i = 0; i < ch1.size() && !suc; ++i) {
  50.       for(int j = i+1; j < ch1.size() && !suc; ++j) {
  51.         st.erase(ch1[i]); st.erase(ch1[j]);
  52.         dfs(ch1[i], ch1[j]);
  53.         st.insert(ch1[i]); st.insert(ch1[j]);
  54.       }
  55.     }
  56.     return;
  57.   }
  58.   for(int i = head[r]; ~i; i = E[i].nx) {
  59.     if(st.find(E[i].to) != st.end()) {
  60.       ch2.push_back(E[i].to);
  61.     }
  62.   }
  64.   for(int i = 0; i < ch1.size() && !suc; ++i) {
  65.     for(int j = 0; j < ch2.size() && !suc; ++j) {
  66.       if(ch1[i] != ch2[j]) {
  67.         st.erase(ch1[i]); st.erase(ch2[j]);
  68.         dfs(ch1[i], ch2[j]);
  69.         st.insert(ch1[i]); st.insert(ch2[j]);
  70.       }
  71.     }
  72.   }
  74. }
  75. int main() {
  76.   int n,m;
  77.   while(~scanf("%d %d", &n, &m)) {
  78.     memset(head, -1, sizeof(head));
  79.     tot = 0;
  81.     for(int i = 0; i < m; ++i) {
  82.       int a, b; scanf("%d %d", &a, &b);
  83.       add(a, b); add(b, a);
  84.       mp[a][b] = mp[b][a] = 1;
  85.     }
  87.     int k; scanf("%d", &k);
  88.     while(k --) {
  89.       int a; scanf("%d", &a);
  90.       int fl = 1;
  91.       st.clear();
  92.       int pre = -1;
  93.       int St = -1;
  95.       for(int i = 0; i < a; ++i) {
  96.         int b; scanf("%d", &b);
  97.         if(St == -1) St = b;
  98.         if(st.find(b) != st.end() && i != a-1) fl = 0;
  99.         if(i == a-1 && St != b) fl = 0;
  100.         if(~pre && !mp[b][pre]) fl = 0;
  101.         pre = b;
  102.         st.insert(b);
  103.       }
  105.     //  int tt = *st.begin(); st.erase(tt);
  106.     //  suc = 0;
  107.     //  dfs(tt, tt);
  109.       if(fl && a > 4) printf("YES\n");
  110.       else printf("NO\n");
  111.     }
  112.   }
  113.   return 0;
  114. }

1123 和之前一道avl类似

  1. #include<cmath>
  2. #include<map>
  3. #include<iostream>
  4. #include<cstring>
  5. #include<cstdio>
  6. #include<set>
  7. #include<vector>
  8. #include<queue>
  9. #include<algorithm>
  10. using namespace std;
  11. typedef long long ll;
  12. const int N = 25;
  13. const int INF = 0x3f3f3f3f;
  14. #define MP(x, y) make_pair(x, y)
  16. int root;
  17. int num[N];
  18. int L[N], R[N], fa[N];
  19. int n;
  21. void insert(int x, int tag) {
  22.   //  printf("tag: %d\n", x);
  23.   if(!root) {
  24.     root = tag; fa[tag] = tag; return;
  25.   }
  26.   if(num[x] > num[tag]) {
  27.     if(!L[x])  L[x] = tag, fa[tag] = x;
  28.     else insert(L[x], tag);
  29.   }else {
  30.     if(!R[x])  R[x] = tag, fa[tag] = x;
  31.     else insert(R[x], tag);
  32.   }
  33. }
  35. struct Node{
  36.   int po, val;
  37.   Node(int a=0, int b=0):po(a), val(b){}
  38. }E[10];
  39. int cmp(Node a,Node b) {
  40.   return a.val < b.val;
  41. }
  43. void LL(int x) {
  44.   //  printf("LL\n");
  45.   int fart = fa[fa[x]];
  46.   int t1 = x; int t2 = R[x]; int t3 = fa[x];
  47.   fa[t1] = 0; fa[t2] = 0; fa[t3] = 0;
  48.   R[t1] = t3; fa[t3] = t1;
  49.   L[t3] = t2; fa[t2] = t3;
  51.   if(t3 == root) {
  52.     root = t1; fa[t1] = t1;
  53.   }else if(L[fart] == t3) {
  54.     L[fart] = t1; fa[t1] = fart;
  55.   }else R[fart] = t1, fa[t1] = fart;
  56. }
  57. void RR(int x) {
  58.   //  printf("RR\n");
  59.   int fart = fa[fa[x]];
  60.   int t1 = x; int t2 = L[x]; int t3 = fa[x];
  61.   fa[t1] = 0; fa[t2] = 0; fa[t3] = 0;
  62.   L[t1] = t3; fa[t3] = t1;
  63.   R[t3] = t2; fa[t2] = t3;
  65.   if(t3 == root) {
  66.     root = t1; fa[t1] = t1;
  67.   }else if(L[fart] == t3) {
  68.     L[fart] = t1; fa[t1] = fart;
  69.   }else R[fart] = t1, fa[t1] = fart;
  70. }
  71. void LR(int x, int tag) {
  72.   //  printf("LR\n");
  74.   int fart = fa[fa[x]];
  75.   int t1 = x; int t2 = R[x]; int t3 = fa[x];
  76.   int a1 = L[t2]; int a2 = R[t2];
  78.   fa[t1] = 0; fa[t2] = 0; fa[t3] = 0;
  79.   R[t1] = 0; L[t3] = 0;
  80.   L[t2] = t1; fa[t1] = t2;
  81.   R[t2] = t3; fa[t3] = t2;
  82.   if(t3 == root) {
  83.     root = t2; fa[t2] = t2;
  84.   }else if(L[fart] == t3) {
  85.     L[fart] = t2; fa[t2] = fart;
  86.   }else {
  87.     R[fart] = t2; fa[t2] = fart;
  88.   }
  90.   if(a1) insert(root, a1);
  91.   if(a2) insert(root, a2);
  92. }
  93. void RL(int x, int tag) {
  94.   //  printf("RL\n");
  95.   int fart = fa[fa[x]];
  96.   int t1 = x; int t2 = L[x]; int t3 = fa[x];
  97.   int a1 = L[t2]; int a2 = R[t2];
  99.   L[t1] = 0; R[t3] = 0;
  100.   fa[t1] = 0; fa[t2] = 0; fa[t3] = 0;
  101.   L[t2] = t3; fa[t3] = t2;
  102.   R[t2] = t1; fa[t1] = t2;
  103.   //   printf("hh %d %d %d\n", num[t1], num[t2], num[t3]);
  104.   if(t3 == root) {
  105.     root = t2; fa[t2] = t2;
  106.   }else if(L[fart] == t3) {
  107.     L[fart] = t2; fa[t2] = fart;
  108.   }else {
  109.     R[fart] = t2; fa[t2] = fart;
  110.   }
  111.   //  printf("hh %d %d", fart, R[fart]);
  112.   if(a1) insert(root, a1);
  113.   if(a2) insert(root, a2);
  114. }
  115. void fix(int x) {
  116.   int rt = fa[fa[x]]; int fart = fa[rt];
  117.   if( (L[rt]==0) + (R[rt]==0) == 1) {
  118.     int tot = 0;
  119.     for(int i = 0, tt = x; i < 3; ++i) {
  120.       E[tot++] = Node(tt, num[tt]);
  121.       tt = fa[tt];
  122.     }
  123.     sort(E, E+tot, cmp);
  124.     L[E[1].po] = E[0].po; fa[E[0].po] = E[1].po;
  125.     R[E[1].po] = E[2].po; fa[E[2].po] = E[1].po;
  126.     L[E[0].po] = 0; R[E[0].po] = 0;
  127.     L[E[2].po] = 0; R[E[2].po] = 0;
  129.     if(root == rt) {
  130.       root = E[1].po; fa[root] = root;
  131.     }else if(L[fart] == rt) {
  132.       L[fart] = E[1].po; fa[E[1].po] = fart;
  133.     }else {
  134.       R[fart] = E[1].po; fa[E[1].po] = fart;
  135.     }
  136.   }else {
  137.     //  printf("%d %d %d\n", x, rt, fa[rt]);
  138.     if     (L[fa[rt]] == rt && L[rt] == fa[x] ) LL(rt);
  139.     else if(R[fa[rt]] == rt && R[rt] == fa[x] ) RR(rt);
  140.     else if(L[fa[rt]] == rt && R[rt] == fa[x] ) LR(rt, x);
  141.     else if(R[fa[rt]] == rt && L[rt] == fa[x] ) RL(rt, x);
  142.   }
  143. }
  144. void test(int x, int pre) {
  145.   printf("%d from %d\n", x, pre);
  146.   if(L[x]) test(L[x], x);
  147.   if(R[x]) test(R[x], x);
  148. }
  150. int height[N]; int tag;
  151. void dfs(int x) {
  152.   int t1 = 0, t2 = 0;
  153.   if(L[x]) dfs(L[x]), t1 = height[L[x]];
  154.   if(R[x]) dfs(R[x]), t2 = height[R[x]];
  155.   height[x] = max(t1, t2)+1;
  156.   if( abs(t1- t2) > 1  && !tag) tag = x;
  157. }
  158. void solve(int x) {
  159.   //  printf("do %d\n", x);
  160.   memset(height, 0, sizeof(height));
  161.   tag = 0;
  162.   dfs(root);
  163.   if(tag) {
  164.     int t1 = tag;
  165.     if(height[L[t1]] > height[R[t1]]) t1 = L[t1];
  166.     else t1 = R[t1];
  168.     if(height[L[t1]] > height[R[t1]]) t1 = L[t1];
  169.     else t1 = R[t1];
  171.     if(height[L[t1]] > height[R[t1]]) t1 = L[t1];
  172.     else if(height[L[t1]] < height[R[t1]]) t1 = R[t1];
  174.     //  printf("%d %d\n", tag, t1);
  175.     fix(t1);
  176.   }
  177.   //  test(root, root);
  178.   //  printf("\n");
  179. }
  180. void bfs(int x) {
  181.   int all = 0;
  182.   queue<int> Q;
  183.   Q.push(x);
  184.   while(Q.front() != 0) {
  185.     int po = Q.front(); Q.pop();
  186.     all ++;
  187.     Q.push(L[po]); Q.push(R[po]);
  188.   }
  189.   while(!Q.empty()) Q.pop();
  190.   Q.push(x);
  191.   int nn = 0;
  192.   while(!Q.empty()) {
  193.     int po = Q.front(); Q.pop();
  194.     if(!nn) nn = 1; else printf(" ");
  195.     printf("%d", num[po]);
  196.     if(L[po]) Q.push(L[po]);
  197.     if(R[po]) Q.push(R[po]);
  198.   }
  199.   printf("\n");
  200.   if(all == n) printf("YES\n");
  201.   else printf("NO\n");
  203. }
  204. int main() {
  205.   while(~scanf("%d", &n)) {
  206.     root = 0;
  207.     memset(fa, 0, sizeof(fa));
  208.     memset(L, 0, sizeof(L));
  209.     memset(R, 0, sizeof(R));
  211.     for(int i = 1; i <= n; ++i) {
  212.       scanf("%d", &num[i]);
  213.       insert(root, i);
  214.       solve(i);
  215.       //  fa[root] = root;
  216.       //  check(root);
  217.     }
  218.   //  printf("hh\n");
  219.     bfs(root);
  220.   //  printf("%d\n", num[root]);
  221.   }
  222.   return 0;
  223. }

1124

  1. #include<cmath>
  2. #include<map>
  3. #include<iostream>
  4. #include<cstring>
  5. #include<cstdio>
  6. #include<set>
  7. #include<vector>
  8. #include<queue>
  9. #include<algorithm>
  10. using namespace std;
  11. typedef long long ll;
  12. const int N = 25;
  13. const int INF = 0x3f3f3f3f;
  14. #define MP(x, y) make_pair(x, y)
  16. map<string, int> mp;
  17. int main() {
  18.   int m, n, s;
  19.   while(~scanf("%d %d %d", &m, &n, &s)) {
  20.     int won = s;
  21.     int all = 0;
  22.     mp.clear();
  23.     for(int i = 1, j = 1; i <= m; ++i) {
  24.       char s[10]; scanf("%s", s);
  25.       if(j == won) {
  26.         if(mp.find(s) == mp.end()) printf("%s\n", s), won += n, all ++;
  27.         else j --;
  28.         mp[s] = 1;
  29.       }
  30.       j++;
  31.     }
  32.     if(!all) printf("Keep going...\n");
  33.   }
  34.   return 0;
  35. }

1125 讲道理我没有读懂题之前 = =我以为在你们选几个组成不就行了，直接选两个最大的

  1. #include<cmath>
  2. #include<map>
  3. #include<iostream>
  4. #include<cstring>
  5. #include<cstdio>
  6. #include<set>
  7. #include<vector>
  8. #include<queue>
  9. #include<algorithm>
  10. using namespace std;
  11. typedef long long ll;
  12. const int N = 1e4+5;
  13. const int INF = 0x3f3f3f3f;
  14. #define MP(x, y) make_pair(x, y)
  16. int a[N];
  17. int main() {
  18.   int n;
  19.   while(~scanf("%d", &n)) {
  20.     for(int i = 0; i < n; ++i) scanf("%d", &a[i]);
  21.     sort(a, a + n);
  22.     int ans = a[0];
  23.     for(int i = 1; i < n; ++i) {
  24.       ans = (ans + a[i]) / 2;
  25.     }
  26.     printf("%d\n", ans);
  27.   }
  28.   return 0;
  29. }

1126需先判断下图的连通性

  1. #include<cmath>
  2. #include<map>
  3. #include<iostream>
  4. #include<cstring>
  5. #include<cstdio>
  6. #include<set>
  7. #include<vector>
  8. #include<queue>
  9. #include<algorithm>
  10. using namespace std;
  11. typedef long long ll;
  12. const int N = 505;
  13. const int INF = 0x3f3f3f3f;
  14. #define MP(x, y) make_pair(x, y)
  16. struct Node{
  17.   int to, nx;
  18. }E[N*N*2];
  19. int head[N], tot;
  20. int vis[N];
  21. void add(int fr, int to) {
  22.   E[tot].to = to; E[tot].nx = head[fr]; head[fr] = tot ++;
  23. }
  24. void dfs(int x) {
  25.   for(int i = head[x]; ~i; i = E[i].nx) {
  26.     int to = E[i].to;
  27.     if(!vis[to]) {
  28.       vis[to] = 1;
  29.       dfs(to);
  30.     }
  31.   }
  32. }
  33. int in[N];
  34. int main() {
  35.   int n, m;
  36.   while(~scanf("%d %d", &n, &m)) {
  37.     memset(in, 0, sizeof(in));
  38.     memset(vis, 0, sizeof(vis));
  39.     memset(head, -1, sizeof(head)); tot = 0;
  41.     for(int i = 0; i < m; ++i) {
  42.       int a, b; scanf("%d %d", &a, &b);
  43.       add(a, b); add(b, a);
  44.       in[a] ++; in[b] ++;
  45.     }
  46.     vis[1] = 1;
  47.     dfs(1);
  49.     int fl = 1;
  50.     for(int i = 1; i <= n; ++i) {
  51.       if(!vis[i]) {
  52.         fl = 0; break;
  53.       }
  54.     }
  56.     int odd = 0; int even = 0;
  57.     for(int i = 1; i <= n; ++i) {
  58.       if(in[i] % 2 == 0) even ++;
  59.       else odd ++;
  60.     }
  62.     for(int i = 1; i <= n; ++i) {
  63.       if(i != 1) printf(" ");
  64.       printf("%d", in[i]);
  65.     } printf("\n");
  67.     if(odd == 0 && fl) printf("Eulerian\n");
  68.     else if(odd == 2 && fl) printf("Semi-Eulerian\n");
  69.     else printf("Non-Eulerian\n");
  71.   }
  72.   return 0;
  73. }

1127

  1. #include<cmath>
  2. #include<map>
  3. #include<iostream>
  4. #include<cstring>
  5. #include<cstdio>
  6. #include<set>
  7. #include<vector>
  8. #include<queue>
  9. #include<algorithm>
  10. using namespace std;
  11. typedef long long ll;
  12. const int N = 35;
  13. const int INF = 0x3f3f3f3f;
  14. #define MP(x, y) make_pair(x, y)
  16. int in[N];
  17. int post[N];
  18. map<int, int> L;
  19. map<int, int> R;
  21. int solve(int LL, int RR, int l, int r) {
  22.   if(l > r) return 0;
  23.      else if(l == r) return post[l];
  25.   int tag = post[r];
  26.   int po = 0;
  27.   for(int i = LL; i <= RR; ++i) {
  28.     if(in[i] == tag) {
  29.       po = i; break;
  30.     }
  31.   }
  32.   int _po = l + (po-1-LL);
  34.   L[tag] = solve(LL, po-1, l, _po);
  35.      R[tag] = solve(po+1, RR, _po+1, r-1);
  37.   return tag;
  38. }
  39. void bfs(int x) {
  40.   queue<int> Q;
  41.   Q.push(x);
  42.   int fl = 1;
  44.   while(!Q.empty()) {
  45.     vector<int> vc;
  46.     int ed = Q.size();
  47.     for(int i = 0; i < ed; ++i) {
  48.       int po = Q.front(); Q.pop();
  49.       vc.push_back(po);
  50.       if(L[po]) Q.push(L[po]);
  51.       if(R[po]) Q.push(R[po]);
  52.     }
  54.     if(fl) for(int i = vc.size()-1; i >= 0; --i) {
  55.       if(vc[i] != x) printf(" ");
  56.       printf("%d", vc[i]);
  57.     }else for(int i = 0; i < vc.size(); ++i) {
  58.       if(vc[i] != x) printf(" ");
  59.       printf("%d", vc[i]);
  60.     }
  61.     fl ^= 1;
  62.   }
  63.   printf("\n");
  64. }
  65. int main() {
  66.   int n;
  67.   while(~scanf("%d", &n)) {
  69.     for(int i = 1; i <= n; ++i) {
  70.       scanf("%d", &in[i]);
  71.     }
  73.     for(int i = 1; i <= n; ++i) scanf("%d", &post[i]);
  75.     int root = solve(1, n, 1, n);
  77.     bfs(root);
  78.   }
  79.   return 0;
  80. }

1128

  1. #include<cmath>
  2. #include<map>
  3. #include<iostream>
  4. #include<cstring>
  5. #include<cstdio>
  6. #include<set>
  7. #include<vector>
  8. #include<queue>
  9. #include<algorithm>
  10. using namespace std;
  11. typedef long long ll;
  12. const int N = 1005;
  13. const int INF = 0x3f3f3f3f;
  14. #define MP(x, y) make_pair(x, y)
  16. int dia1[N*2];
  17. int row[N];
  18. int dia2[N*2];
  20. int main() {
  21.   int k;
  22.   while(~scanf("%d", &k)) {
  24.     for(int i = 1; i <= k; ++i) {
  25.       int a; scanf("%d", &a);
  26.       int fl = 1;
  28.       for(int j = 1; j <= a; ++j) {
  29.         int b; scanf("%d", &b);
  30.         int t1 = b; int t2 = b-j + a; int t3 = b+j;
  31.         if(row[t1] == i|| dia1[t2] == i || dia2[t3] == i ) fl = 0;
  33.         row[t1] = i; dia1[t2] = i; dia2[t3] = i;
  34.       }  
  36.       if(fl) printf("YES\n");
  37.       else printf("NO\n");
  38.     }
  40.   }
  41.   return 0;
  42. }

1129

  1. #include<cmath>
  2. #include<map>
  3. #include<iostream>
  4. #include<cstring>
  5. #include<cstdio>
  6. #include<set>
  7. #include<vector>
  8. #include<queue>
  9. #include<algorithm>
  10. using namespace std;
  11. typedef long long ll;
  12. const int N = 5e4+5;
  13. const int INF = 0x3f3f3f3f;
  14. #define MP(x, y) make_pair(x, y)
  16. int has[N];
  17. int a[N];
  18. struct Node{
  19.   int nu, po;
  20.   Node(int a=0, int b=0):nu(a), po(b) {}
  21.   bool operator <(const Node &T) const  {
  22.     if(nu != T.nu) return nu > T.nu;
  23.     else return po < T.po;
  24.   }
  25. };
  26. set<Node> st;
  27. set<Node> ::iterator it;
  29. int main() {
  30.   int n, k;
  31.   while(~scanf("%d %d", &n, &k)) {
  32.     st.clear();
  33.     memset(has, 0, sizeof(has));
  35.     for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  37.     has[a[1]] ++;
  38.     st.insert(Node(has[a[1]], a[1]));
  40.     for(int i = 2; i <= n; ++i) {
  41.       printf("%d: ", a[i]);
  42.       int cnt = 0;
  43.       for(it = st.begin(); it != st.end(); ++it) {
  44.         if(it != st.begin()) printf(" ");
  45.         printf("%d", (*it).po);
  46.         cnt ++;
  47.         if(cnt >= k) break;
  48.       }
  49.       printf("\n");
  51.       has[a[i]] ++;
  53.       it = st.find(Node(has[a[i]]-1, a[i]) );
  54.       if( it != st.end() ) st.erase(it), st.insert(Node(has[a[i]], a[i]));
  55.       else {
  56.         st.insert(Node(has[a[i]], a[i]));
  57.         if(st.size() > k) st.erase(--st.end());
  58.       }
  60.     }
  61.   }
  62.   return 0;
  63. }

1030

  1. #include<cmath>
  2. #include<map>
  3. #include<iostream>
  4. #include<cstring>
  5. #include<cstdio>
  6. #include<set>
  7. #include<vector>
  8. #include<queue>
  9. #include<algorithm>
  10. using namespace std;
  11. typedef long long ll;
  12. const int N = 25;
  13. const int INF = 0x3f3f3f3f;
  14. #define MP(x, y) make_pair(x, y)
  16. char num[N][15];
  17. int dep[N];
  18. int root;
  19. int L[N], R[N];
  21. void dfs(int x) {
  22.   if(x != root && L[x] + R[x]) printf("(");
  23.   if(L[x]) dfs(L[x]);
  24.   printf("%s", num[x]);
  25.   if(R[x]) dfs(R[x]);
  26.   if(x != root && L[x] + R[x]) printf(")");
  27. }
  28. int main() {
  29.   int n;
  30.   while(~scanf("%d", &n)) {
  31.     for(int i = 1; i <= n; ++i) {
  32.       char b[10], c[10];
  33.       scanf("%s %s %s", num[i], b, c);
  34.       int tt;
  35.       if(b[0] != '-') {
  36.         sscanf(b, "%d", &tt);
  37.         L[i] = tt, dep[tt] ++;
  38.       }
  39.       if(c[0] != '-') {
  40.         sscanf(c, "%d", &tt);
  41.         R[i] = tt; dep[tt] ++;
  42.       }
  43.     }
  44.     for(int i = 1; i <= n; ++i) {
  45.       if(!dep[i]) {
  46.         root = i;
  47.         dfs(i);
  48.         break;
  49.       }
  50.     }
  52.     printf("\n");
  54.   }
  55.   return 0;
  56. }

1031 最后一题还是花了一点时间，简单来说就是最短路即可，但是中间处理还是有点难的

  1. #include<cmath>
  2. #include<map>
  3. #include<iostream>
  4. #include<cstring>
  5. #include<cstdio>
  6. #include<set>
  7. #include<vector>
  8. #include<queue>
  9. #include<algorithm>
  10. using namespace std;
  11. typedef long long ll;
  12. const int N = 105;
  13. const int M = 1e5+5;
  15. const int INF = 0x3f3f3f3f;
  16. #define MP(x, y) make_pair(x, y)
  18. map<int, int> nam;
  19. map<int, int> ::iterator it;
  20. int _nam[M];
  21. vector<int> input[N];
  22. int n;
  23. int tol;
  24. struct Node{
  25.   int nx, to, ty;
  26. }E[M*10];
  27. int head[M], tot;
  28. void add(int fr, int to, int ty) {
  29.   E[tot].to = to; E[tot].nx = head[fr]; E[tot].ty = ty; head[fr] = tot++;
  30. }
  31. struct Hode{
  32.   int po, di, ti, ty;
  33.   Hode(int a=0, int b=0, int c=0, int d=0):po(a), di(b), ti(c), ty(d) {}
  34.   bool operator < (const Hode & T) const{
  35.     if(di != T.di) return di > T.di;
  36.     else return ti > T.ti;
  37.   }
  38. };
  39. pair<int, int> pre[M]; int vis[M];
  40. int dis[M], tim[M];
  41. vector<pair<int, int> > ans;
  43. void dfs(int x, int s) {
  44. //  printf("%d %d\n", x, _nam[x]);
  45.   if(x == s) {
  46.     return ;
  47.   }
  48.   dfs(pre[x].first, s);
  49.   ans.push_back(MP(x, pre[x].second));
  50. }
  52. void dij(int s, int t) {
  53. //  printf("%d %d\n", s, t);
  54.   for(int i = 1; i <= tol; ++i) {
  55.     vis[i] = 0; dis[i] = INF; tim[i] = INF;
  56.   }
  57.   dis[s] = 0; tim[s] = 0;
  58.   priority_queue<Hode> Q;
  59.   Q.push(Hode(s, dis[s], tim[s], INF));
  60.   while(!Q.empty()) {
  61.     int po = Q.top().po; int ty = Q.top().ty; Q.pop();
  62.     if(vis[po]) continue;
  63.     vis[po] = 1;
  64.     for(int i = head[po]; ~i; i = E[i].nx) {
  65.       int to = E[i].to;
  66.          int tt = ty != E[i].ty;
  67.       if(dis[to] > dis[po] + 1) {
  68.         dis[to] = dis[po] + 1;
  69.         tim[to] = tim[po] + tt;
  70.         pre[to] = MP(po, E[i].ty);
  71.         Q.push(Hode(to, dis[to], tim[to], E[i].ty));
  72.       }else if(dis[to] == dis[po] + 1 && tim[to] > tim[po] + tt )  {
  73.         tim[to] = tim[po] + tt;
  74.         pre[to] = MP(po, E[i].ty);
  75.         Q.push(Hode(to, dis[to], tim[to], E[i].ty));
  76.       }
  77.     }
  78.   }
  79.   ans.clear();
  80.   dfs(t, s);
  81.   printf("%d\n", dis[t]);
  82.   int fr = s;
  83.   ans.push_back(MP(INF, INF));
  84.   for(int i = 1; i < ans.size(); ++i) {
  85.     if(ans[i].second != ans[i-1].second) {
  86.       printf("Take Line#%d from %04d to %04d.\n", ans[i-1].second, _nam[fr], _nam[ans[i-1].first]);
  87.       fr = ans[i-1].first;
  88.     }
  89.   }
  90. }
  92. int main() {
  93.   while(~scanf("%d", &n)) {
  94.     memset(head, -1, sizeof(head)); tot = 0;
  96.     for(int i = 1; i <= n; ++i) {
  97.       int m; scanf("%d", &m);
  98.       input[i].push_back(m);
  99.       for(int j = 0; j < m; ++j) {
  100.         int b; scanf("%d", &b);
  101.         input[i].push_back(b);
  102.         nam[b] ++;
  103.       }
  104.     }
  106.     tol = 0;
  107.     for(it = nam.begin(); it != nam.end(); ++it) {
  108.       nam[it->first] = ++tol;
  109.       _nam[tol] = it->first;
  110.     }
  111.     // for(int i = 1; i <= tol; ++i) printf("%d:%d ", _nam[i], nam[_nam[i]]); printf("\n");
  113.     for(int i = 1; i <= n; ++i) {
  114.       for(int j = 2; j < input[i].size(); ++j) {
  115.         add(nam[input[i][j]], nam[input[i][j-1]], i); add(nam[input[i][j-1]], nam[input[i][j]], i);
  116.       }
  117.     }
  119.     int m; scanf("%d", &m);
  120.     while(m --) {
  121.       int a, b; scanf("%d %d", &a, &b);
  122.       dij(nam[a], nam[b]);
  123.     }
  124.   }
  125.   return 0;
  126. }

pat1121-1131的更多相关文章

  1. BZOJ 1131: [POI2008]Sta

    Description 一棵树,问以那个节点为根时根的总和最大. Sol DFS+树形DP. 第一遍统计一下 size 和 d. 第二遍转移根,统计答案就行了. Code /************* ...

  2. cdoj 1131 男神的礼物 区间dp

    男神的礼物 Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.uestc.edu.cn/#/problem/show/1131 Descr ...

  3. 九度OJ 1131 合唱队形 -- 动态规划（最长递增子序列）

    题目地址:http://ac.jobdu.com/problem.php?pid=1131 题目描述: N位同学站成一排,音乐老师要请其中的(N-K)位同学出列,使得剩下的K位同学不交换位置就能排成合 ...

  4. BZOJ 1131: [POI2008]Sta( dfs )

    对于一棵树, 考虑root的答案向它的孩子转移, 应该是 ans[son] = (ans[root] - size[son]) + (n - size[son]). so , 先 dfs 预处理一下, ...

  5. 1131: [POI2008]Sta

    1131: [POI2008]Sta Time Limit: 10 Sec  Memory Limit: 162 MBSubmit: 783  Solved: 235[Submit][Status] ...

  6. CJOJ 1131 机器分配 / Luogu 2066 机器分配 （动态规划）

    CJOJ 1131 机器分配 / Luogu 2066 机器分配 (动态规划) Description Luogu: 总公司拥有高效设备M台,准备分给下属的N个分公司.各分公司若获得这些设备,可以为国 ...

  7. PAT甲级1131. Subway Map

    PAT甲级1131. Subway Map 题意: 在大城市,地铁系统对访客总是看起来很复杂.给你一些感觉,下图显示了北京地铁的地图.现在你应该帮助人们掌握你的电脑技能!鉴于您的用户的起始位置,您的任 ...

  8. hdu 1130，hdu 1131(卡特兰数,大数)

    How Many Trees? Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)T ...

  9. BZOJ 1131 [POI2008]Sta（树形DP）

    [题目链接] http://www.lydsy.com/JudgeOnline/problem.php?id=1131 [题目大意] 给出一个N个点的树,找出一个点来,以这个点为根的树时,所有点的深度 ...

  10. 51nod 1131 数列

    http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1131 1131 覆盖数字的数量 基准时间限制:1 秒 空间限制:1310 ...

随机推荐

  1. 《深入理解Java虚拟机》学习笔记(一)

    JDK是支持Java程序开发的最小环境集,JRE是支持Java程序运行的标准环境,JRE是JDK的一部分. Java 1.0版本诞生于1995年,其使用的虚拟机是Sun Classisc VM,这款虚 ...

  2. [转载]完全版线段树 by notonlysuccess大牛

    原文出处:http://www.notonlysuccess.com/ (好像现在这个博客已经挂掉了,在网上找到的全部都是转载) 今天在清北学堂听课,听到了一些很令人吃惊的消息.至于这消息具体是啥,等 ...

  3. Python3 栈的实现

    这篇博客主要记录我在学习python算法时实现栈的过程,这里栈的实现只是最简单的实现,其中也包括符号匹配,前缀.中缀以及后缀表达式的实例.参考书目为: problem-solving-with-alg ...

  4. 发放春节福利，ASP.NET Core断点续传

    ASP.NET Core断点续传 在ASP.NET WebAPi写过完整的断点续传文章,目前我对ASP.NET Core仅止于整体上会用,对于原理还未去深入学习,由于有园友想看断点续传在ASP.NET ...

  5. Trie树/字典树题目（2017今日头条笔试题：异或）

    /* 本程序说明: [编程题] 异或 时间限制:1秒 空间限制:32768K 给定整数m以及n个数字A1,A2,..An,将数列A中所有元素两两异或,共能得到n(n-1)/2个结果,请求出这些结果中大 ...

  6. Python数据结构之二——tuple（元组）

    Python版本:3.6.2  操作系统:Windows  作者:SmallWZQ 列表和元组是Python中最常见的内建序列.元组与列表一样,但是tuple一旦创建就不能修改.创建元组的语法非常简单 ...

  7. [转]用JavaScript在浏览器中创建下载文件

    前端很多项目中,都有文件下载的需求,特别是JS生成文件内容,然后让浏览器执行下载操作(例如在线图片编辑.在线代码编辑.iPresst等. 但受限于浏览器,很多情况下我们都只能给出个链接,让用户点击打开 ...

  8. Linux 上 C 程序的内存布局

    在仔细研究这个问题之前,我认为 C 程序在内存中只有代码段,堆和栈三部分构成.前几天面试被问到了这个问题,才发现自己的印象是不完全的. 在本文中通过解析析一个 C 程序中变量和函数的地址来分析 C 程 ...

  9. LaTeX 各种命令，符号

    函数.符号及特殊字符 声调 语法 效果 语法 效果 语法 效果 \bar{x} \acute{\eta} \check{\alpha} \grave{\eta} \breve{a} \ddot{y} ...

  10. 有了Openvswitch和Docker，终于可以做《TCP/IP详解》的实验了！

    所有做过网络编程的程序员,想必都会看<TCP/IP详解>卷一:协议 后来出了第二版,但是由于第一版才是Rechard Stevens的原版,本人还是多次看了第一版. 对这一版印象最深的就是 ...