-
Notifications
You must be signed in to change notification settings - Fork 7
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
5ed4ceb
commit 16de35e
Showing
5 changed files
with
118 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,28 @@ | ||
| import sys; input = sys.stdin.readline; from random import * | ||
| R = set(); V = 1001; r, c, d, n = map(int, input().split()); p = [-1]*(d+1); P = [[*map(lambda x: int(x)-1, input().split())] for _ in range(n)] | ||
| for i in range(d+1): | ||
| for j in range(d+1): | ||
| if i*i+j*j<=d*d: p[i] = j | ||
| while len(R) < r: | ||
| i = randint(0, r-1) | ||
| if i in R: continue | ||
| R.add(i); m = {} | ||
| for x, y in P: | ||
| if abs(x-i) > d: continue | ||
| f = p[abs(x-i)]; s = max(y-f, 0); e = min(y+f+1, c) | ||
| if s < e: | ||
| if s not in m: m[s] = 0 | ||
| if e not in m: m[e] = 0 | ||
| m[s] += 1; m[e] -= 1 | ||
| if x == i: | ||
| if y not in m: m[y] = 0 | ||
| if y+1 not in m: m[y+1] = 0 | ||
| m[y] -= 1001; m[y+1] += 1001 | ||
| g = q = 0; v = 1001 | ||
| for x in sorted(m): | ||
| if q != x and g >= 0: v = min(v, g) | ||
| g += m[x]; q = x | ||
| if v == 0: break | ||
| V = min(V, v) | ||
| if V == 0: break | ||
| print(V) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,19 @@ | ||
| M = 10**9+7; n = int(input()); r = 1 | ||
| spf = list(range(n+1)); primes = []; p = 2 | ||
| while p <= n: | ||
| if spf[p] == p: | ||
| primes.append(p) | ||
| for i in range(p*p, n+1, p): | ||
| if spf[i] == i: spf[i] = p | ||
| if p == 2: p -= 1 | ||
| p += 2 | ||
| dp = [float('inf')]*(n+1) | ||
| for p in primes: | ||
| if p <= n: dp[p] = p | ||
| for i in range(4, n+1): | ||
| for p in primes: | ||
| if p > i: break | ||
| dp[i] = min(dp[i], dp[i-p]*p) | ||
| while n%3: n -= 2; r *= 2; r %= M | ||
| r *= pow(3, n//3, M); r %= M | ||
| print(dp[-1], r) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,12 @@ | ||
| n, m, *a = map(int, open(0).read().split()); z = 2*n*(m-1); N = 1<<n | ||
| for i in range(m-1): | ||
| v1 = a[i]+N; c1 = 0 | ||
| while v1%2==0: v1 //= 2; c1 += 1 | ||
| v2 = a[i+1]+N; c2 = 0 | ||
| while v2%2==0: v2 //= 2; c2 += 1 | ||
| s = 0; v1, v2 = a[i]+N, a[i+1]+N; d = abs(c1-c2) | ||
| if c1 > c2: v2 = (a[i+1]<<d)%N+N | ||
| else: v1 = (a[i]<<d)%N+N | ||
| while v1%2==v2%2 and v1 > 1: s += 1; v1 //= 2; v2 //= 2 | ||
| z += d-2*s | ||
| print(z) |