hi

cf.py

@@ -0,0 +1,34 @@
+from sys import stdin, maxsize, setrecursionlimit
+from heapq import *
+from collections import deque
+import random
+
+MAX = 17
+MOD = 1000000007
+setrecursionlimit(10**5)
+input = stdin.readline
+
+for _ in range(int(input())):
+  s = input().strip()
+  sl = len(s)
+  res = {}
+  k = 0
+  ret = 1
+  for i, c in enumerate(s):
+    tmp = res.get(c)
+    if tmp:
+      # print(tmp, c)
+      k = i
+      break
+    else:
+      res[c] = 1
+
+  for i in range(k, sl):
+    if s[i] != s[i-k]:
+      ret = 0
+      break
+  print('YES' if ret else 'NO')
+
+
+# 비둘기 집
+# 구현인데 왜 못함~

cf/round_785/1.py

@@ -0,0 +1,30 @@
+from sys import stdin, maxsize, setrecursionlimit
+from heapq import *
+from collections import deque
+import random
+
+MAX = 17
+MOD = 1000000007
+setrecursionlimit(10**5)
+input = stdin.readline
+
+for _ in range(int(input())):
+  s = input().strip()
+  sl = len(s)
+  res = {}
+  k = 0
+  ret = 1
+  for i, c in enumerate(s):
+    tmp = res.get(c)
+    if tmp:
+      # print(tmp, c)
+      k = i
+      break
+    else:
+      res[c] = 1
+
+  for i in range(k, sl):
+    if s[i] != s[i-k]:
+      ret = 0
+      break
+  print('YES' if ret else 'NO')

cf/round_785/2.py

@@ -0,0 +1,34 @@
+from sys import stdin, maxsize, setrecursionlimit
+from heapq import *
+from collections import deque
+import random
+
+MAX = 17
+MOD = 1000000007
+setrecursionlimit(10**5)
+input = stdin.readline
+
+for _ in range(int(input())):
+  s = input().strip()
+  sl = len(s)
+  res = {}
+  k = 0
+  ret = 1
+  for i, c in enumerate(s):
+    tmp = res.get(c)
+    if tmp:
+      # print(tmp, c)
+      k = i
+      break
+    else:
+      res[c] = 1
+
+  for i in range(k, sl):
+    if s[i] != s[i-k]:
+      ret = 0
+      break
+  print('YES' if ret else 'NO')
+
+
+# 비둘기 집
+# 구현인데 왜 못함~

cf/round_785/3.cpp

@@ -0,0 +1,92 @@
+#include<bits/stdc++.h>
+
+typedef long long ll;
+
+#define FAST ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
+#define PII pair<int,int>
+#define PIII pair<PII,int>
+#define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a))
+#define FORN(a, b, c) for (int(a) = (b); (a) <= (c); ++(a))
+#define FORD(a, b, c) for (int(a) = (b); (a) >= (c); --(a))
+#define FORSQ(a, b, c) for (int(a) = (b); (a) * (a) <= (c); ++(a))
+#define FORC(a, b, c) for (char(a) = (b); (a) <= (c); ++(a))
+#define FOREACH(a, b) for (auto&(a) : (b))
+#define REP(i, n) FOR(i, 0, n)
+#define REPN(i, n) FORN(i, 1, n)
+#define SQR(x) ((ll)(x) * (x))
+#define RESET(a, b) memset(a, b, sizeof(a))
+#define fi first
+#define se second
+#define mp make_pair
+#define pb push_back
+#define ALL(v) v.begin(), v.end()
+#define ALLA(arr, sz) arr, arr + sz
+#define SIZE(v) (int)v.size()
+#define SORT(v) sort(ALL(v))
+#define REVERSE(v) reverse(ALL(v))
+#define SORTA(arr, sz) sort(ALLA(arr, sz))
+#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
+#define PERMUTE next_permutation
+#define TC(t) while (t--)
+
+#define INF 1e9
+#define MAX 1000000000
+#define MOD 1000000007
+
+#define N 40001
+#define M 500
+
+using namespace std;
+
+vector<int> tmp;
+int d[N][M];
+
+int re(int n) {
+    int r = 0;
+    while (n > 0) {
+        r = r * 10 + n % 10;
+        n /= 10;
+    }
+    return r;
+}
+
+bool p(int n) {
+    return re(n) == n;
+}
+
+int solve() {
+    tmp.pb(0);
+    for(int i=1;i<N;i++){
+        if (p(i)) tmp.pb(i);
+    }
+    for(int i=1;i<M;i++){
+        d[0][i] = 1;
+    }
+
+    for(int i=1;i<N;i++){
+        d[i][0] = 0;
+        for(int j=1;j<M;j++){
+            if (tmp[j]<=i) {
+                d[i][j] = (d[i][j-1] + d[i-tmp[j]][j]) % MOD;
+            } else {
+                d[i][j] = d[i][j-1];
+            }
+        }
+    }
+
+    int t;
+    cin>>t;
+    for(int i=0;i<t;i++){
+        int n;
+        cin>>n;
+        cout<<d[n][M-1]<<'\n';
+    }
+
+    return 0;
+}
+
+int main() {
+    FAST;
+    solve();
+    return 0;
+}

cf/round_785/3.py

@@ -0,0 +1,42 @@
+from sys import stdin, maxsize, setrecursionlimit
+from heapq import *
+from collections import deque
+import random
+
+MAX = 40004
+M = 502
+MOD = 1000000007
+setrecursionlimit(10**5)
+input = stdin.readline
+
+
+def f(n):
+  r = 0
+  while n > 0:
+    r = r * 10 + n % 10
+    n //= 10
+  return r
+
+def p(n):
+  return f(n) == n
+
+a = [0]
+d = [[0] * M for _ in range(MAX)]
+for i in range(1, 2*MAX):
+  if p(i):
+    a.append(i)
+
+for i in range(1, M):
+  d[0][i] = 1
+
+for i in range(1, MAX):
+  d[i][0] = 0
+  for j in range(1, M):
+    if a[j] <= i:
+      d[i][j] = (d[i][j-1] + d[i-a[j]][j]) % MOD
+    else:
+      d[i][j] = d[i][j-1]
+
+for _ in range(int(input())):
+  n = int(input())
+  print(d[n][M-1])

main.cpp

@@ -33,26 +33,13 @@ typedef long long ll;
 #define MAX 1000000000
 #define MOD 1000000007
 
-using namespace std;
-
-int n;
+#define N 40001
+#define M 500
 
-vector<PII> a;
+using namespace std;
 
 int solve() {
-    cin>>n;
-    REP(i, n){
-        cin>>a[i].fi;
-        cin>>a[i].se;
-    }
-
-    sort(ALL(a), [&](const PII l, const PII r){
-        return l.fi<r.fi;
-    });
-
-    REP(i, n){
-        cout<<a[i].fi<<" "<<a[i].se<<'\n';
-    }
+
     return 0;
 }
 

main.py

@@ -3,29 +3,47 @@
 from collections import deque
 import random
 
-MAX = 27
+MAX = 17
 MOD = 1000000007
 setrecursionlimit(10**5)
 input = stdin.readline
 
-n = int(input())
-a = []
-for _ in range(n):
-    p, q = map(int, input().split())
-    if p < q:
-        a.append([p, q])
-    else:
-        a.append([q, p])
-a.sort(key=lambda x: x[1])
-d = int(input())
-
-pq = []
-res = 0
-for item in a:
-    if item[1] - item[0] > d:
-        continue
-    while pq and item[1] - d > pq[0][0]:
-        heappop(pq)
-    heappush(pq, item)
-    res = max(res, len(pq))
-print(res)
+t = int(stdin.readline().strip())
+
+
+def find(x):
+    if d[x] != x:
+        d[x] = find(d[x])
+    return d[x]
+
+
+def union(x, y):
+    x = find(x)
+    y = find(y)
+
+    if x != y:
+        d[y] = x
+
+
+for p in range(t):
+    n = int(stdin.readline().strip())
+    m = dict()
+    d = [int(i) for i in range(200001)]
+    cnt = [0] * (200001)
+    for _ in range(n):
+        a, b = stdin.readline().split()
+        res = 0
+        ak = m.get(a)
+        bk = m.get(b)
+        if not ak:
+            m[a] = len(m)
+            res += 1
+        if not bk:
+            m[b] = len(m)
+            res += 1
+        res += cnt[find(m[a])]
+        res += cnt[find(m[b])]
+        union(m[a], m[b])
+        cnt[find(m[a])] = res
+        cnt[find(m[b])] = res
+        print(cnt[find(m[a])])