yg

Author: ksh-code

1.txt

@@ -0,0 +1,5 @@
+4 4
+####
+#JF#
+#..#
+#..#

10986

@@ -0,0 +1,23 @@
+#include <iostream>
+#include <map>
+using namespace std;
+typedef long long ll;
+
+int main()
+{
+  cin.tie(nullptr);
+  cout.tie(nullptr);
+  ios::sync_with_stdio(false);
+
+  ll N, M; cin >> N >> M;
+  map<int, int> mp; mp[0] = 1;
+  ll s = 0;
+  ll result = 0;
+  for (int i = 0; i < N; i++) {
+    ll a; cin >> a; s+= a;
+    s %= M; result += mp[s]++;
+  }
+
+  cout << result;
+  return 0;
+}

10986.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+#include <map>
+using namespace std;
+typedef long long ll;
+
+int main()
+{
+  cin.tie(nullptr);
+  cout.tie(nullptr);
+  ios::sync_with_stdio(false);
+
+  string str; cin >> str;
+  map<int, int> map;
+  int result = -1;
+  int a = 0;
+  for (int i = 0; i < str.size(); i++) {
+    str[i] == 'S' ? a+= 2 : a--;
+    if (map.find(a) == map.end) map[-a] = i;
+    else result = max(result, i - map[-a]);
+  }
+
+  cout << result;
+  return 0;
+}

1305.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+using namespace std;
+typedef long long ll;
+ll a = 1;
+ll c = 1;
+ll f() { return (a *= -1) * c++; }
+
+int main(){
+  cin.tie(nullptr) -> sync_with_stdio(false);
+
+  int N, M; cin >> N >> M;
+  ll arr[N][M]; for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) arr[i][j] = 0;
+  if (N + M == 2) {
+    cout << 0;
+    return 0;
+  }
+  arr[0][0] = 2 * N * M;
+  for (int i = 1; i < M; i++) arr[0][i] = arr[0][i - 1] + f();
+  if (M % 2 == 0) a *= -1;
+
+  for (int i = 1; i < N; i++) {
+    for (int j = 0; j < M; j++) {
+      arr[i][j] = arr[i - 1][j] + f();
+    }
+    for (int j = 0; j < M - 1; j++) f();
+  }
+
+  for (int i = 0; i < N ; i++) {
+    for (int j = 0; j < M; j++) {
+      cout << arr[i][j] << ' ';
+    }
+    cout << '\n';
+  }
+  return 0;
+}

2041

@@ -0,0 +1,24 @@
+#include <iostream>
+#include <map>
+using namespace std;
+typedef long long ll;
+
+int main()
+{
+  cin.tie(nullptr);
+  cout.tie(nullptr);
+  ios::sync_with_stdio(false);
+
+  string str; cin >> str;
+  map<int, int> map;
+  int result = -1;
+  int a = 0;
+  for (int i = 0; i < str.size(); i++) {
+    str[i] == 'S' ? a+= 2 : a--;
+    if (map.find(a) == map.end) map[-a] = i;
+    else result = max(result, i - map[-a]);
+  }
+
+  cout << result;
+  return 0;
+}

2041.cpp

@@ -0,0 +1,25 @@
+#include <iostream>
+#include <map>
+using namespace std;
+typedef long long ll;
+
+int main()
+{
+  cin.tie(nullptr);
+  cout.tie(nullptr);
+  ios::sync_with_stdio(false);
+
+  int T; cin >> T;
+  while(T--) {
+    ll N, M; cin >> M >> N;
+    map<int, int> mp; mp[0] = 1;
+    ll s = 0;
+    ll result = 0;
+    for (int i = 0; i < N; i++) {
+      ll a; cin >> a; s+= a;
+      s %= M; result += mp[s]++;
+    }
+    cout << result << '\n';
+  }
+  return 0;
+}

24525.cpp

@@ -0,0 +1,80 @@
+#include <iostream>
+#include <queue>
+#include <string>
+using namespace std;
+
+struct Node {
+  int x, y, count;
+};
+
+void solve(){
+  int N, M; cin >> N >> M;
+  string map[N]; for (int i = 0; i < N; i++) cin >> map[i];
+
+  int start_x = -1, start_y = -1;
+
+  int visited[1001][1001] = {0};
+  int fires[1001][1001];
+
+  for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) fires[i][j] = visited[i][j] = 1e9;
+
+  queue<Node> queue;
+  for (int i = 0; i < N; i++) for (int j = 0; j < M; j++)
+    if (map[i][j] == 'J') start_x = i, start_y = j;
+    else if (map[i][j] == 'F') {
+      queue.push({i, j, 0});
+      fires[i][j] = 0;
+    }
+
+  while (queue.size()) {
+    auto [x, y, count] = queue.front();
+
+    queue.pop();
+
+    int xxxx[] = {-1, 0, 1, 0};
+    int yyyy[] = {0, 1, 0, -1};
+
+    for (int i = 0; i < 4; i++) {
+      int next_x = x + xxxx[i];
+      int next_y = y + yyyy[i];
+      int next_count = count + 1;
+      if (next_x < 0 || next_y < 0 || next_x >= N || next_y >= M || fires[next_x][next_y] <= next_count || map[next_x][next_y] == '#') continue;
+
+      fires[next_x][next_y] = next_count;
+      queue.push({next_x, next_y, next_count});
+    }
+  }
+  visited[start_x][start_y] = 0;
+  queue.push({start_x, start_y, 0});
+
+  while (queue.size()) {
+    auto [x, y, count] = queue.front();
+    queue.pop();
+
+    if (fires[x][y] <= count) continue;
+
+    int xxxx[] = {-1, 0, 1, 0};
+    int yyyy[] = {0, 1, 0, -1};
+
+    for (int i = 0; i < 4; i++) {
+      int next_x = x + xxxx[i];
+      int next_y = y + yyyy[i];
+      int next_count = count + 1;
+      if (next_x >= N || next_y >= M || next_x < 0 || next_y < 0) {
+        cout << next_count;
+        return;
+      }
+      if (fires[next_x][next_y] <= next_count || visited[next_x][next_y] != 1e9 || map[next_x][next_y] == '#') continue;
+      visited[next_x][next_y] = next_count;
+      queue.push({next_x, next_y, next_count});
+    }
+  }
+
+  cout << "IMPOSSIBLE";
+}
+
+int main(){
+  cin.tie(0) -> sync_with_stdio(false);
+  solve();
+  return 0;
+}

3673

@@ -0,0 +1,80 @@
+#include <iostream>
+#include <queue>
+#include <string>
+using namespace std;
+
+struct Node {
+  int x, y, count;
+};
+
+void solve(){
+  int N, M; cin >> M >> N;
+  string map[N]; for (int i = 0; i < N; i++) cin >> map[i];
+
+  int start_x = -1, start_y = -1;
+
+  int visited[1001][1001] = {0};
+  int fires[1001][1001];
+
+  for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) fires[i][j] = visited[i][j] = 1e10;
+
+  queue<Node> queue;
+  for (int i = 0; i < N; i++) for (int j = 0; j < M; j++)
+    if (map[i][j] == '@') start_x = i, start_y = j;
+    else if (map[i][j] == '*') {
+      queue.push({i, j, 0});
+      fires[i][j] = 0;
+    }
+
+  while (queue.size()) {
+    auto [x, y, count] = queue.front();
+
+    queue.pop();
+
+    int xxxx[] = {-1, 0, 1, 0};
+    int yyyy[] = {0, 1, 0, -1};
+
+    for (int i = 0; i < 4; i++) {
+      int next_x = x + xxxx[i];
+      int next_y = y + yyyy[i];
+      int next_count = count + 1;
+      if (next_x < 0 || next_y < 0 || next_x >= N || next_y >= M || fires[next_x][next_y] <= next_count || map[next_x][next_y] == '#') continue;
+
+      fires[next_x][next_y] = next_count;
+      queue.push({next_x, next_y, next_count});
+    }
+  }
+  visited[start_x][start_y] = 0;
+  queue.push({start_x, start_y, 0});
+
+  while (queue.size()) {
+    auto [x, y, count] = queue.front();
+    queue.pop();
+
+    if (fires[x][y] <= count) continue;
+
+    int xxxx[] = {-1, 0, 1, 0};
+    int yyyy[] = {0, 1, 0, -1};
+
+    for (int i = 0; i < 4; i++) {
+      int next_x = x + xxxx[i];
+      int next_y = y + yyyy[i];
+      int next_count = count + 1;
+      if (next_x >= N || next_y >= M || next_x < 0 || next_y < 0) {
+        cout << next_count << '\n';
+        return;
+      }
+      if (fires[next_x][next_y] <= next_count || visited[next_x][next_y] != 1e10 || map[next_x][next_y] == '#') continue;
+      visited[next_x][next_y] = next_count;
+      queue.push({next_x, next_y, next_count});
+    }
+  }
+
+  cout << "IMPOSSIBLE" << '\n';
+}
+
+int main(){
+  cin.tie(0) -> sync_with_stdio(false);
+  int T; cin >> T; while(T--) solve();
+  return 0;
+}