Hackerrank Univ Codesprint + Bioinformatics Contest + Codechef Cook79

Author: wiwitrifai

bioinformatics/gene_expression.cpp

@@ -0,0 +1,8 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+  
+  return 0;
+}

bioinformatics/gene_expression.py

@@ -0,0 +1,76 @@
+#!/bin/python3
+
+def intersec(a, b, x, y):
+    return a <= y and x <= b
+
+n, m = map(int, input().strip().split())
+a = []
+for i in range(n):
+    tmp = list(map(int, input().strip().split()))
+    cnt = len(tmp)
+    for j in range(cnt):
+        a.append((tmp[j] + (j & 1), (j & 1) ^ 1, i))
+a.sort()
+st = set()
+seg = []
+cur = 0
+for it in a:
+    if it[0] == cur:
+        if it[1]:
+            st.add(it[2])
+        else:
+            st.discard(it[2])
+    else:
+        if len(st) > 1:
+            seg.append((cur, -2))
+        elif len(st) == 1:
+            for e in st:
+                seg.append((cur, e))
+        else:
+            seg.append((cur, -1))
+        cur = it[0]
+        if it[1]:
+            st.add(it[2])
+        else:
+            st.discard(it[2])
+if len(st) > 1:
+    seg.append((cur, -2))
+elif len(st) == 1:
+    for e in st:
+        seg.append((cur, e))
+else:
+    seg.append((cur, -1))
+
+nseg = len(seg)
+ans = [0] * n
+for _ in range(m):
+    b = list(map(int, input().strip().split()))
+    idd = -1
+    ln = len(b)
+    ok = True
+    for i in range(0, ln, 2):
+        assert(b[i] >= 0)
+        l = 0
+        r = nseg-1
+        while l < r:
+            mid = (l + r+1)//2
+            if seg[mid][0] <= b[i]:
+                l = mid
+            else:
+                r = mid-1
+        assert(seg[l][0] <= b[i])
+        while l < nseg and seg[l][0] <= b[i+1]:
+            if seg[l][1] == -2:
+                ok = False
+                break
+            elif seg[l][1] != -1:
+                if idd != -1 and idd != seg[l][1]:
+                    ok = False
+                    break
+                idd = seg[l][1]
+            l += 1
+        if not ok:
+            break
+    if ok and idd != -1:
+        ans[idd] += 1
+print('\n'.join(map(str, ans)))

bioinformatics/reconstruction_bacteria.py

@@ -0,0 +1,69 @@
+#!/bin/python3
+
+import sys
+
+for line in sys.stdin:
+    n, k = map(int, line.split())
+    s = []
+    nx = [-1] * n
+    bef = [-1] * n
+    for i in range(n):
+        s.append(input().strip())
+    g = [[False] * n for _ in range(n)]
+    din = [0] * n
+    dout = [0] * n
+    for i in range(n):
+        for j in range(n):
+            if i == j: continue
+            g[i][j] = s[i][1:] == s[j][:k-1]
+            if g[i][j]:
+                din[j] += 1
+                dout[i] += 1
+    for i in range(n):
+        h = -1
+        for j in range(n):
+            if nx[j] != -1: continue
+            if h == -1 or dout[h] > dout[j]:
+                h = j
+        if h == -1:
+            continue
+        to = -1
+        for j in range(n):
+            if bef[j] >= 0: continue
+            if not g[h][j]: continue
+            if to == -1 or din[to] > din[j]:
+                cur = h
+                while cur != -1 and cur != j:
+                    cur = bef[cur]
+                if cur == j:
+                    continue
+                to = j
+        if to == -1:
+            nx[h] = -2
+            continue
+        bef[to] = h
+        nx[h] = to
+        for j in range(n):
+            if g[h][j]:
+                din[j] -= 1
+            if g[j][to]:
+                dout[j] -= 1
+    ans = []
+    for i in range(n):
+        if bef[i] >= 0: continue
+        now = s[i]
+        cur = nx[i]
+        while cur >= 0 and cur != i:
+            now += s[cur][k-1]
+            cur = nx[cur]
+        ans.append(now)
+    if len(ans) == 0:
+        assert(False)
+        now = s[0]
+        cur = nx[0]
+        while cur >= 0 and cur != 0:
+            now += s[cur][k-1]
+            cur = nx[cur]
+        ans.append(now)
+    print(len(ans))
+    print('\n'.join(ans))

bioinformatics/reconstruction_bacteria2.py

@@ -0,0 +1,69 @@
+#!/bin/python3
+
+import sys
+
+for line in sys.stdin:
+    n, k = map(int, line.split())
+    s = []
+    nx = [-1] * n
+    bef = [-1] * n
+    for i in range(n):
+        s.append(input().strip())
+    g = [[False] * n for _ in range(n)]
+    din = [0] * n
+    dout = [0] * n
+    for i in range(n):
+        for j in range(n):
+            if i == j: continue
+            g[i][j] = s[i][1:] == s[j][:k-1]
+            if g[i][j]:
+                din[j] += 1
+                dout[i] += 1
+    for i in range(n):
+        h = -1
+        for j in range(n):
+            if nx[j] != -1: continue
+            if h == -1 or dout[h] > dout[j]:
+                h = j
+        if h == -1:
+            continue
+        to = -1
+        for j in range(n):
+            if bef[j] >= 0: continue
+            if not g[h][j]: continue
+            if to == -1 or din[to] > din[j]:
+                cur = h
+                while cur != -1 and cur != j:
+                    cur = bef[cur]
+                if cur == j:
+                    continue
+                to = j
+        if to == -1:
+            nx[h] = -2
+            continue
+        bef[to] = h
+        nx[h] = to
+        for j in range(n):
+            if g[h][j]:
+                din[j] -= 1
+            if g[j][to]:
+                dout[j] -= 1
+    ans = []
+    for i in range(n):
+        if bef[i] >= 0: continue
+        now = s[i]
+        cur = nx[i]
+        while cur >= 0 and cur != i:
+            now += s[cur][k-1]
+            cur = nx[cur]
+        ans.append(now)
+    if len(ans) == 0:
+        assert(False)
+        now = s[0]
+        cur = nx[0]
+        while cur >= 0 and cur != 0:
+            now += s[cur][k-1]
+            cur = nx[cur]
+        ans.append(now)
+    print(len(ans))
+    print('\n'.join(ans))

codechef/cook79/addmult.cpp

@@ -0,0 +1,42 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int N = 1e6 + 6;
+
+int a[N];
+char s[N];
+
+int main() {
+  int t;
+  scanf("%d", &t);
+  while (t--) {
+    int n;
+    scanf("%d %s", &n, s);
+    for (int i = 0; i < n; i++)
+      scanf("%d", a+i), a[i] &= 1;
+    int len = strlen(s);
+    if (len  > 4) { // chefu 1
+      if (n & 1) {
+        bool ok = 1;
+        for (int i = 0; i < n; i += 2)
+          if (!a[i])
+            ok = 0;
+        puts(ok ? "Chefu" : "Chef");
+      }
+      else 
+        puts("Chef");
+    }
+    else {
+      if (n & 1)
+        puts("Chef");
+      else {
+        int i = 0, j = n-1;
+        while (i < n && a[i]) i += 2;
+        while (j >= 0 && a[j]) j -= 2;
+        puts((j <= i) ? "Chefu" : "Chef");
+      }
+    }
+  }
+  return 0;
+}

codechef/cook79/chairs.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+ 
+using namespace std;
+ 
+const int N = 1e6 + 6;
+char s[N];
+ 
+int main() {
+  int t;
+  scanf("%d", &t);
+  while (t--) {
+    int n;
+    scanf("%d %s", &n, s);
+    int one = 0, ma = 0, now = 0;
+    for (int i = 0; i < n; i++)
+      one += s[i] == '0';
+    for (int i = 0; i < 2 * n; i++) {
+      if (s[i % n] == '0')
+        now++;
+      else
+        now = 0;
+      ma = max(ma, now);
+    }
+    printf("%d\n", max(one - ma, 0));
+  }
+  return 0;
+} 

codechef/cook79/cookgame.cpp

@@ -0,0 +1,51 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int N = 1e6 + 5;
+const int mod = 1e9 + 7;
+long long powmod(long long b, long long p) {
+  long long ret = 1;
+  for (; p; p >>= 1, b = (b * b) % mod)
+    if (p&1) ret = (ret * b) % mod;
+  return ret;
+}
+
+int a[N];
+
+int main() {
+  int t;
+  scanf("%d", &t);
+  while (t--) {
+    int n;
+    scanf("%d", &n);
+    for (int i = 0; i < n; i++) {
+      scanf("%d", a+i);
+    }
+    int now = 0;
+    long long ans = 1;
+    for (int i = n-1; i >= 0; i--, now = max(now-1, 0)) {
+      if (a[i] != -1) {
+        if (now <= 0)
+          now = a[i];
+        else
+          if (now != a[i]) {
+            ans = 0;
+            break;
+          }
+      }
+      else {
+        if (now > 0)
+          a[i] = now;
+        else {
+          if (i > 0)
+            ans = (ans + ans) % mod;
+        }
+      }
+    }
+    if (a[0] != -1 && a[0] != 1)
+      ans = 0; 
+    printf("%lld\n", ans);
+  }
+  return 0;
+}

codechef/cook79/dwnld.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+  int t;
+  scanf("%d", &t);
+  while (t--) {
+    int n, k;
+    scanf("%d %d", &n, &k);
+    int ans = 0, now = 0;
+    while (n--) {
+      int tm, d;
+      scanf("%d %d", &tm, &d);
+      int bon = max(0, k-now);
+      now += tm;
+      tm -= bon;
+      if (tm <= 0)
+        continue;
+      ans += tm * d;
+    }
+    printf("%d\n", ans);
+  }
+  return 0;
+}

hackerrank/University Codesprint 2/breaking.py

@@ -0,0 +1,12 @@
+n = int(input())
+a = list(map(int, input().split()))
+ma, mi = a[0], a[0]
+ans1, ans2 = 0, 0
+for v in a:
+    if v > ma:
+        ans1 += 1
+        ma = v
+    if v < mi:
+        ans2 += 1
+        mi = v
+print(ans1, ans2)