제출 #639819

#제출 시각아이디문제언어결과실행 시간메모리
639819magmag죄수들의 도전 (IOI22_prison)C++17
5 / 100
26 ms19028 KiB
#include "prison.h" #include <bits/stdc++.h> using namespace std; using vi = vector<int>; vector<vector<int>> devise_strategy(int n) { int x = n; vector<vi> ans(x+1, vi(n+1, 1)); ans[0][0] = 0; for (int j = 1; j <= n; ++j)ans[0][j] = j; for (int i = 1; i <= x; ++i) { for (int j = 1; j <= n; ++j) { if (j <= i) { ans[i][j] = -2; } else ans[i][j] = -1; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...