⚡️ 精進

Author: reo11

Diff for: atcoder/abc/abc201-300/abc252/a.py

@@ -0,0 +1,2 @@
+n = int(input())
+print(chr(n))

Diff for: atcoder/abc/abc201-300/abc252/b.py

@@ -0,0 +1,18 @@
+n, k = map(int, input().split())
+a = list(map(int, input().split()))
+b = list(map(int, input().split()))
+b = set(b)
+
+max_a = max(a)
+ab = []
+flag = True
+
+for i, ai in enumerate(a, start=1):
+    print(i, ai)
+    if ai == max_a and i in b:
+        flag = False
+        break
+if flag:
+    print("No")
+else:
+    print("Yes")

Diff for: atcoder/abc/abc201-300/abc252/c.py

@@ -0,0 +1,25 @@
+n = int(input())
+s = []
+
+for i in range(n):
+    si = list(map(int, list(input())))
+    for _ in range(4):
+        si = si + si
+    s.append(si)
+
+ans = float("inf")
+for i in range(10):
+    t = 0
+    for j in range(n):
+        while True:
+            if s[j][t] == i:
+                if j < n - 1:
+                    t += 1
+                break
+            else:
+                t += 1
+    ans = min(ans, t)
+print(ans)
+
+
+

Diff for: atcoder/abc/abc201-300/abc253/a.cpp

@@ -0,0 +1,39 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define endl "\n"
+using ll = long long;
+using P = pair<ll, ll>;
+
+const ll infll = (1LL << 62) - 1;
+const int inf = (1 << 30) - 1;
+
+struct IoSetup {
+    IoSetup() {
+        cin.tie(nullptr);
+        ios::sync_with_stdio(false);
+        cout << fixed << setprecision(10);
+        cerr << fixed << setprecision(10);
+    }
+} iosetup;
+
+template< typename T1, typename T2 >
+inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
+
+template< typename T1, typename T2 >
+inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
+
+void fail() {
+    cout << -1 << endl;
+    exit(0);
+}
+
+int main(){
+    ll a, b, c;
+    cin >> a >> b >> c;
+
+    if ((a <= b && b <= c) || (c <= b && b <= a){
+        cout << "Yes" << endl;
+    } else {
+        cout << "No" << endl;
+    }
+}

Diff for: atcoder/abc/abc201-300/abc253/b.cpp

@@ -0,0 +1,51 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define endl "\n"
+using ll = long long;
+using P = pair<ll, ll>;
+
+const ll infll = (1LL << 62) - 1;
+const int inf = (1 << 30) - 1;
+
+struct IoSetup {
+    IoSetup() {
+        cin.tie(nullptr);
+        ios::sync_with_stdio(false);
+        cout << fixed << setprecision(10);
+        cerr << fixed << setprecision(10);
+    }
+} iosetup;
+
+template< typename T1, typename T2 >
+inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
+
+template< typename T1, typename T2 >
+inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
+
+void fail() {
+    cout << -1 << endl;
+    exit(0);
+}
+
+ll manhattan_distance(ll x1, ll y1, ll x2, ll y2){
+    return abs(x1 - x2) + abs(y1 - y2);
+}
+
+int main(){
+    ll h, w;
+    cin >> h >> w;
+    string s[h];
+    for(ll i = 0; i < h; i++){
+        cin >> s[i];
+    }
+    vector<tuple<ll, ll>> points;
+    for(ll i = 0; i < h; i++){
+        for(ll j = 0; j < w; j++){
+            if (s[i][j] == 'o'){
+                points.push_back(make_tuple(i, j));
+            }
+        }
+    }
+    ll ans = manhattan_distance(get<0>(points[0]), get<1>(points[0]), get<0>(points[1]), get<1>(points[1]));
+    cout << ans << endl;
+}

Diff for: atcoder/abc/abc201-300/abc253/c.py

@@ -0,0 +1,30 @@
+from collections import defaultdict
+import heapq
+
+q = int(input())
+min_values = []
+max_values = []
+counter = defaultdict(int)
+ans = []
+
+for _ in range(q):
+    query = list(map(int, input().split()))
+    if query[0] == 1:
+        x = query[1]
+        counter[x] += 1
+        heapq.heappush(min_values, x)
+        heapq.heappush(max_values, -x)
+    elif query[0] == 2:
+        x, c = query[1], query[2]
+        counter[x] = max(0, counter[x] - c)
+    else:
+        min_v = min_values[0]
+        while counter[min_v] == 0:
+            heapq.heappop(min_values)
+            min_v = min_values[0]
+        max_v = -max_values[0]
+        while counter[max_v] == 0:
+            heapq.heappop(max_values)
+            max_v = -max_values[0]
+        ans.append(max_v - min_v)
+print(*ans, sep="\n")

Diff for: atcoder/abc/abc201-300/abc253/d.py

@@ -0,0 +1,18 @@
+import math
+
+n, a, b = map(int, input().split())
+
+# 包除原理
+# 1からnの和 - aの倍数の合計 - bの倍数の合計 + a*bの倍数の合計
+
+# 1からnの和
+s = n * (n + 1) // 2
+# aの倍数の合計
+sa = a * (n // a) * (n // a + 1) // 2
+# bの倍数の合計
+sb = b * (n // b) * (n // b + 1) // 2
+# a*bの倍数の合計
+ab = math.lcm(a, b)
+sab = ab * (n // ab) * (n // ab + 1) // 2
+
+print(s - sa - sb + sab)

Diff for: atcoder/abc/abc201-300/abc254/a.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define endl "\n"
+using ll = long long;
+using P = pair<ll, ll>;
+
+const ll infll = (1LL << 62) - 1;
+const int inf = (1 << 30) - 1;
+
+struct IoSetup {
+    IoSetup() {
+        cin.tie(nullptr);
+        ios::sync_with_stdio(false);
+        cout << fixed << setprecision(10);
+        cerr << fixed << setprecision(10);
+    }
+} iosetup;
+
+template< typename T1, typename T2 >
+inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
+
+template< typename T1, typename T2 >
+inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
+
+void fail() {
+    cout << -1 << endl;
+    exit(0);
+}
+
+int main(){
+    ll n;
+    cin >> n;
+    if(n % 100 < 10){
+        cout << "0" << n % 100 << endl;
+    } else {
+        cout << n % 100 << endl;
+    }
+}

Diff for: atcoder/abc/abc201-300/abc254/b.cpp

@@ -0,0 +1,48 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define endl "\n"
+using ll = long long;
+using P = pair<ll, ll>;
+
+const ll infll = (1LL << 62) - 1;
+const int inf = (1 << 30) - 1;
+
+struct IoSetup {
+    IoSetup() {
+        cin.tie(nullptr);
+        ios::sync_with_stdio(false);
+        cout << fixed << setprecision(10);
+        cerr << fixed << setprecision(10);
+    }
+} iosetup;
+
+template< typename T1, typename T2 >
+inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
+
+template< typename T1, typename T2 >
+inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
+
+void fail() {
+    cout << -1 << endl;
+    exit(0);
+}
+
+int main(){
+    ll n;
+    cin >> n;
+    ll a[n][n] = {0};
+    for(ll i = 0; i < n; i++){
+        for(ll j = 0; j <= i; j++){
+            if (j > 0) {
+                cout << " ";
+            }
+            if (j == 0 || j == i) {
+                a[i][j] = 1;
+            } else {
+                a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
+            }
+            cout << a[i][j];
+        }
+        cout << endl;
+    }
+}

Diff for: atcoder/abc/abc201-300/abc254/c.cpp

@@ -0,0 +1,55 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define endl "\n"
+using ll = long long;
+using P = pair<ll, ll>;
+
+const ll infll = (1LL << 62) - 1;
+const int inf = (1 << 30) - 1;
+
+struct IoSetup {
+    IoSetup() {
+        cin.tie(nullptr);
+        ios::sync_with_stdio(false);
+        cout << fixed << setprecision(10);
+        cerr << fixed << setprecision(10);
+    }
+} iosetup;
+
+template< typename T1, typename T2 >
+inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
+
+template< typename T1, typename T2 >
+inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
+
+void fail() {
+    cout << -1 << endl;
+    exit(0);
+}
+
+int main(){
+    ll n, k;
+    cin >> n >> k;
+    vector<ll> a;
+    vector<vector<ll>> b(n);
+
+    for(ll i = 0; i < n; i++){
+        ll tmp;
+        cin >> tmp;
+        b[i % k].push_back(tmp);
+    }
+    for(ll i = 0; i < k; i++){
+        sort(b[i].begin(), b[i].end());
+    }
+
+    string ans = "Yes";
+    ll pre_value = -1;
+    for(ll i = 0; i < n; i++){
+        if (b[i % k][i / k] < pre_value) {
+            ans = "No";
+            break;
+        }
+        pre_value = b[i % k][i / k];
+    }
+    cout << ans << endl;
+}

Diff for: atcoder/abc/abc201-300/abc255/a.py

@@ -0,0 +1,4 @@
+r, c = map(int, input().split())
+a = [list(map(int, input().split())) for _ in range(2)]
+
+print(a[r-1][c-1])

Diff for: atcoder/abc/abc201-300/abc255/b.py

@@ -0,0 +1,21 @@
+INF = float("inf")
+n, k = map(int, input().split())
+a = list(map(int, input().split()))
+xy = []
+for _ in range(n):
+    x, y = map(int, input().split())
+    xy.append((x, y))
+
+def dist(x1, y1, x2, y2):
+    return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5
+
+dists = [INF for _ in range(n)]
+for i in range(n):
+    xi, yi = xy[i]
+    for ai in a:
+        dists[i] = min(dists[i], dist(xi, yi, xy[ai - 1][0], xy[ai - 1][1]))
+
+ans = 0
+for di in dists:
+    ans = max(ans, di)
+print(ans)

Diff for: atcoder/abc/abc201-300/abc255/c.py

@@ -0,0 +1,20 @@
+GETA = 10 ** 18
+x, a, d, n = map(int, input().split())
+if d < 0:
+    min_value = a + d * (n - 1)
+    a = min_value
+    d = -d
+
+x += GETA
+a += GETA
+
+min_value = a
+max_value = a + d * (n - 1)
+
+if x >= max_value:
+    print(abs(x - max_value))
+elif x <= min_value:
+    print(abs(min_value - x))
+else:
+    y = x - a
+    print(min(y % d, d - (y % d)))