Codechef SnackDown 2021 - Online Qualifiers

Author: wiwitrifai

codechef/snackdown21-qual/luckynum.cpp

@@ -0,0 +1,15 @@
+#include <bits/stdc++.h>
+
+
+using namespace std;
+
+int main() {
+  int tc;
+  cin >> tc;
+  while (tc--) {
+    int a, b, c;
+    cin >> a >> b >> c;
+    cout << ((a == 7) || (b == 7) || (c == 7) ? "YES" : "NO") << endl;
+  }
+  return 0;
+}

codechef/snackdown21-qual/maxdistkt.cpp

@@ -0,0 +1,37 @@
+#include <bits/stdc++.h>
+
+
+using namespace std;
+
+void solve() {
+  int n;
+  cin >> n;
+  vector<int> b(n);
+  for (int i = 0; i < n; ++i) {
+    cin >> b[i];
+  }
+  vector<int> ids(n);
+  iota(ids.begin(), ids.end(), 0);
+  sort(ids.begin(), ids.end(), [&](int l, int r) {
+    return b[l] < b[r];
+  });
+  int last = 0;
+  vector<int> ans(n, 0);
+  for (int i : ids) {
+    ans[i] = last % b[i];
+    if (last == ans[i])
+      ++last;
+  }
+  for (int i = 0; i < n; ++i) {
+    cout << ans[i] << (i+1 == n ? '\n' : ' ');
+  }
+}
+
+int main() {
+  int tc;
+  cin >> tc;
+  while (tc--) {
+    solve();
+  }
+  return 0;
+}

codechef/snackdown21-qual/mindiff1.cpp

@@ -0,0 +1,68 @@
+#include <bits/stdc++.h>
+
+
+using namespace std;
+
+void solve() {
+  int n, m;
+  cin >> n >> m;
+  vector<int> b(n, 0);
+  vector<pair<int, int>> edges;
+  vector<vector<int>> g(n);
+  for (int i = 0; i < m; ++i) {
+    int u, v;
+    cin >> u >> v;
+    --u, --v;
+    if (u > v)
+      swap(u, v);
+    edges.emplace_back(u, v);
+  }
+  sort(edges.begin(), edges.end());
+  edges.erase(unique(edges.begin(), edges.end()), edges.end());
+  for (auto & [u, v] : edges) {
+    ++b[u];
+    ++b[v];
+    g[u].push_back(v);
+    g[v].push_back(u);
+  }
+  vector<int> ids;
+  set<pair<int, int>> st;
+  for (int i = 0; i < n; ++i) {
+    st.insert(make_pair(b[i], i));
+  }
+  int biggest = 0;
+  while (!st.empty()) {
+    auto it = st.begin();
+    int v = it->second;
+    st.erase(it);
+    biggest = max(biggest, b[v]);
+    ids.push_back(v);
+    b[v] = -1;
+    for (int u : g[v]) {
+      if (b[u] < 0) continue;
+      st.erase(make_pair(b[u], u));
+      --b[u];
+      st.insert(make_pair(b[u], u));
+    }
+  }
+  reverse(ids.begin(), ids.end());
+  vector<int> ans(n);
+  for (int i = 0; i < n; ++i) {
+    ans[ids[i]] = i+1;
+  }
+  cout << biggest << '\n';
+  for (int i = 0; i < n; ++i) {
+    cout << ans[i] << (i+1 == n ? '\n' : ' ');
+  }
+}
+
+int main() {
+  ios_base::sync_with_stdio(0);
+  cin.tie(0);
+  int tc;
+  cin >> tc;
+  while (tc--) {
+    solve();
+  }
+  return 0;
+}

codechef/snackdown21-qual/sstrpref2.cpp

@@ -0,0 +1,90 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+// b[i] = max len so that b[i] < i+1 and s[0..len-1] = s[i-len+1..i]
+vector<int> prekmp(const string& s) {
+  int n = s.size();
+  vector<int> b(n, 0);
+  for (int i = 1; i < n; ++i) {
+    int j = b[i-1];
+    while (j > 0 && s[i] != s[j]) j = b[j - 1];
+    if (s[i] == s[j])
+      ++j;
+    b[i] = j;
+  }
+  return b;
+}
+
+vector<int> kmp(const string& s, const string& p, const vector<int>& b) {
+  int n = s.size(), m = p.size();
+  vector<int> ans(n);
+  int len = 0;
+  for (int i = 0; i < n; ++i) {
+    while (len > 0 && p[len] != s[i]) len = b[len-1];
+    if (s[i] == p[len])
+      ++len;
+    ans[i] = len;
+    if (len == m) {
+      len = b[len-1];
+    }
+  }
+  return ans;
+}
+
+// z[i] = max len so that s[0..len-1] = s[i..i+len-1]
+vector<int> zstring(const string& s) {
+  int n = s.size();
+  vector<int> z(n);
+  for (int i = 1, l = 0, r = 0; i < n; ++i) {
+    if (r <= i) {
+      l = r = i;
+      while (r < n && s[r] == s[r-l]) ++r;
+      z[i] = r-l;
+    } else {
+      if (i + z[i-l] < r)
+        z[i] = z[i-l];
+      else {
+        l = i;
+        while (r < n && s[r] == s[r-l]) ++r;
+        z[i] = r-l;
+      }
+    }
+  }
+  z[0] = n;
+  return z;
+}
+
+void solve() {
+  string a, b, x;
+  cin >> a >> b >> x;
+  auto p = prekmp(a);
+  auto suf = kmp(x, a, p);
+  auto z = zstring(b + x);
+  int m = b.size();
+  vector<int> best(a.size()+1, -1);
+  for (int i = -1; i < (int)x.size(); ++i) {
+    int lef = (i >= 0) ? suf[i] : 0;
+    int rig = (i + 1 < (int)x.size()) ? min(z[i+1+m], m) : 0;
+    best[lef] = max(best[lef], rig);
+  }
+  long long ans = 0;
+  for (int i = (int)a.size(); i >= 0; --i) {
+    ans += best[i] + 1;
+    if (i > 0) {
+      best[p[i-1]] = max(best[p[i-1]], best[i]);
+    }
+  }
+  cout << ans << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(0);
+  cin.tie(0);
+  int tc;
+  cin >> tc;
+  while (tc--) {
+    solve();
+  }
+  return 0;
+}

codechef/snackdown21-qual/testseries.cpp

@@ -0,0 +1,29 @@
+#include <bits/stdc++.h>
+
+
+using namespace std;
+
+void solve() {
+  vector<int> cnt(3, 0);
+  for (int i = 0; i < 5; ++i) {
+    int x;
+    cin >> x;
+    ++cnt[x];
+  }
+  if (cnt[1] > cnt[2]) {
+    cout << "INDIA\n";
+  } else if (cnt[1] < cnt[2]) {
+    cout << "ENGLAND\n";
+  } else {
+    cout << "DRAW\n";
+  }
+}
+
+int main() {
+  int tc;
+  cin >> tc;
+  while (tc--) {
+    solve();
+  }
+  return 0;
+}