# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
254162 | Berted | Coins (LMIO19_monetos) | C++14 | 672 ms | 231672 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 <iostream>
#include <algorithm>
#include <assert.h>
#include <queue>
#include <random>
#include <vector>
#define pii pair<int, int>
#define fst first
#define snd second
#define ppp pair<pii, pii>
using namespace std;
const int INF = 1e9;
const int cst = 80;
int t, n, k1, k2, c;
int ar[351][351], pref[351][351], ans[351][351];
bool bt[351][351];
vector<ppp> v[90301];
vector<ppp> tp;
vector<int> tp2;
queue<pii> q;
int main()
{
mt19937 rng(6969420);
cin >> t >> n >> k1 >> k2;
for (int i = 0; i < n; i++)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |