oj.uz

Submission #858651

# Submission time Handle Problem Language Result Execution time Memory
858651 2023-10-09T04:07:38 Z Naxocist Prisoner Challenge (IOI22_prison) C++17
0 / 100
 1 ms 348 KB 
#include "prison.h"
#include <bits/stdc++.h>
using namespace std;


vector<vector<int>> devise_strategy(int N) {
	int x = 500;
	vector<vector<int>> res(x+1, vector<int>(N+1, 0));

	for(int j=1; j<=x; ++j) res[0][j] = j;

	for(int i=1; i<=x; ++i) {
		for(int j=1; j<=N; ++j) {
			res[i][j] = (i > j ? -1 : -2);
		}
	}

	return res;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Wrong answer detected in grader
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Wrong answer detected in grader
2 Halted 0 ms 0 KB -

Subtask #3
0 / 90.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Wrong answer detected in grader
2 Halted 0 ms 0 KB -