Merge branch 'main' of https://github.com/fei0319/competitive-program…

…ming

contest/cf1936/A.cpp

@@ -28,7 +28,7 @@ void solve() {
     }
 
     int p = 0;
-    std::vector<int> v {p};
+    std::vector<int> v{p};
     for (int i = 1; i < n; ++i) {
         char t = query(max, p, max, i);
         if (t == '<') {

contest/cf1936/B.cpp

@@ -23,7 +23,7 @@ struct BIT {
     }
     void update(int x, int k) {
         x += 1;
-        
+
         for (; x <= n + 10; x += x & -x) {
             tr[x] += k;
         }

contest/cf1936/C.cpp

@@ -31,9 +31,7 @@ void solve() {
     }
 
     std::vector<std::vector<std::pair<int, int>>> G(n * 2 + n * m + 1);
-    auto add = [&](int u, int v, int w) {
-        G[u].emplace_back(v, w);
-    };
+    auto add = [&](int u, int v, int w) { G[u].emplace_back(v, w); };
     auto dijkstra = [&](auto &G, int src, int t) -> ll {
         std::vector<ll> dist(G.size(), ll(1e18));
         std::vector<uint8_t> vist(G.size(), false);
@@ -70,9 +68,8 @@ void solve() {
         for (int i = 1; i <= n; ++i) {
             id.push_back(i);
         }
-        std::sort(id.begin(), id.end(), [&](int x, int y) {
-            return a[x][b] < a[y][b];
-        });
+        std::sort(id.begin(), id.end(),
+                  [&](int x, int y) { return a[x][b] < a[y][b]; });
 
         int d = n * 2 + n * (b - 1);
         std::vector<int> v;