제출 #1321315

#제출 시각아이디문제언어결과실행 시간메모리
1321315wonderfull죄수들의 도전 (IOI22_prison)C++20
0 / 100
0 ms332 KiB
#include "prison.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

std::vector<std::vector<int>> devise_strategy(int N) {
	vector<vector<int>> a(N + 1, vector<int>(N + 1, 0));
	for(int i = 0; i <= N; i++) a[0][i] = i;
	for(int i = 1; i < N; i++) a[i][0] = 1;
	int cnt = 1;
 	for(int i = 1; i < N; i++) {
		for(int j = 1; j <= N; j++) {
			if(j <= cnt) a[i][j] == -2;
			else a[i][j] = -1;
		}
		cnt++;
	}
	return a;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...