제출 #628068

#제출 시각아이디문제언어결과실행 시간메모리
628068jwvg0425죄수들의 도전 (IOI22_prison)C++17
5 / 100
25 ms19124 KiB
#include <stdio.h> #include <vector> #include <queue> #include <algorithm> #include <iostream> #include <string> #include <bitset> #include <map> #include <set> #include <tuple> #include <string.h> #include <math.h> #include <random> #include <functional> #include <assert.h> #include <math.h> #define all(x) (x).begin(), (x).end() #define xx first #define yy second using namespace std; template<typename T, typename Pr = less<T>> using pq = priority_queue<T, vector<T>, Pr>; using i64 = long long int; using ii = pair<int, int>; using ii64 = pair<i64, i64>; vector<vector<int>> devise_strategy(int N) { vector<vector<int>> res(N + 1, vector<int>(N + 1, 0)); res[0][0] = 0; for (int a = 1; a <= N; a++) res[0][a] = a; for (int a = 1; a <= N; a++) { res[a][0] = 1; for (int b = 1; b <= N; b++) res[a][b] = (a < b) ? -1 : -2; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...