#include <bits/stdc++.h>
#include "prison.h"
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
using namespace std;
using ll = long long;
vector<vector<int>> devise_strategy(int N){
vector<vector<int>> ans(501,vector<int>(N+1));
ans[0][0]=0;
for(int i=1;i<=500;i++) ans[i][0]=1;
for(int i=1;i<=N;i++) ans[0][i]=i;
for(int i=1;i<=500;i++){
for(int j=1;j<=N;j++){
if(j>i) ans[i][j]=-1;
else ans[i][j]=-2;
}
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
9 ms |
1128 KB |
Output is correct |
4 |
Correct |
10 ms |
1116 KB |
Output is correct |
5 |
Correct |
18 ms |
2144 KB |
Output is correct |
6 |
Correct |
18 ms |
2140 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
14 ms |
1628 KB |
Output is correct |
9 |
Correct |
15 ms |
1880 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
596 KB |
Wrong answer detected in grader |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Wrong answer detected in grader |
3 |
Halted |
0 ms |
0 KB |
- |