oj.uz

Submission #567258

# Submission time Handle Problem Language Result Execution time Memory
567258 2022-05-23T09:49:08 Z haxorman Kitchen (BOI19_kitchen) C++14
0 / 100
 2 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxN = 307;

int a[mxN], b[mxN];

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	int n, m, k;
	cin >> n >> m >> k;

	if (m < k) {
		cout << "Impossible\n";
		exit(0);
	}

	for (int i = 0; i < n; ++i) {
		cin >> a[i];
	}

	for (int i = 0; i < m; ++i) {
		cin >> b[i];
	}

	if (k == 1) {
		int ans = 0;
		for (int i = 0; i < n; ++i) {
			int mn = INT_MAX;
			for (int j = 0; j < m; ++j) {
				mn = min(mn, a[i] % b[j]);
			}
			ans += mn;
		}
		cout << ans << "\n";
	}
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -