# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236223 | Aldas25 | Coins (LMIO19_monetos) | C++14 | 484 ms | 69112 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.
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define f first
#define s second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
int t, n, k1, k2;
bool grid[310][310];
bool nGrid[310][310];
bool ans[310][310];
int bst;
int checkGrid () {
int ret = 0;
FOR(i, 1, n) FOR(j, 1, n)
if (grid[i][j] != nGrid[i][j]) ret++;
return (ret/2);
}
void setGrid() {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |