Submission #1258092

#	Time	Username	Problem	Language	Result	Execution time	Memory
1258092		avighna	World Map (IOI25_worldmap)	C++20	7 / 100	37 ms	4164 KiB

worldmap

#include <bits/stdc++.h>

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A,
                                         std::vector<int> B) {
  std::vector<std::vector<int>> ans = {{1}};
  for (int cur = 2; cur <= N; ++cur) {
    std::vector next(ans.size() + 4, std::vector<int>(ans.size() + 4, cur));
    for (int j = 0; j < ans.size(); ++j) {
      for (int k = 0; k < ans[j].size(); ++k) {
        next[j + 2][k + 2] = ans[j][k];
      }
    }
    int val = 0;
    for (int i = 0; i < next.size(); ++i, val = (val + 1) % cur) {
      next[0][i] = val + 1;
    }
    for (int i = 1; i < next.size(); ++i, val = (val + 1) % cur) {
      next[i][next[i].size() - 1] = val + 1;
    }
    for (int i = 1; i < next.size(); ++i, val = (val + 1) % cur) {
      next[i][0] = val + 1;
    }
    for (int i = 1; i < next[next.size() - 1].size() - 1; ++i, val = (val + 1) % cur) {
      next[next.size() - 1][i] = val + 1;
    }
    ans = next;
  }
  return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 7 / 7
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 56