# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1063837 | kunzaZa183 | Mars (APIO22_mars) | C++17 | 394 ms | 4680 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 "mars.h"
#include <algorithm>
#include <bits/stdc++.h>
#include <utility>
using namespace std;
string process(vector<vector<string>> a, int x, int y, int k, int n) {
auto helper = [&](int x, int y, int k) {
vector<pair<int, int>> vpii;
int dimens = n - k * 2;
int each = n / dimens;
int last = n % dimens;
vector<int> vi(dimens, each);
for (int i = 0; i < last; i++)
vi[i]++;
vector<int> coord(1, 0);
for (int i = 0; i < vi.size() - 1; i++)
coord.push_back(coord.back() + vi[i]);
for (int i = coord[x]; i < coord[x] + vi[x]; i++)
for (int j = coord[y]; j < coord[y] + vi[y]; j++)
vpii.emplace_back(i, j);
return vpii;
};
n *= 2;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |