text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i = 0, j;
cin >> n;
char ss[n];
cin >> ss;
while (i < n) {
if (ss[i] == 'a' || ss[i] == 'e' || ss[i] == 'o' || ss[i] == 'i' ||
ss[i] == 'u' || ss[i] == 'y') {
char c = ss[i];
i++;
int cnt = 1;
while (i < n && ss[i] == ss[i - 1]) {
cnt++;
i++;
}
if ((c == 'e' || c == 'o') && cnt == 2) {
} else {
for (j = i - cnt + 1; j < i; j++) {
ss[j] = ' ';
}
}
} else
i++;
}
for (i = 0; i < n; i++) {
if (ss[i] != ' ') {
printf("%c", ss[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, k;
char a[N];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
k = 1;
for (int i = 1; i <= n; ++i) {
if (a[i] == a[i + 1] && (a[i] == 'o' || a[i] == 'e' || a[i] == 'a' ||
a[i] == 'i' || a[i] == 'u' || a[i] == 'y'))
k++;
else {
if (k == 2) {
if (a[i] == 'e' || a[i] == 'o')
cout << a[i] << a[i];
else
cout << a[i];
} else
cout << a[i];
k = 1;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int sz;
string s;
cin >> sz >> s;
string t;
for (int i = 0; i < sz; i++) {
char c = s[i];
if (c == 'a' or c == 'i' or c == 'u' or c == 'y') {
if (i == sz - 1 or c != s[i + 1]) t += c;
} else if (c == 'e' or c == 'o') {
int count = 0;
while (s[++i] == c) count++;
t += c;
if (count == 1) t += c;
i--;
} else {
t += c;
}
}
cout << t << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool is_vowel(char c) {
return c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'y';
}
string format(const string& str) {
int n = str.size();
char repeating = str[0];
int times = 1;
string new_str;
for (int i = 1; i < n; i++) {
if (str[i] == repeating) {
times++;
} else {
if ((repeating == 'e' || repeating == 'o') && times == 2) {
new_str.push_back(repeating);
new_str.push_back(repeating);
} else if (is_vowel(repeating)) {
new_str.push_back(repeating);
} else {
for (int k = 0; k < times; k++) {
new_str.push_back(repeating);
}
}
repeating = str[i];
times = 1;
}
}
if ((repeating == 'e' || repeating == 'o') && times == 2) {
new_str.push_back(repeating);
new_str.push_back(repeating);
} else if (is_vowel(repeating)) {
new_str.push_back(repeating);
} else {
for (int k = 0; k < times; k++) {
new_str.push_back(repeating);
}
}
return new_str;
}
int main() {
int n;
cin >> n;
string str;
cin >> str;
string res = format(str);
cout << res;
int end;
cin >> end;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int tes;
tes = 1;
while (tes--) {
long long int n, x, y;
cin >> n;
string s;
cin >> s;
int i = 0;
int j = 1;
int count = 0;
vector<char> c;
if (n == 1) {
cout << s;
break;
}
while (i <= n - 2 && j <= n - 1) {
if (s[j] == s[i] && (s[i] == 'a' || s[i] == 'e' || s[i] == 'i' ||
s[i] == 'o' || s[i] == 'u' || s[i] == 'y')) {
count++;
if (j + 1 < n && s[j + 1] == s[i]) {
j++;
} else {
count++;
if ((s[i] == 'e' || s[i] == 'o') && count == 2) {
c.push_back(s[i]);
c.push_back(s[i]);
count = 0;
if (j == n - 2) c.push_back(s[n - 1]);
i = j + 1;
j = i + 1;
} else {
c.push_back(s[i]);
count = 0;
i = j + 1;
j = i + 1;
}
}
} else {
c.push_back(s[i]);
if (j == n - 1) c.push_back(s[j]);
i = j;
j++;
}
}
for (auto d : c) cout << d;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int i = 0;
while (i < n) {
if (s[i] != 'a' && s[i] != 'e' && s[i] != 'o' && s[i] != 'u' &&
s[i] != 'i' && s[i] != 'y') {
cout << s[i];
i++;
continue;
}
int j = i;
while (j < n && s[i] == s[j]) {
j++;
}
if (j - i == 2 && (s[i] == 'o' || s[i] == 'e')) {
cout << s[i];
cout << s[i + 1];
} else {
cout << s[i];
}
i = j;
}
return 0;
}
|
#include <bits/stdc++.h>
const long long SZ = 1e5 + 7;
const long long inf = 1e18;
const long long MOD = 1e9 + 7;
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
void krdiyasuru() {
long long n;
cin >> n;
string s;
cin >> s;
long long i = 0;
while (i < n) {
if (s[i] != 'a' && s[i] != 'e' && s[i] != 'o' && s[i] != 'u' &&
s[i] != 'i' && s[i] != 'y') {
cout << s[i];
i++;
continue;
}
long long j = i;
while (j < n && s[i] == s[j]) {
j++;
}
if (j - i == 2 && (s[i] == 'o' || s[i] == 'e')) {
cout << s[i];
cout << s[i + 1];
} else {
cout << s[i];
}
i = j;
}
return;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
{ krdiyasuru(); }
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n;
cin >> n;
string s;
cin >> s;
s += ".";
n++;
vector<pair<char, int>> a;
int c = s[0];
int cnt = 1;
for (int i = 1; i < n; i++) {
if (c == s[i]) {
cnt++;
} else {
a.push_back({c, cnt});
c = s[i];
cnt = 1;
}
}
for (int i = 0; i < a.size(); i++) {
if (a[i].first == 'a' || a[i].first == 'e' || a[i].first == 'i' ||
a[i].first == 'o' || a[i].first == 'u' || a[i].first == 'y') {
if ((a[i].first == 'e' || a[i].first == 'o') && a[i].second == 2) {
cout << a[i].first << a[i].first;
} else {
cout << a[i].first;
}
} else {
for (int j = 0; j < a[i].second; j++) cout << a[i].first;
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, i;
scanf("%d", &n);
char str[100001];
scanf("%s", str);
printf("%c", str[0]);
int k = 1;
for (i = 1; i < n; i++) {
if (str[i] != str[i - 1]) {
printf("%c", str[i]);
k = 1;
continue;
}
k++;
if (str[i] == 'o' || str[i] == 'e') {
if ((i < n - 1) && (str[i + 1] != str[i]) && (k == 2)) {
printf("%c", str[i]);
k = 1;
} else if ((i == n - 1) && (k == 2)) {
printf("%c", str[i]);
}
} else if (str[i] == 'a' || str[i] == 'i' || str[i] == 'u' ||
str[i] == 'y') {
if (str[i] != str[i - 1]) {
printf("%c", str[i]);
k = 0;
}
} else {
printf("%c", str[i]);
k = 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, len;
string s, ans;
int main() {
cin >> n;
cin >> s;
k = 1;
for (int i = 1; i < n; i++) {
if (s[i] == s[i - 1] && (s[i] == 'a' || s[i] == 'e' || s[i] == 'i' ||
s[i] == 'o' || s[i] == 'u' || s[i] == 'y')) {
k++;
} else {
ans += s[i - 1];
if (k == 2 && (s[i - 1] == 'o' || s[i - 1] == 'e')) ans += s[i - 1];
k = 1;
}
}
ans += s[n - 1];
if (k == 2 && (s[n - 1] == 'o' || s[n - 1] == 'e')) ans += s[n - 1];
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, a, e, i1, o, u, y;
string s;
int main() {
cin >> n;
cin >> s;
s[n] = '0';
for (int i = 0; i < s.size(); i++) {
if (s[i] != 'a' && s[i] != 'e' && s[i] != 'i' && s[i] != 'o' &&
s[i] != 'u' && s[i] != 'y')
cout << s[i];
if (s[i] == 'a') a++;
if (s[i + 1] != 'a' && s[i] == 'a') {
cout << 'a';
a = 0;
}
if (s[i] == 'e') e++;
if (s[i + 1] != 'e' && s[i] == 'e') {
if (e == 2)
cout << 'e' << 'e';
else
cout << 'e';
e = 0;
}
if (s[i] == 'i') i1++;
if (s[i + 1] != 'i' && s[i] == 'i') {
cout << 'i';
i1 = 0;
}
if (s[i] == 'o') o++;
if (s[i + 1] != 'o' && s[i] == 'o') {
if (o == 2)
cout << 'o' << 'o';
else
cout << 'o';
o = 0;
}
if (s[i] == 'u') u++;
if (s[i + 1] != 'u' && s[i] == 'u') {
cout << 'u';
u = 0;
}
if (s[i] == 'y') y++;
if (s[i + 1] != 'y' && s[i] == 'y') {
cout << 'y';
y = 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long pow(long long x, long long n) {
long long res = 1;
while (n) {
if (n & 1) res = (res * x);
x = (x * x);
n >>= 1;
}
return res;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
string s;
cin >> s;
string ans = "";
char ch;
long long cnt = 0;
for (long long i = 0; i < n; i++) {
char ch = s[i];
if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u' ||
ch == 'y') {
if (s[i] == s[i + 1]) {
cnt++;
continue;
}
}
if (cnt == 1 && ch == 'e') {
ans.append(2, 'e');
cnt = 0;
continue;
}
if (cnt == 1 && ch == 'o') {
ans.append(2, 'o');
cnt = 0;
continue;
}
ans.append(1, ch);
cnt = 0;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int xd[] = {0, 1, 0, -1};
int yd[] = {1, 0, -1, 0};
int xx[] = {0, 1, 0, -1, 1, -1, 1, -1};
int yy[] = {1, 0, -1, 0, 1, 1, -1, -1};
int kx[] = {-2, -1, -2, -1, 1, 2, 2, 1};
int ky[] = {1, 2, -1, -2, -2, -1, 1, 2};
bool islucky(int x) {
int four = 0, seven = 0;
while (x) {
if (x % 10 != 7 && x % 10 != 4) return false;
if (x % 10 == 7)
seven++;
else
four++;
x = x / 10;
}
return four == seven;
}
bool is_prime(long long x) {
if (x == 1) return false;
for (int i = 2; i * i <= x; i++)
if (x % i == 0) return false;
return true;
}
long long C(int k, int l) {
if (l == k) return 1;
if (l * 2 > k) l = k - l;
long long res = 1, temp = l;
for (int i = k - l + 1; i <= k; i++) {
res *= i / temp;
temp--;
}
return res;
}
long long sumOfDigit(int x) {
int res = 0;
while (x) {
res += x % 10;
x /= 10;
}
return res;
}
uint64_t bigPow(uint64_t base, uint64_t p) {
uint64_t temp = 1;
while (p--) {
temp *= base;
}
return temp;
}
vector<int> soso;
bool prime[10000001] = {0};
void SieveOfEratosthenes(int n) {
soso.push_back(2);
for (int p = 3; p * p <= n; p += 2) {
if (prime[p] == false) {
for (int i = p * 2; i <= n; i += p) prime[i] = true;
}
}
for (int i = 3; i <= n; i += 2)
if (!prime[i]) soso.push_back(i);
}
vector<vector<int> > AdjList;
bool visited[100005];
void dfs(int s) {
if (visited[s]) return;
visited[s] = 1;
for (int i = 0; i < AdjList[s].size(); i++) dfs(AdjList[s][i]);
return;
}
int a[100000 + 5];
string vow = "aeiouy";
int main() {
int n, l, r, x;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (vow.find(s[i]) == -1)
cout << s[i];
else {
int j = i;
while (s[j] == s[i] && j < n) j++;
if (j - i == 2 && (s[i] == 'e' || s[i] == 'o')) {
cout << s[i] << s[i + 1];
i = j - 1;
} else if (j - i > 1) {
cout << s[i];
i = j - 1;
} else
cout << s[i];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[100009];
int n;
scanf("%d", &n);
scanf("%s", &s);
bool f = false;
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == s[i - 1] && (s[i] == 'a' || s[i] == 'e' || s[i] == 'i' ||
s[i] == 'o' || s[i] == 'u' || s[i] == 'y')) {
f = true;
count++;
continue;
}
if (s[i] != s[i - 1] && (s[i] == 'a' || s[i] == 'e' || s[i] == 'i' ||
s[i] == 'o' || s[i] == 'u' || s[i] == 'y')) {
if (s[i - 1] != 'a' && s[i - 1] != 'e' && s[i - 1] != 'i' &&
s[i - 1] != 'o' && s[i - 1] != 'u' && s[i - 1] != 'y') {
f = true;
count++;
continue;
}
if ((s[i - 1] == 'o' || s[i - 1] == 'e') && count == 2) {
printf("%c%c", s[i - 1], s[i - 1]);
} else {
printf("%c", s[i - 1]);
}
count = 1;
continue;
}
if (f) {
if ((s[i - 1] == 'o' || s[i - 1] == 'e') && count == 2) {
printf("%c%c", s[i - 1], s[i - 1]);
} else {
printf("%c", s[i - 1]);
}
f = false;
count = 0;
}
printf("%c", s[i]);
}
if (f) {
if ((s[n - 1] == 'o' || s[n - 1] == 'e') && count == 2) {
printf("%c%c", s[n - 1], s[n - 1]);
} else {
printf("%c", s[n - 1]);
}
f = false;
count = 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
vector<char> gl = {'a', 'e', 'i', 'o', 'u', 'y'};
for (int i = 0; i < s.size(); ++i) {
bool flag = false;
for (int j = 0; j < 6; ++j) {
int cnt = 0;
while (i < s.size() && s[i] == gl[j]) {
++i;
++cnt;
}
if (cnt > 0) {
flag = true;
if (cnt == 2 && (j == 1 || j == 3)) {
cout << gl[j] << gl[j];
} else {
cout << gl[j];
}
--i;
}
}
if (!flag) {
cout << s[i];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
int n, t = 0, k = 0;
char f[1000000];
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'o' || s[i] == 'y' || s[i] == 'i' || s[i] == 'a' ||
s[i] == 'e' || s[i] == 'u') {
if (s[i] != s[i + 1]) {
f[t] = s[i];
t++;
if ((s[i] == 'o' || s[i] == 'e') && k == 1) {
f[t] = s[i];
t++;
}
k = 0;
} else {
k++;
}
} else {
f[t] = s[i];
t++;
}
}
cout << f;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < s.size();) {
if (s[i] == 'i') {
int cnt = 1;
while (s[i + cnt] == 'i') cnt++;
if (cnt >= 2) {
for (int j = i + 1; j < i + cnt; j++) s[j] = '.';
}
i += cnt;
} else if (s[i] == 'y') {
int cnt = 1;
while (s[i + cnt] == 'y') cnt++;
if (cnt >= 2) {
for (int j = i + 1; j < i + cnt; j++) s[j] = '.';
}
i += cnt;
} else if (s[i] == 'a') {
int cnt = 1;
while (s[i + cnt] == 'a') cnt++;
if (cnt >= 2) {
for (int j = i + 1; j < i + cnt; j++) s[j] = '.';
}
i += cnt;
} else if (s[i] == 'u') {
int cnt = 1;
while (s[i + cnt] == 'u') cnt++;
if (cnt >= 2) {
for (int j = i + 1; j < i + cnt; j++) s[j] = '.';
}
i += cnt;
} else if (s[i] == 'o') {
int cnt = 1;
while (s[i + cnt] == 'o') cnt++;
if (cnt > 2) {
for (int j = i + 1; j < i + cnt; j++) s[j] = '.';
}
i += cnt;
} else if (s[i] == 'e') {
int cnt = 1;
while (s[i + cnt] == 'e') cnt++;
if (cnt > 2) {
for (int j = i + 1; j < i + cnt; j++) s[j] = '.';
}
i += cnt;
} else
i++;
}
for (char c : s)
if (c != '.') cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = (1LL << 60) - 1;
long long int lf[200000], rt[200000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n;
cin >> n;
string s;
cin >> s;
lf[0] = 1, rt[n - 1] = 1;
for (int i = 1; i < n; i++) {
if (s[i] == s[i - 1])
lf[i] = lf[i - 1] + 1;
else
lf[i] = 1;
}
for (int i = n - 2; i >= 0; i--) {
if (s[i] == s[i + 1])
rt[i] = rt[i + 1] + 1;
else
rt[i] = 1;
}
for (int i = 0; i < n; i++) {
if (s[i] == 'a') {
if (lf[i] == 1) cout << "a";
} else if (s[i] == 'i') {
if (lf[i] == 1) cout << "i";
} else if (s[i] == 'u') {
if (lf[i] == 1) cout << "u";
} else if (s[i] == 'y') {
if (lf[i] == 1) cout << "y";
} else if (s[i] == 'o') {
if (lf[i] == 1 || (lf[i] == 2 && rt[i] == 1)) cout << "o";
} else if (s[i] == 'e') {
if (lf[i] == 1 || (lf[i] == 2 && rt[i] == 1)) cout << "e";
} else {
cout << s[i];
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int __gcd(long long int a, long long int b) {
return (a % b) ? __gcd(b, a % b) : b;
}
bool prime(long long int k) {
for (long long int i = 2; i * i <= k; i++)
if (k % i == 0) {
return false;
}
return true;
}
void pdash(int n = 1) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < 30; j++) {
cout << "-";
}
cout << "\n";
}
}
void solve() {
int n;
cin >> n;
string str;
cin >> str;
string ans = "";
for (int i = 0, j = 0; i < n && j < n;) {
while (str[i] == str[j] and j < n) j++;
if (str[i] == 'a' || str[i] == 'u' || str[i] == 'i' || str[i] == 'y' ||
((str[i] == 'o' || str[i] == 'e') && (j - i != 2))) {
ans += string(str.begin() + i, str.begin() + (i + 1));
i = j;
} else {
ans += string(str.begin() + i, str.begin() + j);
i = j;
}
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string x, s = "";
int n, i, j, c = 0;
cin >> n >> x;
for (i = 0; i < x.size(); i++) {
c = 0;
if (x[i] == 'a' || x[i] == 'i' || x[i] == 'u' || x[i] == 'y' ||
x[i] == 'e' || x[i] == 'o') {
if (x[i] != 'e' && x[i] != 'o') {
j = i;
while (x[j] == x[j + 1]) {
if (x[j] == x[j + 1]) {
c += 1;
j += 1;
}
}
s += x[i];
i = i + c;
} else if (x[i] == 'e' || x[i] == 'o') {
j = i;
while (x[j] == x[j + 1]) {
if (x[j] == x[j + 1]) {
c += 1;
j += 1;
}
}
if (c == 1) {
s += x[i];
s += x[i + 1];
i = i + c;
} else {
s += x[i];
i = i + c;
}
}
} else
s += x[i];
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, i, j;
char ch[100005] = {0};
int main() {
cin >> n;
getchar();
for (i = 1; i <= n; i++) scanf("%c", &ch[i]);
for (i = 1; i <= n; i++) {
if (ch[i] != 'e' && ch[i] != 'o') {
if (ch[i] == 'a' || ch[i] == 'i' || ch[i] == 'u' || ch[i] == 'y')
if (ch[i - 1] != ch[i])
printf("%c", ch[i]);
else
;
else
printf("%c", ch[i]);
} else {
for (j = i; ch[j] == ch[i]; j++)
;
if (j - i == 2)
printf("%c%c", ch[i], ch[i]);
else
printf("%c", ch[i]);
i = j - 1;
}
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const long double eps = 1e-7;
const long long inf = numeric_limits<long long>::max() / 2 - 1;
const long long mod = 1000000007;
const long long maxn = 800007;
bool isgl(char c) {
return (c == 'a' || c == 'o' || c == 'e' || c == 'i' || c == 'y' || c == 'u');
}
inline int run() {
long long n;
cin >> n;
string s;
cin >> s;
string ans = "";
for (int i = 0; i < n;) {
int nxt = i + 1;
if (isgl(s[i])) {
while (nxt != n && s[nxt] == s[i]) nxt++;
if (nxt - i == 2 && (s[i] == 'e' || s[i] == 'o')) {
ans.push_back(s[i]);
}
}
ans.push_back(s[i]);
i = nxt;
}
cout << ans;
return 0;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
if (strlen("") > 0) {
freopen(
""
".in",
"r", stdin);
freopen(
""
".out",
"w", stdout);
}
run();
cerr << clock() * 1000 / CLOCKS_PER_SEC;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i;
cin >> n;
string str;
cin >> str;
if (n <= 2)
cout << str;
else {
str[-1] = 'b';
cout << str[0];
for (i = 1; i < n; i++) {
if ((str[i] == str[i - 1]) && ((str[i] == 'a') || (str[i] == 'i') ||
(str[i] == 'u') || (str[i] == 'y')))
;
else if ((str[i] == 'e') || (str[i] == 'o')) {
if (((str[i - 2] != str[i - 1]) && (str[i - 1] == str[i]) &&
(str[i] != str[i + 1])) ||
((str[i] == str[i - 1]) && (str[i] != str[i + 1]) && (i == 1)))
cout << str[i];
else if (str[i] != str[i - 1])
cout << str[i];
} else
cout << str[i];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, m, x, s, p[10005], c[105], y[30][30], d[10005], q[10005], f, r,
g[1100005];
bool a[10005];
void work(int x, int y) {
if (x > 0 && x <= n && y < d[x]) {
d[x] = y;
q[++r] = x;
}
}
void bfs(int x) {
int i;
memset(d, 1, sizeof(d));
d[x] = 0;
f = 0;
r = 0;
for (q[0] = x; f <= r; f++) {
for (i = 1; i <= m; i++) {
work(q[f] + c[i], d[q[f]] + 1);
work(q[f] - c[i], d[q[f]] + 1);
}
}
for (i = 1; i <= n; i++) {
if (a[i]) y[p[x]][p[i]] = d[i];
}
}
int main() {
int i, j, l;
scanf("%d%d%d", &n, &k, &m);
n++;
for (i = 1; i <= k; i++) {
scanf("%d", &x);
a[x] = 1;
}
for (i = 1; i <= m; i++) scanf("%d", &c[i]);
for (i = n; i >= 1; i--) {
if (a[i] ^= a[i - 1]) p[i] = ++s;
}
for (i = 1; i <= n; i++) {
if (a[i]) bfs(i);
}
memset(g, 80, sizeof(g));
g[0] = 0;
for (i = 1; i <= (1 << s) - 1; i++) {
for (j = 1; j <= s; j++) {
if (i & (1 << j - 1)) {
for (l = j + 1; l <= s; l++) {
if (i & (1 << l - 1))
g[i] = min(g[i], g[i ^ (1 << j - 1) ^ (1 << l - 1)] + y[j][l]);
}
break;
}
}
}
if (g[(1 << s) - 1] > 1 << 20)
puts("-1");
else
printf("%d\n", g[(1 << s) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T read() {
T x = 0;
char ch = getchar();
bool fl = false;
while (!isdigit(ch)) {
if (ch == '-') fl = true;
ch = getchar();
}
while (isdigit(ch)) {
x = (x << 3) + (x << 1) + (ch ^ 48);
ch = getchar();
}
return fl ? -x : x;
}
const int maxn = 2e4 + 10;
int stk[maxn << 1], top = 0, n, k, m;
int f[(1 << 21) + 5], len[maxn];
int dis[maxn], c[30][30];
bool vis[maxn];
void bfs(int s) {
memset(dis, 0x3f, sizeof dis);
queue<int> q;
q.push(stk[s]);
dis[stk[s]] = 0;
while (q.size()) {
int u = q.front();
q.pop();
for (int i = 1; i <= m; i++) {
if (u + len[i] <= n + 1 && dis[u + len[i]] > dis[u] + 1) {
dis[u + len[i]] = dis[u] + 1;
q.push(u + len[i]);
}
if (u - len[i] > 0 && dis[u - len[i]] > dis[u] + 1) {
dis[u - len[i]] = dis[u] + 1;
q.push(u - len[i]);
}
}
}
for (int i = 1; i <= top; i++) c[s][i] = dis[stk[i]];
}
int main() {
memset(f, 0x3f, sizeof f);
memset(c, 0x3f, sizeof c);
n = read<int>();
k = read<int>();
m = read<int>();
for (int i = 1; i <= k; i++) {
int x = read<int>();
vis[x] ^= 1;
vis[x + 1] ^= 1;
}
for (int i = 1; i <= m; i++) len[i] = read<int>();
for (int i = 1; i <= n + 1; i++)
if (vis[i]) stk[++top] = i;
for (int i = 1; i <= top; i++) bfs(i);
f[0] = 0;
for (int s = 0; s < (1 << top); s++) {
for (int i = 1; i <= top; i++) {
if ((s >> i - 1) & 1) continue;
for (int j = i + 1; j <= top; j++) {
if ((s >> j - 1) & 1) continue;
f[s | (1 << i - 1) | (1 << j - 1)] =
min(f[s | (1 << i - 1) | (1 << j - 1)], f[s] + c[i][j]);
}
}
}
if (f[(1 << top) - 1] > 1e9)
puts("-1");
else
printf("%d\n", f[(1 << top) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#pragma GCC optimize("Ofast")
using namespace std;
const int inf = 0x3f3f3f3f;
const int Maxn = 10005;
int a[Maxn], dist[30][30];
int vis[Maxn], ways[105];
int n, k, l;
pair<int, int> q[Maxn << 1];
int bfs(int s, int e) {
memset(vis, 0, sizeof(vis));
vis[s] = 1;
int head = 0, tail = 1;
q[head] = pair<int, int>(s, 0);
while (head < tail) {
pair<int, int> t = q[head++];
int u = t.first, dist = t.second + 1;
for (int i = 0; i < (l); ++i) {
int v = u + ways[i];
if (v == e) return dist;
if (v <= n + 1 && !vis[v])
vis[v] = 1, q[tail++] = pair<int, int>(v, dist);
v = u - ways[i];
if (v == e) return dist;
if (v > 0 && !vis[v]) vis[v] = 1, q[tail++] = pair<int, int>(v, dist);
}
}
return -1;
}
vector<int> v[30];
int dp[1 << 21];
int main() {
scanf("%d%d%d", &n, &k, &l);
for (int i = 0; i < (k); ++i) {
int t;
scanf("%d", &t);
a[t] = 1;
}
for (int i = 0; i < (l); ++i) scanf("%d", &ways[i]);
vector<int> all;
for (int i = 1; i <= (n + 1); ++i)
if (a[i] != a[i - 1]) all.push_back(i);
for (int i = 0; i < (all.size()); ++i)
for (int j = (i + 1); j <= (all.size() - 1); ++j)
dist[i][j] = dist[j][i] = bfs(all[i], all[j]);
for (int p = 0; p < (1 << all.size()); ++p) {
int t = __builtin_popcount(p);
if (!(t & 1)) v[t].push_back(p);
}
memset(dp, inf, sizeof(dp));
dp[0] = 0;
for (int x = 2; x <= all.size(); x += 2)
for (int y = 0; y < (v[x].size()); ++y) {
int p = v[x][y];
for (int i = 0; i < (all.size()); ++i) {
if (!(p & (1 << i))) continue;
for (int j = (i + 1); j <= (all.size() - 1); ++j) {
if (!(p & (1 << j)) || dist[i][j] == -1) continue;
int np = p ^ (1 << i) ^ (1 << j);
dp[p] = min(dp[p], dp[np] + dist[i][j]);
}
}
}
printf("%d\n",
dp[(1 << all.size()) - 1] == inf ? -1 : dp[(1 << all.size()) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000 * 1000 * 1000 + 7;
const int maxn = 10000 + 10;
const int inf = 100000000;
const int base = 139;
int n, k, l, b[maxn], first[11], c[maxn], r, t, d[maxn], dist[22][22],
dp[(1 << 20) + 3];
vector<int> v[maxn], a;
bool mark[maxn];
void bfs(int e) {
queue<int> q;
memset(mark, 0, sizeof mark);
for (int i = 0; i < maxn; i++) d[i] = inf;
q.push(e);
d[e] = 0;
mark[e] = 1;
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = 0; i < v[x].size(); i++)
if (!mark[v[x][i]]) {
q.push(v[x][i]);
d[v[x][i]] = d[x] + 1;
mark[v[x][i]] = 1;
}
}
for (int i = 0; i <= n; i++)
if (b[i]) dist[b[e]][b[i]] = d[i];
}
int f(int x) {
if (!x) return 0;
if (dp[x] != -1) return dp[x];
int o = -1, res = inf;
for (int i = 0; i < r; i++) {
if ((1 << i) & x) {
if (o == -1)
o = i;
else
res = min(res, f(x - (1 << o) - (1 << i)) + dist[o + 1][i + 1]);
}
}
return dp[x] = res;
}
int main() {
memset(dp, -1, sizeof dp);
for (int i = 0; i < 22; i++)
for (int j = 0; j < 22; j++) dist[i][j] = inf;
cin >> n >> k >> l;
for (int i = 1; i <= k; i++) {
cin >> first[i];
c[first[i]] = 1;
}
for (int i = 1; i <= l; i++) {
int x;
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
a.resize(unique(a.begin(), a.end()) - a.begin());
for (int i = 0; i <= n; i++)
if (c[i] != c[i + 1]) b[i] = ++t;
for (int i = 0; i < l; i++)
for (int j = 0; j + a[i] <= n; j++) {
v[j].push_back(j + a[i]);
v[j + a[i]].push_back(j);
}
for (int i = 0; i <= n; i++)
if (b[i]) {
r++;
bfs(i);
}
int k = f((1 << r) - 1);
if (k >= inf)
cout << -1 << endl;
else
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 10005, maxK = 25;
int n, m, K, dis[maxK][maxn], to[maxn], a[maxK], q[maxn], f[1 << 20];
bool b[maxn];
void Bfs(int S, int *Dp) {
int rt, i, s, t, x;
q[s = t = 1] = S;
Dp[S] = 0;
while (s <= t) {
rt = q[s++];
for (i = 0; i < m; i++) {
x = rt + to[i];
if (x <= n + 1 && Dp[x] > Dp[rt] + 1) Dp[x] = Dp[rt] + 1, q[++t] = x;
x = rt - to[i];
if (x > 0 && Dp[x] > Dp[rt] + 1) Dp[x] = Dp[rt] + 1, q[++t] = x;
}
}
}
int main() {
scanf("%d%d%d", &n, &K, &m);
int i, j, v, V;
while (K--) scanf("%d", &v), b[v] = true;
for (i = 0; i < m; i++) scanf("%d", &to[i]);
memset(dis, 0x3f, sizeof(dis));
memset(f, 0x3f, sizeof(f));
f[0] = 0;
for (K = 0, i = 1; i <= n + 1; i++)
if (b[i] ^ b[i - 1]) a[K++] = i, Bfs(i, dis[K - 1]);
for (V = 1 << K, v = 1; v < V; v++) {
int &x = f[v];
for (i = 0; i < K; i++)
if (v >> i & 1)
for (j = i + 1; j < K; j++)
if (v >> j & 1) x = min(x, f[v ^ (1 << i) ^ (1 << j)] + dis[i][a[j]]);
}
printf("%d\n", f[V - 1] < 0x3f3f3f3f ? f[V - 1] : -1);
fclose(stdin);
fclose(stdout);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 10010, INF = 0x3fffffff;
int d[N], x[20], a[100], dp[1 << 20], w[20][20];
bool vis[N];
int main() {
int n, k, l;
while (scanf("%d%d%d", &n, &k, &l) == 3) {
fill(vis, vis + N + 1, 0);
for (int i = 0; i < k; i++) scanf("%d", &x[i]), vis[x[i]] = 1;
for (int i = 0; i < l; i++) scanf("%d", &a[i]);
sort(a, a + l);
l = unique(a, a + l) - a;
k = 0;
for (int i = 0; i <= n; i++)
if (vis[i] != vis[i + 1]) x[k++] = i;
for (int i = 0; i < k; i++) {
priority_queue<pair<int, int> > q;
fill(d, d + n + 1, INF);
d[x[i]] = 0;
for (q.push(make_pair(0, x[i])); !q.empty();) {
int u = q.top().second;
int dis = -q.top().first;
q.pop();
if (d[u] != dis) continue;
for (int j = 0; j < l; j++) {
if (u - a[j] >= 0 && d[u - a[j]] > dis + 1)
d[u - a[j]] = dis + 1, q.push(make_pair(-dis - 1, u - a[j]));
if (u + a[j] <= n && d[u + a[j]] > dis + 1)
d[u + a[j]] = dis + 1, q.push(make_pair(-dis - 1, u + a[j]));
}
}
for (int j = 0; j < k; j++) w[i][j] = d[x[j]];
}
fill(dp, dp + (1 << k), INF);
dp[0] = 0;
for (int mask = 0; mask < (1 << k); mask++) {
int u;
for (u = 0; u < k; u++)
if ((mask & (1 << u)) == 0) break;
if (u >= k) continue;
for (int v = u + 1; v < k; v++)
if ((mask & (1 << v)) == 0) {
int _mask = mask ^ (1 << u) ^ (1 << v);
dp[_mask] = min(dp[_mask], dp[mask] + w[u][v]);
}
}
printf("%d\n", dp[(1 << k) - 1] == INF ? -1 : dp[(1 << k) - 1]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long rd() {
long long xx = 0, ff = 1;
char ch = getchar();
while (ch < '0' or ch > '9') {
if (ch == '-') ff = -1;
ch = getchar();
}
while (ch >= '0' and ch <= '9') {
xx = xx * 10 - '0' + ch;
ch = getchar();
}
return xx * ff;
}
const long long N = 4e4 + 10;
const long long INF = 0x3f3f3f3f3f3f3f3f;
long long n, K, m;
long long a[N], b[N];
long long len[N];
long long poi[100], p_cnt;
long long is[N];
long long tot;
long long last[N], nex[N * 110 * 2], ver[N * 110 * 2];
inline void add(long long u, long long v) {
nex[++tot] = last[u];
ver[tot] = v;
last[u] = tot;
}
long long dist[110][110];
bool vis[N];
pair<long long, long long> q[N * 10];
long long hd, ed;
void bfs(long long s, long long sign) {
memset(vis, 0, sizeof vis);
hd = ed = 0;
vis[s] = 1;
dist[sign][sign] = 0;
q[ed++] = make_pair(s, 0);
long long num = 1;
while (hd != ed) {
long long u = q[hd].first;
long long d = q[hd++].second;
for (long long i = last[u]; i; i = nex[i]) {
long long r = ver[i];
if (vis[r]) continue;
vis[r] = true;
if (is[r]) dist[sign][is[r]] = min(dist[sign][is[r]], d + 1);
if (num == p_cnt) return;
q[ed++] = make_pair(r, d + 1);
}
}
}
long long f[1 << 21];
int main() {
n = rd();
K = rd();
m = rd();
for (long long i = 1; i <= K; i++) a[rd()] = 1;
for (long long i = 1; i <= m; i++) len[i] = rd();
for (long long i = 0; i <= n; i++) {
b[i] = a[i] ^ a[i + 1];
if (b[i]) {
poi[++p_cnt] = i;
is[i] = p_cnt;
}
}
memset(dist, 0x3f, sizeof dist);
for (long long i = 0; i <= n; i++)
for (long long j = 1; j <= m; j++) {
if (i - len[j] >= 0) add(i, i - len[j]);
if (i + len[j] <= n) add(i, i + len[j]);
}
for (long long i = 1; i <= p_cnt; i++) bfs(poi[i], i);
memset(f, 0x3f, sizeof f);
f[0] = 0;
for (long long i = 0; i < (1 << p_cnt); i++) {
long long j = 1;
for (; j <= p_cnt; j++)
if ((i & (1 << (j - 1))) == 0) break;
for (long long k = j + 1; k <= p_cnt; k++)
if (!(i & (1 << (k - 1))))
f[i | (1 << (j - 1)) | (1 << (k - 1))] =
min(f[i | (1 << (j - 1)) | (1 << (k - 1))], f[i] + dist[j][k]);
}
long long ans = f[(1 << p_cnt) - 1] == INF ? -1 : f[(1 << p_cnt) - 1];
printf("%lld", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 100000000;
int n, k, l, x[23], a[111], m;
int d[10011], c[23][10011];
bool y[10011];
queue<int> q;
void init() {
ios::sync_with_stdio(false);
cin >> n >> k >> l;
for (int i = 0; i < k; ++i) cin >> x[i], y[x[i]] = 1;
for (int i = 0; i < l; ++i) cin >> a[i];
for (int j = 0; j <= n; ++j) {
if (y[j] == y[j + 1]) continue;
memset(d, 0, sizeof(d));
d[j] = 1;
q.push(j);
for (int u; q.size() && (u = q.front(), 1); q.pop())
for (int i = 0, v1, v2; i < l; ++i) {
v1 = u + a[i], v2 = u - a[i];
if (v1 <= n && !d[v1]) d[v1] = d[u] + 1, q.push(v1);
if (v2 >= 0 && !d[v2]) d[v2] = d[u] + 1, q.push(v2);
}
for (int i = 0; i <= n; ++i) c[m][i] = d[i] ? d[i] - 1 : INF;
x[m++] = j;
}
}
int f[9999999];
void work() {
fill(f, f + ((1 << (m - 1 + 1)) - 1) + 1, INF);
f[0] = 0;
for (int i = 1; i <= ((1 << (m - 1 + 1)) - 1); ++i) {
int a = __builtin_ctz(i);
for (int j = i & ~(1 << a); j; j &= j - 1) {
int b = __builtin_ctz(j);
f[i] = min(f[i], f[i & ~(1 << a) & ~(1 << b)] + c[a][x[b]]);
}
}
cout << (f[((1 << (m - 1 + 1)) - 1)] == INF ? -1
: f[((1 << (m - 1 + 1)) - 1)])
<< endl;
}
int main() {
init();
work();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, k, l, dat[10005], len[105], dis[25][25], dp[(1 << 20) + 5];
vector<int> pos;
void bfs(int c, int s) {
int dis[10005];
queue<int> q;
for (int i = 0; i < 10005; ++i) {
dis[i] = 1e9;
}
dis[s] = 0;
q.push(s);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = 0; i < l; ++i) {
int v = u - len[i];
if (v >= 0 && dis[u] + 1 < dis[v]) {
dis[v] = dis[u] + 1;
q.push(v);
}
v = u + len[i];
if (v <= n && dis[u] + 1 < dis[v]) {
dis[v] = dis[u] + 1;
q.push(v);
}
}
}
for (int i = 0; i < m; ++i) {
::dis[c][i] = dis[pos[i]];
}
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> k >> l;
for (int i = 0; i < k; ++i) {
int pos;
cin >> pos;
dat[pos] ^= 1;
dat[--pos] ^= 1;
}
for (int i = 0; i < l; ++i) {
cin >> len[i];
}
for (int i = 0; i < 25; ++i) {
for (int j = 0; j < 25; ++j) {
dis[i][j] = 2e9;
}
}
for (int i = 0; i < n + 1; ++i) {
if (dat[i]) {
pos.push_back(i);
}
}
m = (int)pos.size();
for (int i = 0; i < m; ++i) {
bfs(i, pos[i]);
}
for (int S = 0; S < (1 << m) - 1; ++S) {
dp[S] = 1e9;
}
dp[(1 << m) - 1] = 0;
for (int S = (1 << m) - 1; S >= 0; --S) {
for (int i = 0; i < m; ++i) {
if ((S >> i) & 1) {
for (int j = 0; j < m; ++j) {
if (i != j && (S >> j) & 1) {
int nS = S ^ (1 << i) ^ (1 << j);
dp[nS] = min(dp[nS], dp[S] + dis[i][j]);
}
}
}
}
}
if (dp[0] == 1e9) {
cout << -1 << endl;
} else {
cout << dp[0] << endl;
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int inf_int = 1e9 + 100;
const long long inf_ll = 1e18;
const double pi = 3.1415926535898;
bool debug = 0;
const int MAXN = 1e4 + 100;
const int LOG = 25;
const int mod = 1e9 + 7;
const int MX = 5e5 + 100;
const long long MOD = 1000000000949747713ll;
bool used[MAXN];
int a[MAXN];
int dis[MAXN];
int d[50][50];
int n, k, l;
void bfs(int st) {
fill(dis, dis + MAXN, inf_int);
dis[st] = 0;
queue<int> q;
q.push(st);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int i = 1; i <= l; ++i) {
int to = v + a[i];
if (to >= 0 && to <= n)
if (dis[to] > dis[v] + 1) {
dis[to] = dis[v] + 1;
q.push(to);
}
}
for (int i = 1; i <= l; ++i) {
int to = v - a[i];
if (to >= 0 && to <= n)
if (dis[to] > dis[v] + 1) {
dis[to] = dis[v] + 1;
q.push(to);
}
}
}
}
int dp[1 << 20];
void solve() {
cin >> n >> k >> l;
for (int i = 1; i <= k; ++i) {
int x;
cin >> x;
used[x] = 1;
}
vector<int> spec;
for (int i = 0; i <= n; ++i) {
if (used[i] != used[i + 1]) spec.push_back(i);
}
for (int i = 1; i <= l; ++i) {
cin >> a[i];
}
k = (int(spec.size()));
if (debug) cout << "K " << k << endl;
for (int i = 0; i < k; ++i) {
bfs(spec[i]);
for (int j = 0; j < k; ++j) {
d[i][j] = dis[spec[j]];
}
assert(d[i][i] == 0);
}
for (int i = 0; i < (1 << k); ++i) dp[i] = inf_int;
dp[0] = 0;
for (int mask = 0; mask < (1 << k); ++mask) {
for (int v = 0; v < k; ++v) {
if (!(mask & (1 << v)))
for (int to = 0; to < k; ++to) {
if (v == to) continue;
if (!(mask & (1 << to))) {
dp[mask | (1 << v) | (1 << to)] =
min(dp[mask | (1 << v) | (1 << to)], dp[mask] + d[v][to]);
}
}
}
}
int all = (1 << k) - 1;
if (dp[all] >= inf_int) {
cout << -1;
return;
}
cout << dp[all];
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.precision(20);
int t = 1;
while (t--) solve();
if (debug)
cerr << endl << "time : " << (1.0 * clock() / CLOCKS_PER_SEC) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, k, l, dat[10005], len[105], dis[25][25], dp[(1 << 20) + 5];
vector<int> pos;
void bfs(int c, int s) {
int dis[10005];
queue<int> q;
for (int i = 0; i < 10005; ++i) {
dis[i] = 1e9;
}
dis[s] = 0;
q.push(s);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = 0; i < l; ++i) {
int v = u - len[i];
if (v >= 0 && dis[u] + 1 < dis[v]) {
dis[v] = dis[u] + 1;
q.push(v);
}
v = u + len[i];
if (v <= n && dis[u] + 1 < dis[v]) {
dis[v] = dis[u] + 1;
q.push(v);
}
}
}
for (int i = 0; i < m; ++i) {
::dis[c][i] = dis[pos[i]];
}
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> k >> l;
for (int i = 0; i < k; ++i) {
int pos;
cin >> pos;
dat[pos] ^= 1;
dat[--pos] ^= 1;
}
for (int i = 0; i < l; ++i) {
cin >> len[i];
}
for (int i = 0; i < 25; ++i) {
for (int j = 0; j < 25; ++j) {
dis[i][j] = 2e9;
}
}
for (int i = 0; i < n + 1; ++i) {
if (dat[i]) {
pos.push_back(i);
}
}
m = (int)pos.size();
for (int i = 0; i < m; ++i) {
bfs(i, pos[i]);
}
for (int S = 0; S < (1 << m) - 1; ++S) {
dp[S] = 1e9;
}
dp[(1 << m) - 1] = 0;
for (int S = (1 << m) - 1; S >= 0; --S) {
for (int i = 0; i < m; ++i) {
if ((S >> i) & 1) {
for (int j = 0; j < m; ++j) {
if (i != j && (S >> j) & 1) {
int nS = S;
nS ^= (1 << i);
nS ^= (1 << j);
if (dis[i][j]) dp[nS] = min(dp[nS], dp[S] + dis[i][j]);
}
}
}
}
}
if (dp[0] == 1e9) {
cout << -1 << endl;
} else {
cout << dp[0] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 10000 + 10, M = 25, INF = 2000 * 1000;
vector<int> adj[N];
int dis[M][M], dp[1 << M], c, d[N];
short mrk[N], dpm[1 << M], mt;
short sit[N];
void bfs(int v) {
int f = sit[v];
queue<int> q;
q.push(v);
d[v] = 0;
mrk[v] = mt;
while (!q.empty()) {
v = q.front();
q.pop();
if (sit[v]) {
int tmp = sit[v];
dis[tmp][f] = dis[f][tmp] = d[v];
}
for (int i = 0; i < (int)(adj[v]).size(); ++i) {
int u = adj[v][i];
if (mrk[u] != mt) {
mrk[u] = mt;
q.push(u);
d[u] = d[v] + 1;
}
}
}
}
int dpf(int x) {
if (!x) return 0;
if (dpm[x]) return dp[x];
dp[x] = INF;
dpm[x] = 1;
bitset<22> num(x);
int s;
for (int i = 0; i < 22; ++i)
if (num[i]) {
s = i;
break;
}
for (int i = s + 1; i < 22; ++i)
if (num[i]) dp[x] = min(dp[x], dpf(x ^ (1 << s) ^ (1 << i)) + dis[s][i]);
return dp[x];
}
void input() {
int n, k, l, t;
cin >> n >> k >> l;
for (int i = 0; i < k; ++i) {
cin >> t;
sit[t] = 1;
}
for (int i = n + 1; i; --i) {
sit[i] ^= sit[i - 1];
if (sit[i]) {
sit[i] = ++c;
}
}
for (int i = 0; i < l; ++i) {
cin >> t;
for (int j = t + 1; j <= n + 1; ++j) {
adj[j].push_back(j - t);
adj[j - t].push_back(j);
}
}
}
int main() {
ios::sync_with_stdio(false);
for (int i = 0; i < M; ++i)
for (int j = 0; j < M; ++j) dis[i][j] = INF;
input();
for (int i = 1; i < N; ++i)
if (sit[i]) {
++mt;
bfs(i);
}
int ans = dpf(2 * ((1 << c) - 1));
if (ans >= INF)
cout << -1 << endl;
else
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 10010;
const int inf = 0x3fffffff;
int dp[1 << 20], w[20][20], d[maxn], x[20], a[100];
inline int rightZeroBit(int mask) {
for (int i = 0;; i++) {
if ((mask & (1 << i)) == 0) return i;
}
return -1;
}
int main() {
int n, k, l;
while (scanf("%d%d%d", &n, &k, &l) == 3) {
for (int i = 0; i < k; i++) scanf("%d", &x[i]);
for (int i = 0; i < l; i++) scanf("%d", &a[i]);
sort(a, a + l);
l = unique(a, a + l) - a;
set<int> iset;
for (int i = 0; i < k; i++) {
pair<set<int>::iterator, bool> p;
p = iset.insert(x[i] - 1);
if (!p.second) iset.erase(p.first);
p = iset.insert(x[i]);
if (!p.second) iset.erase(p.first);
}
k = copy(iset.begin(), iset.end(), x) - x;
for (int i = 0; i < k; i++) {
fill(d, d + n + 1, inf);
d[x[i]] = 0;
priority_queue<pair<int, int> > pq;
pq.push(make_pair(0, x[i]));
while (!pq.empty()) {
int s = pq.top().second;
int t = -pq.top().first;
pq.pop();
if (d[s] != t) continue;
for (int j = 0; j < l; j++) {
if (s - a[j] >= 0 && d[s - a[j]] > t + 1) {
d[s - a[j]] = t + 1;
pq.push(make_pair(-d[s - a[j]], s - a[j]));
}
if (s + a[j] <= n && d[s + a[j]] > t + 1) {
d[s + a[j]] = t + 1;
pq.push(make_pair(-d[s + a[j]], s + a[j]));
}
}
}
for (int j = 0; j < k; j++) w[i][j] = d[x[j]];
}
fill(dp, dp + (1 << k), inf);
dp[0] = 0;
for (int mask = 0; mask < (1 << k); mask++) {
int u = rightZeroBit(mask);
if (u >= k) continue;
for (int v = 0; v < k; v++)
if ((mask & (1 << v)) == 0) {
int _mask = mask ^ (1 << u) ^ (1 << v);
dp[_mask] = min(dp[_mask], dp[mask] + w[u][v]);
}
}
printf("%d\n", dp[(1 << k) - 1] == inf ? -1 : dp[(1 << k) - 1]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, m, dis[25][25], cf[10010], a[10010], cnt = -1, loc[10010], w[10010],
f[(1 << 20) + 10];
void bfs(int s) {
memset(w, 0, sizeof(w));
for (int i = 1; i <= n + 1; i++) w[i] = 0x3f3f3f3f;
queue<int> q;
q.push(s);
w[s] = 0;
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = 1; i <= m; i++) {
int pre = x - a[i], nxt = x + a[i];
if (pre > 0 && w[pre] == 0x3f3f3f3f) w[pre] = w[x] + 1, q.push(pre);
if (nxt <= n + 1 && w[nxt] == 0x3f3f3f3f) w[nxt] = w[x] + 1, q.push(nxt);
}
}
for (int i = 1; i <= n + 1; i++)
if (loc[i] >= 0) dis[loc[s]][loc[i]] = w[i];
}
int main() {
scanf("%d%d%d", &n, &k, &m);
for (int i = 1; i <= k; i++) {
int x;
scanf("%d", &x);
cf[x] = 1;
}
for (int i = 1; i <= m; i++) scanf("%d", &a[i]);
for (int i = n + 1; i; i--) cf[i] ^= cf[i - 1];
memset(loc, -1, sizeof(loc));
for (int i = 1; i <= n + 1; i++)
if (cf[i]) loc[i] = ++cnt;
cnt++;
for (int i = 1; i <= n + 1; i++)
if (cf[i]) bfs(i);
for (int i = 1; i < (1 << cnt); i++) f[i] = 0x3f3f3f3f;
for (int i = 0; i < (1 << cnt); i++) {
if (f[i] == 0x3f3f3f3f) continue;
for (int j = 0; j < cnt; j++) {
if ((i >> j) & 1) continue;
for (int k = j + 1; k < cnt; k++)
if (!((i >> k) & 1))
f[i + (1 << j) + (1 << k)] =
((f[i + (1 << j) + (1 << k)]) < (f[i] + dis[j][k])
? (f[i + (1 << j) + (1 << k)])
: (f[i] + dis[j][k]));
}
}
printf("%d", f[(1 << cnt) - 1] == 0x3f3f3f3f ? -1 : f[(1 << cnt) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &x) {
x = 0;
long long f = 0;
char ch = getchar();
while (!isdigit(ch)) f = ch == '-', ch = getchar();
while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
x = f ? -x : x;
}
const long long N = 1e4 + 5;
long long n, k, l, vis[21][N], dis[21][N], a[N], S[N], tot, f[2000005], b[N],
g[2000005];
inline void BFS(long long s, long long h) {
queue<long long> q;
memset(dis[h], 0x3f, sizeof(dis[h]));
vis[h][s] = 1, dis[h][s] = 0;
q.push(s);
while (!q.empty()) {
long long x = q.front();
q.pop();
for (long long i = 1; i <= k; ++i) {
long long y = x + g[i];
if (y <= n + 1 && !vis[h][y])
dis[h][y] = dis[h][x] + 1, vis[h][y] = 1, q.push(y);
y = x - g[i];
if (y >= 1 && !vis[h][y])
dis[h][y] = dis[h][x] + 1, vis[h][y] = 1, q.push(y);
}
}
}
signed main() {
read(n), read(l), read(k);
for (register long long i = 1; i <= l; ++i) {
long long x;
read(x);
a[++tot] = x;
a[++tot] = x + 1;
}
for (register long long i = 1; i <= k; ++i) read(g[i]);
for (register long long i = 1; i <= tot; ++i) BFS(a[i], i);
memset(f, 0x3f, sizeof(f));
f[0] = 0;
for (signed i = 1; i < (1 << tot); ++i) {
long long num = 0;
for (register long long j = 1; j <= i; j <<= 1)
if (i & j) num++;
if (num & 1) continue;
for (register long long j = 1, p = 1; j <= i; j <<= 1, ++p)
if (i & j)
for (register long long k = 1, q = 1; k <= i; k <<= 1, ++q)
if ((p != q) && (i & k))
f[i] = min(f[i ^ j ^ k] + dis[p][a[q]], f[i]);
}
if (f[(1 << tot) - 1] >= 0x3f3f3f3f)
cout << -1;
else
cout << f[(1 << tot) - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int in() {
int32_t x;
scanf("%d", &x);
return x;
}
inline long long lin() {
long long x;
scanf("%lld", &x);
return x;
}
inline string get() {
char ch[2000010];
scanf("%s", ch);
return ch;
}
inline void read(int *a, int n) {
for (int i = 0; i < n; i++) a[i] = in();
}
template <class blank>
inline void out(blank x) {
cout << x << "\n";
exit(0);
}
template <class blank>
inline void smin(blank &a, blank b) {
a = min(a, b);
}
template <class blank>
inline void smax(blank &a, blank b) {
a = max(a, b);
}
const int maxn = 1e5 + 10;
const int maxm = 1e6 + 10;
const int maxlg = 21;
const int base = 29;
const int mod = 1e9 + 7;
const int inf = 1e9 + 10;
const int SQ = 317;
bool has[maxn];
int a[maxn], di[maxn], h, t, q[maxn], cst[50][50], dp[maxn * 30];
vector<int> vc;
int32_t main() {
int n = in(), k = in(), l = in();
for (int i = 0; i < k; i++) has[in()] = true;
for (int i = 1; i <= n + 1; i++)
if (has[i] != has[i - 1]) vc.push_back(i);
read(a, l);
memset(cst, 63, sizeof cst);
for (int _ = 0; _ < vc.size(); _++) {
int v = vc[_];
memset(di, 63, (n + 2) * sizeof di[0]);
h = t = 0;
di[v] = 0;
q[t++] = v;
while (h < t) {
int v = q[h++];
for (int i = 0; i < l; i++) {
if (v + a[i] >= 1 && v + a[i] <= n + 1 && di[v + a[i]] > di[v] + 1)
di[v + a[i]] = di[v] + 1, q[t++] = v + a[i];
a[i] *= -1;
if (v + a[i] >= 1 && v + a[i] <= n + 1 && di[v + a[i]] > di[v] + 1)
di[v + a[i]] = di[v] + 1, q[t++] = v + a[i];
a[i] *= -1;
}
}
for (int i = 0; i < vc.size(); i++) cst[_][i] = di[vc[i]];
}
memset(dp, 63, sizeof dp);
dp[0] = 0;
int sz = (int)vc.size();
for (int i = 1; i < (1 << sz); i++) {
int f = __builtin_ctz(i & -i);
for (int j = f + 1; j < vc.size(); j++)
if (i & (1 << j))
dp[i] = min(dp[i], dp[i ^ (1 << f) ^ (1 << j)] + cst[f][j]);
}
int mask = (1 << sz) - 1;
if (dp[mask] >= inf)
cout << -1;
else
cout << dp[mask] << "\n";
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
using namespace std;
const int N = 10000 + 10;
const int MOD = 1000000007;
const int LOG = 20;
const int INF = 1000000010;
const int delta = 11353;
int n, k, l, a[N], b[N], X[N], dis[22][N], inv[N], cnt, dp[(1 << 20) + 10];
vector<int> G[N];
inline void BFS(int x) {
for (int i = 0; i < N; i++) dis[x][i] = INF;
dis[x][inv[x]] = 0;
queue<int> q;
q.push(inv[x]);
while (q.size()) {
int fr = q.front();
q.pop();
for (auto u : G[fr]) {
if (dis[x][u] > dis[x][fr] + 1) {
dis[x][u] = dis[x][fr] + 1;
q.push(u);
}
}
}
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k >> l;
for (int i = 1; i <= k; i++) {
int x;
cin >> x;
X[x] = 1;
}
for (int i = 1; i <= l; i++) cin >> a[i];
for (int i = 0; i <= n; i++) {
b[i] = (X[i] != X[i + 1]);
}
for (int i = 0; i <= n; i++) {
for (int j = 1; j <= l; j++) {
if (i - a[j] >= 0) G[i].push_back(i - a[j]), G[i - a[j]].push_back(i);
}
}
for (int i = 0; i <= n; i++) {
if (b[i]) inv[cnt] = i, BFS(cnt), cnt++;
}
fill(dp, (dp + (1 << 20) + 10), INF);
dp[0] = 0;
for (int mask = 1; mask < (1 << cnt); mask++) {
int Fi = -1;
for (int i = 0; i < cnt; i++) {
if (mask & (1 << i)) {
if (Fi == -1)
Fi = i;
else {
dp[mask] =
min(dp[mask], dp[mask ^ (1 << Fi) ^ (1 << i)] + dis[Fi][inv[i]]);
}
}
}
}
cout << (dp[(1 << cnt) - 1] == INF ? -1 : dp[(1 << cnt) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000000;
int a[10000];
int main() {
int n, k, l;
scanf("%d%d%d", &n, &k, &l);
memset(a, 0, sizeof(a));
for (int i = 0; i < k; i++) {
int x;
scanf("%d", &x);
x--;
a[x] = 1;
}
vector<int> pos;
for (int i = n - 1; i > 0; i--)
if (a[i] != a[i - 1]) pos.push_back(i);
if (a[0] == 1) pos.push_back(0);
reverse(pos.begin(), pos.end());
for (int i = 0; i < l; i++) scanf("%d", &a[i]);
vector<vector<int> > dist;
dist.resize(pos.size());
for (int i = 0; i < pos.size(); i++) {
dist[i].assign(n + 1, inf);
dist[i][pos[i]] = 0;
queue<int> q;
q.push(pos[i]);
while (!q.empty()) {
int now = q.front();
q.pop();
for (int j = 0; j < l; j++) {
if (now + a[j] <= n && dist[i][now + a[j]] == inf) {
dist[i][now + a[j]] = dist[i][now] + 1;
q.push(now + a[j]);
}
if (now - a[j] >= 0 && dist[i][now - a[j]] == inf) {
dist[i][now - a[j]] = dist[i][now] + 1;
q.push(now - a[j]);
}
}
}
}
vector<int> f(1 << pos.size(), inf);
f[0] = 0;
for (int i = 0; i < (1 << pos.size()) - 1; i++) {
if (f[i] == inf) continue;
int t = 0;
while (i & 1 << t) t++;
f[i + (1 << t)] = min(f[i + (1 << t)], f[i] + dist[t][n]);
for (int j = 0; j < pos.size(); j++) {
if (j == t || (i & 1 << j) != 0) continue;
int tmp = i + (1 << t) + (1 << j);
f[tmp] = min(f[tmp], f[i] + dist[t][pos[j]]);
}
}
int ans = f[(1 << pos.size()) - 1];
if (ans == inf) ans = -1;
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
const int maxn = 1e4 + 10, maxm = 1e6 + 10, lg = 22, mod = 998244353,
inf = 1e18;
int n, k, l, dis[maxn], dd[lg][lg], dp[(1 << lg)];
bool b[maxn];
vector<int> g[maxn];
void bfs(int src) {
memset(dis, 69, sizeof(dis));
dis[src] = 0;
queue<int> q;
q.push(src);
while (!q.empty()) {
int v = q.front();
q.pop();
for (auto u : g[v])
if (dis[u] >= maxn) dis[u] = dis[v] + 1, q.push(u);
}
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> k >> l;
for (int i = 1; i <= k; i++) {
int x;
cin >> x;
b[x - 1] ^= 1;
b[x] ^= 1;
}
for (int i = 1; i <= l; i++) {
int x;
cin >> x;
for (int j = 0; j + x <= n; j++)
g[j].push_back(j + x), g[j + x].push_back(j);
}
vector<int> o;
for (int i = 0; i <= n; i++)
if (b[i]) o.push_back(i);
for (int i = 0; i < (int)(o.size()); i++) {
bfs(o[i]);
for (int j = 0; j < (int)(o.size()); j++) dd[i][j] = dis[o[j]];
}
memset(dp, 69, sizeof(dp));
dp[0] = 0;
for (int msk = 1; msk < (1 << (int)(o.size())); msk++)
if ((__builtin_popcount(msk)) % 2 == 0) {
int fur = -1;
for (int i = 0; i < (int)(o.size()); i++)
if (msk >> i & 1) {
if (fur == -1) {
fur = i;
continue;
}
if (dd[fur][i] < maxn)
dp[msk] =
min(dp[msk], dp[msk ^ (1 << fur) ^ (1 << i)] + dd[fur][i]);
}
}
if (dp[(1 << (int)(o.size())) - 1] >= mod)
cout << -1;
else
cout << dp[(1 << (int)(o.size())) - 1];
return 0;
}
|
#include <bits/stdc++.h>
int tag[10010];
int len[110];
int q[10010], d[10010];
int g[20][20];
int f[1 << 20];
int a[20];
int L, m, n;
int main() {
int i, j, k;
scanf("%d %d %d", &L, &k, &m);
memset(tag, 0, sizeof(tag));
for (i = 0; i < k; i++) {
scanf("%d", &j);
tag[j] = 1;
}
for (i = 0; i < m; i++) scanf("%d", len + i);
n = 0;
for (i = 0; i <= L; i++)
if (tag[i] != tag[i + 1]) a[n++] = i;
for (k = 0; k < n; k++) {
memset(d, -1, sizeof(d));
int qn = 1;
q[0] = a[k];
d[a[k]] = 0;
for (int p = 0; p < qn; p++) {
int pos = q[p];
for (i = 0; i < m; i++)
for (j = -1; j <= 1; j += 2) {
int newpos = pos + j * len[i];
if (newpos >= 0 && newpos <= L && d[newpos] == -1) {
d[newpos] = d[pos] + 1;
q[qn++] = newpos;
}
}
}
for (i = 0; i < n; i++) g[k][i] = d[a[i]];
}
memset(f, -1, sizeof(f));
f[0] = 0;
for (i = 0; i < (1 << n) - 1; i++)
if (f[i] > -1) {
for (j = 0; j < n && (i & (1 << j)) > 0; j++)
;
for (k = j + 1; k < n; k++)
if ((i & (1 << k)) == 0 && g[j][k] > -1) {
int s = i | (1 << j) | (1 << k);
int v = f[i] + g[j][k];
if (f[s] == -1 || v < f[s]) f[s] = v;
}
}
printf("%d\n", f[(1 << n) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, p, m, x[2333333], a[2333333], fst[2333333], nxt[2333333], vb[2333333],
M = 0, tar[2333333];
bool xx[2333333];
int ys[2333333];
void ad_de(int a, int b) {
++M;
vb[M] = b;
nxt[M] = fst[a];
fst[a] = M;
}
void adde(int a, int b) {
ad_de(a, b);
ad_de(b, a);
}
int dist[1003][10003], ps[2333333], pn = 0, dp[2333333];
template <class T, int siz>
struct sbq {
T st[siz + 3];
int head, tail, fsiz;
void clr() { head = tail = fsiz = 0; }
bool empty() { return fsiz == 0; }
int size() { return fsiz; }
T front() { return st[head]; }
T back() { return st[tail - 1]; }
void push(T x) {
st[tail++] = x;
++fsiz;
}
void pop() {
++head;
--fsiz;
}
};
sbq<int, 100003> q;
void bfs(int a, int* d) {
for (int i = 0; i <= n; i++) d[i] = -1;
d[a] = 0;
q.clr();
q.push(a);
while (!q.empty()) {
int s = q.front();
q.pop();
for (int e = fst[s]; e; e = nxt[e]) {
int b = vb[e];
if (d[b] != -1) continue;
d[b] = d[s] + 1;
q.push(b);
}
}
}
int main() {
scanf("%d%d%d", &n, &p, &m);
for (int i = 1; i <= p; i++) scanf("%d", x + i), xx[x[i]] = 1;
for (int i = 0; i <= n; i++) tar[i] = xx[i] ^ xx[i + 1];
for (int i = 0; i <= n; i++)
if (tar[i]) ps[++pn] = i;
for (int i = 1; i <= m; i++) scanf("%d", a + i);
for (int i = 0; i <= n; i++) {
for (int k = 1; k <= m; k++)
if (i + a[k] <= n) adde(i, i + a[k]);
}
for (int i = 1; i <= pn; i++) bfs(ps[i], dist[i]);
dp[0] = 0;
for (int i = 1; i <= pn; i++) ys[1 << i - 1] = i;
for (int i = 1; i < (1 << pn); i++) {
dp[i] = 2000000000;
int ii = i, cnt = 0;
while (ii) cnt += ii & 1, ii >>= 1;
if (cnt & 1) continue;
int j = pn;
for (; !(i & (1 << j - 1)); --j)
;
for (int k = j - 1; k >= 1; k--) {
if (i & (1 << k - 1))
;
else
continue;
if (dist[j][ps[k]] == -1) continue;
dp[i] = min(dp[i], dp[i ^ (1 << j - 1) ^ (1 << k - 1)] + dist[j][ps[k]]);
}
}
printf("%d\n", (dp[(1 << pn) - 1] == 2000000000) ? -1 : dp[(1 << pn) - 1]);
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long x = 0, w = 0;
char ch = getchar();
while (!isdigit(ch)) w |= ch == '-', ch = getchar();
while (isdigit(ch)) x = (x << 1) + (x << 3) + ch - '0', ch = getchar();
return w ? -x : x;
}
long long cnt[1 << 20], f[1 << 20], dis[310000], l[310000], d[40][40], n, m, k,
vis[310000], loc[310000], tot;
void bfs(long long s) {
memset(dis, 0x3f, sizeof(dis));
queue<long long> q;
q.push(loc[s]);
dis[loc[s]] = 0;
while (!q.empty()) {
long long u = q.front();
q.pop();
for (long long i = 1; i <= k; ++i) {
long long v = u + l[i];
if (v <= n + 1 && dis[v] > dis[u] + 1) {
dis[v] = dis[u] + 1;
q.push(v);
}
v = u - l[i];
if (v >= 1 && dis[v] > dis[u] + 1) {
dis[v] = dis[u] + 1;
q.push(v);
}
}
}
for (long long i = 1; i <= tot; ++i) d[s][i] = dis[loc[i]];
}
signed main() {
n = read(), m = read(), k = read();
for (long long i = 1; i <= m; ++i) {
long long d = read();
vis[d] = 1;
}
for (long long i = 1; i <= n + 1; ++i)
if (vis[i] ^ vis[i - 1]) loc[++tot] = i;
if (tot == 0) {
puts("0");
return 0;
}
for (long long i = 1; i <= k; ++i) l[i] = read();
for (long long i = 1; i <= tot; ++i) bfs(i);
for (long long s = 1; s < (1 << tot); ++s) cnt[s] = cnt[s ^ (s & (-s))] + 1;
memset(f, 0x3f, sizeof(f));
f[0] = 0;
for (long long s = 0; s < (1 << tot); ++s)
if (!(cnt[s] & 1)) {
long long k = ((1 << tot) - 1) ^ s;
if (k == 0) continue;
k = log2(k & (-k)) + 1;
for (long long i = k + 1; i <= tot; ++i)
if (!(s & (1 << i - 1))) {
long long ns = (s | (1 << k - 1) | (1 << i - 1));
f[ns] = min(f[ns], f[s] + d[i][k]);
}
}
printf("%d\n", f[(1 << tot) - 1] >= 0x3f3f3f3f ? -1 : f[(1 << tot) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 10005;
int n, kk, l, a[N], num[N], dis[25][25], id[N], idx, pos[N], d[N], lg[1 << 20];
vector<int> v[N];
void bfs(int pos) {
memset(d, 63, sizeof(d));
d[pos] = 0;
queue<int> q;
q.push(pos);
while (!q.empty()) {
int nd = q.front();
q.pop();
for (auto &i : v[nd])
if (d[i] > d[nd] + 1) d[i] = d[nd] + 1, q.push(i);
}
for (int i = 1; i <= n; i++)
if (id[i] != -1) dis[id[pos]][id[i]] = d[i];
}
int dp[1 << 20];
inline int lowbit(int x) { return x & -x; }
int main() {
ios::sync_with_stdio(false);
cin >> n >> kk >> l;
int tmp;
for (int i = 1; i <= kk; i++) {
cin >> tmp;
num[tmp] ^= 1;
}
for (int i = 1; i <= l; i++) cin >> a[i];
memset(id, -1, sizeof(id));
++n;
for (int i = 1; i <= n; i++) {
if (num[i] ^ num[i - 1]) id[i] = idx, pos[idx] = i, idx++;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= l; j++)
if (i + a[j] <= n) v[i].push_back(i + a[j]), v[i + a[j]].push_back(i);
for (int i = 0; i < idx; i++) bfs(pos[i]);
int lim = 1 << idx;
for (int i = 2; i < lim; i++) lg[i] = lg[i >> 1] + 1;
memset(dp, 63, sizeof(dp));
int inf = dp[0];
dp[0] = 0;
for (int i = 1; i < lim; i++) {
int t = lg[lowbit(i)];
for (int j = t + 1; j < idx; j++)
if (i & (1 << j))
dp[i] = min(dp[i], dp[i ^ (1 << t) ^ (1 << j)] + dis[t][j]);
}
cout << (dp[lim - 1] == inf ? -1 : dp[lim - 1]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int kMaxN = 10000, kMaxK = 10, kMaxM = kMaxK * 2, kMaxL = 100;
int n, k, l, s[kMaxN + 2], t[kMaxN + 1], p[kMaxL];
int m, pos[kMaxM];
int dis[kMaxM][kMaxN + 1];
int Solve(int mask) {
static int memo[1 << kMaxM];
static bool done[1 << kMaxM];
if (done[mask]) return memo[mask];
int &res = memo[mask];
done[mask] = true;
if (mask == 0)
return (res = 0);
else if (__builtin_popcount(mask) == 1)
return (res = -1);
int seq[kMaxM], idx = 0;
int now = mask;
while (now) {
int p = now & -now;
now ^= p;
seq[idx++] = __builtin_ctz(p);
}
res = 0x3f3f3f3f;
for (int i = 0; i < idx - 1; ++i)
for (int j = i + 1; j < idx; ++j) {
int tmp = Solve(mask ^ (1 << seq[i]) ^ (1 << seq[j]));
if (tmp != -1) res = min(res, tmp + dis[seq[i]][pos[seq[j]]]);
}
if (res == 0x3f3f3f3f) res = -1;
return res;
}
int main() {
scanf("%d%d%d", &n, &k, &l);
for (int i = 0, x; i < k; ++i) {
scanf("%d", &x);
s[x] = 1;
}
for (int i = 0; i < l; ++i) scanf("%d", &p[i]);
for (int i = 0; i <= n; ++i) {
t[i] = s[i] ^ s[i + 1];
if (t[i] == 1) pos[m++] = i;
}
memset(dis, 0x3f, sizeof(dis));
for (int i = 0; i < m; ++i) {
dis[i][pos[i]] = 0;
static int q[kMaxN + 1];
int qh = 0, qt = 0;
q[qt++] = pos[i];
while (qh < qt) {
int u = q[qh++];
for (int j = 0; j < l; ++j) {
int v = u + p[j];
if (v <= n && dis[i][v] > dis[i][u] + 1) {
dis[i][v] = dis[i][u] + 1;
q[qt++] = v;
}
v = u - p[j];
if (v >= 0 && dis[i][v] > dis[i][u] + 1) {
dis[i][v] = dis[i][u] + 1;
q[qt++] = v;
}
}
}
}
printf("%d\n", Solve((1 << m) - 1));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 10011;
int n, m, k, L, a[111], b[111];
void init() {
scanf("%d%d%d", &n, &k, &L);
++n;
m = 0;
for (int i = 1; i <= k; ++i) {
int x;
scanf("%d", &x);
a[m++] = x;
a[m++] = x + 1;
}
for (int i = 1; i <= L; ++i) scanf("%d", b + i);
sort(a, a + m);
for (int i = 0; i + 1 < m; ++i)
if (a[i] == a[i + 1]) a[i] = a[i + 1] = n + 1;
sort(a, a + m);
while (m >= 2 && a[m - 1] > n) --m;
}
void bfs(int dis[], int x) {
for (int i = 1; i <= n; ++i) dis[i] = 1e9;
static int q[maxn];
int w = 1;
q[w] = x;
dis[x] = 0;
for (int i = 1; i <= w; ++i) {
int x = q[i];
for (int i = 1; i <= L; ++i)
if (x + b[i] <= n && dis[x + b[i]] == 1e9)
dis[q[++w] = x + b[i]] = dis[x] + 1;
for (int i = 1; i <= L; ++i)
if (x - b[i] >= 1 && dis[x - b[i]] == 1e9)
dis[q[++w] = x - b[i]] = dis[x] + 1;
}
}
int f[1 << 20];
vector<int> V;
int Dis[30][30], dis[30][maxn];
void dfs(int dep, int s) {
if (dep == m) {
f[s] = 1e9;
if (s == 0) f[s] = 0;
if (__builtin_popcount(s) & 1) return;
for (auto x : V)
for (auto y : V)
if (x < y) f[s] = min(f[s], f[s ^ (1 << x) ^ (1 << y)] + Dis[x][y]);
return;
}
dfs(dep + 1, s);
V.push_back(dep);
dfs(dep + 1, s | 1 << dep);
V.pop_back();
}
void work() {
for (int i = 0; i < m; ++i) bfs(dis[i], a[i]);
for (int i = 0; i < m; ++i)
for (int j = i + 1; j < m; ++j) {
Dis[i][j] = 1e9;
for (int k = 1; k <= n; ++k)
Dis[i][j] = min(dis[i][k] + dis[j][k], Dis[i][j]);
Dis[j][i] = Dis[i][j];
}
dfs(0, 0);
printf("%d\n", f[(1 << m) - 1] > 10000000 ? -1 : f[(1 << m) - 1]);
}
int main() {
init();
work();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, m;
int a[40005], l[40005], b[40005], pos[40005], tot, d[50][40005], inq[1 << 20],
f[1 << 20], cnt, head[40005];
struct edge {
int to, nxt, val;
} e[40005 << 1];
inline int read() {
int x = 0, f = 0;
char c = getchar();
while (c > '9' || c < '0') f = c == '-', c = getchar();
while (c >= '0' && c <= '9') x = (x << 1) + (x << 3) + c - '0', c = getchar();
return f ? -x : x;
}
inline void add(int u, int v, int k) {
e[++cnt] = (edge){v, head[u], k}, head[u] = cnt;
e[++cnt] = (edge){u, head[v], k}, head[v] = cnt;
}
inline int minn(int a, int b) { return a < b ? a : b; }
inline void bfs() {
for (int i = 1; i <= tot; ++i) {
d[i][pos[i]] = 0;
queue<int> q;
q.push(pos[i]);
while (q.size()) {
int x = q.front();
q.pop();
inq[x] = 0;
for (int j = 1; j <= m; ++j) {
int o = x + b[j], p = x - b[j];
if (o <= n)
if (d[i][o] > d[i][x] + 1) {
d[i][o] = d[i][x] + 1;
if (!inq[o]) inq[o] = 1, q.push(o);
}
if (p >= 1)
if (d[i][p] > d[i][x] + 1) {
d[i][p] = d[i][x] + 1;
if (!inq[p]) inq[p] = 1, q.push(p);
}
}
}
}
}
inline void spfa() {
queue<int> q;
int N = (1 << tot) - 1;
memset(f, 0x3f3f3f3f, sizeof(f)), f[N] = 0;
q.push(N);
while (q.size()) {
int x = q.front();
q.pop(), inq[x] = 0;
for (int i = 1; i <= tot; ++i) {
int u = 1 << (i - 1);
for (int j = head[i]; j; j = e[j].nxt) {
int v = 1 << (e[j].to - 1), z = x ^ u ^ v;
if ((x & u) && (x & v)) {
if (f[z] > f[x] + e[j].val) {
f[z] = f[x] + e[j].val;
if (!inq[z]) inq[z] = 1, q.push(z);
}
}
}
}
}
}
int main() {
n = read(), ++n, k = read(), m = read(), memset(d, 0x3f3f3f3f, sizeof(d));
int x;
for (int i = 1; i <= k; ++i) x = read(), a[x] = 1;
for (int i = 1; i <= m; ++i) b[i] = read();
for (int i = 1; i <= n; ++i) {
l[i] = a[i] ^ a[i - 1];
if (l[i]) pos[++tot] = i;
}
bfs();
for (int i = 1; i <= tot; ++i)
for (int j = i + 1; j <= tot; ++j) {
int m_in = 0x3f3f3f3f;
for (int u = 1; u <= n; ++u)
if (d[i][u] != 0x3f3f3f3f && d[j][u] != 0x3f3f3f3f)
m_in = minn(d[i][u] + d[j][u], m_in);
if (m_in != 0x3f3f3f3f) add(i, j, m_in);
}
spfa();
printf("%d", f[0] != 0x3f3f3f3f ? f[0] : -1);
return 0;
}
|
#include <bits/stdc++.h>
using std::min;
const int fin = 0, maxn = 10010, maxm = 20;
const int INF = 100000000;
int N, M, P;
int a[maxm], b[maxn];
int q[maxn], d[maxn];
int g[maxm][maxm], f[1 << maxm];
bool c[maxn], v[maxn];
void bfs(int S) {
int i, u, t, head, tail;
head = tail = 1, q[1] = S;
memset(v, 0, sizeof(v));
for (i = 1; i <= N; ++i) d[i] = INF;
v[S] = 1, d[S] = 0;
while (head <= tail) {
u = q[head++];
for (i = 0; i < P; ++i) {
if (t = u - b[i], 1 <= t && t <= N && !v[t])
v[t] = 1, d[t] = d[u] + 1, q[++tail] = t;
if (t = u + b[i], 1 <= t && t <= N && !v[t])
v[t] = 1, d[t] = d[u] + 1, q[++tail] = t;
}
}
}
inline int sol(int S) {
if (!S) return 0;
if (f[S] != -1) return f[S];
int i, j;
f[S] = INF;
for (i = 0; i < M; ++i)
if ((S >> i) & 1)
for (j = 0; j < M; ++j)
if (i != j)
if ((S >> j) & 1)
f[S] = min(f[S], sol(S - (1 << i) - (1 << j)) + g[i][j]);
return f[S];
}
int main() {
if (fin) {
freopen("t.in", "r", stdin);
freopen("t.out", "w", stdout);
}
int i, j, w, all;
scanf("%d%d%d", &N, &M, &P);
while (M--) scanf("%d", &w), c[w] ^= 1, c[w + 1] ^= 1;
for (i = 0; i < P; ++i) scanf("%d", b + i);
for (M = 0, ++N, i = 1; i <= N; ++i)
if (c[i]) a[M++] = i;
for (i = 0; i < M; ++i)
for (bfs(a[i]), j = 0; j < M; ++j) g[i][j] = d[a[j]];
for (all = (1 << M) - 1, i = 1; i <= all; ++i) f[i] = -1;
if (sol(all) == INF)
puts("-1");
else
printf("%d\n", f[all]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29, MAXN = 10000 + 100, MAXK = 10 + 2, MAXL = 100 + 10;
int n, k, l, dist[2 * MAXK][2 * MAXK], pos[2 * MAXK], jump[2 * MAXL];
int memo[1 << 20];
int go(int mask) {
int& res = memo[mask];
if (res != -1) return res;
if (mask == 0) return res = 0;
res = INF;
for (int i = 0; i < (int)(k); i++) {
if (mask & (1 << i)) {
mask ^= (1 << i);
for (int j = 0; j < (int)(k); j++)
if (j != i && (mask & (1 << j)))
res = min(res, go(mask ^ (1 << j)) + dist[i][j]);
return res;
}
}
return res;
}
int bfs_dist[MAXN];
void bfs(int s) {
for (int u = 0; u < (int)(n + 1); u++) bfs_dist[u] = INF;
bfs_dist[s] = 0;
queue<int> q;
q.push(s);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = 0; i < (int)(l); i++) {
int v = u + jump[i];
if (v < 0 || v >= n + 1 || bfs_dist[v] < INF) continue;
bfs_dist[v] = bfs_dist[u] + 1;
q.push(v);
}
}
}
int main() {
cin >> n >> k >> l;
for (int i = 0; i < (int)(k); i++) {
int x;
cin >> x;
pos[2 * i] = x - 1;
pos[2 * i + 1] = x;
}
k *= 2;
for (int i = 0; i < (int)(l); i++) {
int x;
cin >> x;
jump[2 * i] = x;
jump[2 * i + 1] = -x;
}
l *= 2;
for (int i = 0; i < (int)(k); i++) {
bfs(pos[i]);
for (int j = 0; j < (int)(k); j++) dist[i][j] = bfs_dist[pos[j]];
}
for (int i = 0; i < (int)(k); i++) {
for (int j = 0; j < (int)(k); j++) cerr << dist[i][j] << ' ';
cerr << endl;
}
memset(memo, -1, sizeof memo);
int res = go((1 << k) - 1);
if (res == INF)
cout << -1 << endl;
else
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
void chkmin(T1 &x, T2 y) {
if (x > y) x = y;
}
template <typename T1, typename T2>
void chkmax(T1 &x, T2 y) {
if (x < y) x = y;
}
namespace fastio {
char rbuf[1 << 23], *p1 = rbuf, *p2 = rbuf, wbuf[1 << 23], *p3 = wbuf;
inline char getc() {
return p1 == p2 &&
(p2 = (p1 = rbuf) + fread(rbuf, 1, 1 << 23, stdin), p1 == p2)
? -1
: *p1++;
}
inline void putc(char x) { (*p3++ = x); }
template <typename T>
void read(T &x) {
x = 0;
char c = getchar();
T neg = 0;
while (!isdigit(c)) neg |= !(c ^ '-'), c = getchar();
while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
if (neg) x = (~x) + 1;
}
template <typename T>
void recursive_print(T x) {
if (!x) return;
recursive_print(x / 10);
putc(x % 10 ^ 48);
}
template <typename T>
void print(T x) {
if (!x) putc('0');
if (x < 0) putc('-'), x = ~x + 1;
recursive_print(x);
}
template <typename T>
void print(T x, char c) {
if (!x) putc('0');
if (x < 0) putc('-'), x = ~x + 1;
recursive_print(x);
putc(c);
}
void print_final() { fwrite(wbuf, 1, p3 - wbuf, stdout); }
} // namespace fastio
const int MAXN = 1e4;
const int MAXM = 100;
const int MAXK = 20;
const int MAXP = 1 << 20;
const int INF = 0x3f3f3f3f;
int n, k, m, a[MAXN + 5], b[MAXN + 5], l[MAXM + 5], id[MAXN + 5], pos[MAXK + 5];
int dis[MAXN + 5], d[MAXK + 5][MAXK + 5], cnt;
void bfs(int s) {
queue<int> q;
memset(dis, -1, sizeof(dis));
dis[s] = d[id[s]][id[s]] = 0;
q.push(s);
while (!q.empty()) {
int x = q.front();
q.pop();
if (id[x]) d[id[s]][id[x]] = dis[x];
for (int i = 1; i <= m; i++) {
if (x + l[i] <= n + 1) {
if (!~dis[x + l[i]]) dis[x + l[i]] = dis[x] + 1, q.push(x + l[i]);
}
if (x - l[i] >= 1) {
if (!~dis[x - l[i]]) dis[x - l[i]] = dis[x] + 1, q.push(x - l[i]);
}
}
}
}
int dp[MAXP + 5];
int main() {
scanf("%d%d%d", &n, &k, &m);
for (int i = 1, x; i <= k; i++) scanf("%d", &x), a[x] = 1;
for (int i = 1; i <= m; i++) scanf("%d", &l[i]);
for (int i = 1; i <= n + 1; i++) b[i] = a[i] ^ a[i - 1];
for (int i = 1; i <= n + 1; i++)
if (b[i]) id[i] = ++cnt, pos[cnt] = i;
memset(d, 63, sizeof(d));
for (int i = 1; i <= n + 1; i++)
if (id[i]) bfs(i);
memset(dp, 63, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < (1 << cnt); i++) {
if (dp[i] >= INF) continue;
for (int j = 1; j <= cnt; j++)
for (int l = 1; l < j; l++)
if ((~i >> j - 1 & 1) && (~i >> l - 1 & 1))
chkmin(dp[i | (1 << j - 1) | (1 << l - 1)], dp[i] + d[j][l]);
}
printf("%d\n", (dp[(1 << cnt) - 1] >= INF) ? -1 : dp[(1 << cnt) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 10010;
int a[N], del[N], no[N], x_y[N], t[N];
int m, n, k, l, nn;
int f[25][25];
int g[1500000];
bool check[N];
queue<int> q;
int main() {
m = 1;
while (m--) {
scanf("%d%d%d", &n, &k, &l);
memset(a, 0, sizeof(a));
for (int i = 1; i <= k; i++) {
int x;
scanf("%d", &x);
a[x] = (a[x] + 1) % 2;
a[x + 1] = (a[x + 1] + 1) % 2;
}
for (int i = 1; i <= l; i++) scanf("%d", &del[i]);
nn = 0;
memset(no, 0, sizeof(no));
memset(f, -1, sizeof(f));
for (int i = 1; i <= n + 1; i++)
if (a[i]) {
no[i] = ++nn;
x_y[nn] = i;
}
for (int i = 1; i <= nn; i++) {
memset(check, 0, sizeof(check));
t[x_y[i]] = 0;
check[x_y[i]] = 1;
q.push(x_y[i]);
while (!q.empty()) {
int now = q.front();
q.pop();
for (int j = 1; j <= l; j++) {
if (now + del[j] <= n + 1 && check[now + del[j]] == 0) {
check[now + del[j]] = 1;
t[now + del[j]] = t[now] + 1;
if (no[now + del[j]]) f[i][no[now + del[j]]] = t[now + del[j]];
q.push(now + del[j]);
}
if (now - del[j] > 0 && check[now - del[j]] == 0) {
check[now - del[j]] = 1;
t[now - del[j]] = t[now] + 1;
if (no[now - del[j]]) f[i][no[now - del[j]]] = t[now - del[j]];
q.push(now - del[j]);
}
}
}
}
memset(g, -1, sizeof(g));
g[0] = 0;
q.push(0);
while (!q.empty()) {
int now = q.front();
q.pop();
int l = -1;
for (int i = 0; i < nn; i++) {
if ((now & (1 << i)) == 0) {
l = i;
break;
}
}
if (l == -1) continue;
for (int i = l + 2; i <= nn; i++) {
if (f[l + 1][i] == -1) continue;
if (now & (1 << (i - 1))) continue;
int tmp = now;
tmp = tmp ^ (1 << l);
tmp = tmp ^ (1 << (i - 1));
if (g[tmp] == -1) {
g[tmp] = g[now] + f[l + 1][i];
q.push(tmp);
} else
g[tmp] = min(g[tmp], g[now] + f[l + 1][i]);
}
}
printf("%d\n", g[(1 << nn) - 1]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int SIZE = 10010;
int N, K, L;
bool on[SIZE];
vector<int> steps;
vector<int> v;
int dist[22][SIZE];
void bfs(int idx) {
queue<int> q;
q.push(v[idx]);
dist[idx][v[idx]] = 0;
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = 0; i < (int)steps.size(); i++) {
for (int d = -1; d <= 1; d += 2) {
if (x + d * steps[i] <= N && x + d * steps[i] >= 0 &&
dist[idx][x + d * steps[i]] == -1) {
dist[idx][x + d * steps[i]] = 1 + dist[idx][x];
q.push(x + d * steps[i]);
}
}
}
}
}
int table[1 << 20];
int get(int mask) {
if (!mask) return 0;
if (table[mask] != -1) return table[mask];
int i = log2(mask & -mask);
int mm = mask & (~(1 << i));
int r = INF;
for (int j = i + 1; j < (int)v.size(); j++) {
if ((mask >> j) & 1) {
int current = dist[i][v[j]];
if (current == -1) continue;
current += get(mm & (~(1 << j)));
r = min(r, current);
}
}
return table[mask] = r;
}
int main() {
cin >> N >> K >> L;
for (int i = 0; i < K; i++) {
int x;
cin >> x;
on[x] = true;
}
for (int i = 0; i <= N; i++)
if (on[i] != on[i + 1]) v.push_back(i);
for (int i = 0; i < L; i++) {
int x;
cin >> x;
steps.push_back(x);
}
memset(dist, -1, sizeof dist);
for (int i = 0; i < (int)v.size(); i++) bfs(i);
memset(table, -1, sizeof table);
int r = get((1 << v.size()) - 1);
if (r < INF) assert(v.size() % 2 == 0);
cout << (r >= INF ? -1 : r) << endl;
return 0;
}
|
#include <bits/stdc++.h>
int n, k, l, x, t, p, c[10100], d[10100], q[10100], a[10100], g[30][10100],
h[10100], f[2000000];
int main() {
scanf("%d%d%d", &n, &k, &l);
for (int i = 0; i < k; i++) scanf("%d", &x), c[x] = 1;
for (int i = 0; i < l; i++) scanf("%d", a + i);
for (int i = 0; i < n + 1; i++)
if (c[i] ^= c[i + 1]) {
memset(d, 0, sizeof(d));
q[(t = 1) - 1] = i;
d[i] = 1;
for (int j = 0; j < t; j++)
for (int k = 0; k < l; k++) {
if (q[j] >= a[k] && !d[q[j] - a[k]])
d[q[t++] = q[j] - a[k]] = d[q[j]] + 1;
if (q[j] + a[k] <= n && !d[q[j] + a[k]])
d[q[t++] = q[j] + a[k]] = d[q[j]] + 1;
}
for (int j = 0; j < n + 1; j++) g[p][j] = d[j] ? d[j] - 1 : 0x30303030;
h[p++] = i;
}
memset(f, 0x30, sizeof(f));
f[0] = 0;
for (int i = 0; i < (1 << p); i++)
for (int j = 0; j < p; j++)
if ((~i >> j) & 1)
for (int k = j + 1; k < p; k++)
if ((~i >> k) & 1)
f[i | (1 << j) | (1 << k)] =
std::min(f[i | (1 << j) | (1 << k)], f[i] + g[j][h[k]]);
printf("%d\n", f[(1 << p) - 1] < 100000000 ? f[(1 << p) - 1] : -1);
}
|
#include <bits/stdc++.h>
using namespace std;
const int V = 20, N = 10005, INF = 1000005;
int n, m, k, x, cnt = 0;
bool a[N] = {};
int len[N] = {};
int d[V][N] = {};
int p[V] = {};
int ans[1 << V] = {};
int act[2] = {1, -1};
int last(int x) {
int i = 0;
while (!(x & 1)) {
x >>= 1;
i++;
}
return i;
}
void bfs(int v) {
queue<int> q;
q.push(p[v]);
d[v][p[v]] = 0;
while (!q.empty()) {
int u = q.front();
for (int i = 0; i < k; i++) {
for (int t = 0; t < 2; t++) {
int j = u + act[t] * len[i];
if (j >= 0 && j <= n && d[v][j] > d[v][u] + 1 && j != p[v]) {
d[v][j] = d[v][u] + 1;
q.push(j);
}
}
}
q.pop();
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> k;
for (int i = 0; i < m; i++) {
cin >> x;
a[x] = true;
}
for (int i = 0; i < k; i++) {
cin >> len[i];
}
for (int i = 0; i <= n; i++) {
if (a[i] != a[i + 1]) {
p[cnt++] = i;
}
}
for (int i = 0; i < V; i++) {
for (int j = 0; j < N; j++) {
d[i][j] = INF;
}
}
for (int i = 0; i < cnt; i++) {
bfs(i);
}
for (int i = 1; i < 1 << cnt; i++) {
int v = last(i);
ans[i] = INF;
for (int j = 0; j < cnt; j++) {
if (((i >> j) & 1) && j != v)
ans[i] = min(ans[i], ans[i ^ (1 << v) ^ (1 << j)] + d[v][p[j]]);
}
}
cout << (ans[(1 << cnt) - 1] < INF ? ans[(1 << cnt) - 1] : -1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int nbElem, nbDef, nbScope;
cin >> nbElem >> nbDef >> nbScope;
vector<bool> orig(nbElem + 2);
for (int iDef = 0; iDef < nbDef; ++iDef) {
int pos;
cin >> pos;
orig[pos] = true;
}
vector<int> scopes;
for (int iScope = 0; iScope < nbScope; ++iScope) {
int x;
cin >> x;
scopes.push_back(x);
scopes.push_back(-x);
}
vector<vector<int>> dis(nbElem + 1);
auto bfs = [&](int source) {
dis[source].assign(nbElem + 1, 1e9);
vector<int> &dist = dis[source];
queue<int> qq;
dist[source] = 0;
qq.push(source);
while (!qq.empty()) {
int node = qq.front();
qq.pop();
for (int scope : scopes) {
int neighbour = node + scope;
if (0 <= neighbour && neighbour < nbElem + 1 &&
dist[node] + 1 < dist[neighbour]) {
dist[neighbour] = dist[node] + 1;
qq.push(neighbour);
}
}
}
};
vector<int> tokens;
for (int pos = 0; pos < nbElem + 1; ++pos) {
if (orig[pos] ^ orig[pos + 1]) {
tokens.push_back(pos);
bfs(pos);
}
}
int nbToken = ((int)((tokens).size()));
vector<int> dp(1 << nbToken, 1e9);
dp[0] = 0;
for (int mask = 1; mask < (1 << nbToken); ++mask) {
int fi = -1;
for (int iToken = 0; iToken < nbToken; ++iToken) {
if (!(mask & (1 << iToken))) continue;
if (fi == -1) {
fi = iToken;
continue;
}
int suiv = mask ^ (1 << fi) ^ (1 << iToken);
int u1 = tokens[fi], u2 = tokens[iToken];
dp[mask] = min(dp[mask], dp[suiv] + dis[u1][u2]);
}
}
int res = dp[(1 << nbToken) - 1];
cout << (res < 1e9 ? res : -1) << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 10;
const int P = 1048576 + 10;
const int Y = 30;
int vis[N];
int cnt;
int book[N];
int a[N];
int n;
int m;
int k;
int add[Y][Y];
int dis[N];
int dp[P];
queue<int> q;
inline void bfs(int s) {
for (int i = 1; i <= n + 1; i++) dis[i] = 0x3f3f3f3f;
dis[s] = 0;
int now;
int i = 1;
for (q.push(s); !q.empty();) {
for (now = q.front(), q.pop(), i = 1; i <= m; i++) {
if (now + a[i] <= n + 1 && dis[now + a[i]] == 0x3f3f3f3f) {
dis[now + a[i]] = dis[now] + 1;
q.push(now + a[i]);
}
if (now - a[i] >= 1 && dis[now - a[i]] == 0x3f3f3f3f) {
dis[now - a[i]] = dis[now] + 1;
q.push(now - a[i]);
}
}
}
for (int i = 1; i <= n + 1; i++) {
if (vis[i] != -1) {
add[vis[s]][vis[i]] = dis[i];
}
}
}
int main() {
scanf("%d%d%d", &n, &k, &m);
for (int i = 1, t; i <= k; i++) {
scanf("%d", &t);
book[t] = 1;
}
for (int i = 1; i <= m; i++) scanf("%d", &a[i]);
for (int i = n + 1; i >= 1; i--) book[i] ^= book[i - 1];
cnt = -1;
for (int i = 1; i <= n + 1; i++) vis[i] = -1;
for (int i = 1; i <= n + 1; i++)
if (book[i]) vis[i] = ++cnt;
for (int i = 1; i <= n + 1; i++)
if (book[i]) bfs(i);
for (int i = 1; i < (1 << (cnt + 1)); i++) dp[i] = 0x3f3f3f3f;
for (int i = 0; i < (1 << (cnt + 1)); i++) {
if (dp[i] == 0x3f3f3f3f) continue;
for (int j = 0; j <= cnt; j++) {
if ((i >> j) & 1) continue;
for (int k = j + 1; k <= cnt; k++)
if (((i >> k) & 1) == 0)
dp[i + (1 << j) + (1 << k)] =
min(dp[i + (1 << j) + (1 << k)], dp[i] + add[j][k]);
}
}
int ans = dp[(1 << (cnt + 1)) - 1];
printf("%d", (ans == 0x3f3f3f3f) ? -1 : ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int dist[10010], DD[30][30];
int s[10010];
vector<int> all;
vector<int> a;
queue<int> q;
int dp[1 << 20];
int n;
void calc(int x) {
memset(dist, -1, sizeof(dist));
q.push(x), dist[x] = 0;
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = 0; i < all.size(); i++) {
int del = all[i];
if (x - del > 0 && dist[x - del] == -1) {
dist[x - del] = dist[x] + 1;
q.push(x - del);
}
if (x + del <= n + 1 && dist[x + del] == -1) {
dist[x + del] = dist[x] + 1;
q.push(x + del);
}
}
}
}
void chmin(int &x, int y) { x = min(x, y); }
int main() {
int k, l;
scanf("%d%d%d", &n, &k, &l);
for (int i = 0; i < k; i++) {
int x;
scanf("%d", &x);
s[x] = 1;
}
while (l--) {
int x;
scanf("%d", &x);
all.push_back(x);
}
for (int i = n + 1; i >= 1; i--) {
s[i] ^= s[i - 1];
}
for (int i = 1; i <= n + 1; i++) {
if (s[i]) a.push_back(i);
}
for (int i = 0; i < a.size(); i++) {
int x = a[i];
calc(x);
for (int j = 0; j < a.size(); j++) {
DD[i][j] = dist[a[j]];
}
}
int N = a.size();
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for (int mask = 0; mask < (1 << N) - 1; mask++) {
if (dp[mask] == INF) continue;
int x = 0;
while (mask >> x & 1) x++;
for (int y = x + 1; y < N; y++) {
if (mask >> y & 1) continue;
if (DD[x][y] == -1) continue;
chmin(dp[mask | 1 << x | 1 << y], dp[mask] + DD[x][y]);
}
}
printf("%d\n", dp[(1 << N) - 1] == INF ? -1 : dp[(1 << N) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k, l;
long long a[2002];
long long L[2002];
long long ons[10005];
long long m;
vector<long long> b;
long long d[50][50];
const long long inf = 1e16;
void bfs(long long id) {
for (long long i = 0; i < m; i++) d[id][i] = inf;
queue<long long> q;
q.push(b[id]);
vector<long long> dist(n + 5, inf);
dist[b[id]] = 0;
d[id][id] = 0;
while (q.empty() == false) {
long long u = q.front();
q.pop();
for (long long i = 1; i <= l; i++) {
long long fr = u + L[i];
long long bk = u - L[i];
if (fr <= n) {
if (dist[fr] == inf) {
dist[fr] = dist[u] + 1;
q.push(fr);
}
}
if (bk >= 0) {
if (dist[bk] == inf) {
dist[bk] = dist[u] + 1;
q.push(bk);
}
}
}
}
for (long long i = 0; i < m; i++) {
d[id][i] = dist[b[i]];
}
}
long long dp[1LL << 21];
int main() {
cin >> n >> k >> l;
for (long long i = 1; i <= k; i++) {
cin >> a[i];
ons[a[i]] = 1;
}
for (long long i = 1; i <= l; i++) cin >> L[i];
for (long long i = 0; i <= n; i++) {
if (ons[i] != ons[i + 1]) {
b.push_back(i);
}
}
m = b.size();
for (long long i = 0; i < m; i++) {
bfs(i);
}
dp[0] = 0;
long long lim = (1LL << m) - 1;
for (long long i = 1; i <= lim; i++) {
long long cnt = __builtin_popcountll(i);
if (cnt % 2 == 1) {
dp[i] = inf;
continue;
}
dp[i] = inf;
long long j = 0;
while (((i >> j) & 1) == 0) j++;
long long hh = j;
j++;
for (; j < m; j++) {
if ((i >> j) & 1) {
long long nw = i ^ (1LL << hh);
nw = nw ^ (1LL << j);
dp[i] = min(dp[i], dp[nw] + min(d[hh][j], d[j][hh]));
}
}
}
if (dp[lim] >= inf) dp[lim] = -1;
cout << dp[lim] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1E4 + 10;
bool st[MAXN];
int n, k, l, f[1 << 20], dis[25][25], id[MAXN], d[MAXN], tot;
vector<int> g[MAXN];
queue<int> q;
inline void add(int u, int v) {
g[u].push_back(v);
g[v].push_back(u);
}
void bfs(int s) {
memset(d, 0x3f, sizeof d);
d[s] = 0;
q.push(s);
while (!q.empty()) {
int x = q.front();
q.pop();
for (int v : g[x])
if (d[v] == 0x3f3f3f3f) {
d[v] = d[x] + 1;
q.push(v);
}
}
for (int i = 1; i <= n; i++)
if (id[i]) dis[id[i]][id[s]] = min(dis[id[i]][id[s]], d[i]);
}
int main() {
scanf("%d%d%d", &n, &k, &l);
for (int i = 1, x; i <= k; i++) {
scanf("%d", &x);
st[x - 1] ^= 1;
st[x] ^= 1;
}
for (int i = 0; i <= n; i++)
if (st[i]) id[i] = ++tot;
for (int i = 1, x; i <= l; i++) {
scanf("%d", &x);
for (int j = 1; j <= n - x + 1; j++) add(j - 1, j + x - 1);
}
memset(dis, 0x3f, sizeof dis);
for (int i = 0; i <= n; i++)
if (id[i]) bfs(i);
memset(f, 0x3f, sizeof f);
f[0] = 0;
for (int s = 1; s < (1 << tot); s++)
for (int i = 0; i < tot; i++)
if ((s >> i) & 1)
for (int j = 0; j < tot; j++)
if ((s >> j) & 1)
f[s] = min(f[s], f[s ^ (1 << i) ^ (1 << j)] + dis[i + 1][j + 1]);
if (f[(1 << tot) - 1] == 0x3f3f3f3f)
puts("-1");
else
printf("%d\n", f[(1 << tot) - 1]);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k, l;
cin >> n >> k >> l;
vector<int> x(k), a(l);
for (int i = 0; i < k; i++) cin >> x[i];
for (int i = 0; i < l; i++) cin >> a[i];
for (int i = 0; i < l; i++) a.push_back(-a[i]);
map<int, vector<int> > reach;
{
vector<int> bases;
for (auto c : x) {
bases.push_back(c - 1);
bases.push_back(c);
}
for (auto b : bases) {
vector<int> cost(n + 1, 1000000000);
vector<int> front(1, b);
cost[b] = 0;
for (size_t i = 0; i < front.size(); i++) {
for (auto mov : a) {
int next = front[i] + mov;
if (next >= 0 && next <= n && cost[next] > cost[front[i]] + 1) {
cost[next] = cost[front[i]] + 1;
front.push_back(next);
}
}
}
reach[b] = cost;
}
}
int result = 1000000000;
for (int orient = 0; orient < (1 << k); orient++) {
vector<bool> dir(k);
for (int i = 0; i < k; i++) dir[i] = ((orient & (1 << i)) != 0);
vector<int> dp(1 << k, 1000000000);
dp[0] = 0;
for (int comb = 0; comb < (1 << k) - 1; comb++) {
if (dp[comb] == 1000000000) continue;
int cind = 0;
for (int i = 0; i < k; i++)
if ((comb & (1 << i)) != 0) cind++;
int cur = x[cind];
for (int j = 0; j < k; j++)
if ((comb & (1 << j)) == 0)
dp[comb + (1 << j)] =
min(dp[comb + (1 << j)],
dp[comb] + reach[cur - 1 + dir[cind]][x[j] - dir[j]]);
}
result = min(result, dp[(1 << k) - 1]);
}
if (result == 1000000000)
cout << "-1\n";
else
cout << result << '\n';
return 0;
}
|
#include <bits/stdc++.h>
const int INF = 1000000666;
int n, k, l;
std::vector<std::vector<int> > g;
int dist[20][20];
int distance[10005];
void bfs(int start) {
for (int i = 0; i < (10005); ++i) distance[i] = INF;
distance[start] = 0;
std::queue<int> que;
que.push(start);
while ((int)(que).size()) {
int v = que.front();
que.pop();
for (auto &ch : g[v]) {
if (distance[ch] == INF) {
distance[ch] = distance[v] + 1;
que.push(ch);
}
}
}
}
long long dp[1 << 20];
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
std::cin >> n >> k >> l;
std::vector<bool> need(n + 1);
for (int i = 0; i < (k); ++i) {
int a;
std::cin >> a;
need[a] = true;
}
std::vector<int> mv;
for (int i = 0; i < (l); ++i) {
int a;
std::cin >> a;
mv.push_back(a);
}
need.push_back(false);
std::vector<int> A(n + 2);
std::vector<int> bad;
for (int i = (1); i < (n + 2); ++i) {
if (need[i] != need[i - 1]) A[i] = 1, bad.push_back(i);
}
g.resize(n + 2);
for (auto &jump : mv) {
for (int j = (1); j < (n + 2); ++j) {
if (j + jump > n + 1) break;
g[j].push_back(j + jump);
g[j + jump].push_back(j);
}
}
assert((int)(bad).size() <= 20);
for (int i = 0; i < ((int)(bad).size()); ++i) {
bfs(bad[i]);
for (int j = (i + 1); j < ((int)(bad).size()); ++j)
dist[i][j] = dist[j][i] = distance[bad[j]];
}
for (int i = 0; i < (1 << (int)(bad).size()); ++i) dp[i] = INF;
dp[0] = 0;
for (int mask = (1); mask < (1 << (int)(bad).size()); ++mask)
if (__builtin_popcount(mask) % 2 == 0) {
int fs = -1;
for (int i = 0; i < ((int)(bad).size()); ++i) {
if (mask & (1 << i)) {
fs = i;
break;
}
}
for (int i = 0; i < ((int)(bad).size()); ++i)
if ((mask & (1 << i)) && fs != i) {
dp[mask] =
std::min(dp[mask ^ (1 << fs) ^ (1 << i)] + dist[fs][i], dp[mask]);
}
}
std::cout << (dp[(1 << (int)(bad).size()) - 1] >= INF
? -1
: dp[(1 << (int)(bad).size()) - 1])
<< "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 10005, M = 105, K = (1 << 20) + 5, INF = 0x3f3f3f3f;
int n, m, kk, tot = -1;
int s[N], a[N], dis[M][M], size[M], f[K], d[N];
queue<int> q;
void bfs(int id) {
memset(d, 0x3f, sizeof(d));
d[id] = 0;
q.push(id);
while (!q.empty()) {
int t = q.front();
q.pop();
for (int i = 1; i <= m; i++) {
if (t + size[i] <= n + 1 && d[t + size[i]] == INF) {
d[t + size[i]] = d[t] + 1;
q.push(t + size[i]);
}
if (t - size[i] >= 1 && d[t - size[i]] == INF) {
d[t - size[i]] = d[t] + 1;
q.push(t - size[i]);
}
}
}
for (int i = 1; i <= n + 1; i++) {
if (s[i]) {
dis[s[id]][s[i]] = d[i];
}
}
}
int main() {
memset(f, 0x3f, sizeof(f));
memset(s, -1, sizeof(s));
f[0] = 0;
scanf("%d%d%d", &n, &kk, &m);
for (int i = 1; i <= kk; i++) {
int x;
scanf("%d", &x);
a[x] = 1;
}
for (int i = 1; i <= m; i++) scanf("%d", &size[i]);
for (int i = n + 1; i >= 1; i--) a[i] ^= a[i - 1];
for (int i = 1; i <= n + 1; i++) {
if (a[i]) s[i] = ++tot;
}
for (int i = 1; i <= n + 1; i++) {
if (a[i]) bfs(i);
}
for (int i = 0; i < (1 << tot + 1); i++) {
if (f[i] == 0x3f3f3f3f) continue;
for (int j = 0; j <= tot; j++) {
if ((i >> j) & 1) continue;
for (int k = j + 1; k <= tot; k++) {
if (!((i >> k) & 1)) {
int t = i ^ (1 << j) ^ (1 << k);
f[t] = min(f[t], f[i] + dis[j][k]);
}
}
}
}
if (f[(1 << tot + 1) - 1] == INF)
printf("-1");
else
printf("%d", f[(1 << tot + 1) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
template <class T>
bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
using namespace std;
using ll = long long;
const int inf = 1 << 20;
const int nmax = 10010;
bool a[nmax], b[nmax];
int c[110];
vector<int> graph[nmax];
vector<int> idx;
int dist[nmax];
int cost[25][25];
void bfs(int n) {
for (int i = int(0); i < int(n); ++i) {
fill(dist, dist + nmax, inf);
queue<int> q;
dist[idx[i]] = 0, q.push(idx[i]);
while (!q.empty()) {
int v = q.front();
q.pop();
for (auto &v2 : graph[v])
if (chmin(dist[v2], dist[v] + 1)) q.push(v2);
}
for (int j = int(0); j < int(n); ++j) cost[i][j] = dist[idx[j]];
}
}
int dp[1 << 20];
int main(void) {
int n, k, l;
cin >> n >> k >> l;
for (int i = int(0); i < int(k); ++i) {
int in;
cin >> in;
a[in] = 1;
}
for (int i = int(0); i < int(n + 1); ++i)
if (a[i] ^ a[i + 1]) idx.push_back(i);
for (int i = int(0); i < int(l); ++i) cin >> c[i];
for (int i = int(0); i < int(n); ++i) {
for (int j = int(0); j < int(l); ++j)
if (i + c[j] <= n) {
graph[i].push_back(i + c[j]);
graph[i + c[j]].push_back(i);
}
}
int m = idx.size();
bfs(m);
fill(dp, dp + (1LL << m), inf), dp[0] = 0;
for (int mask = int(0); mask < int((1LL << m)); ++mask)
for (int j = int(0); j < int(m); ++j)
for (int i = int(0); i < int(j); ++i) {
if ((mask & (1LL << i)) == 0) continue;
if ((mask & (1LL << j)) == 0) continue;
int pmask = mask ^ (1LL << i) ^ (1LL << j);
chmin(dp[mask], dp[pmask] + cost[i][j]);
}
int ans = dp[(1LL << m) - 1];
if (ans >= inf)
cout << -1 << endl;
else
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long num;
vector<long long> len;
vector<long long> vec;
long long dis[21][21];
long long dp[1 << 21];
long long dfs[10005];
bool delim[10005];
long long n, k, l;
int recur(long long mask) {
long long &res = dp[mask];
if (res != -1) return res;
vector<int> bits;
for (long long i = 0; i < ((long long)((long long)vec.size())); i++)
if (mask & (1 << i)) bits.push_back(i);
for (long long i = 0; i < ((long long)((long long)bits.size())); i++)
if (i > 0) {
long long tmp = recur(mask ^ (1 << bits[0]) ^ (1 << bits[i]));
long long t = dis[bits[0]][bits[i]];
if (tmp != -2 && t != -1)
res = (res == -1) ? (tmp + t) : min(res, tmp + t);
}
if (res == -1) res = -2;
return res;
}
int main() {
for (long long i = 0; i < ((long long)10005); i++) delim[i] = false;
cin >> n >> k >> l;
for (long long i = 0; i < ((long long)k); i++) {
long long tmp;
cin >> tmp;
delim[tmp] = !delim[tmp];
delim[tmp - 1] = !delim[tmp - 1];
}
for (long long i = 0; i < ((long long)l); i++) {
long long tmp;
cin >> tmp;
len.push_back(tmp);
}
for (long long i = 0; i < ((long long)10005); i++)
if (delim[i]) vec.push_back(i);
for (long long i = 0; i < ((long long)((long long)vec.size())); i++) {
for (long long j = 0; j < ((long long)10005); j++) dfs[j] = -1;
dfs[vec[i]] = 0;
queue<int> q;
q.push(vec[i]);
while (((long long)q.size())) {
long long tmp = q.front();
q.pop();
for (long long j = 0; j < ((long long)((long long)len.size())); j++) {
if (len[j] + tmp <= n && dfs[len[j] + tmp] == -1) {
dfs[len[j] + tmp] = dfs[tmp] + 1;
q.push(len[j] + tmp);
}
if (tmp - len[j] >= 0 && dfs[tmp - len[j]] == -1) {
dfs[tmp - len[j]] = dfs[tmp] + 1;
q.push(tmp - len[j]);
}
}
}
for (long long j = 0; j < ((long long)((long long)vec.size())); j++)
dis[i][j] = dfs[vec[j]];
}
for (long long i = 0; i < ((long long)1 << 21); i++) dp[i] = -1;
dp[0] = 0;
long long tmp = recur((1 << ((long long)vec.size())) - 1);
cout << ((tmp == -2) ? -1 : tmp) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, m, a[10012], b[10012], len[10012];
int pos[10012], tot, mn[102][102];
long long dp[1100000];
queue<int> q;
int main() {
scanf("%d%d%d", &n, &k, &m);
for (int i = 1; i <= k; i++) {
int x;
scanf("%d", &x);
a[x] ^= 1;
a[x + 1] ^= 1;
}
for (int i = 1; i <= n + 1; i++)
if (a[i]) pos[++tot] = i;
for (int i = 1; i <= m; i++) scanf("%d", &b[i]);
for (int i = 1; i <= tot; i++) {
for (int j = 1; j <= n + 1; j++) len[j] = 1e9;
len[pos[i]] = 0;
q.push(pos[i]);
while (!q.empty()) {
int a1 = q.front();
q.pop();
for (int j = 1; j <= m; j++) {
if (a1 > b[j]) {
int to = a1 - b[j];
if (len[to] > len[a1] + 1) len[to] = len[a1] + 1, q.push(to);
}
if (a1 + b[j] <= n + 1) {
int to = a1 + b[j];
if (len[to] > len[a1] + 1) len[to] = len[a1] + 1, q.push(to);
}
}
}
for (int j = 1; j <= tot; j++) mn[i][j] = len[pos[j]];
}
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for (int i = 1; i <= (1 << tot); i++) {
for (int j = 1; j <= tot; j++)
if (i & (1 << (j - 1))) {
for (int ii = j + 1; ii <= tot; ii++)
if (i & (1 << (ii - 1))) {
if (mn[j][ii] < 1e9) {
dp[i] = min(dp[i],
dp[i ^ (1 << (j - 1)) ^ (1 << (ii - 1))] + mn[j][ii]);
}
}
}
}
if (dp[(1 << tot) - 1] > 1e18)
puts("-1");
else
printf("%lld\n", dp[(1 << tot) - 1]);
}
|
#include <bits/stdc++.h>
using namespace std;
int read() {
int s = 0, w = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
return s * w;
}
priority_queue<pair<int, int>, vector<pair<int, int> >,
greater<pair<int, int> > >
q;
int n, k, l, wa[10010], v[10010], d[10010], p[30], D[30][30], f[1100000], dot,
a[110], lg[1100000];
signed main() {
int x;
n = read(), k = read(), l = read();
while (k--) {
x = read();
if (!wa[x]) wa[x] = 1, v[x] ^= 1, v[x + 1] ^= 1;
}
for (int i = 1; i <= n + 1; i++)
if (v[i]) p[++dot] = i, lg[1 << (dot - 1)] = dot - 1;
for (int i = 1; i <= l; i++) a[i] = read();
for (int s = 1; s <= dot; s++) {
memset(d, 0x3f, sizeof(d)), memset(v, 0, sizeof(v)),
d[p[s]] = 0, q.push(make_pair(0, p[s]));
while (!q.empty()) {
int x = q.top().second;
q.pop();
if (v[x]) continue;
v[x] = 1;
for (int i = 1; i <= l; i++) {
if (x + a[i] <= n + 1 && d[x + a[i]] > d[x] + 1)
d[x + a[i]] = d[x] + 1, q.push(make_pair(d[x + a[i]], x + a[i]));
if (x - a[i] >= 1 && d[x - a[i]] > d[x] + 1)
d[x - a[i]] = d[x] + 1, q.push(make_pair(d[x - a[i]], x - a[i]));
}
}
for (int i = 1; i <= dot; i++) D[s][i] = d[p[i]];
}
memset(f, 0x3f, sizeof(f)), f[0] = 0;
for (int i = 1; i < 1 << dot; i++)
for (int j = lg[i & -i] + 1; j < dot; j++)
if ((i >> j) & 1)
f[i] = min(f[i], f[i ^ (1 << lg[i & -i]) ^ (1 << j)] +
D[lg[i & -i] + 1][j + 1]);
printf("%d\n", f[(1 << dot) - 1] == 0x3f3f3f3f ? -1 : f[(1 << dot) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, k, num[100005], tmp, sz[105], f[1048578], d[25][25];
bool flag[100005], vis[100005];
int q[100005], l, r, dis[100005];
int main() {
scanf("%d%d%d", &n, &k, &m);
for (int i = 1, a; i <= k; ++i) {
scanf("%d", &a);
flag[a] = 1;
}
for (int i = 1; i <= m; ++i) scanf("%d", &sz[i]);
for (int i = 0; i <= n; ++i)
if (flag[i] != flag[i + 1]) num[tmp++] = i;
for (int i = 0, u, p; i < tmp; ++i) {
memset(dis, 0x3f3f3f3f, sizeof dis);
l = r = 0;
q[++r] = num[i];
dis[num[i]] = 0;
while (l < r) {
u = q[++l];
vis[u] = 0;
for (int j = 1; j <= m; ++j) {
p = u + sz[j];
if (p <= n && dis[p] > dis[u] + 1) {
dis[p] = dis[u] + 1;
if (!vis[p]) {
q[++r] = p;
vis[p] = 1;
}
}
p = u - sz[j];
if (p >= 0 && dis[p] > dis[u] + 1) {
dis[p] = dis[u] + 1;
if (!vis[p]) {
q[++r] = p;
vis[p] = 1;
}
}
}
}
for (int j = 0; j < tmp; ++j) d[i][j] = dis[num[j]];
}
memset(f, 0x3f3f3f3f, sizeof f);
int End = 1 << tmp;
f[0] = 0;
for (int s = 0, ss; s < End; ++s)
if (f[s] != 0x3f3f3f3f)
for (int i = 0; i < tmp; ++i)
if (!(s & (1 << i))) {
for (int j = i + 1; j < tmp; ++j)
if (!(s & (1 << j))) {
ss = s | (1 << i) | (1 << j);
f[ss] = min(f[ss], f[s] + d[i][j]);
}
break;
}
if (f[End - 1] != 0x3f3f3f3f)
printf("%d\n", f[End - 1]);
else
puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 30000;
int q[maxn], val[maxn], b[maxn], n, k, l, dp[1 << 21], D[21][21], dist[maxn];
vector<int> g[maxn], ones;
int main() {
scanf("%d%d%d", &n, &k, &l);
for (int i = 0; i < k; ++i) {
int x;
scanf("%d", &x);
val[x] = 1;
}
for (int i = 0; i <= n; ++i) b[i] = (val[i] != val[i + 1]);
for (int i = 0; i < l; ++i) {
int x;
scanf("%d", &x);
for (int i = 0; i + x <= n; ++i) {
g[i].push_back(i + x);
g[i + x].push_back(i);
}
}
for (int i = 0; i <= n; ++i)
if (b[i]) ones.push_back(i);
int nn = ones.size();
for (int i = 0; i < nn; ++i) {
int v = ones[i];
int head = 0, tail = 0;
memset(dist, -1, sizeof(dist));
q[tail++] = v;
dist[v] = 0;
while (head != tail) {
int v = q[head++];
for (typeof(g[v].begin()) it = g[v].begin(); it != g[v].end(); ++it) {
int to = *it;
if (dist[to] == -1) {
q[tail++] = to;
dist[to] = dist[v] + 1;
}
}
}
for (int j = 0; j < nn; ++j)
if (dist[ones[j]] != -1)
D[i][j] = dist[ones[j]];
else
D[i][j] = 1e9;
}
for (int i = 0; i < (1 << nn); ++i) dp[i] = 1e9;
dp[0] = 0;
for (int mask = 0; mask < (1 << nn); ++mask) {
int pos = -1;
for (int i = 0; i < nn; ++i)
if ((mask & (1 << i))) {
pos = i;
break;
}
if (pos != -1)
for (int i = 0; i < nn; ++i)
if (i != pos && (mask & (1 << i))) {
dp[mask] =
min(dp[mask], dp[mask ^ (1 << pos) ^ (1 << i)] + D[pos][i]);
}
}
if (dp[(1 << nn) - 1] < (int)1e9)
cout << dp[(1 << nn) - 1];
else
puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, m, cnt;
int a[40005];
int b[150];
int c[40005];
int idx[40005];
bool vis[40005];
int dis[30][30];
queue<int> que;
void bfs(int st) {
for (int i = 1; i <= n; i++) vis[i] = 0;
vis[st] = 1;
que.push(st);
que.push(0);
while (!que.empty()) {
int x = que.front();
que.pop();
int stp = que.front();
que.pop();
if (idx[x]) {
dis[idx[st] - 1][idx[x] - 1] = dis[idx[x] - 1][idx[st] - 1] = stp;
}
for (int i = 1; i <= m; i++) {
if (x + b[i] <= n && vis[x + b[i]] == 0) {
vis[x + b[i]] = 1;
que.push(x + b[i]);
que.push(stp + 1);
}
if (x - b[i] >= 1 && vis[x - b[i]] == 0) {
vis[x - b[i]] = 1;
que.push(x - b[i]);
que.push(stp + 1);
}
}
}
}
void init() {
a[0] = 1;
scanf("%d%d%d", &n, &k, &m);
n++;
for (int i = 1; i <= n; i++) a[i] = 1;
for (int i = 1; i <= k; i++) {
int x;
scanf("%d", &x);
a[x] = 0;
}
for (int i = 1; i <= m; i++) scanf("%d", &b[i]);
for (int i = 1; i <= n; i++) c[i] = a[i] ^ a[i - 1];
for (int i = 1; i <= n; i++)
if (c[i]) cnt++, idx[i] = cnt;
memset(dis, 0x3f, sizeof(dis));
for (int i = 1; i <= n; i++)
if (c[i]) bfs(i);
}
int dp[4600000];
int main() {
init();
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
int maxn = (1 << cnt);
for (int i = 0; i < maxn; i++) {
if (dp[i] > 1000000000) continue;
int st = 0;
for (int j = 0; j < cnt; j++) {
if ((i & (1 << j)) == 0) {
st = j;
break;
}
}
for (int j = st + 1; j < cnt; j++) {
if ((i & (1 << j)) == 0) {
int ni = (i | (1 << st) | (1 << j));
dp[ni] = min(dp[i] + dis[st][j], dp[ni]);
}
}
}
if (dp[maxn - 1] > 1e9)
printf("-1\n");
else
printf("%d\n", dp[maxn - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int read() {
char cc = getchar();
int cn = 0, flus = 1;
while (cc < '0' || cc > '9') {
if (cc == '-') flus = -flus;
cc = getchar();
}
while (cc >= '0' && cc <= '9') cn = cn * 10 + cc - '0', cc = getchar();
return cn * flus;
}
const int N = 40000 + 5;
const int M = 1000 + 5;
const int K = 24;
const int inf = 99999999;
int dis[N][K], n, m, k, dp[(1 << K)];
int g1[N], g2[N], b[M], p[K], top, ans;
queue<int> q;
void input() {
n = read(), k = read(), m = read();
int a;
for (int i = 1; i <= k; i++) a = read(), g1[a] ^= 1, g1[a + 1] ^= 1;
for (int i = 1; i <= m; i++) b[i] = read();
for (int i = 1; i <= n + 1; i++) {
if ((g1[i]) == 1) p[++top] = i;
}
return;
}
void bfs(int x, int id) {
dis[x][id] = 0;
q.push(x);
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = 1; i <= m; i++) {
int to = x + b[i];
if (to <= n + 1 && dis[to][id] > dis[x][id] + 1) {
dis[to][id] = dis[x][id] + 1;
q.push(to);
}
to = x - b[i];
if (to > 0 && dis[to][id] > dis[x][id] + 1) {
dis[to][id] = dis[x][id] + 1;
q.push(to);
}
}
}
}
void work() {
int x = (1 << (top)) - 1;
for (int i = 0; i <= x; i++) dp[i] = inf;
dp[0] = 0;
for (int i = 0; i <= x; i++) {
if (dp[i] >= inf) continue;
for (int j = 1; j <= top; j++) {
if (i & (1 << (j - 1))) continue;
for (int k = j + 1; k <= top; k++) {
if (i & (1 << (k - 1))) continue;
dp[i + (1 << (j - 1)) + (1 << (k - 1))] =
min(dp[i + (1 << (j - 1)) + (1 << (k - 1))], dp[i] + dis[p[k]][j]);
}
}
}
}
void solve() {
sort(b + 1, b + m + 1);
memset(dis, 63, sizeof(dis));
for (int i = 1; i <= top; i++) {
bfs(p[i], i);
}
work();
if (dp[(1 << top) - 1] == inf)
printf("%d\n", -1);
else
printf("%d\n", dp[(1 << top) - 1]);
}
signed main() {
input();
solve();
return 0;
}
|
#include <bits/stdc++.h>
const int MAXN = 10010;
const int INF = 0x3f3f3f3f;
bool vis[MAXN];
std::queue<int> q;
int dist[25][25], f[1 << 25];
int n, k, m, cnt, a[MAXN], len[MAXN], node[MAXN], dis[MAXN];
inline int read() {
int X = 0, flag = 0;
char ch = 0;
while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
while (isdigit(ch)) X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
return flag ? -X : X;
}
inline void bfs(int x, int pos) {
memset(dis, INF, sizeof(dis));
memset(vis, false, sizeof(vis));
q.push(x), vis[x] = true, dis[x] = 0;
while (!q.empty()) {
x = q.front();
q.pop();
for (int i = 1; i <= m; i++) {
int tmp = len[i];
if ((x + tmp) <= n && !vis[x + tmp]) {
vis[x + tmp] = 1;
dis[x + tmp] = dis[x] + 1;
q.push(x + tmp);
}
if ((x - tmp) >= 1 && !vis[x - tmp]) {
vis[x - tmp] = 1;
dis[x - tmp] = dis[x] + 1;
q.push(x - tmp);
}
}
}
for (int i = 1; i <= cnt; i++) {
if (vis[node[i]])
dist[pos][i] = dis[node[i]];
else
dist[pos][i] = INF;
}
}
inline void dp() {
for (int i = 1; i < (1 << cnt); i++) f[i] = INF;
for (int i = 0, j; i < (1 << cnt); i++) {
for (int k = 1; k <= cnt; k++)
if ((1 << (k - 1)) & i) {
j = k;
break;
}
for (int k = 1; k <= cnt; k++)
if ((1 << (k - 1)) & i)
f[i] =
std::min(f[i], f[i ^ (1 << (j - 1)) ^ (1 << (k - 1))] + dist[j][k]);
}
}
signed main() {
n = read(), k = read(), m = read();
for (int i = 1; i <= k; i++) a[read()] = 1;
for (int i = 1; i <= m; i++) len[i] = read();
n++;
for (int i = n; i >= 1; i--) a[i] ^= a[i - 1];
for (int i = 1; i <= n; i++)
if (a[i]) a[i] = ++cnt, node[cnt] = i;
for (int i = 1; i <= n; i++)
if (a[i]) bfs(i, a[i]);
dp();
if (f[(1 << cnt) - 1] == INF)
printf("-1\n");
else
printf("%d\n", f[(1 << cnt) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, l;
int x[30], a[110];
int dist[10010];
int graph[30][30];
int dp[(1 << 20)];
queue<int> q;
void add(int pos, int d) {
if (d < dist[pos]) {
dist[pos] = d;
q.push(pos);
}
}
void bfs(int start) {
int i;
for (i = 0; i <= n; i++) dist[i] = (1 << 29);
add(start, 0);
while (!q.empty()) {
int pos = q.front();
q.pop();
for (int i = 0; i < l; i++) {
if (pos - a[i] >= 0) add(pos - a[i], dist[pos] + 1);
if (pos + a[i] <= n) add(pos + a[i], dist[pos] + 1);
}
}
}
int main() {
ios::sync_with_stdio(false);
int mask, i, j;
cin >> n >> k >> l;
for (i = 0; i < k; i++) {
cin >> x[i];
x[i]--;
}
for (i = 0; i < l; i++) cin >> a[i];
for (i = 0; i < k; i++) x[k + i] = x[i] + 1;
k *= 2;
for (i = 0; i < k; i++) {
bfs(x[i]);
for (int j = 0; j < k; j++) graph[i][j] = dist[x[j]];
}
for (i = 0; i < (1 << k); i++) dp[i] = (1 << 29);
dp[0] = 0;
for (mask = 0; mask < (1 << k); mask++) {
if (mask != 0) {
for (i = 0; i < k; i++)
if (mask & (1 << i)) break;
for (int j = 0; j < k; j++)
if (mask & (1 << j))
if (i != j)
dp[mask] =
min(dp[mask], dp[mask ^ (1 << i) ^ (1 << j)] + graph[i][j]);
}
}
int ans = dp[(1 << k) - 1];
if (ans == (1 << 29))
cout << -1 << endl;
else
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 10005;
int n, k, l, v[N], a[N], x, tot, b[N], f[22][22], dis[N], dp[1 << 20 | 1];
queue<int> q;
int main() {
scanf("%d%d%d", &n, &k, &l);
for (int i = 1; i <= k; i++) scanf("%d", &x), v[x] = 1;
for (int i = 1; i <= n; i++)
if (v[i] != v[i - 1]) a[tot++] = i;
if (tot & 1) a[tot++] = n + 1;
sort(a, a + tot);
for (int i = 1; i <= l; i++) scanf("%d", &b[i]);
for (int i = 0; i < tot; i++) {
memset(dis, 0x3f, sizeof dis);
dis[a[i]] = 0;
q.push(a[i]);
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = 1; i <= l; i++) {
if (x > b[i] && dis[x - b[i]] > 1e9) {
dis[x - b[i]] = dis[x] + 1;
q.push(x - b[i]);
}
if (x + b[i] <= n + 1 && dis[x + b[i]] > 1e9) {
dis[x + b[i]] = dis[x] + 1;
q.push(x + b[i]);
}
}
}
for (int j = 0; j < tot; j++) f[i][j] = dis[a[j]];
}
memset(dp, 0x3f, sizeof dp);
dp[0] = 0;
for (int i = 1; i < 1 << tot; i++) {
int id = 0;
for (int j = 0; j < tot; j++)
if ((1 << j) & i) id = j;
for (int j = 0; j < tot; j++)
if (((1 << j) & i) && id != j)
dp[i] = min(dp[i ^ (1 << j) ^ (1 << id)] + f[j][id], dp[i]);
}
if (dp[(1 << tot) - 1] > 1e9)
puts("-1");
else
printf("%d\n", dp[(1 << tot) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
bool a[10020];
int b[10020];
int f[1 << 21 | 1], g[21][10020];
vector<int> v;
queue<int> q;
void BFS(int s, int k) {
int i;
for (i = 0; i <= n; i++) g[k][i] = 10020;
g[k][s] = 0;
for (q.push(s); !q.empty(); q.pop()) {
s = q.front();
for (i = 0; i < m; i++) {
if (s - b[i] > -1 && g[k][s - b[i]] > g[k][s] + 1) {
g[k][s - b[i]] = g[k][s] + 1;
q.push(s - b[i]);
}
if (s + b[i] <= n && g[k][s + b[i]] > g[k][s] + 1) {
g[k][s + b[i]] = g[k][s] + 1;
q.push(s + b[i]);
}
}
}
return;
}
int main(void) {
int k, p;
int i, x, y;
cin >> n >> k >> m;
while (k--) {
cin >> p;
a[--p] = true;
}
for (i = 0; i < m; i++) cin >> b[i];
for (i = n; i > 0; i--) a[i] ^= a[i - 1];
for (i = 0; i <= n; i++)
if (a[i]) {
BFS(i, v.size());
v.push_back(i);
}
for (i = 1; i < (1 << v.size()); i++) {
f[i] = 10020;
if (!__builtin_parity(i))
for (y = (x = __builtin_ctz(i)) + 1; y < (signed)v.size(); y++)
if (i & (1 << y))
f[i] = min(f[i], f[i ^ (1 << x) ^ (1 << y)] + g[x][v.at(y)]);
}
cout << (f[(1 << v.size()) - 1] == 10020 ? -1 : f[(1 << v.size()) - 1])
<< endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Inf = (1 << 30) - 1;
const int mInf = 0x3f3f3f3f;
int f[1 << 20];
int mark[10010];
int v[10010];
int dist[30][30];
int len[110];
int n, K, L;
vector<int> pos;
void bfs(int S) {
memset(mark, 0x3f, sizeof(mark));
mark[S] = 0;
queue<int> Q;
Q.push(S);
while (!Q.empty()) {
int x = Q.front();
Q.pop();
for (int i = 1; i <= L; i++) {
if (x + len[i] <= n + 1 && mark[x + len[i]] > mark[x] + 1) {
mark[x + len[i]] = mark[x] + 1;
Q.push(x + len[i]);
}
if (x - len[i] >= 1 && mark[x - len[i]] > mark[x] + 1) {
mark[x - len[i]] = mark[x] + 1;
Q.push(x - len[i]);
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> K >> L;
for (int x, i = 1; i <= K; i++) {
cin >> x;
v[x] ^= 1;
v[x + 1] ^= 1;
}
for (int i = 1; i <= n + 1; i++)
if (v[i]) pos.push_back(i);
for (int i = 1; i <= L; i++) cin >> len[i];
for (int i = 0; i < pos.size(); i++) {
bfs(pos[i]);
for (int j = 0; j < pos.size(); j++) dist[i][j] = mark[pos[j]];
}
memset(f, 0x3f, sizeof(f));
f[0] = 0;
for (int S = 0; S < (1 << pos.size()); S++) {
int p = -1;
for (int i = 0; i < pos.size(); i++)
if ((S >> i & 1) == 0) p = i;
for (int i = 0; i < p; i++)
if ((S >> i & 1) == 0) {
int S1 = S | 1 << i | 1 << p;
f[S1] = min(f[S1], f[S] + dist[i][p]);
}
}
if (f[(1 << pos.size()) - 1] == mInf)
cout << "-1" << endl;
else
cout << f[(1 << pos.size()) - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long fpm(long long b, long long e, long long m) {
long long t = 1;
for (; e; e >>= 1, b = b * b % m) e & 1 ? t = t * b % m : 0;
return t;
}
template <class T>
inline bool chkmin(T &a, T b) {
return a > b ? a = b, true : false;
}
template <class T>
inline bool chkmax(T &a, T b) {
return a < b ? a = b, true : false;
}
template <class T>
inline T sqr(T x) {
return x * x;
}
template <class edge>
struct Graph {
vector<vector<edge> > adj;
Graph(int n) {
adj.clear();
adj.resize(n + 5);
}
Graph() { adj.clear(); }
void resize(int n) { adj.resize(n + 5); }
void adde(int s, edge e) { adj[s].push_back(e); }
int deg(int v) { return adj[v].size(); }
vector<edge> &operator[](int t) { return adj[t]; }
};
const int maxn = 11000, maxK2 = 20;
int n, K, L;
int dist[maxn];
int f[1 << maxK2 | 50];
int a[maxn], b[maxn], x[maxn], cost[maxK2][maxK2];
int ctz[1 << maxK2 | 50];
void BFS(int x) {
fill(dist, dist + maxn, 0x3F3F3F3F), dist[x] = 0;
queue<int> Q;
Q.push(x);
for (; !Q.empty(); Q.pop()) {
x = Q.front();
for (int i = 1; i <= L; ++i) {
if (x + a[i] <= n && dist[x + a[i]] > dist[x] + 1)
dist[x + a[i]] = dist[x] + 1, Q.push(x + a[i]);
if (x - a[i] >= 1 && dist[x - a[i]] > dist[x] + 1)
dist[x - a[i]] = dist[x] + 1, Q.push(x - a[i]);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> K >> L;
++n;
for (int i = 1, x; i <= K; ++i) cin >> x, a[x] = 1;
vector<int> ones;
for (int i = 1; i <= n; ++i)
if (a[i] != a[i - 1]) ones.push_back(i);
for (int i = 1; i <= L; ++i) cin >> a[i];
for (int i = 0; i < (int)((ones).size()); ++i) {
BFS(ones[i]);
cerr << ones[i] << endl;
for (int j = 0; j < (int)((ones).size()); ++j) cost[i][j] = dist[ones[j]];
}
int z = (int)((ones).size());
memset(f, 0x3F, sizeof(f));
f[(1 << z) - 1] = 0;
for (int i = 0; i < z; ++i) ctz[1 << i] = i;
for (int S = (1 << z) - 1; S; --S) {
int w = ctz[S & -S], T = S & (S - 1);
for (int a = 0; a < z; ++a)
if (T >> a & 1) chkmin(f[T ^ (1 << a)], f[S] + cost[w][a]);
}
cout << (f[0] == 0x3F3F3F3F ? -1 : f[0]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef int arr[1100010];
int n, k, l, tot;
arr f, a, inq, lst, ans, x;
int dis[30][1100010];
void spfa(int st, int dis[]) {
for (int i = 0; i <= n; i++) dis[i] = 1000000000;
inq[dis[lst[0] = st] = 0] = 1;
for (int op = 0, cl = 1; op < cl;) {
int now = lst[(op++) % 1100010];
for (int i = 1, j; i <= l; i++) {
if ((j = now + a[i]) <= n && dis[now] + 1 < dis[j]) {
if (!inq[j]) inq[j] = 1, lst[(cl++) % 1100010] = j;
dis[j] = dis[now] + 1;
}
if ((j = now - a[i]) >= 0 && dis[now] + 1 < dis[j]) {
if (!inq[j]) inq[j] = 1, lst[(cl++) % 1100010] = j;
dis[j] = dis[now] + 1;
}
}
inq[now] = 0;
}
}
int main() {
scanf("%d%d%d", &n, &k, &l);
for (int i = 1, j; i <= k; i++) {
scanf("%d", &j);
f[j] = 1;
}
for (int i = 1; i <= l; i++) {
scanf("%d", a + i);
}
f[n + 1] = 0;
for (int i = 0; i <= n; i++) {
f[i] = f[i] != f[i + 1];
}
for (int i = 0; i <= n; i++) {
if (f[i]) spfa(x[tot] = i, dis[tot]), tot++;
}
int ub = 1 << tot;
for (int i = 1; i < ub; i++) {
int u = i & -i, v, temp = u;
for (v = 0; temp > 1; temp >>= 1, v++)
;
ans[i] = 1000000000;
for (int k = 1, j = 0, r; k <= i; j++, k <<= 1) {
if (k != u && (i & k) == k && ~ans[r = i ^ k ^ u] &&
dis[v][x[j]] != 1000000000) {
ans[i] = min(ans[i], ans[r] + dis[v][x[j]]);
}
}
if (ans[i] == 1000000000) ans[i] = -1;
}
printf("%d\n", ans[ub - 1]);
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 10010, maxk = 22, maxl = 210;
int n, k, l, m, a[maxl], p[maxn], c[maxk], d[maxn], cost[maxk][maxk],
f[1 << maxk];
void update(int &a, int b) {
if (a < 0 || a > b) a = b;
}
void bfs(int k) {
memset(d, -1, sizeof d);
d[c[k]] = 0;
queue<int> Q;
Q.push(c[k]);
while (!Q.empty()) {
int i = Q.front();
Q.pop();
for (int j = 0; j < l; j++) {
if (0 < i + a[j] && i + a[j] <= n + 1 && d[i + a[j]] < 0) {
d[i + a[j]] = d[i] + 1;
Q.push(i + a[j]);
}
}
}
for (int i = 0; i < m; i++) cost[k][i] = d[c[i]];
}
int main() {
scanf("%d%d%d", &n, &k, &l);
memset(p, 0, sizeof p);
for (int i = 0; i < k; i++) {
int x;
scanf("%d", &x);
p[x] ^= 1, p[x + 1] ^= 1;
}
for (int i = 0; i < l; i++) {
scanf("%d", &a[i]);
a[i + l] = -a[i];
}
l <<= 1;
m = 0;
for (int i = 1; i <= n + 1; i++)
if (p[i]) c[m++] = i;
for (int i = 0; i < m; i++) bfs(i);
memset(f, -1, sizeof f);
f[0] = 0;
for (int opt = 0; opt < 1 << m; opt++)
if (f[opt] >= 0) {
for (int i = 0; i < m; i++)
if (!((1 << i) & opt)) {
for (int j = i + 1; j < m; j++)
if (!((1 << j) & opt) && cost[i][j] >= 0)
update(f[opt ^ (1 << i) ^ (1 << j)], f[opt] + cost[i][j]);
break;
}
}
printf("%d\n", f[(1 << m) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int b[10005];
int d[10005];
int inv[10005];
int vis[10005];
vector<int> E[10005];
int mv[105];
int dist[21][10005];
int x[21];
int arr[21][21];
int dp[(1 << 21)];
int lg[(1 << 21)];
void bfs(int src, int* dist, int N) {
for (int i = 0; i < (N); ++i) dist[i] = 1000000000;
dist[src] = 0;
queue<int> Q;
Q.push(src);
assert(inv[src] >= 0);
while (!Q.empty()) {
int i = Q.front();
Q.pop();
if (vis[i]) continue;
vis[i] = true;
if (inv[i] >= 0) {
int a = inv[src];
int b = inv[i];
arr[a][b] = arr[b][a] = min(arr[a][b], dist[i]);
}
int numE = E[i].size();
for (int x = 0; x < (numE); ++x) {
int j = E[i][x];
if (vis[j]) continue;
if (dist[i] + 1 < dist[j]) {
dist[j] = dist[i] + 1;
Q.push(j);
}
}
}
}
int solve(int s, const int& K, const int& L, const int& N) {
assert(s >= 0);
int& ans = dp[s];
if (ans >= 0) return ans;
if (s == 0) return ans = 0;
ans = 1000000000;
int i = lg[s & (-s)];
assert(s & (1 << i));
for (int j = 0; j < (K); ++j) {
if (j == i) continue;
if (s & (1 << j))
ans = min(ans, arr[i][j] + solve(s - (1 << i) - (1 << j), K, L, N));
}
return ans;
}
int main() {
for (int i = 0; i < (21); ++i) lg[1 << i] = i;
int N, K, L, y;
cin >> N >> K >> L;
for (int i = 0; i < (N + 1); ++i) inv[i] = -1;
for (int h = 0; h < (K); ++h) {
scanf("%d", &y);
y--;
x[h] = y;
b[y] = 1;
}
for (int i = 0; i < (N); ++i) d[i] = b[i] ^ (i ? b[i - 1] : 0);
K = 0;
for (int i = 0; i < (N); ++i)
if (d[i]) {
x[K] = i;
inv[i] = K;
K++;
assert(K <= 21);
}
if (K % 2) {
x[K] = N;
inv[N] = K;
K++;
assert(K <= 21);
}
N++;
for (int j = 0; j < (L); ++j) scanf("%d", &mv[j]);
sort(mv, mv + L);
L = unique(mv, mv + L) - mv;
for (int i = 0; i < (N); ++i)
for (int q = 0; q < (L); ++q) {
int j = i + mv[q];
if (0 <= j && j < N) {
E[i].push_back(j), E[j].push_back(i);
}
}
for (int i = 0; i < (21); ++i)
for (int j = 0; j < (21); ++j) arr[i][j] = 1000000000;
for (int h = 0; h < (K); ++h) {
memset(vis, 0, sizeof(vis));
bfs(x[h], dist[h], N);
}
memset(dp, -1, sizeof(dp));
int ans = solve((1 << K) - 1, K, L, N);
cout << (ans >= 1000000000 ? -1 : ans) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, m, x, tot, p[10100], len[110], dis[30][30], d[10100], q[10100], head,
tail, f[1048576];
bool a[10100];
void update(int x, int dis) {
if (x > 0 && x <= n && dis < d[x]) d[x] = dis, q[++tail] = x;
}
void bfs(int x) {
memset(d, 1, sizeof(d)), d[x] = 0;
for (q[head = tail = 0] = x; head <= tail; ++head)
for (int i = 1; i <= m; ++i)
update(q[head] + len[i], d[q[head]] + 1),
update(q[head] - len[i], d[q[head]] + 1);
for (int i = 1; i <= n; ++i)
if (a[i]) dis[p[x]][p[i]] = d[i];
}
int main() {
scanf("%d%d%d", &n, &k, &m), ++n;
for (int i = 1; i <= k; ++i) scanf("%d", &x), a[x] = 1;
for (int i = 1; i <= m; ++i) scanf("%d", &len[i]);
for (int i = n; i >= 1; --i)
if (a[i] ^= a[i - 1]) p[i] = ++tot;
for (int i = 1; i <= n; ++i)
if (a[i]) bfs(i);
memset(f, 80, sizeof(f)), f[0] = 0;
for (int i = 1; i <= (1 << tot) - 1; ++i)
for (int j = 1; j <= tot; ++j)
if (i & (1 << j - 1)) {
for (int k = j + 1; k <= tot; ++k)
if (i & (1 << k - 1))
f[i] = min(f[i], f[i ^ (1 << j - 1) ^ (1 << k - 1)] + dis[j][k]);
break;
}
printf("%d\n", f[(1 << tot) - 1] > 1 << 20 ? -1 : f[(1 << tot) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e4 + 10;
const int MAXK = 20 + 1;
int n, k, l, vec[MAXK], sz;
bool mark[MAXN];
int lv[MAXN], d[1 << MAXK], q[MAXN], y[MAXN], w[MAXK][MAXK];
bool fit(int x) { return 0 <= x && x <= n; }
int main() {
scanf("%d %d %d", &n, &k, &l);
for (int i = 0; i < k; i++) {
int x;
scanf("%d", &x), x--;
mark[x] = 1;
}
for (int i = 0; i + 1 < MAXN; i++)
if (i && mark[i - 1] && !mark[i])
vec[sz++] = i;
else if (mark[i] && (!i || !mark[i - 1]))
vec[sz++] = i;
for (int i = 0; i < l; i++) scanf("%d", &y[i]);
for (int i = 0; i < sz; i++) {
memset(lv, 63, sizeof(lv));
int h = 0, t = 0;
q[t++] = vec[i];
lv[vec[i]] = 0;
while (h < t) {
int v = q[h++];
for (int i = 0; i < l; i++) {
if (fit(v + y[i]) && lv[v] + 1 < lv[v + y[i]])
lv[v + y[i]] = lv[v] + 1, q[t++] = v + y[i];
y[i] = -y[i];
if (fit(v + y[i]) && lv[v] + 1 < lv[v + y[i]])
lv[v + y[i]] = lv[v] + 1, q[t++] = v + y[i];
y[i] = -y[i];
}
}
for (int j = 0; j < sz; j++)
if (i ^ j) w[i][j] = lv[vec[j]];
}
memset(d, 63, sizeof(d));
d[0] = 0;
for (int i = 1; i < 1 << sz; i++) {
int t = __builtin_popcount(i);
if (t & 1) continue;
int v = __builtin_ctz(i & -i);
for (int j = v + 1; j < sz; j++)
if (i >> j & 1) d[i] = min(d[i], d[i ^ 1 << v ^ 1 << j] + w[v][j]);
}
if (d[(1 << sz) - 1] < 1e9)
printf("%d\n", d[(1 << sz) - 1]);
else
printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[110], b[22], c[10010], d[10010], f[1100000], g[22][22], n, t, m, p, i, j,
k, x;
void bfs(int x) {
memset(d, 0x3f, sizeof(d));
queue<int> q;
q.push(x), d[x] = 0;
while (q.size()) {
x = q.front(), q.pop();
for (int i = 1; i <= m; i++) {
if (x >= a[i] && d[x - a[i]] > d[x] + 1)
d[x - a[i]] = d[x] + 1, q.push(x - a[i]);
if (x + a[i] <= n && d[x + a[i]] > d[x] + 1)
d[x + a[i]] = d[x] + 1, q.push(x + a[i]);
}
}
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> t >> m;
for (i = 1; i <= t; i++) cin >> x, c[x] = 1;
for (i = 0; i <= n; i++)
if (c[i] != c[i + 1]) b[++p] = i;
for (i = 1; i <= m; i++) cin >> a[i];
for (i = 1; i <= p; i++) {
bfs(b[i]);
for (j = 1; j <= p; j++) g[i][j] = d[b[j]];
}
memset(f, 0x3f, sizeof(f));
f[0] = 0;
for (i = 0; i < 1 << p; i++)
for (j = 0; j < p; j++)
if (!(i >> j & 1))
for (k = j + 1; k < p; k++)
if (!(i >> k & 1))
f[i | 1 << j | 1 << k] =
min(f[i | 1 << j | 1 << k], f[i] + g[j + 1][k + 1]);
cout << (f[(1 << p) - 1] == 0x3f3f3f3f ? -1 : f[(1 << p) - 1]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 10010;
const int INF = 0x3f3f3f3f;
int n, k, l, dist[22][maxn], p[30], f[1 << 22], z[maxn], y[maxn], s[110];
queue<int> que;
int dfs(int s, int cnt) {
if (s == 0) return 0;
if (f[s]) return f[s];
f[s] = INF;
for (int a = 1; a <= cnt; a++)
if (s & (1 << (a - 1)))
for (int b = a + 1; b <= cnt; b++)
if (s & (1 << (b - 1)))
f[s] = min(f[s], dist[a][p[b]] +
dfs(s ^ (1 << (a - 1)) ^ (1 << (b - 1)), cnt));
return f[s];
}
int main() {
scanf("%d%d%d", &n, &k, &l);
for (int a = 1; a <= k; a++) {
int p;
scanf("%d", &p);
z[p] = 1;
}
for (int a = 1; a <= n + 1; a++) y[a] = z[a - 1] ^ z[a];
for (int a = 1; a <= l; a++) scanf("%d", &s[a]);
int cnt = 0;
for (int a = 1; a <= n + 1; a++)
if (y[a] == 1) {
cnt++;
p[cnt] = a;
memset(dist[cnt], 0x3f, sizeof(dist[cnt]));
dist[cnt][a] = 0;
que.push(a);
while (que.size()) {
int now = que.front();
que.pop();
for (int b = 1; b <= l; b++) {
if (now + s[b] <= n + 1 && dist[cnt][now + s[b]] == INF) {
dist[cnt][now + s[b]] = dist[cnt][now] + 1;
que.push(now + s[b]);
}
if (now - s[b] > 0 && dist[cnt][now - s[b]] == INF) {
dist[cnt][now - s[b]] = dist[cnt][now] + 1;
que.push(now - s[b]);
}
}
}
}
if (dfs((1 << cnt) - 1, cnt) == INF)
printf("-1\n");
else
printf("%d\n", dfs((1 << cnt) - 1, cnt));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, K, M, X[10010], Size[10010];
int seq[10010], Dist[25][25], num[10010], ti;
int Que[10010], Qhead, Qtail, Dis[10010], oo = 1000000000, f[2000010],
g[2000010];
bool vis[10010];
int Min(int a, int b) { return a < b ? a : b; }
void Bfs(int s) {
int i, j;
memset(vis, 0, sizeof(vis));
vis[Que[Qhead = Qtail = 1] = s] = 1;
Dis[s] = 0;
for (; Qhead <= Qtail; ++Qhead) {
int now = Que[Qhead];
for (i = 1; i <= M; ++i) {
if (now + Size[i] <= N && !vis[now + Size[i]]) {
vis[Que[++Qtail] = now + Size[i]] = 1;
Dis[now + Size[i]] = Dis[now] + 1;
}
if (now - Size[i] > 0 && !vis[now - Size[i]]) {
vis[Que[++Qtail] = now - Size[i]] = 1;
Dis[now - Size[i]] = Dis[now] + 1;
}
}
}
for (i = 1; i <= N; ++i)
if (num[i]) {
if (!vis[i])
Dist[num[s]][num[i]] = oo;
else
Dist[num[s]][num[i]] = Dis[i];
}
}
void DP() {
int i, j;
for (i = 0; i < (1 << ti); ++i) {
if (i == 0) continue;
f[i] = oo;
g[i] = g[i >> 1] + (i & 1);
if (g[i] & 1) continue;
int start = 0;
for (j = 0; j < ti; ++j)
if (i & (1 << j)) {
if (!start)
start = j + 1;
else {
f[i] = Min(f[i],
f[i - (1 << (start - 1)) - (1 << j)] + Dist[start][j + 1]);
}
}
}
printf("%d\n", f[(1 << ti) - 1] >= oo ? -1 : f[(1 << ti) - 1]);
}
int main() {
int i, j;
scanf("%d%d%d", &N, &K, &M);
for (i = 1; i <= K; ++i) {
scanf("%d", &X[i]);
seq[X[i]] = 1;
}
for (i = 1; i <= M; ++i) scanf("%d", &Size[i]);
for (i = N + 1; i; --i) seq[i] ^= seq[i - 1];
++N;
for (i = 1; i <= N; ++i)
if (seq[i]) num[i] = ++ti;
for (i = 1; i <= N; ++i)
if (seq[i]) Bfs(i);
DP();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
queue<int> q;
int n, m, a[10009], c[10009], dis[21][10009], k, dp[1 << 21], now[10009],
b[10009], d[10009], tot, num[10009], cnt;
bool vis[10009];
inline int rd() {
int x = 0;
char c = getchar();
bool f = 0;
while (!isdigit(c)) {
if (c == '-') f = 1;
c = getchar();
}
while (isdigit(c)) {
x = (x << 1) + (x << 3) + (c ^ 48);
c = getchar();
}
return f ? -x : x;
}
inline void spfa(int s, int id) {
memset(dis[id], 0x3f, sizeof(dis[id]));
q.push(s);
dis[id][s] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
vis[u] = 0;
for (int i = 1; i <= m; ++i) {
int x = u - a[i], y = u + a[i];
if (x >= 1) {
if (dis[id][x] > dis[id][u] + 1) {
dis[id][x] = dis[id][u] + 1;
if (!vis[x]) {
vis[x] = 1;
q.push(x);
}
}
}
if (y <= n + 1) {
if (dis[id][y] > dis[id][u] + 1) {
dis[id][y] = dis[id][u] + 1;
if (!vis[y]) {
vis[y] = 1;
q.push(y);
}
}
}
}
}
}
int main() {
n = rd();
k = rd();
m = rd();
int x;
for (int i = 1; i <= k; ++i) x = rd(), now[x] = 1;
for (int i = 1; i <= m; ++i) a[i] = rd();
for (int i = n + 1; i >= 1; --i) {
c[i] = (now[i] - now[i - 1] + 2) % 2;
}
for (int i = 1; i <= n + 1; ++i)
if (c[i]) {
++tot;
num[tot] = i;
spfa(i, tot);
}
for (int i = 1; i <= tot; ++i)
for (int j = i + 1; j <= tot; ++j) {
b[++cnt] = (1 << i - 1) | (1 << j - 1);
d[cnt] = dis[i][num[j]];
}
q.push(0);
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < (1 << tot); ++i) {
for (int j = 1; j <= cnt; ++j)
if (!(i & b[j])) {
dp[i | b[j]] = min(dp[i | b[j]], dp[i] + d[j]);
}
}
if (dp[(1 << tot) - 1] > 1e9)
puts("-1");
else
printf("%d", dp[(1 << tot) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct timer {
time_t start;
timer() { start = clock(); }
~timer() {
cout << 1. * (clock() - start) / CLOCKS_PER_SEC << " secs" << endl;
}
};
int n, k, l, a[111];
int on[10010];
int m, pos[22];
int dist[22][10010];
int dp[1 << 20];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cin >> n >> k >> l;
for (int i = 0; i < (k); i++) {
int x;
cin >> x;
on[x] = 1;
}
for (int i = 0; i < (n + 1); i++) {
if (on[i] ^ on[i + 1]) {
pos[m++] = i;
}
}
for (int i = 0; i < (l); i++) cin >> a[i];
for (int i = 0; i < (m); i++) {
for (int j = 0; j < (n + 1); j++) dist[i][j] = 1070000000LL;
dist[i][pos[i]] = 0;
queue<int> Q;
Q.push(pos[i]);
while (((int)Q.size())) {
int x = Q.front();
Q.pop();
for (int j = 0; j < (l); j++)
for (int sign = -1; sign < 2; sign += 2) {
int nx = x + sign * a[j];
if (0 <= nx && nx <= n && dist[i][nx] == 1070000000LL) {
dist[i][nx] = dist[i][x] + 1;
Q.push(nx);
}
}
}
}
for (int i = 0; i < (1 << m); i++) dp[i] = 1070000000LL;
dp[0] = 0;
for (int mask = 1; mask < (1 << m); mask++)
if (__builtin_popcount(mask) % 2 == 0) {
int low = 0;
while (!(mask >> low & 1)) low++;
for (int i = low + 1; i < (m); i++)
if (mask >> i & 1) {
dp[mask] = min(dp[mask],
dp[mask ^ (1 << low) ^ (1 << i)] + dist[low][pos[i]]);
}
}
cout << (dp[(1 << m) - 1] < 1070000000LL ? dp[(1 << m) - 1] : -1);
}
|
#include <bits/stdc++.h>
using namespace std;
int mem[1 << 21];
int cp[100];
int vis[10005];
int op[1004];
int d[100][10005];
int n, k, m, nc;
int bfs(int u) {
int q[10005], f, r;
int i, j;
d[u][cp[u]] = 0;
q[f = r = 0] = cp[u];
while (f <= r) {
int v = q[f++];
for (i = 0; i < m; i++) {
int b = v + op[i];
if (b >= 0 and b <= n and d[u][b] == 1000000000) {
d[u][b] = d[u][v] + 1;
q[++r] = b;
}
}
}
return 0;
}
int dp(int s) {
int i, j, l;
if (s == 0) return 0;
if (mem[s] != 1000000000) return mem[s];
for (i = 0; i < k; i++)
if (s & (1 << i)) break;
for (j = i + 1; j < k; j++)
if (s & (1 << j)) {
mem[s] = min(mem[s], dp(s ^ (1 << i) ^ (1 << j)) + d[i][cp[j]]);
}
if (mem[s] == 1000000000) mem[s] = 1000000000 + 1;
return mem[s];
}
int main() {
int i, j, l, x;
scanf("%d %d %d", &n, &k, &m);
for (i = 0; i <= n + 1; i++) vis[i] = 0;
for (i = 0; i < 100; i++)
for (j = 0; j <= 10000; j++) d[i][j] = 1000000000;
for (i = 0; i < k; i++) {
scanf("%d", &j);
vis[j] = 1;
}
for (i = 0, nc = 0; i <= n; i++)
if (vis[i] != vis[i + 1]) cp[nc++] = i;
k = nc;
for (i = 0; i < (1 << k); i++) mem[i] = 1000000000;
for (i = 0; i < m; i++) {
scanf("%d", &j);
op[i * 2] = j;
op[i * 2 + 1] = -j;
}
m *= 2;
for (i = 0; i < k; i++) bfs(i);
printf("%d\n", (dp((1 << k) - 1) != 1000000000 + 1) ? dp((1 << k) - 1) : -1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, k, a[100010], l[110], num[21][21], f[1 << 21], d[100010];
void bfs(int x) {
deque<int> q;
q.push_back(x);
while (!q.empty()) {
int a = q.front();
q.pop_front();
for (int i = 1; i <= k; ++i) {
if (a > l[i] && !d[a - l[i]]) {
d[a - l[i]] = d[a] + 1;
q.push_back(a - l[i]);
}
if (a + l[i] <= n && !d[a + l[i]]) {
d[a + l[i]] = d[a] + 1;
q.push_back(a + l[i]);
}
}
}
for (int i = 1; i <= n; ++i)
if (!d[i]) d[i] = 1e9;
}
void read() {
int ls1;
static bool b[100010];
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= m; ++i) scanf("%d", &ls1), a[ls1] = 1;
for (int i = 1; i <= n; ++i) b[i] = a[i] ^ a[i - 1];
for (int i = 1; i <= k; ++i) scanf("%d", l + i);
m = 0;
for (int i = 1; i <= n; ++i)
if (b[i]) a[++m] = i;
if (m & 1) a[++m] = n + 1;
return;
}
void solve() {
++n;
for (int i = 1; i <= m; ++i) {
d[a[i]] = 1;
bfs(a[i]);
for (int j = 1; j <= m; ++j) num[i][j] = d[a[j]] - 1;
for (int j = 1; j <= n; ++j) d[j] = 0;
}
int U = (1 << m) - 1;
f[1] = f[2] = 1e9;
for (int i = 3; i <= U; ++i) {
int v[21], _v = 0;
for (int j = 1; j <= m; ++j) {
if ((i >> (j - 1)) & 1) v[++_v] = j;
}
f[i] = 1e9;
for (int j = 1; j <= _v; ++j) {
for (int k = j + 1; k <= _v; ++k) {
f[i] = min(f[i], f[i - (1 << (v[j] - 1)) - (1 << (v[k] - 1))] +
num[v[j]][v[k]]);
}
}
}
printf("%d\n", f[U] > 1e8 ? -1 : f[U]);
}
int main() {
read();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool vis[40010];
int N, M, K, num[110], cnt[20], minDis[40010], minN[31][31], dp[1 << 21 + 1],
cnt1[1 << 21 + 1];
queue<int> q;
inline void Dijk(int dir) {
memset(minDis, 0x3f, sizeof(minDis));
minDis[cnt[dir]] = 0;
q.push(cnt[dir]);
while (!q.empty()) {
int t = q.front();
q.pop();
for (int i = 1; i <= K; i++) {
if (t + num[i] <= N + 1 && minDis[t + num[i]] > minDis[t] + 1) {
minDis[t + num[i]] = minDis[t] + 1;
q.push(t + num[i]);
}
if (t - num[i] > 0 && minDis[t - num[i]] > minDis[t] + 1) {
minDis[t - num[i]] = minDis[t] + 1;
q.push(t - num[i]);
}
}
}
for (int i = 1; i <= cnt[0]; i++) minN[dir][i] = minDis[cnt[i]];
}
int main() {
cin >> N >> M >> K;
for (int i = 1; i <= M; i++) {
int a;
cin >> a;
vis[a] = 1;
}
for (int i = 1; i <= N + 1; i++)
if (vis[i] ^ vis[i - 1]) cnt[++cnt[0]] = i;
if (cnt[0] == 0) {
cout << 0;
return 0;
}
for (int i = 1; i <= K; i++) cin >> num[i];
for (int i = 1; i <= cnt[0]; i++) Dijk(i);
for (int i = 1; i < 1 << cnt[0]; i++) cnt1[i] = cnt1[i - (i & -i)] + 1;
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < (1 << cnt[0]); i++)
if (!(cnt1[i] & 1)) {
int t = ((1 << cnt[0]) - 1) ^ i;
if (t == 0) {
cout << (dp[i] == 0x3f3f3f3f ? -1 : dp[i]);
return 0;
}
t = log2(t & -t) + 1;
for (int j = t + 1; j <= cnt[0]; j++)
if (!(i & (1 << j - 1)))
dp[i | (1 << t - 1) | (1 << j - 1)] =
min(dp[i | (1 << t - 1) | (1 << j - 1)], dp[i] + minN[t][j]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long x = 0, w = 0;
char ch = getchar();
while (!isdigit(ch)) w |= ch == '-', ch = getchar();
while (isdigit(ch)) x = (x << 1) + (x << 3) + ch - '0', ch = getchar();
return w ? -x : x;
}
long long cnt[1 << 20], f[1 << 20], dis[310000], l[310000], d[40][40], n, m, k,
vis[310000], loc[310000], tot;
void bfs(long long s) {
memset(dis, 0x3f, sizeof(dis));
queue<long long> q;
q.push(loc[s]);
dis[loc[s]] = 0;
while (!q.empty()) {
long long u = q.front();
q.pop();
for (long long i = 1; i <= k; ++i) {
long long v = u + l[i];
if (v <= n + 1 && dis[v] > dis[u] + 1) {
dis[v] = dis[u] + 1;
q.push(v);
}
v = u - l[i];
if (v >= 1 && dis[v] > dis[u] + 1) {
dis[v] = dis[u] + 1;
q.push(v);
}
}
}
for (long long i = 1; i <= tot; ++i) d[s][i] = dis[loc[i]];
}
signed main() {
n = read(), m = read(), k = read();
for (long long i = 1; i <= m; ++i) {
long long d = read();
vis[d] = 1;
}
for (long long i = 1; i <= n + 1; ++i)
if (vis[i] ^ vis[i - 1]) loc[++tot] = i;
if (tot == 0) {
puts("0");
return 0;
}
for (long long i = 1; i <= k; ++i) l[i] = read();
for (long long i = 1; i <= tot; ++i) bfs(i);
for (long long s = 1; s < (1 << tot); ++s) cnt[s] = cnt[s ^ (s & (-s))] + 1;
memset(f, 0x3f, sizeof(f));
f[0] = 0;
for (long long s = 0; s < (1 << tot); ++s)
if (!(cnt[s] & 1)) {
long long k = ((1 << tot) - 1) ^ s;
if (k == 0) continue;
k = log2(k & (-k)) + 1;
for (long long i = k + 1; i <= tot; ++i)
if (!(s & (1 << i - 1))) {
long long ns = (s | (1 << k - 1) | (1 << i - 1));
f[ns] = min(f[ns], f[s] + d[i][k]);
}
}
printf("%d\n", f[(1 << tot) - 1] >= 0x3f3f3f3f ? -1 : f[(1 << tot) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
typedef unsigned long long uint64;
const double pi = acos(-1.0);
const double eps = 1e-11;
template <class T>
inline void checkmin(T &a, T b) {
if (b < a) a = b;
}
template <class T>
inline void checkmax(T &a, T b) {
if (b > a) a = b;
}
template <class T>
inline T sqr(T x) {
return x * x;
}
typedef pair<int, int> ipair;
template <class T>
inline T lowbit(T n) {
return (n ^ (n - 1)) & n;
}
template <class T>
inline int countbit(T n) {
return (n == 0) ? 0 : (1 + countbit(n & (n - 1)));
}
template <class T>
inline T gcd(T a, T b) {
if (a < 0) return gcd(-a, b);
if (b < 0) return gcd(a, -b);
return (b == 0) ? a : gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
if (a < 0) return lcm(-a, b);
if (b < 0) return lcm(a, -b);
return a * (b / gcd(a, b));
}
template <class T>
inline T euclide(T a, T b, T &x, T &y) {
if (a < 0) {
T d = euclide(-a, b, x, y);
x = -x;
return d;
}
if (b < 0) {
T d = euclide(a, -b, x, y);
y = -y;
return d;
}
if (b == 0) {
x = 1;
y = 0;
return a;
} else {
T d = euclide(b, a % b, x, y);
T t = x;
x = y;
y = t - (a / b) * y;
return d;
}
}
template <class T>
inline vector<pair<T, int> > factorize(T n) {
vector<pair<T, int> > R;
for (T i = 2; n > 1;) {
if (n % i == 0) {
int C = 0;
for (; n % i == 0; C++, n /= i)
;
R.push_back(make_pair(i, C));
}
i++;
if (i > n / i) i = n;
}
if (n > 1) R.push_back(make_pair(n, 1));
return R;
}
template <class T>
inline bool isPrimeNumber(T n) {
if (n <= 1) return false;
for (T i = 2; i * i <= n; i++)
if (n % i == 0) return false;
return true;
}
template <class T>
inline T eularFunction(T n) {
vector<pair<T, int> > R = factorize(n);
T r = n;
for (int i = 0; i < R.size(); i++) r = r / R[i].first * (R[i].first - 1);
return r;
}
const int MaxMatrixSize = 40;
template <class T>
inline void showMatrix(int n, T A[MaxMatrixSize][MaxMatrixSize]) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) cout << A[i][j];
cout << endl;
}
}
template <class T>
inline T checkMod(T n, T m) {
return (n % m + m) % m;
}
template <class T>
inline void identityMatrix(int n, T A[MaxMatrixSize][MaxMatrixSize]) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) A[i][j] = (i == j) ? 1 : 0;
}
template <class T>
inline void addMatrix(int n, T C[MaxMatrixSize][MaxMatrixSize],
T A[MaxMatrixSize][MaxMatrixSize],
T B[MaxMatrixSize][MaxMatrixSize]) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) C[i][j] = A[i][j] + B[i][j];
}
template <class T>
inline void subMatrix(int n, T C[MaxMatrixSize][MaxMatrixSize],
T A[MaxMatrixSize][MaxMatrixSize],
T B[MaxMatrixSize][MaxMatrixSize]) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) C[i][j] = A[i][j] - B[i][j];
}
template <class T>
inline void mulMatrix(int n, T C[MaxMatrixSize][MaxMatrixSize],
T _A[MaxMatrixSize][MaxMatrixSize],
T _B[MaxMatrixSize][MaxMatrixSize]) {
T A[MaxMatrixSize][MaxMatrixSize], B[MaxMatrixSize][MaxMatrixSize];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
A[i][j] = _A[i][j], B[i][j] = _B[i][j], C[i][j] = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
for (int k = 0; k < n; k++) C[i][j] += A[i][k] * B[k][j];
}
template <class T>
inline void addModMatrix(int n, T m, T C[MaxMatrixSize][MaxMatrixSize],
T A[MaxMatrixSize][MaxMatrixSize],
T B[MaxMatrixSize][MaxMatrixSize]) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) C[i][j] = checkMod(A[i][j] + B[i][j], m);
}
template <class T>
inline void subModMatrix(int n, T m, T C[MaxMatrixSize][MaxMatrixSize],
T A[MaxMatrixSize][MaxMatrixSize],
T B[MaxMatrixSize][MaxMatrixSize]) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) C[i][j] = checkMod(A[i][j] - B[i][j], m);
}
template <class T>
inline T multiplyMod(T a, T b, T m) {
return (T)((((int64)(a) * (int64)(b) % (int64)(m)) + (int64)(m)) %
(int64)(m));
}
template <class T>
inline void mulModMatrix(int n, T m, T C[MaxMatrixSize][MaxMatrixSize],
T _A[MaxMatrixSize][MaxMatrixSize],
T _B[MaxMatrixSize][MaxMatrixSize]) {
T A[MaxMatrixSize][MaxMatrixSize], B[MaxMatrixSize][MaxMatrixSize];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
A[i][j] = _A[i][j], B[i][j] = _B[i][j], C[i][j] = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
for (int k = 0; k < n; k++)
C[i][j] = (C[i][j] + multiplyMod(A[i][k], B[k][j], m)) % m;
}
template <class T>
inline T powerMod(T p, int e, T m) {
if (e == 0)
return 1 % m;
else if (e % 2 == 0) {
T t = powerMod(p, e / 2, m);
return multiplyMod(t, t, m);
} else
return multiplyMod(powerMod(p, e - 1, m), p, m);
}
double dist(double x1, double y1, double x2, double y2) {
return sqrt(sqr(x1 - x2) + sqr(y1 - y2));
}
double distR(double x1, double y1, double x2, double y2) {
return sqr(x1 - x2) + sqr(y1 - y2);
}
template <class T>
T cross(T x0, T y0, T x1, T y1, T x2, T y2) {
return (x1 - x0) * (y2 - y0) - (x2 - x0) * (y1 - y0);
}
int crossOper(double x0, double y0, double x1, double y1, double x2,
double y2) {
double t = (x1 - x0) * (y2 - y0) - (x2 - x0) * (y1 - y0);
if (fabs(t) <= eps) return 0;
return (t < 0) ? -1 : 1;
}
bool isIntersect(double x1, double y1, double x2, double y2, double x3,
double y3, double x4, double y4) {
return crossOper(x1, y1, x2, y2, x3, y3) * crossOper(x1, y1, x2, y2, x4, y4) <
0 &&
crossOper(x3, y3, x4, y4, x1, y1) * crossOper(x3, y3, x4, y4, x2, y2) <
0;
}
bool isMiddle(double s, double m, double t) {
return fabs(s - m) <= eps || fabs(t - m) <= eps || (s < m) != (t < m);
}
bool isUpperCase(char c) { return c >= 'A' && c <= 'Z'; }
bool isLowerCase(char c) { return c >= 'a' && c <= 'z'; }
bool isLetter(char c) { return c >= 'A' && c <= 'Z' || c >= 'a' && c <= 'z'; }
bool isDigit(char c) { return c >= '0' && c <= '9'; }
char toLowerCase(char c) { return (isUpperCase(c)) ? (c + 32) : c; }
char toUpperCase(char c) { return (isLowerCase(c)) ? (c - 32) : c; }
template <class T>
string toString(T n) {
ostringstream ost;
ost << n;
ost.flush();
return ost.str();
}
int toInt(string s) {
int r = 0;
istringstream sin(s);
sin >> r;
return r;
}
int64 toInt64(string s) {
int64 r = 0;
istringstream sin(s);
sin >> r;
return r;
}
double toDouble(string s) {
double r = 0;
istringstream sin(s);
sin >> r;
return r;
}
template <class T>
void stoa(string s, int &n, T A[]) {
n = 0;
istringstream sin(s);
for (T v; sin >> v; A[n++] = v)
;
}
template <class T>
void atos(int n, T A[], string &s) {
ostringstream sout;
for (int i = 0; i < n; i++) {
if (i > 0) sout << ' ';
sout << A[i];
}
s = sout.str();
}
template <class T>
void atov(int n, T A[], vector<T> &vi) {
vi.clear();
for (int i = 0; i < n; i++) vi.push_back(A[i]);
}
template <class T>
void vtoa(vector<T> vi, int &n, T A[]) {
n = vi.size();
for (int i = 0; i < n; i++) A[i] = vi[i];
}
template <class T>
void stov(string s, vector<T> &vi) {
vi.clear();
istringstream sin(s);
for (T v; sin >> v; vi.push_bakc(v))
;
}
template <class T>
void vtos(vector<T> vi, string &s) {
ostringstream sout;
for (int i = 0; i < vi.size(); i++) {
if (i > 0) sout << ' ';
sout << vi[i];
}
s = sout.str();
}
template <class T>
struct Fraction {
T a, b;
Fraction(T a = 0, T b = 1);
string toString();
};
template <class T>
Fraction<T>::Fraction(T a, T b) {
T d = gcd(a, b);
a /= d;
b /= d;
if (b < 0) a = -a, b = -b;
this->a = a;
this->b = b;
}
template <class T>
string Fraction<T>::toString() {
ostringstream sout;
sout << a << "/" << b;
return sout.str();
}
template <class T>
Fraction<T> operator+(Fraction<T> p, Fraction<T> q) {
return Fraction<T>(p.a * q.b + q.a * p.b, p.b * q.b);
}
template <class T>
Fraction<T> operator-(Fraction<T> p, Fraction<T> q) {
return Fraction<T>(p.a * q.b - q.a * p.b, p.b * q.b);
}
template <class T>
Fraction<T> operator*(Fraction<T> p, Fraction<T> q) {
return Fraction<T>(p.a * q.a, p.b * q.b);
}
template <class T>
Fraction<T> operator/(Fraction<T> p, Fraction<T> q) {
return Fraction<T>(p.a * q.b, p.b * q.a);
}
const int maxL = 10000 + 5;
const int maxn = 20;
int L, p, m, n;
int d[maxL], a[maxL];
int c[maxL], q[maxL], e[maxL];
int g[maxn][maxn];
int f[(1 << (maxn))];
int main() {
scanf("%d%d%d", &L, &p, &m);
memset(a, 0, sizeof(a));
for (int i = 0; i < p; i++) {
int pos;
scanf("%d", &pos);
a[pos] = 1;
}
for (int i = 0; i < m; i++) scanf("%d", &c[i]);
n = 0;
for (int i = 0; i <= L; i++)
if (a[i] != a[i + 1]) d[n++] = i;
for (int k = 0; k < n; k++) {
for (int i = 0; i <= L; i++) e[i] = -1;
int sizeq = 0;
q[sizeq++] = d[k];
e[d[k]] = 0;
for (int cl = 0; cl < sizeq; cl++) {
int key = q[cl];
for (int i = 0; i < m; i++)
for (int op = -1; op <= 1; op += 2) {
int other = key + op * c[i];
if (other >= 0 && other <= L && e[other] < 0) {
e[other] = e[key] + 1;
q[sizeq++] = other;
}
}
}
for (int i = 0; i < n; i++) g[k][i] = e[d[i]];
}
memset(f, 255, sizeof(f));
f[0] = 0;
for (int set = 0; set < (1 << (n)) - 1; set++)
if (f[set] >= 0) {
int i = 0;
for (; (((set) & (1 << (i))) != 0); i++)
;
for (int j = i + 1; j < n; j++)
if (!(((set) & (1 << (j))) != 0) && g[i][j] >= 0) {
int newset = set | (1 << (i)) | (1 << (j));
int t = f[set] + g[i][j];
if (f[newset] < 0 || t < f[newset]) f[newset] = t;
}
}
printf("%d\n", f[(1 << (n)) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000005, mxn = 10005, mxk = 12, mxl = 105, mxN = 1 << 20;
int n, k, l;
int x[mxn], a[mxl];
vector<int> v;
int dist[2 * mxk][mxn];
int dp[mxN];
inline void bfs(int id, int st) {
fill(dist[id], dist[id] + mxn, inf);
dist[id][st] = 0;
queue<int> q;
q.push(st);
while (!q.empty()) {
int p(q.front()), d(dist[id][p]);
q.pop();
for (int i = 0; i < l; ++i) {
int t(p + a[i]);
if (t <= n and d + 1 < dist[id][t]) {
dist[id][t] = d + 1;
q.push(t);
}
t = p - a[i];
if (t >= 0 and d + 1 < dist[id][t]) {
dist[id][t] = d + 1;
q.push(t);
}
}
}
}
int main() {
int i, j, f;
scanf("%d%d%d", &n, &k, &l);
int t;
while (k--) {
scanf("%d", &t);
x[t] = 1;
}
for (i = 0; i < l; ++i) scanf("%d", &a[i]);
for (i = 0; i <= n; ++i)
if (x[i] != x[i + 1]) v.push_back(i), bfs(v.size() - 1, i);
int N(v.size());
fill(dp + 1, dp + (1 << N), inf);
for (i = 0; i < (1 << N) - 1; ++i) {
j = N - 1;
while (i & 1 << j) --j;
for (f = j - 1; f >= 0; --f)
dp[i ^ 1 << f ^ 1 << j] =
min(dp[i ^ 1 << f ^ 1 << j], dp[i] + dist[f][v[j]]);
}
int ans((1 << N) - 1);
printf("%d\n", dp[ans] == inf ? -1 : dp[ans]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e4 + 5;
const int MAXM = (1 << 20) + 5;
const int INF = 0x3f3f3f3f;
int n, l, k, cnt[25], tot, d[25][25], e[105], p[MAXN], f[MAXM], c[MAXM];
inline int read() {
int x = 0;
char ch = getchar();
while (!isdigit(ch)) ch = getchar();
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x;
}
template <typename T1, typename T2>
inline void Min(T1 &x, T2 y) {
if (x > y) x = y;
}
inline void prepare(int id) {
queue<int> q;
static int dis[MAXN];
memset(dis, 0, sizeof(dis));
int s = cnt[id], x;
q.push(s), dis[s] = 1;
while (!q.empty()) {
x = q.front(), q.pop();
for (int i = 1; i <= l; i++) {
int len = e[i];
if (x - len > 0 && !dis[x - len])
dis[x - len] = dis[x] + 1, q.push(x - len);
if (x + len <= n + 1 && !dis[x + len])
dis[x + len] = dis[x] + 1, q.push(x + len);
}
}
memset(d[id], 0x3f, sizeof(d[id]));
for (int i = 1; i <= tot; i++) dis[cnt[i]] && (d[id][i] = dis[cnt[i]] - 1);
}
int main() {
n = read(), k = read(), l = read();
for (int i = 1; i <= k; i++) p[read()] = 1;
for (int i = 1; i <= l; i++) e[i] = read();
for (int i = 1; i <= n + 1; i++)
if (p[i] ^ p[i - 1]) cnt[++tot] = i;
for (int i = 1; i <= tot; i++) prepare(i);
int lim = 1 << tot;
for (int i = 0; i < lim; i++) c[i] = c[i >> 1] + (i & 1);
memset(f, 0x3f, sizeof(f)), f[0] = 0;
for (int i = 0; i < lim - 1; i++) {
if (c[i] & 1) continue;
if (f[i] == INF) continue;
for (int x = 1; x <= tot; x++)
if (!(i & (1 << (x - 1))))
for (int y = 1; y <= tot; y++)
if (x != y && !(i & (1 << (y - 1))))
Min(f[i | (1 << (x - 1)) | (1 << (y - 1))], f[i] + d[x][y]);
}
if (f[lim - 1] == INF)
puts("-1");
else
printf("%d\n", f[lim - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 7, inf = 9e8;
int a[N], dis[43][N], vis[N], len[107];
int f[2000007], n, m, k, p[43];
inline void bfs(int S, int X) {
queue<int> q;
q.push(X);
for (register int i = 1; i <= n + 1; ++i) dis[S][i] = inf;
vis[X] = S;
dis[S][X] = 0;
while (!q.empty()) {
int x = q.front(), u;
q.pop();
for (register int i = 1; i <= m; ++i) {
u = x - len[i];
if (u >= 0 && dis[S][u] > dis[S][x] + 1) {
dis[S][u] = dis[S][x] + 1;
if (vis[u] != S) {
q.push(u);
vis[u] = S;
}
}
u = x + len[i];
if (u <= n + 1 && dis[S][u] > dis[S][x] + 1) {
dis[S][u] = dis[S][x] + 1;
if (vis[u] != S) {
q.push(u);
vis[u] = S;
}
}
}
}
}
int main() {
scanf("%d%d%d", &n, &k, &m);
int x, cnt = 0;
for (register int i = 1; i <= k; ++i) scanf("%d", &x), a[x] = 1;
for (register int i = 1; i <= m; ++i) scanf("%d", &len[i]);
for (register int i = 1; i <= n + 1; ++i)
if (a[i] != a[i - 1]) p[++cnt] = i;
for (register int i = 1; i <= cnt; ++i) bfs(i, p[i]);
int mx = (1 << cnt) - 1;
for (register int i = 0; i < mx; ++i) f[i] = inf;
for (register int i = mx; i; --i) {
if (f[i] == inf) continue;
for (register int j = 1; j <= cnt; ++j) {
if ((i & (1 << (j - 1))) == 0) continue;
for (register int l = j + 1; l <= cnt; ++l) {
if ((i & (1 << (l - 1))) == 0) continue;
int to = i - (1 << (j - 1)) - (1 << (l - 1));
f[to] = min(f[to], f[i] + dis[j][p[l]]);
}
break;
}
}
printf("%d", f[0] == inf ? -1 : f[0]);
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool ckmax(T& x, T y) {
return x < y ? x = y, 1 : 0;
}
template <class T>
bool ckmin(T& x, T y) {
return x > y ? x = y, 1 : 0;
}
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = 0;
ch = getchar();
}
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
const int N = 40005;
const int M = 105;
const int K = 20;
int n, k, m, a[K], b[M], dif[N], c[K], tot, dis[K][N], cnt[1 << K], dp[1 << K];
bool vis[N];
void bfs(int* dis, int st) {
static int q[N], ql, qr;
q[ql = qr = 1] = st;
for (int i = 1, iend = n + 1; i <= iend; ++i) dis[i] = 0x3f3f3f3f, vis[i] = 0;
dis[st] = 0, vis[st] = 1;
while (ql <= qr) {
int u = q[ql++];
for (int i = 1, iend = m; i <= iend; ++i) {
if (u - b[i] >= 1 && !vis[u - b[i]])
dis[u - b[i]] = dis[u] + 1, vis[u - b[i]] = 1, q[++qr] = u - b[i];
if (u + b[i] <= n + 1 && !vis[u + b[i]])
dis[u + b[i]] = dis[u] + 1, vis[u + b[i]] = 1, q[++qr] = u + b[i];
}
}
}
signed main() {
n = read(), k = read(), m = read();
for (int i = 1, iend = k; i <= iend; ++i) {
a[i] = read();
dif[a[i]] ^= 1, dif[a[i] + 1] ^= 1;
}
for (int i = 1, iend = m; i <= iend; ++i) b[i] = read();
for (int i = 1, iend = n + 1; i <= iend; ++i)
if (dif[i] == 1) c[tot++] = i;
for (int i = 0; i < tot; ++i) bfs(dis[i], c[i]);
memset(dp, 0x3f, sizeof(dp)), dp[0] = 0;
for (int msk = 0; msk < 1 << tot; ++msk) {
cnt[msk] = cnt[msk >> 1] + (msk & 1);
if (cnt[msk] & 1) continue;
int st = -1;
for (int i = 0; i < tot; ++i) {
if (msk >> i & 1) {
if (!~st)
st = i;
else
ckmin(dp[msk], dp[msk ^ (1 << st) ^ (1 << i)] + dis[st][c[i]]);
}
}
}
int ans = dp[(1 << tot) - 1];
printf("%d\n", ans == 0x3f3f3f3f ? -1 : ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int info[10001];
int n, k, l;
int mov[100];
int bList[20];
int bListN;
int dynamic[1 << 20];
int dist[20][10001];
int getDynamic(int stat);
int main(void) {
scanf("%d %d %d", &n, &k, &l);
for (int i = 0; i < k; i++) {
int cur;
scanf("%d", &cur);
info[cur - 1] = (info[cur - 1] + 1) % 2;
info[cur] = (info[cur] + 1) % 2;
}
for (int i = 0; i < l; i++) scanf("%d", mov + i);
for (int i = 0; i <= n; i++)
if (info[i]) bList[bListN++] = i;
memset(dist, -1, sizeof(dist));
for (int i = 0; i < bListN; i++) {
int start = bList[i];
dist[i][start] = 0;
queue<int> q;
q.push(start);
while (!q.empty()) {
int cur = q.front();
q.pop();
for (int j = 0; j < l; j++) {
int next = cur + mov[j];
if (next <= n && dist[i][next] == -1) {
dist[i][next] = dist[i][cur] + 1;
q.push(next);
}
next = cur - mov[j];
if (next >= 0 && dist[i][next] == -1) {
dist[i][next] = dist[i][cur] + 1;
q.push(next);
}
}
}
}
memset(dynamic, -1, sizeof(dynamic));
int ans = getDynamic((1 << bListN) - 1);
if (ans >= 99999999) ans = -1;
printf("%d\n", ans);
return 0;
}
int getDynamic(int stat) {
int &ret = dynamic[stat];
if (ret != -1) return ret;
ret = 99999999;
if (stat == 0)
ret = 0;
else {
int start;
for (int i = 0; i < bListN; i++)
if (stat & (1 << i)) {
start = i;
break;
}
for (int i = start + 1; i < bListN; i++) {
if (stat & (1 << i)) {
if (dist[start][bList[i]] != -1) {
ret = min(ret, getDynamic(stat - (1 << start) - (1 << i)) +
dist[start][bList[i]]);
}
}
}
}
return ret;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f, mod = 1000000007;
int dp[1 << 20], num[1 << 20], low[1 << 20], f[10005], dis[10005], mn[22][22],
len[105], cnt[22];
int n, k, l, tot = 0;
queue<int> q;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-') f = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = (x << 1) + (x << 3) + ch - '0';
return x * f;
}
void Get_Shortest_Path(int rt) {
memset(dis, 0x3f, sizeof(dis));
dis[cnt[rt]] = 0;
q.push(cnt[rt]);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = 1; i <= l; i++) {
if (u + len[i] <= n + 1 && dis[u + len[i]] > dis[u] + 1) {
dis[u + len[i]] = dis[u] + 1;
q.push(u + len[i]);
}
if (u - len[i] > 0 && dis[u - len[i]] > dis[u] + 1) {
dis[u - len[i]] = dis[u] + 1;
q.push(u - len[i]);
}
}
}
for (int i = 1; i <= tot; i++) mn[rt][i] = dis[cnt[i]];
}
int main() {
n = read();
k = read();
l = read();
for (int i = 1; i <= k; i++) {
int x = read();
f[x] = 1;
}
for (int i = 1; i <= n + 1; i++)
if (f[i] ^ f[i - 1]) cnt[++tot] = i;
for (int i = 1; i <= l; i++) len[i] = read();
for (int i = 1; i <= tot; i++) Get_Shortest_Path(i);
low[1] = 0;
for (int i = 2; i < (1 << tot); i++) low[i] = low[i >> 1] + 1;
for (int i = 1; i < (1 << tot); i++) num[i] = num[i - (i & -i)] + 1;
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < (1 << tot); i++) {
if (num[i] & 1) continue;
int j = ((1 << tot) - 1) ^ i;
j = low[j & -j] + 1;
for (int k = j + 1; k <= tot; k++)
dp[i | (1 << (j - 1)) | (1 << (k - 1))] =
min(dp[i | (1 << (j - 1)) | (1 << (k - 1))], dp[i] + mn[j][k]);
}
printf("%d\n", dp[(1 << tot) - 1] == inf ? -1 : dp[(1 << tot) - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 5;
int a[maxn], b[maxn], n, l, k, x[maxn];
vector<int> v;
int d[20][maxn];
void enter() {
cin >> n >> k >> l;
for (int i = 0; i < k; ++i) {
int u;
cin >> u;
a[u + 1] ^= 1, a[u] ^= 1;
}
for (int i = 1; i <= l; ++i) cin >> b[i];
}
int dp[1 << 20];
const int inf = 1e9;
void BFS(int st, int d[maxn]) {
queue<int> q;
q.push(st);
fill_n(d, maxn, inf);
d[st] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = 1; i <= l; ++i) {
for (int j = -1; j <= 1; ++j) {
int nx = u + b[i] * j;
if (nx > 0 && nx <= n + 1 && d[nx] == inf) d[nx] = d[u] + 1, q.push(nx);
}
}
}
}
void solve() {
for (int i = 1; i <= n + 1; ++i)
if (a[i] == 1) BFS(i, d[v.size()]), v.push_back(i);
int sz = v.size();
fill_n(dp, 1 << sz, inf);
dp[0] = 0;
for (int i = 0; i < (1 << sz); ++i) {
for (int j = 0; j < sz; ++j) {
if ((i >> j) & 1) continue;
for (int k = j + 1; k < sz; ++k) {
if ((i >> k) & 1) continue;
int& res = dp[i | (1 << j) | (1 << k)];
res = min(res, dp[i] + d[j][v[k]]);
}
}
}
if (dp[(1 << sz) - 1] == inf)
cout << -1;
else
cout << dp[(1 << sz) - 1];
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
if (fopen("TEST"
".INP",
"r"))
freopen(
"TEST"
".INP",
"r", stdin),
freopen(
"TEST"
".OUT",
"w", stdout);
enter();
solve();
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.