oj.uz

Submission #67137

# Submission time Handle Problem Language Result Execution time Memory
67137 2018-08-13T11:28:28 Z cdemirer DEL13 (info1cup18_del13) C++17
12 / 100
 7 ms 920 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<vi> vvi;
typedef pair<double, double> dodo;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)

int N, M;

bool dp[524288] = {0};

void func(int m) {
	if (dp[m]) return;
	dp[m] = true;
	if (m == (m & -m)) return;
	int t1 = m;
	int t2 = t1 - (t1 & -t1);
	while (true) {
		if (t2 == (t2 & -t2)) return;
		int x = m;
		x -= (t1 & -t1);
		int t3 = t2 - (t2 & -t2);
		x -= (t3 & -t3);
		func(x);
		t1 = t2;
		t2 = t3;
	}
}

void pp() {
	func((1<<N)-1);
	//for (int i = 0; i < 10; i++) cerr << dp[i] << " ";
	//cerr << endl;
}

int main(int argc, char **argv) {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int TC; cin >> TC;
	for (int tc = 1; tc <= TC; tc++) {
		cin >> N >> M;
		if (tc == 1) pp();
		int x = 0;
		for (int i = 0; i < M; i++) {
			int a; cin >> a;
			x += (1<<(a-1));
		}
		if (dp[x]) {
			cout << "0\n\n";
		} else {
			cout << "-1\n";
		}
	}
	
	return 0;
}

Subtask #1
6.0 / 15.0

# Verdict Execution time Memory Grader output
1 Partially correct 3 ms 376 KB Output is partially correct
2 Partially correct 2 ms 376 KB Output is partially correct

Subtask #2
6.0 / 15.0

# Verdict Execution time Memory Grader output
1 Partially correct 3 ms 376 KB Output is partially correct
2 Partially correct 2 ms 376 KB Output is partially correct
3 Partially correct 7 ms 540 KB Output is partially correct
4 Partially correct 6 ms 744 KB Output is partially correct

Subtask #3
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 744 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 3 ms 780 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Partially correct 3 ms 376 KB Output is partially correct
2 Partially correct 2 ms 376 KB Output is partially correct
3 Partially correct 7 ms 540 KB Output is partially correct
4 Partially correct 6 ms 744 KB Output is partially correct
5 Runtime error 3 ms 780 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 3 ms 784 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 3 ms 800 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #5
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 3 ms 376 KB Output is partially correct
2 Partially correct 2 ms 376 KB Output is partially correct
3 Partially correct 7 ms 540 KB Output is partially correct
4 Partially correct 6 ms 744 KB Output is partially correct
5 Runtime error 3 ms 780 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 3 ms 784 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 3 ms 800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 3 ms 800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 3 ms 800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 3 ms 800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Runtime error 3 ms 920 KB Execution killed with signal 11 (could be triggered by violating memory limits)