# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
317086 | 8e7 | DEL13 (info1cup18_del13) | C++14 | 144 ms | 632 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 <utility>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define maxn 200005
using namespace std;
bool dp[1<<18];
void build(int n) {
dp[(1<<n) - 1] = true;
for (int i = (1<<n) - 2;i >= 0;i--) {
vector<int> pos;
for (int j = 0;j < n;j++) {
//cout << ((i & (1<<j)) ? 1 : 0);
if ((i & (1<<j)) == 0) {
pos.push_back(j);
}
}
for (int j = 0;j < pos.size() - 1;j++) {
int cnt = 0;
for (int x = pos[j];x < n;x++) {
cnt += ((i & (1<<x)) ? 1 : 0);
if (cnt > 1) continue;
if ((i & (1<<x)) == 0 && cnt == 1) {
dp[i] |= dp[i + (1<<(pos[j])) + (1<<x)];
}
}
}
//cout << " " << (dp[i] ? 1 : 0) << endl;
}
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int t;
cin >> t;
int cnt = 0;
while (t--) {
int n, q;
cin >> n >> q;
if (cnt == 0) {
build(n);
}
int a = 0;
for (int i = 0;i < q;i++) {
int x;
cin >> x;
a += (1<<(x - 1));
}
//cout << a << endl;
if (dp[a]) {
cout << 0 << endl;
cout << endl;
} else {
cout << -1 << endl;
}
cnt++;
}
}
/*
4
7 3
1 5 7
7 3
1 2 7
*/
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... |