# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
787941 | vjudge1 | Coins (LMIO19_monetos) | C++17 | 371 ms | 1376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 303, tries = 20, lives = 10000, tolerance = 0;
int t, n, k1, k2;
vector<vector<bool>> board;
int sum;
vector<int> rows;
int pref[maxn][maxn];
mt19937 rng;
int score;
vector<int> solution;
pair<int, int> prev_move;
int cur_score;
vector<int> cur_solution;
void init() {
sum = 0;
memset(pref, 0, sizeof pref);
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
rows.push_back(i);
if (!board[i][j]) {
sum++;
pref[i][j] = 1;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |