제출 #856465

#제출 시각아이디문제언어결과실행 시간메모리
856465samek08죄수들의 도전 (IOI22_prison)C++17
0 / 100
0 ms348 KiB
#include "prison.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define rep(a,b) for (int a = 0; a < (b); ++a) #define pb push_back #define all(t) t.begin(), t.end() const int MAXN = 5005; vector<vector<int>> wyn; vector<vector<int>> devise_strategy(int N) { wyn.assign(N+1,{}); rep(i,N+1) wyn[i].assign(N+1,-1); wyn[0][0] = 0; for(int i = 1; i <= N; ++i) wyn[0][i] = i; for(int i = 1; i <= N; ++i) { wyn[i][0] = 1; for(int j = 0; j <= N; ++j) { if(i < j) wyn[i][j] = -1; else wyn[i][j] = -2; } } return wyn; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...