# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
615949 | KazamaHoang | Split the sequence (APIO14_sequence) | C++14 | 2070 ms | 131072 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;
int n, k, a[100005];
int what_subtask_is_the_input() {
if (n <= 10) return 1;
}
template <typename T>
void println(vector<T>& a) {
for (auto x : a) cout << x << " ";
cout << "\n";
}
namespace sub1 {
bool used[15];
long long res = -1;
vector<int> ans;
void back_track(long long cur = 0, vector<int> order = {}) {
vector<int> vt = {1};
for (int i = 2; i <= n; ++ i) {
if (used[i]) {
vt.push_back(i);
}
}
if (vt.size() == k + 1) {
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... |