A. Company Merging

Solved.

温暖的签到。

  1.  #include<bits/stdc++.h>
  2.  
  3.  using namespace std;
  4.  
  5.  const int maxn = 2e5 + ;
  6.  
  7.  typedef long long ll;
  8.  
  9.  struct node{
  10.      int val, num;
  11.      node(){}
  12.      node(int val, int num):val(val), num(num){}
  13.  }arr[maxn];
  14.  
  15.  int n, m;
  16.  
  17.  int main()
  18.  {
  19.      while(~scanf("%d", &n))
  20.      {
  21.          int Max = ;
  22.          for(int i = ; i <= n; ++i)
  23.          {
  24.              scanf("%d", &arr[i].num);
  25.              arr[i].val = ;
  26.              for(int j = , x; j <= arr[i].num; ++j)
  27.              {
  28.                  scanf("%d", &x);
  29.                  arr[i].val = max(arr[i].val, x);
  30.              }
  31.              Max = max(arr[i].val, Max);
  32.          }
  33.          ll ans = ;
  34.          for(int i = ; i <= n; ++i)
  35.          {
  36.  //            cout << arr[i].val << " " << endl;
  37.              ans += 1ll * arr[i].num * (Max - arr[i].val);
  38.          }
  39.          printf("%lld\n", ans);
  40.      }
  41.      return ;
  42.  }

B. LaTeX Expert

Solved.

按题意模拟即可。

  1.  #include <bits/stdc++.h>
  2.  using namespace std;
  3.  
  4.  #define N 100010
  5.  string str, s;
  6.  string st = "\\begin{thebibliography}{99}";
  7.  string ed = "\\end{thebibliography}";
  8.  map <string, int> mp;
  9.  int cnt, now; bool same;
  10.  string res[N]; 
  11.  
  12.  int getid(string s)
  13.  {
  14.      if (mp.find(s) == mp.end()) mp[s] = ++cnt;
  15.      return mp[s];
  16.  }
  17.  
  18.  void work()
  19.  {
  20.      int len = str.size();
  21.      string tmp = ""; bool add = ;
  22.      for (int i = ; i < len; ++i)
  23.      {
  24.          if (str[i] == '{') add = ;
  25.          else if (str[i] == '}')
  26.          {
  27.              getid(tmp);
  28.              tmp = "";
  29.              add = ;
  30.          }
  31.          else if (add) tmp += str[i];
  32.      }
  33.  }
  34.  
  35.  void add()
  36.  {
  37.      int len = s.size();
  38.      string tmp = ""; bool add = ;
  39.      for (int i = ; i < len; ++i)
  40.      {
  41.          if (s[i] == '{') add = ;
  42.          else if (s[i] == '}')
  43.          {
  44.              ++now;
  45.              int id = getid(tmp);
  46.              if (id != now) same = false;
  47.              res[id] = s;
  48.              return;
  49.          }
  50.          else if (add)
  51.              tmp += s[i];
  52.      }
  53.  }
  54.  
  55.  int main()
  56.  {
  57.      ios::sync_with_stdio(false);
  58.      cin.tie(); cout.tie();
  59.      cnt = ; now = ;
  60.      bool start = ;
  61.      same = true;
  62.      str = "";
  63.      while (getline(cin, s))
  64.      {
  65.          if (s == "") continue;
  66.          if (s == st)
  67.          {
  68.              start = ;
  69.              work();
  70.              continue;
  71.          }
  72.          if (s == ed)
  73.          {
  74.              if (same)
  75.              {
  76.                  cout << "Correct\n";
  77.                  return ;
  78.              }
  79.              cout << "Incorrect\n";
  80.              cout << st << "\n";
  81.              for (int i = ; i <= cnt; ++i)
  82.                  cout << res[i] << "\n";
  83.              cout << ed << "\n";
  84.          }
  85.          if (start)
  86.              add();
  87.          else
  88.              str += s;
  89.      }
  90.      return ;
  91.  }

C. New Year Presents

Upsolved.

题意：

有$n$个小朋友，每个小朋友有$s_i$件不同的物品，一个小朋友可以将自己的一件物品给另一个小朋友，前提是另一个小朋友没有这件物品，这样记为一次转移

求最少的转移次数使得拥有最多数量物品的小朋友和拥有最少数量物品的小朋友他们拥有的物品数量差值不超过1.

思路：

首先拥有东西多的小朋友肯定能往拥有东西少的小朋友转移(根据鸽笼原理)，那只要把物品多的小朋友放在一起，然后去转移给物品少的小朋友就好了

注意枚举的技巧，复杂度应该跟$O(n)有关？$

  1.  #include <bits/stdc++.h>
  2.  using namespace std;
  3.  
  4.  #define N 100010
  5.  struct node
  6.  {
  7.      int l, r, x;
  8.      node () {}
  9.      node (int l, int r, int x) : l(l), r(r), x(x) {}
  10.  };
  11.  vector <int> vec[N];
  12.  int n, m;
  13.  int vis[N];
  14.  vector <node> res;
  15.  int a[N * ], now[N], nx[N * ], last;
  16.  int sze[N];
  17.  queue <int> q;  
  18.  
  19.  void add(int x, int id)
  20.  {
  21.      a[++last] = x;
  22.      nx[last] = now[id];
  23.      now[id] = last;
  24.  }
  25.  
  26.  int main()
  27.  {
  28.      while (scanf("%d%d", &n, &m) != EOF)
  29.      {
  30.          int tot = ;
  31.          res.clear();
  32.          memset(now, , sizeof now);
  33.          for (int i = , x, y; i <= n; ++i)
  34.          {
  35.              scanf("%d", &x);
  36.              tot += x;
  37.              vec[i].clear();
  38.              for (int j = ; j <= x; ++j)
  39.              {
  40.                  scanf("%d", &y);
  41.                  vec[i].push_back(y);
  42.              }
  43.              sze[i] = vec[i].size();
  44.          }
  45.          if (tot % n == )
  46.          {
  47.              int x = tot / n;
  48.              for (int i = ; i <= n; ++i)
  49.                  if (sze[i] > x)
  50.                      for (auto it : vec[i])
  51.                          add(i, it);
  52.              for (int i = ; i <= m; ++i)
  53.                  if (now[i]) q.push(i);
  54.              for (int i = , front; i <= n; ++i)
  55.                  if (sze[i] < x)
  56.                  {
  57.                      for (auto it : vec[i])
  58.                          vis[it] = ;
  59.                      while (sze[i] < x)
  60.                      {
  61.                          front = q.front(); q.pop();
  62.                          //printf("%d %d %d\n", i, sze[i], front);
  63.                          if (vis[front])
  64.                          {
  65.                              q.push(front);
  66.                              continue;
  67.                          }
  68.                          int id = now[front];
  69.                          for (; id ; id = nx[id])
  70.                          {
  71.                              if (sze[a[id]] <= x) continue;
  72.                              res.push_back(node(a[id], i, front));
  73.                              vec[i].push_back(front);
  74.                              vis[front] = ;
  75.                              --sze[a[id]];
  76.                              ++sze[i];
  77.                              id = nx[id];
  78.                              break;
  79.                          }
  80.                          if (id) q.push(front);
  81.                          now[front] = id;
  82.                      }
  83.                      for (auto it : vec[i])
  84.                          vis[it] = ;
  85.                  }
  86.          }
  87.          else
  88.          {
  89.              int x = tot / n + ;
  90.              int need = n - tot % n;
  91.              for (int i = ; i <= n; ++i)
  92.                  if (sze[i] > x)
  93.                      for (auto it : vec[i])
  94.                          add(i, it);
  95.              for (int i = ; i <= m; ++i)
  96.                  if (now[i]) q.push(i);
  97.              for (int i = , front; i <= n; ++i)
  98.                  if (sze[i] < x)
  99.                  {
  100.                      if (sze[i] == x -  && need)
  101.                      {
  102.                          --need;
  103.                          continue;
  104.                      }
  105.                      for (auto it : vec[i])
  106.                          vis[it] = ;
  107.                      while (sze[i] < x)
  108.                      {
  109.                          if (sze[i] == x -  && need)
  110.                          {
  111.                              --need;
  112.                              break;
  113.                          }
  114.                          front = q.front(); q.pop();
  115.                          if (vis[front])
  116.                          {
  117.                              q.push(front);
  118.                              continue;
  119.                          }
  120.                          int id = now[front];
  121.                          for (; id; id = nx[id])
  122.                          {
  123.                              if (sze[a[id]] <= x) continue;
  124.                              res.push_back(node(a[id], i, front));
  125.                              vec[i].push_back(front);
  126.                              vis[front] = ;
  127.                              --sze[a[id]];
  128.                              ++sze[i];
  129.                              id = nx[id];
  130.                              break;
  131.                          }
  132.                          if (id) q.push(front);
  133.                          now[front] = id;
  134.                      }
  135.                      for (auto it : vec[i])
  136.                          vis[it] = ;
  137.                  }
  138.          }
  139.          int len = res.size();
  140.          printf("%d\n", len);
  141.          for (int i = ; i < len; ++i)
  142.              printf("%d %d %d\n", res[i].l, res[i].r, res[i].x);
  143.      }
  144.      return ;
  145.  }

D. Similar Arrays

Solved.

找到一组没有任何关系的$i, j$填上1/1, 1/2， 其他的分别填入3-n。

  1.  #include<bits/stdc++.h>
  2.  
  3.  using namespace std;
  4.  
  5.  const int maxn = 1e5 + ;
  6.  
  7.  int n, m;
  8.  set<int>s[maxn];
  9.  int arr[maxn], brr[maxn];
  10.  
  11.  void solve()
  12.  {
  13.      for(int i = ; i <= n; ++i)
  14.      {
  15.          for(int j = i + ; j <= n; ++j) if(s[i].count(j) == )
  16.          {
  17.              arr[i] = , arr[j] = ;
  18.              brr[i] = , brr[j] = ;
  19.              int pos = ;
  20.              for(int k = ; k <= n; ++k)if(!arr[k])
  21.              {
  22.                  arr[k] = brr[k] = pos++;
  23.              }
  24.              puts("YES");
  25.              for(int k = ; k <= n; ++k) printf("%d%c", arr[k], " \n"[k == n]);
  26.              for(int k = ; k <= n; ++k) printf("%d%c", brr[k], " \n"[k == n]);
  27.              return ;
  28.          }
  29.      }
  30.      puts("NO");
  31.  }
  32.  
  33.  int main()
  34.  {
  35.      while(~scanf("%d %d", &n, &m))
  36.      {
  37.          for(int i = ; i <= n; ++i) s[i].clear(), arr[i] = brr[i] = ;
  38.          for(int i = , l, r; i <= m; ++i)
  39.          {
  40.              scanf("%d %d", &l, &r);
  41.              s[min(l, r)].insert(max(l, r));
  42.          }
  43.          solve();
  44.      }
  45.      return ;
  46.  }

E. Horseback Riding

Solved.

枚举每个终点， 跑一边$BFS$, 暴力搜索， 记录状态。

  1.  #include<bits/stdc++.h>
  2.  
  3.  using namespace std;
  4.  
  5.  const int maxn = 1e2 + ;
  6.  
  7.  int n;
  8.  vector<pair<int, int> >ans;
  9.  char str[maxn];
  10.  int vis[maxn];
  11.  int dis[maxn];
  12.  int pre[maxn];
  13.  int dir[][] = {, , , -, -, , -, -, , , , -, -, , -, -};
  14.  
  15.  bool judge(int x, int y)
  16.  {
  17.      if(x <  || x >=  || y <  || y >=  || dis[x *  + y]) return false;
  18.      else return true;
  19.  }
  20.  
  21.  void BFS(int st)
  22.  {
  23.      memset(dis, , sizeof dis);
  24.      memset(pre, -, sizeof pre);
  25.      queue<int>q;
  26.      q.push(st);
  27.      dis[st] = ;
  28.      while(!q.empty())
  29.      {
  30.          int x = q.front() / ;
  31.          int y = q.front() % ;
  32.          q.pop();
  33.          for(int j = ; j < ; ++j)
  34.          {
  35.              int dx = x + dir[j][];
  36.              int dy = y + dir[j][];
  37.              if(judge(dx, dy))
  38.              {
  39.                  dis[dx *  + dy] = dis[x *  + y] + ;
  40.                  pre[dx *  + dy] = x *  + y;
  41.                  q.push(dx *  + dy);
  42.              }
  43.          }
  44.      }
  45.  }
  46.  
  47.  int main()
  48.  {
  49.      while(~scanf("%d", &n))
  50.      {
  51.          memset(vis, , sizeof vis);
  52.          ans.clear();
  53.          for(int i = ; i <= n; ++i)
  54.          {
  55.              scanf("%s", str);
  56.              vis[(str[] - '') *  + str[] - 'a'] = ;
  57.          }
  58.          ans.clear();
  59.          for(int i = ; i < n; ++i)
  60.          {
  61.              BFS(i);
  62.              int ed = i;
  63.              while(!vis[ed]) ++ed;
  64.              vis[ed] = ;
  65.              while(ed != i)
  66.              {
  67.                  vector<int>path;
  68.                  do{
  69.                      path.push_back(ed);
  70.                      ed = pre[ed];
  71.                  }while(vis[ed]);
  72.                  path.push_back(ed);
  73.                  for(int j = path.size() - ; j >= ; --j) ans.push_back(make_pair(path[j - ], path[j]));
  74.              }
  75.              vis[ed] = ;
  76.          }
  77.          int len = ans.size();
  78.          printf("%d\n", len);
  79.          for(auto it : ans)
  80.          {
  81.              printf("%c%d-%c%d\n", it.first %  + 'a', it.first /  + , it.second %  + 'a', it.second /  + );
  82.          }
  83.      }
  84.      return ;
  85.  }

F.  How to Learn You Score

Upsolved.

题意：

有$n$个数，每次可以询问三个数，返回这三个数的最大值+最小值的和，用不超过$4 \cdot n$次的询问求出这$n$个数是什么

思路：

考虑$4$个数的时候，一共有$4$种询问方式，将这四种询问方式得到的四个值取最大最小值加起来就是这四个值的和

那么五个数我们就得到任意四个数的和，我们令$sum_i$表示不包含第$i$个数的和

那么有

$a_i + sum_i = a_j + sum_j$

有

$a_1 + sum_1 = a_2 + sum_2 = a_3 + sum_3 = a_4 + sum_4 = a_5 + sum_5$

联立后有

$4 \cdot a_1 = \sum\nolimits_{i = 1}^{5} sum_i - 4 \cdot sum_1$

依次求出这五个数

然后考虑后面的数可以用前面已知的数通过四次询问推出

总的询问次数$4 \cdot n$

  1.  #include <bits/stdc++.h>
  2.  using namespace std;
  3.  
  4.  #define ll long long
  5.  #define N 1010
  6.  int n;
  7.  ll a[N];
  8.  
  9.  void work(int l, int r)
  10.  {
  11.      int ord[]; ll sum[];
  12.      for (int i = , j = l; i <= ; ++i, ++j)
  13.          ord[i] = j;
  14.         //for (int i = 1; i <= 5; ++i) printf("%d%c", ord[i], " \n"[i == 5]);
  15.      for (int i = ; i <= ; ++i)
  16.      {
  17.          vector <ll> vec;
  18.          int id[], id2[];
  19.          ll x;
  20.          for (int j = , k = ; j <= ; ++j)
  21.              if (i != j)
  22.                  id[++k] = ord[j];
  23.          //for (int j = 1; j <= 4; ++j)
  24.          //    printf("%d%c", id[j], " \n"[j == 4]);
  25.          for (int j = ; j <= ; ++j)
  26.          {
  27.              for (int k = , o = ; k <= ; ++k)
  28.                 if (j != k)
  29.                     id2[++o] = id[k];
  30.              printf("? ");
  31.              for (int k = ; k <= ; ++k)
  32.                  printf("%d%c", id2[k], " \n"[k == ]);
  33.              fflush(stdout);
  34.              scanf("%lld", &x);
  35.              vec.push_back(x);
  36.          }
  37.          sort(vec.begin(), vec.end());
  38.          sum[i] = vec.end()[-] + *vec.begin();
  39.      }
  40.      //for (int i = 1; i <= 5; ++i)
  41.      //    printf("%lld%c", sum[i], " \n"[i == 5]);
  42.      ll tot = ;
  43.      for (int i = ; i <= ; ++i)
  44.          tot += sum[i];
  45.      for (int i = ; i <= ; ++i)
  46.      {
  47.          //assert((4ll * sum[i] - tot) % 4 == 0);
  48.          a[l + i - ] = -(4ll * sum[i] - tot) / ;
  49.      }
  50.  }
  51.  
  52.  ll get(int l, int r)
  53.  {
  54.      int id[], id2[];
  55.      vector <ll> vec;
  56.      ll x;
  57.      for (int i = ; i <= ; ++i)
  58.          id[i] = i + l - ;
  59.      for (int j = ; j <= ; ++j)
  60.      {
  61.          for (int k = , o = ; k <= ; ++k)
  62.             if (j != k)
  63.                 id2[++o] = id[k];
  64.          printf("? ");
  65.          for (int k = ; k <= ; ++k)
  66.              printf("%d%c", id2[k], " \n"[k == ]);
  67.          fflush(stdout);
  68.          scanf("%lld", &x);
  69.          vec.push_back(x);
  70.      }
  71.      sort(vec.begin(), vec.end());
  72.      return vec.end()[-] + *vec.begin();
  73.  }
  74.  
  75.  int main()
  76.  {
  77.      while (scanf("%d", &n) != EOF)
  78.      {
  79.          work(, );
  80.          for (int i = ; i <= n; ++i)
  81.          {
  82.              ll tot = get(i - , i);
  83.              for (int j = i - ; j < i; ++j)
  84.                  tot -= a[j];
  85.              a[i] = tot;
  86.          }
  87.          printf("! ");
  88.          for (int i = ; i <= n; ++i)
  89.              printf("%lld%c", a[i], " \n"[i == n]);
  90.          fflush(stdout);
  91.      }
  92.      return ;
  93.  }

I. Minimal Product

Solved.

题意：求一个序列$找一个最小的a_i \cdot a_j 并且满足i < j, a_i < a_j$

思路：

正着扫一遍维护最小值，倒着扫一遍维护最大值。

注意生成序列的时候的取模，要自然溢出，否则会爆ll

  1.  #include<bits/stdc++.h>
  2.  
  3.  using namespace std;
  4.  
  5.  typedef long long ll;
  6.  
  7.  const ll MOD = 1ll << ;
  8.  const ll INFLL = 5e18;
  9.  const int maxn = 1e7 + ;
  10.  
  11.  ll n, l, r;
  12.  ll arr[maxn];
  13.  unsigned int x, y,z,  b1, b2;
  14.  unsigned int brr[maxn];
  15.  
  16.  int main()
  17.  {
  18.      int t;
  19.      scanf("%d", &t);
  20.      while(t--)
  21.      {
  22.          scanf("%lld %lld %lld %u %u %u %u %u", &n, &l, &r, &x, &y, &z, &b1, &b2);
  23.          brr[] = b1;
  24.          brr[] = b2;
  25.          for(int i = ; i <= n; ++i) brr[i] = (brr[i - ] * x + brr[i - ] * y + z);
  26.          for(int i = ; i <= n; ++i) arr[i] = (brr[i] % (r - l + ) + l);
  27.          int flag = ;
  28.          ll ans = INFLL;
  29.          ll Max = -INFLL;
  30.          for(int i = n; i >= ; --i)
  31.          {
  32.              if(arr[i] < Max)
  33.              {
  34.                  flag = ;
  35.                  ans = min(ans, arr[i] * Max);
  36.              }
  37.              Max = max(Max, arr[i]);
  38.          }
  39.          ll Min = INFLL;
  40.          for(int i = ; i <= n; ++i)
  41.          {
  42.              if(arr[i] > Min)
  43.              {
  44.                  flag = ;
  45.                  ans = min(ans, arr[i] * Min);
  46.              }
  47.              Min = min(Min, arr[i]);
  48.          }
  49.          if(!flag) puts("IMPOSSIBLE");
  50.          else printf("%lld\n", ans);
  51.      }
  52.      return ;
  53.  }

K. Right Expansion Of The Mind

Solved.

分为s， t两个字符串讨论。

对于t字符串， 只要两个t字符串含有相同字母即可。

对于s字符串， 从后往前删除在t字符串中的字符， 知道找到一个不在t字符串中的字符， 那么另一个可以匹配的字符串， 前缀相同。

  1.  #include<bits/stdc++.h>
  2.  
  3.  using namespace std;
  4.  
  5.  int n;
  6.  string s, t;
  7.  map<pair<string, int>, vector<int> >mp;
  8.  
  9.  int main()
  10.  {
  11.      ios::sync_with_stdio(false);
  12.      cin.tie(); cout.tie();
  13.      while(cin >> n)
  14.      {
  15.          mp.clear();
  16.          for(int i = ; i <= n; ++i)
  17.          {
  18.              cin >> s >> t;
  19.              int tmp = ;
  20.              for(int j = , len = t.length(); j < len; ++j) tmp |= ( << (t[j] - 'a'));
  21.              int len = s.length();
  22.              for(int j = len - ; j >= ; --j)
  23.              {
  24.                  if(tmp & ( << (s[j] - 'a'))) s.erase(s.begin() + j);
  25.                  else break;
  26.              }
  27.              mp[make_pair(s, tmp)].push_back(i);
  28.          }
  29.          int res = mp.size();
  30.          cout << res << "\n";
  31.          for(auto vec : mp)
  32.          {
  33.              int len = vec.second.size();
  34.              cout << len;
  35.              for(auto it : vec.second)
  36.              {
  37.                  cout << " " << it;
  38.              }
  39.              cout << "\n";
  40.          }
  41.      }
  42.      return ;
  43.  }

L. erland University

Solved.

二分答案。

  1.  #include<bits/stdc++.h>
  2.  
  3.  using namespace std;
  4.  
  5.  typedef long long ll;
  6.  
  7.  const int INF = 0x3f3f3f3f;
  8.  
  9.  ll t, n, a, b, k;
  10.  
  11.  bool check(ll mid)
  12.  {
  13.      ll res = mid * k;
  14.      ll tmp = min(a, mid) * (n /  + n % ) + min(b, mid) * (n / );
  15.      return res <= tmp;
  16.  }
  17.  
  18.  int main()
  19.  {
  20.      while(~scanf("%lld %lld %lld %lld %lld", &t ,&n, &a, &b, &k))
  21.      {
  22.          ll l = , r = t, res = ;
  23.          while(r - l >= )
  24.          {
  25.              ll mid = (l + r) >> ;
  26.              if(check(mid))
  27.              {
  28.                  l = mid + ;
  29.                  res = mid;
  30.              }
  31.              else
  32.              {
  33.                  r = mid - ;
  34.              }
  35.          }
  36.          printf("%lld\n", res);
  37.      }
  38.      return ;
  39.  }

M. The Pleasant Walk

Solved.

温暖的签到。

  1.  #include<bits/stdc++.h>
  2.  
  3.  using namespace std;
  4.  
  5.  const int maxn = 1e5 + ;
  6.  
  7.  int n, k;
  8.  int dp[maxn];
  9.  int arr[maxn];
  10.  
  11.  int main()
  12.  {
  13.      while(~scanf("%d %d", &n, &k))
  14.      {
  15.          int ans = ;
  16.          memset(dp, , sizeof dp);
  17.          for(int i = ; i <= n; ++i) scanf("%d", arr + i);
  18.          for(int i = ; i <= n; ++i)
  19.          {
  20.              dp[i] = ;
  21.              if(arr[i] != arr[i - ]) dp[i] = max(dp[i - ] + , dp[i]);
  22.              ans = max(ans, dp[i]);
  23.          }
  24.          printf("%d\n", ans);
  25.      }
  26.      return ;
  27.  }

2018-2019 Russia Open High School Programming Contest的更多相关文章

  1. Codeforces 1090A - Company Merging - [签到水题][2018-2019 Russia Open High School Programming Contest Problem A]

    题目链接:https://codeforces.com/contest/1090/problem/A A conglomerate consists of n companies. To make m ...

  2. Codeforces 1090B - LaTeX Expert - [字符串模拟][2018-2019 Russia Open High School Programming Contest Problem B]

    题目链接:https://codeforces.com/contest/1090/problem/B Examplesstandard input The most famous characters ...

  3. Codeforces 1090D - Similar Arrays - [思维题][构造题][2018-2019 Russia Open High School Programming Contest Problem D]

    题目链接:https://codeforces.com/contest/1090/problem/D Vasya had an array of n integers, each element of ...

  4. Codeforces 1090M - The Pleasant Walk - [签到水题][2018-2019 Russia Open High School Programming Contest Problem M]

    题目链接:https://codeforces.com/contest/1090/problem/M There are n houses along the road where Anya live ...

  5. 计蒜客 39272.Tree-树链剖分(点权)+带修改区间异或和 (The 2019 ACM-ICPC China Shannxi Provincial Programming Contest E.) 2019ICPC西安邀请赛现场赛重现赛

    Tree Ming and Hong are playing a simple game called nim game. They have nn piles of stones numbered  ...

  6. CF_2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)

    只做了两个就去上课去啦... A. Company Merging time limit per test 1 second memory limit per test 512 megabytes i ...

  7. 2019 The 19th Zhejiang University Programming Contest

    感想: 今天三个人的状态比昨天计院校赛的状态要好很多,然而三个人都慢热体质导致签到题wa了很多发.最后虽然跟大家题数一样(6题),然而输在罚时. 只能说,水题还是刷得少,看到签到都没灵感实在不应该. ...

  8. 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)

    前言 有一场下午的cf,很滋磁啊,然后又和dalao(见右面链接)组队打了,dalao直接带飞我啊. 这是一篇题解,也是一篇总结,当然,让我把所有的题目都写个题解是不可能的了. 按照开题顺序讲吧. 在 ...

  9. C.0689-The 2019 ICPC China Shaanxi Provincial Programming Contest

    We call a string as a 0689-string if this string only consists of digits '0', '6', '8' and '9'. Give ...

随机推荐

  1. Android中的动画，选择器，样式和主题的使用

    一.动画: 1.动画的分类: 1).Tween动画:这种实现方式可以使视图组件移动.放大.缩小以及产生透明度的变化: 2).Frame动画:传统的动画方法,通过顺序的播放排列好的图片来实现,类似电影. ...

  2. 《C++ Primer Plus》第13章 类继承 笔记

    类继承通过使用已有的类(基类)定义新的来(派生类),使得能够根据需要修改编程代码.共有继承建立is-a关系,这意味着派生类对象也应该是某种基类对象.作为is-a模型的一部分,派生类继承基类的数据称源和 ...

  3. LNMP一键安装包phpMyAdmin无法正常登录，提示：您的Session已过期,请再次登录。

    找到文件: /usr/local/php/etc/php.ini 搜索: session.auto_start = 0 修改为 session.auto_start = 1 保存即可!

  4. with操作符损耗性能的原因

    当函数运行是,创建一个[[scope]]指向的被称为作用域链的可变对象集合,作用域链的最前端是一个包含所有的局部变量.参数.this等的被称为“激活对象”的对象. 在标示符查找的过程中,从作用域的最前 ...

  5. WEB安全第七篇--终结篇考验逻辑思维：逻辑漏洞大汇总（越权、会话逻辑、业务逻辑、暴力破解）

    零.前言 最近做专心web安全有一段时间了,但是目测后面的活会有些复杂,涉及到更多的中间件.底层安全.漏洞研究与安全建设等越来越复杂的东东,所以在这里想写一个系列关于web安全基础以及一些讨巧的pay ...

  6. [XML] CoolFormat

    http://files.cnblogs.com/files/wjs16/CoolFormat3.4.rar

  7. linux下安装F-prot杀毒软件

    一. f-prot的安装 1.首先我们要创建一个带有超级权限的用户 sudo passwa root 2.su 切换用户 3.下载F-prot http://www.f-prot.com/downlo ...

  8. DGbroker快速失败转移

    1.先决条件 DGMGRL> ENABLE FAST_START FAILOVER; Error: ORA-: requirements not met for enabling fast-st ...

  9. 扫描二维码的实现(barcode) ---- HTML5+

    模块:barcode Barcode模块管理条码扫描,提供常见的条码(二维码及一维码)的扫描识别功能,可调用设备的摄像头对条码图片扫描进行数据输入.通过plus.barcode可获取条码码管理对象. ...

  10. 微信开发（2）:微信js sdk分享朋友圈，朋友，获取config接口注入权限验证（转）

    进行微信开发已经一阵子了,从最初的什么也不懂,到微信授权登录,分享,更改底部菜单,素材管理,等. 今天记录一下微信jssdk 的分享给朋友的功能,获取config接口注入. 官方文档走一下简单说:四步 ...