#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > res(501);
vector<vector<int> > devise_strategy(int n)
{
for (int i=0;i<=500;i++)
for (int j=0;j<=n;j++)
{
if (i==0&&j==0)
res[i].push_back(0);
else if (i==0)
res[i].push_back(j);
else if (j==0)
res[i].push_back(1);
else if (j>i)
res[i].push_back(-1);
else
res[i].push_back(-2);
}
return res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
13 ms |
1692 KB |
Output is correct |
4 |
Correct |
13 ms |
2168 KB |
Output is correct |
5 |
Correct |
26 ms |
3028 KB |
Output is correct |
6 |
Correct |
27 ms |
3048 KB |
Output is correct |
7 |
Correct |
3 ms |
468 KB |
Output is correct |
8 |
Correct |
21 ms |
2600 KB |
Output is correct |
9 |
Correct |
20 ms |
2772 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Wrong answer detected in grader |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Incorrect |
1 ms |
340 KB |
Wrong answer detected in grader |
3 |
Halted |
0 ms |
0 KB |
- |