Submission #625437

#	Time	Username	Problem	Language	Result	Execution time	Memory
625437		model_code	죄수들의 도전 (IOI22_prison)	C++17	5 / 100	29 ms	19028 KiB

prison

#include "prison.h"

#include <vector>

std::vector<std::vector<int>> devise_strategy(int N) {
  std::vector<std::vector<int>> ret(N + 1, std::vector<int>(N + 1, 0));
  for (int i = 1; i <= N; ++i) {
    ret[0][i] = i;
    ret[i][0] = 1;
    std::fill(ret[i].begin() + 1, ret[i].begin() + i, -2);
    std::fill(ret[i].begin() + i + 1, ret[i].end(), -1);
  }
  return ret;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 90