buggy_code
stringlengths 11
625k
| fixed_code
stringlengths 17
625k
| bug_type
stringlengths 2
4.45k
| language
int64 0
8
| token_count
int64 5
200k
|
|---|---|---|---|---|
#include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define NUM 100000
enum Type {
A,
B,
Both,
};
struct ADD {
bool operator<(const struct ADD &arg) const { return value < arg.value; }
int value, index;
};
struct SUB {
bool operator<(const struct SUB &arg) const { return value < arg.value; }
int value, index;
};
int N;
ADD info_add[NUM];
SUB info_sub[NUM];
Type type[2][NUM];
bool is_OK(int max_dist) {
for (int i = 0; i < N; i++) {
type[0][i] = Both;
type[1][i] = Both;
}
int num_A;
type[0][info_add[0].index] = A;
num_A = 1;
for (int i = 1; i < N; i++) {
if (info_add[i].value - info_add[0].value > max_dist &&
info_add[N - 1].value - info_add[i].value > max_dist)
return false;
if (info_add[i].value - info_add[0].value > max_dist) {
type[0][info_add[i].index] = B;
}
if (info_add[N - 1].value - info_add[i].value > max_dist) {
type[0][info_add[i].index] = A;
num_A++;
}
}
if (num_A == N)
return false;
type[1][info_sub[0].index] = A;
num_A = 1;
for (int i = 1; i < N; i++) {
if (info_sub[i].value - info_sub[0].value > max_dist &&
info_sub[N - 1].value - info_sub[i].value > max_dist)
return false;
if (info_sub[i].value - info_sub[0].value > max_dist) {
type[1][info_sub[i].index] = B;
}
if (info_sub[N - 1].value - info_sub[i].value > max_dist) {
type[1][info_sub[i].index] = A;
num_A++;
}
}
if (num_A == N)
return false;
int num_both = 0;
int num_diff = 0;
for (int i = 0; i < N; i++) {
if (type[0][i] == Both && type[1][i] == Both) {
num_both++;
} else if (type[0][i] != type[1][i]) {
num_diff++;
}
}
if (num_diff == 0)
return true;
if (num_both + num_diff == N)
return true;
return false;
}
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
info_add[i].index = i;
info_sub[i].index = i;
}
int x, y;
for (int i = 0; i < N; i++) {
scanf("%d %d", &x, &y);
info_add[i].value = x + y;
info_sub[i].value = x - y;
}
sort(info_add, info_add + N);
sort(info_sub, info_sub + N);
int left = 0, right = 400000, m = (left + right) / 2;
int ans = right;
while (left <= right) {
if (is_OK(m)) {
ans = m;
right = m - 1;
} else {
left = m + 1;
}
m = (left + right) / 2;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define NUM 100000
enum Type {
A,
B,
Both,
};
struct ADD {
bool operator<(const struct ADD &arg) const { return value < arg.value; }
int value, index;
};
struct SUB {
bool operator<(const struct SUB &arg) const { return value < arg.value; }
int value, index;
};
int N;
ADD info_add[NUM];
SUB info_sub[NUM];
Type type[2][NUM];
bool is_OK(int max_dist) {
for (int i = 0; i < N; i++) {
type[0][i] = Both;
type[1][i] = Both;
}
int num_A;
type[0][info_add[0].index] = A;
num_A = 1;
for (int i = 1; i < N; i++) {
if (info_add[i].value - info_add[0].value > max_dist &&
info_add[N - 1].value - info_add[i].value > max_dist)
return false;
if (info_add[i].value - info_add[0].value > max_dist) {
type[0][info_add[i].index] = B;
}
if (info_add[N - 1].value - info_add[i].value > max_dist) {
type[0][info_add[i].index] = A;
num_A++;
}
}
if (num_A == N)
return false;
type[1][info_sub[0].index] = A;
num_A = 1;
for (int i = 1; i < N; i++) {
if (info_sub[i].value - info_sub[0].value > max_dist &&
info_sub[N - 1].value - info_sub[i].value > max_dist)
return false;
if (info_sub[i].value - info_sub[0].value > max_dist) {
type[1][info_sub[i].index] = B;
}
if (info_sub[N - 1].value - info_sub[i].value > max_dist) {
type[1][info_sub[i].index] = A;
num_A++;
}
}
if (num_A == N)
return false;
int num_both = 0;
int num_diff = 0;
for (int i = 0; i < N; i++) {
if (type[0][i] == Both || type[1][i] == Both) {
num_both++;
} else if (type[0][i] != type[1][i]) {
num_diff++;
}
}
if (num_diff == 0)
return true;
if (num_both + num_diff == N)
return true;
return false;
}
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
info_add[i].index = i;
info_sub[i].index = i;
}
int x, y;
for (int i = 0; i < N; i++) {
scanf("%d %d", &x, &y);
info_add[i].value = x + y;
info_sub[i].value = x - y;
}
sort(info_add, info_add + N);
sort(info_sub, info_sub + N);
int left = 0, right = 400000, m = (left + right) / 2;
int ans = right;
while (left <= right) {
if (is_OK(m)) {
ans = m;
right = m - 1;
} else {
left = m + 1;
}
m = (left + right) / 2;
}
printf("%d\n", ans);
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106]]
| 1
| 796
|
#include <stdio.h>
#define INF 1000000000
int a[100005], b[100005];
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int main() {
int n, x, y;
scanf("%d", &n);
int lx = INF, ly = INF, rx = -INF, ry = -INF;
for (int i = 0; i < n; i++) {
scanf("%d%d", &x, &y);
a[i] = x + y;
b[i] = x - y;
lx = min(lx, x + y);
rx = max(rx, x + y);
ly = min(ly, x - y);
ry = max(ry, x - y);
}
int ret1 = INF, ret2 = INF;
for (int i = 0; i < n; i++) {
//(lx,ly)(rx,ry)
ret1 = min(ret1, min(max(a[i] - lx, b[i] - ly), max(rx - a[i], ry - b[i])));
//(lx,ry)(rx,ly)
ret2 = min(ret2, min(max(a[i] - lx, ry - b[i]), max(rx - a[i], b[i] - ly)));
}
printf("%d\n", min(ret1, ret2));
}
|
#include <stdio.h>
#define INF 100000000
int a[100005], b[100005];
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int main() {
int n, x, y;
scanf("%d", &n);
int lx = INF, ly = INF, rx = -INF, ry = -INF;
for (int i = 0; i < n; i++) {
scanf("%d%d", &x, &y);
a[i] = x + y;
b[i] = x - y;
lx = min(lx, x + y);
rx = max(rx, x + y);
ly = min(ly, x - y);
ry = max(ry, x - y);
}
int ret1 = 0, ret2 = 0;
for (int i = 0; i < n; i++) {
//(lx,ly)(rx,ry)
ret1 = max(ret1, min(max(a[i] - lx, b[i] - ly), max(rx - a[i], ry - b[i])));
//(lx,ry)(rx,ly)
ret2 = max(ret2, min(max(a[i] - lx, ry - b[i]), max(rx - a[i], b[i] - ly)));
}
printf("%d\n", min(ret1, ret2));
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22]]
| 1
| 319
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int n;
struct expo {
int x, y;
};
bool comp(const expo &a, const expo &b) { return a.x > b.y; }
int abs(int a) {
if (a < 0)
return -a;
return a;
}
expo in[100001];
expo add[100001];
expo minu[100001];
int team[2][100001];
bool C(int div) {
for (int i = 0; i < n; i++)
team[0][i] = team[1][i] = -1;
team[0][add[0].y] = 0;
for (int i = 0; i < n; i++) {
if (abs(add[i].x - add[0].x) > div && abs(add[i].x - add[n - 1].x) > div)
return false;
if (abs(add[i].x - add[0].x) > div)
team[0][add[i].y] = 1;
if (abs(add[i].x - add[n - 1].x) > div)
team[0][add[i].y] = 0;
}
team[1][minu[0].y] = 0;
for (int i = 0; i < n; i++) {
if (abs(minu[i].x - minu[0].x) > div &&
abs(minu[i].x - minu[n - 1].x) > div)
return false;
if (abs(minu[i].x - minu[0].x) > div)
team[1][minu[i].y] = 1;
if (abs(minu[i].x - minu[n - 1].x) > div)
team[1][minu[i].y] = 0;
}
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
if (team[0][i] == -1 || team[1][i] == -1) {
b++;
} else {
if (team[0][i] != team[1][i])
a++;
}
}
return (a == 0 || a + b == n);
}
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &in[i].x, &in[i].y);
add[i].x = in[i].x + in[i].y;
minu[i].x = in[i].x - in[i].y;
add[i].y = minu[i].y = i;
}
sort(add, add + n, comp);
sort(minu, minu + n, comp);
int lb = -1, ub = 400001;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
if (C(mid))
ub = mid;
else
lb = mid;
}
printf("%d\n", ub);
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int n;
struct expo {
int x, y;
};
bool comp(const expo &a, const expo &b) { return a.x > b.x; }
int abs(int a) {
if (a < 0)
return -a;
return a;
}
expo in[100001];
expo add[100001];
expo minu[100001];
int team[2][100001];
bool C(int div) {
for (int i = 0; i < n; i++)
team[0][i] = team[1][i] = -1;
team[0][add[0].y] = 0;
for (int i = 0; i < n; i++) {
if (abs(add[i].x - add[0].x) > div && abs(add[i].x - add[n - 1].x) > div)
return false;
if (abs(add[i].x - add[0].x) > div)
team[0][add[i].y] = 1;
if (abs(add[i].x - add[n - 1].x) > div)
team[0][add[i].y] = 0;
}
team[1][minu[0].y] = 0;
for (int i = 0; i < n; i++) {
if (abs(minu[i].x - minu[0].x) > div &&
abs(minu[i].x - minu[n - 1].x) > div)
return false;
if (abs(minu[i].x - minu[0].x) > div)
team[1][minu[i].y] = 1;
if (abs(minu[i].x - minu[n - 1].x) > div)
team[1][minu[i].y] = 0;
}
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
if (team[0][i] == -1 || team[1][i] == -1) {
b++;
} else {
if (team[0][i] != team[1][i])
a++;
}
}
return (a == 0 || a + b == n);
}
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &in[i].x, &in[i].y);
add[i].x = in[i].x + in[i].y;
minu[i].x = in[i].x - in[i].y;
add[i].y = minu[i].y = i;
}
sort(add, add + n, comp);
sort(minu, minu + n, comp);
int lb = -1, ub = 400001;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
if (C(mid))
ub = mid;
else
lb = mid;
}
printf("%d\n", ub);
return 0;
}
|
[["-", 8, 9, 0, 37, 0, 16, 12, 118, 119, 120], ["+", 8, 9, 0, 37, 0, 16, 12, 118, 119, 120]]
| 1
| 730
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <utility>
using namespace std;
typedef pair<int, int> P;
P A[100000], B[100000];
// A:(x+y) B:(x-y)
int N, a[100000], b[100000];
// a:(x+y)で分けたとき B:(x-y)で分けたとき
bool ok(int M) {
int both = 0, differ = 0;
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
for (int i = 0; i < N; i++) {
if (abs(A[N - 1].first - A[i].first) > M &&
abs(A[i].first - A[0].first) > M)
return false;
if (abs(A[i].first - A[0].first) > M)
a[A[i].second] = 1;
if (abs(A[N - 1].first - A[0].first) > M)
a[A[i].second] = 2;
}
for (int i = 0; i < N; i++) {
if (abs(B[N - 1].first - B[i].first) > M &&
abs(B[i].first - B[0].first) > M)
return false;
if (abs(B[i].first - B[0].first) > M)
b[B[i].second] = 1;
if (abs(B[N - 1].first - B[i].first) > M)
b[B[i].second] = 2;
}
for (int i = 0; i < N; i++) {
if (a[i] == 0 || b[i] == 0)
both++;
else if (a[i] != b[i])
differ++;
}
return (differ == 0 || both + differ == N);
}
int main() {
int x, y;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d %d", &x, &y);
A[i].first = x + y, A[i].second = i;
B[i].first = x - y, B[i].second = i;
}
sort(A, A + N);
sort(B, B + N);
int lower = 0, upper = 1 << 20;
while (upper - lower > 5) {
int mid = (upper + lower) / 2;
if (ok(mid))
upper = mid;
else
lower = mid;
}
while (ok(--upper))
;
printf("%d\n", upper + 1);
}
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <utility>
using namespace std;
typedef pair<int, int> P;
P A[100000], B[100000];
int N, a[100000], b[100000];
bool ok(int M) {
int both = 0, differ = 0;
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
for (int i = 0; i < N; i++) {
if (abs(A[N - 1].first - A[i].first) > M &&
abs(A[i].first - A[0].first) > M)
return false;
if (abs(A[i].first - A[0].first) > M)
a[A[i].second] = 1;
if (abs(A[N - 1].first - A[i].first) > M)
a[A[i].second] = 2;
}
for (int i = 0; i < N; i++) {
if (abs(B[N - 1].first - B[i].first) > M &&
abs(B[i].first - B[0].first) > M)
return false;
if (abs(B[i].first - B[0].first) > M)
b[B[i].second] = 1;
if (abs(B[N - 1].first - B[i].first) > M)
b[B[i].second] = 2;
}
for (int i = 0; i < N; i++) {
if (a[i] == 0 || b[i] == 0)
both++;
else if (a[i] != b[i])
differ++;
}
return (differ == 0 || both + differ == N);
}
int main() {
int x, y;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d %d", &x, &y);
A[i].first = x + y, A[i].second = i;
B[i].first = x - y, B[i].second = i;
}
sort(A, A + N);
sort(B, B + N);
int lower = 0, upper = 1 << 20;
while (upper - lower > 5) {
int mid = (upper + lower) / 2;
if (ok(mid))
upper = mid;
else
lower = mid;
}
while (ok(--upper))
;
printf("%d\n", upper + 1);
}
|
[["-", 0, 16, 12, 118, 28, 69, 341, 342, 0, 13], ["+", 0, 16, 12, 118, 28, 69, 341, 342, 0, 22]]
| 1
| 589
|
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1 << 29;
int main() {
int m, n;
while (cin >> m >> n, m || n) {
int ba[m][n];
int num = 0;
int sx, sy;
REP(i, n) {
REP(j, m) {
int a;
cin >> a;
if (a == 1) {
ba[j][i] = ++num;
} else {
ba[j][i] = 0;
if (a == 2)
sx = j;
sy = i;
}
}
}
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
map<int, int> mp;
mp[((1 << num) - 1) * 100 + sx * 10 + sy] = 1;
REP(i, num) {
map<int, int> nextmp;
FOR(it, mp) {
int hoge = it->first;
int S = hoge / 100;
int x = (hoge % 100) / 10;
int y = hoge % 10;
// cout << bitset<7>(S) << " " << x << " "<<y << " " <<
// it->second << endl;
REP(k, 4) {
int xx = x, yy = y;
while (1) {
xx += dx[k];
yy += dy[k];
if (xx < 0 || xx >= m || yy < 0 || yy >= n)
break;
if (ba[xx][yy]) {
if (S & (1 << (ba[xx][yy] - 1))) {
nextmp[(S - (1 << (ba[xx][yy] - 1))) * 100 + xx * 10 + yy] +=
it->second;
break;
}
}
}
}
}
// cout << endl;
mp = nextmp;
}
int res = 0;
REP(y, n) {
REP(x, m) {
if (x == sx || y == sy)
res += mp[x * 10 + y];
}
}
cout << res << endl;
}
}
|
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1 << 29;
int main() {
int m, n;
while (cin >> m >> n, m || n) {
int ba[m][n];
int num = 0;
int sx, sy;
REP(i, n) {
REP(j, m) {
int a;
cin >> a;
if (a == 1) {
ba[j][i] = ++num;
} else {
ba[j][i] = 0;
if (a == 2) {
sx = j;
sy = i;
}
}
}
}
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
map<int, int> mp;
mp[((1 << num) - 1) * 100 + sx * 10 + sy] = 1;
REP(i, num) {
map<int, int> nextmp;
FOR(it, mp) {
int hoge = it->first;
int S = hoge / 100;
int x = (hoge % 100) / 10;
int y = hoge % 10;
// cout << bitset<7>(S) << " " << x << " "<<y << " " <<
// it->second << endl;
REP(k, 4) {
int xx = x, yy = y;
while (1) {
xx += dx[k];
yy += dy[k];
if (xx < 0 || xx >= m || yy < 0 || yy >= n)
break;
if (ba[xx][yy]) {
if (S & (1 << (ba[xx][yy] - 1))) {
nextmp[(S - (1 << (ba[xx][yy] - 1))) * 100 + xx * 10 + yy] +=
it->second;
break;
}
}
}
}
}
// cout << endl;
mp = nextmp;
}
int res = 0;
REP(y, n) {
REP(x, m) {
if (x == sx || y == sy)
res += mp[x * 10 + y];
}
}
cout << res << endl;
}
}
|
[["+", 75, 76, 0, 9, 0, 57, 64, 9, 0, 45], ["+", 75, 76, 0, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 471
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int m;
int n;
int map[10][10] = {0};
int cnt = 0;
int churchx;
int churchy;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int saiki(int xinput, int yinput, int nokori) {
for (int i = 0; i < 4; i++) {
int x = xinput;
int y = yinput;
if (nokori == 0) {
if (y == churchy && x > churchx && i != 0)
continue;
if (y == churchy && x < churchx && i != 1)
continue;
if (x == churchx && y > churchy && i != 2)
continue;
if (x == churchx && y < churchy && i != 3)
continue;
}
while (true) {
x += dx[i];
y += dy[i];
if (x < 0 || x >= m || y < 0 || y >= n)
break;
if (map[x][y] == 1) {
map[x][y] = 3;
saiki(x, y, nokori - 1);
map[x][y] = 1;
} else if (map[x][y] == 2) {
if (nokori == 0) {
cnt++;
return 0;
}
} else if (map[x][y] == 3) {
break;
}
}
}
return 0;
}
int main() {
while (true) {
cin >> m;
cin >> n;
if (m == 0)
break;
int nokori = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> map[j][i];
if (map[j][i] == 1) {
nokori++;
} else if (map[j][i] == 2) {
churchx = j;
churchy = i;
}
}
}
if (nokori == 0) {
cout << "1" << endl;
} else {
cnt = 0;
saiki(churchx, churchy, nokori);
cout << cnt << endl;
}
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int m;
int n;
int map[10][10] = {0};
int cnt = 0;
int churchx;
int churchy;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int saiki(int xinput, int yinput, int nokori) {
for (int i = 0; i < 4; i++) {
int x = xinput;
int y = yinput;
if (nokori == 0) {
if (y == churchy && x > churchx && i != 0)
continue;
if (y == churchy && x < churchx && i != 1)
continue;
if (x == churchx && y > churchy && i != 2)
continue;
if (x == churchx && y < churchy && i != 3)
continue;
}
while (true) {
x += dx[i];
y += dy[i];
if (x < 0 || x >= m || y < 0 || y >= n)
break;
if (map[x][y] == 1) {
map[x][y] = 0;
saiki(x, y, nokori - 1);
map[x][y] = 1;
break;
} else if (map[x][y] == 2) {
if (nokori == 0) {
cnt++;
return 0;
}
} else if (map[x][y] == 3) {
break;
}
}
}
return 0;
}
int main() {
while (true) {
cin >> m;
cin >> n;
if (m == 0)
break;
int nokori = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> map[j][i];
if (map[j][i] == 1) {
nokori++;
} else if (map[j][i] == 2) {
churchx = j;
churchy = i;
}
}
}
if (nokori == 0) {
cout << "1" << endl;
} else {
cnt = 0;
saiki(churchx, churchy, nokori);
cout << cnt << endl;
}
}
return 0;
}
|
[["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]]
| 1
| 480
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* A Traveler
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = "";
while ((line = br.readLine()) != null && !line.isEmpty()) {
int n = Integer.parseInt(line.substring(0, line.indexOf(' ')));
int m = Integer.parseInt(line.substring(line.indexOf(' ') + 1));
int[] d = new int[n];
for (int i = 0; i < n - 1; i++) {
d[i] = Integer.parseInt(br.readLine());
}
int sum = 0;
int inn = 0;
for (int i = 0; i < m; i++) {
int mm = Integer.parseInt(br.readLine());
if (mm > 0) {
for (int j = inn; j < inn + mm; j++) {
sum += d[j];
}
} else {
for (int j = inn; j > inn + mm; j--) {
sum += d[j];
}
}
inn += mm;
}
System.out.println(sum % 100000);
}
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* A Traveler
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = "";
while ((line = br.readLine()) != null && !line.isEmpty()) {
int n = Integer.parseInt(line.substring(0, line.indexOf(' ')));
int m = Integer.parseInt(line.substring(line.indexOf(' ') + 1));
int[] d = new int[n];
for (int i = 0; i < n - 1; i++) {
d[i] = Integer.parseInt(br.readLine());
}
long sum = 0;
int inn = 0;
for (int i = 0; i < m; i++) {
int mm = Integer.parseInt(br.readLine());
if (mm > 0) {
for (int j = inn; j < inn + mm; j++) {
sum += d[j];
}
} else {
for (int j = inn - 1; j >= inn + mm; j--) {
sum += d[j];
}
}
inn += mm;
}
System.out.println(sum % 100000);
}
}
}
|
[["-", 0, 52, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 52, 8, 196, 0, 503, 39, 506, 0, 96], ["+", 0, 7, 502, 503, 49, 200, 51, 16, 17, 33], ["+", 0, 7, 502, 503, 49, 200, 51, 16, 12, 499], ["-", 0, 57, 75, 196, 0, 7, 15, 16, 17, 47], ["+", 0, 57, 75, 196, 0, 7, 15, 16, 17, 20]]
| 3
| 290
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int i, j, n, m, a, r, l, ans = 0;
static int s[100001] = {0};
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d", &a);
s[i] = s[i - 1] + a;
}
r = 0;
for (i = 0; i < m; i++) {
scanf("%d", &l);
ans = (ans + (abs(s[l] - s[r]) % 100000)) % 100000;
r = l;
}
printf("%d\n", ans);
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int i, j, n, m, a, r, l, ans = 0;
static int s[100001] = {0};
scanf("%d%d", &n, &m);
for (i = 1; i < n; i++) {
scanf("%d", &a);
s[i] = s[i - 1] + a;
}
r = 0;
for (i = 0; i < m; i++) {
scanf("%d", &l);
ans = (ans + (abs(s[r + l] - s[r]) % 100000)) % 100000;
r = r + l;
}
printf("%d\n", ans);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72]]
| 1
| 173
|
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0549
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
//宿場町はn個 m日間
int n, m, pos = 0, a;
long long ans = 0;
long long t[100000];
int main() {
cin >> n >> m;
t[0] = 0;
for (int i = 0; i < n; i++) {
cin >> t[i];
t[i] += t[i - 1];
}
pos = 0;
for (int i = 0; i < m; i++) {
cin >> a;
ans += abs(t[pos + a] - t[pos]);
ans %= 100000;
pos += a;
}
cout << ans << endl;
return 0;
}
|
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0549
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
//宿場町はn個 m日間
int n, m, pos = 0, a;
long long ans = 0;
long long t[100000];
int main() {
cin >> n >> m;
t[0] = 0;
//累積和
for (int i = 1; i < n; i++) {
cin >> t[i];
t[i] += t[i - 1];
}
pos = 0;
for (int i = 0; i < m; i++) {
cin >> a;
ans += abs(t[pos] - t[pos + a]);
ans %= 100000;
pos += a;
}
cout << ans << endl;
return 0;
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 16, 31, 69, 341, 342, 0, 16, 12, 22], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 12, 22]]
| 1
| 148
|
#include <iostream>
using namespace std;
int main() {
int n;
int m;
cin >> n;
cin >> m;
int a[n];
a[0] = 0;
int b;
int c;
b = 0;
while (b < n) {
cin >> c;
a[b + 1] = a[b] + c;
b = b + 1;
}
int e;
e = 0;
int d;
d = 0;
b = 0;
while (b < m) {
cin >> c;
if (c > 0) {
e = (e + a[d + c] - a[d]) % 100000;
} else {
e = (e + a[d] - a[d + c]) % 100000;
}
d = d + c;
b = b + 1;
}
cout << e << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
int m;
cin >> n;
cin >> m;
int a[n];
a[0] = 0;
int b;
int c;
b = 0;
while (b < n - 1) {
cin >> c;
a[b + 1] = a[b] + c;
b = b + 1;
}
int e;
e = 0;
int d;
d = 0;
b = 0;
while (b < m) {
cin >> c;
if (c > 0) {
e = (e + a[d + c] - a[d]) % 100000;
} else {
e = (e + a[d] - a[d + c]) % 100000;
}
d = d + c;
b = b + 1;
}
cout << e << endl;
}
|
[["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13]]
| 1
| 180
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(), (x).end())
#define all(x) (x).begin(), (x).end()
#define EQ(a, b) (abs((a) - (b)) < EPS)
const int MOD = 100000;
int a[100100];
int n, m;
int main() {
cin >> n >> m;
for (int i = 1; i < n; i++)
cin >> a[i];
for (int i = 1; i < n - 1; i++)
a[i] += a[i - 1];
int ans = 0;
int cur = 0;
for (int i = 0; i < m; i++) {
int k;
cin >> k;
ans += abs(a[cur + k] - a[cur]);
ans %= MOD;
cur += k;
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(), (x).end())
#define all(x) (x).begin(), (x).end()
#define EQ(a, b) (abs((a) - (b)) < EPS)
const int MOD = 100000;
int a[100100];
int n, m;
int main() {
cin >> n >> m;
for (int i = 1; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++)
a[i] += a[i - 1];
int ans = 0;
int cur = 0;
for (int i = 0; i < m; i++) {
int k;
cin >> k;
ans += abs(a[cur + k] - a[cur]);
ans %= MOD;
cur += k;
}
cout << ans << endl;
return 0;
}
|
[["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]]
| 1
| 254
|
#include <iostream>
#define rep(i, n) for (i = 0; i < n; i++)
using namespace std;
long long n, k;
long long rui[100000];
long long ans = 0;
int main() {
int i;
cin >> n >> k;
rep(i, n - 1) {
cin >> rui[i + 1];
rui[i + 1] += rui[i];
}
int bef = 0, now;
rep(i, k) {
cin >> now;
now += bef;
ans += rui[max(now, bef)] - rui[min(now, bef)];
}
cout << ans % 100000 << endl;
return 0;
}
|
#include <iostream>
#define rep(i, n) for (i = 0; i < n; i++)
using namespace std;
long long n, k;
long long rui[100000];
long long ans = 0;
int main() {
int i;
cin >> n >> k;
rep(i, n - 1) {
cin >> rui[i + 1];
rui[i + 1] += rui[i];
}
int bef = 0, now;
rep(i, k) {
cin >> now;
now += bef;
ans += rui[max(now, bef)] - rui[min(now, bef)];
bef = now;
}
cout << ans % 100000 << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 14, 8, 9, 0, 1, 0, 35]]
| 1
| 136
|
#include <cmath>
#include <iostream>
using namespace std;
int n, m;
int a[111111];
int k, ans, p;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> k;
a[i] = a[i - 1] + k;
}
while (m--) {
cin >> k;
ans += abs(a[p + k] - a[p]);
ans %= 100000;
p += k;
}
cout << ans << endl;
}
|
#include <cmath>
#include <iostream>
using namespace std;
int n, m;
int a[111111];
int k, ans, p;
int main() {
cin >> n >> m;
for (int i = 1; i < n; i++)
cin >> k, a[i] = a[i - 1] + k;
while (m--) {
cin >> k;
ans += abs(a[p + k] - a[p]);
ans %= 100000;
p += k;
}
cout << ans << endl;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 7, 8, 1, 0, 34, 0, 21], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 114
|
# -*- coding: utf-8 -*-
# !/usr/bin/env python
# vim: set fileencoding=utf-8 :
"""
#
# Author: Noname
# URL: https://github.com/pettan0818
# License: MIT License
# Created: 木 11/ 9 19:01:14 2017
# Usage
#
"""
from itertools import accumulate
def data_req():
n_yado, m_ryotei = [int(i) for i in input().split(" ")]
yado_distance = []
ryotei = []
for _ in range(n_yado - 1):
yado_distance.append(int(input()))
for _ in range(m_ryotei):
ryotei.append(int(input()))
return yado_distance, ryotei
def search(distance, ryotei):
"""search.
>>> search([2, 1, 1, 3, 2, 1], [2, -1, 3, 2, -3])
18
"""
acc = [0] + list(accumulate(distance, lambda x, y: x+y))
ryotei_index = [0] + list(accumulate(ryotei, lambda x, y: x+y))
# print(ryotei_index)
res = []
for index in enumerate(ryotei_index):
if index[0] == 0:
continue
index = index[0]
# print(index)
# print(ryotei_index[index])
# print(ryotei_index[index - 1])
dist = abs(acc[ryotei_index[index]] - acc[ryotei_index[index - 1]])
res.append(dist)
# print(sum(res))
# his = []
#
# for index in range(len(ryotei_index)):
# his.append(acc[ryotei_index[index + 1]] - acc[ryotei_index[index]])
#
# return sum(his)
return sum(res)
if __name__ == '__main__':
dis, ryotei = data_req()
search(dis, ryotei)
|
# -*- coding: utf-8 -*-
# !/usr/bin/env python
# vim: set fileencoding=utf-8 :
"""
#
# Author: Noname
# URL: https://github.com/pettan0818
# License: MIT License
# Created: 木 11/ 9 19:01:14 2017
# Usage
#
"""
from itertools import accumulate
def data_req():
n_yado, m_ryotei = [int(i) for i in input().split(" ")]
yado_distance = []
ryotei = []
for _ in range(n_yado - 1):
yado_distance.append(int(input()))
for _ in range(m_ryotei):
ryotei.append(int(input()))
return yado_distance, ryotei
def search(distance, ryotei):
"""search.
>>> search([2, 1, 1, 3, 2, 1], [2, -1, 3, 2, -3])
18
"""
acc = [0] + list(accumulate(distance, lambda x, y: x+y))
ryotei_index = [0] + list(accumulate(ryotei, lambda x, y: x+y))
# print(ryotei_index)
res = []
for index in enumerate(ryotei_index):
if index[0] == 0:
continue
index = index[0]
# print(index)
# print(ryotei_index[index])
# print(ryotei_index[index - 1])
dist = abs(acc[ryotei_index[index]] - acc[ryotei_index[index - 1]])
res.append(dist)
# print(sum(res))
# his = []
#
# for index in range(len(ryotei_index)):
# his.append(acc[ryotei_index[index + 1]] - acc[ryotei_index[index]])
#
# return sum(his)
return sum(res)
if __name__ == '__main__':
dis, ryotei = data_req()
print(search(dis, ryotei) % 100000)
|
[["+", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["+", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 3, 4, 0, 657, 31, 652, 3, 4, 0, 25], ["+", 0, 1, 0, 652, 3, 4, 0, 657, 17, 109], ["+", 0, 1, 0, 652, 3, 4, 0, 657, 12, 612]]
| 5
| 236
|
#include <stdio.h>
int memo[2][5001][10000];
int N;
int map[10000 - 1];
int tansaku(int pos, int rest, int status) {
int result = 0x3fffffff;
int now_result;
if (pos >= N - 1)
return (rest == 0) ? 0 : 0x3fffffff;
if (rest < 0)
return 0x3fffffff;
if (memo[status][rest][pos] > 0)
return memo[status][rest][pos] - 1;
if (status) {
now_result = tansaku(pos + 1, rest - 1, 1);
if (now_result < result)
result = now_result;
now_result = tansaku(pos + 1, rest - 1, 0) + map[pos];
if (now_result < result)
result = now_result;
} else {
now_result = tansaku(pos + 1, rest, 0);
if (now_result < result)
result = now_result;
now_result = tansaku(pos + 1, rest, 1) + map[pos];
if (now_result < result)
result = now_result;
}
memo[status][rest][pos] = result + 1;
return result;
}
int main(void) {
int i;
int result;
scanf("%d", &N);
for (i = 0; i < N - 1; i++)
scanf("%d", &map[i]);
result = tansaku(0, N / 2, 0);
printf("%d\n", result);
return 0;
}
|
#include <stdio.h>
int memo[2][5001][10000];
int N;
int map[10000 - 1];
int tansaku(int pos, int rest, int status) {
int result = 0x3fffffff;
int now_result;
if (pos >= N - 1)
return (rest - status == 0) ? 0 : 0x3fffffff;
if (rest < 0)
return 0x3fffffff;
if (memo[status][rest][pos] > 0)
return memo[status][rest][pos] - 1;
if (status) {
now_result = tansaku(pos + 1, rest - 1, 1);
if (now_result < result)
result = now_result;
now_result = tansaku(pos + 1, rest - 1, 0) + map[pos];
if (now_result < result)
result = now_result;
} else {
now_result = tansaku(pos + 1, rest, 0);
if (now_result < result)
result = now_result;
now_result = tansaku(pos + 1, rest, 1) + map[pos];
if (now_result < result)
result = now_result;
}
memo[status][rest][pos] = result + 1;
return result;
}
int main(void) {
int i;
int result;
scanf("%d", &N);
for (i = 0; i < N - 1; i++)
scanf("%d", &map[i]);
result = tansaku(0, N / 2, 0);
printf("%d\n", result);
return 0;
}
|
[["+", 0, 41, 15, 23, 0, 16, 31, 16, 17, 33], ["+", 0, 41, 15, 23, 0, 16, 31, 16, 12, 22]]
| 0
| 314
|
#include <algorithm>
#include <iostream>
using namespace std;
int dp[2][5001][2]; /* 今いる位置、切った長さ、ここで切ったか */
int N;
int t[10010];
int ans = 1 << 30;
int main() {
cin >> N;
for (int i = 1; i < N; i++) {
cin >> t[i];
}
for (int i = 0; i <= 1; i++) {
for (int j = 1; j <= N / 2; j++) {
for (int k = 0; k <= 1; k++) {
dp[i][j][k] = 1 << 30;
}
}
}
dp[1][1][0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= N / 2; j++) {
for (int k = 0; k < 2; k++) {
int to = (i + 1) & 1;
dp[to][j + 1][0] = min(dp[to][j + 1][0], dp[i & 1][j][0]);
dp[to][j][1] = min(dp[to][j][1], dp[i & 1][j][0] + t[i]);
dp[to][j + 1][0] = min(dp[to][j + 1][to], dp[i & 1][j][1] + t[i]);
dp[to][j][1] = min(dp[to][j][1], dp[i & 1][j][1]);
}
}
for (int j = 1; j <= N / 2; j++) {
for (int k = 0; k < 2; k++) {
dp[i & 1][j][k] = 1 << 30;
}
}
}
ans = min(dp[N & 1][N / 2][1], dp[N & 1][N / 2][0]);
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int dp[2][5001][2]; /* 今いる位置、切った長さ、ここで切ったか */
int N;
int t[10010];
int ans = 1 << 30;
int main() {
cin >> N;
for (int i = 1; i < N; i++) {
cin >> t[i];
}
for (int i = 0; i <= 1; i++) {
for (int j = 1; j <= N / 2; j++) {
for (int k = 0; k <= 1; k++) {
dp[i][j][k] = 1 << 30;
}
}
}
dp[1][1][0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= N / 2; j++) {
for (int k = 0; k < 2; k++) {
int to = (i + 1) & 1;
dp[to][j + 1][0] = min(dp[to][j + 1][0], dp[i & 1][j][0]);
dp[to][j][1] = min(dp[to][j][1], dp[i & 1][j][0] + t[i]);
dp[to][j + 1][0] = min(dp[to][j + 1][0], dp[i & 1][j][1] + t[i]);
dp[to][j][1] = min(dp[to][j][1], dp[i & 1][j][1]);
}
}
for (int j = 1; j <= N / 2; j++) {
for (int k = 0; k < 2; k++) {
dp[i & 1][j][k] = 1 << 30;
}
}
}
ans = min(dp[N & 1][N / 2][1], dp[N & 1][N / 2][0]);
cout << ans << endl;
return 0;
}
|
[["-", 12, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 13]]
| 1
| 474
|
#include <algorithm>
#include <cstdio>
using namespace std;
int dp[2][5001];
int main() {
int n, in;
scanf("%d", &n);
for (int i = 0; i <= n / 2; i++)
dp[0][i] = dp[1][i] = 2000000000;
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &in);
for (int j = n / 2 - 1; j >= 0; j--) {
dp[1][j + 1] = dp[1][j];
}
dp[1][0] = 2000000000;
for (int j = 0; j <= n / 2; j++) {
dp[0][j] = min(dp[1][j] + in, dp[0][j]);
dp[1][j] = min(dp[0][j] + in, dp[1][j]);
}
}
printf("%d\n", min(dp[0][n / 2], dp[0][n / 2]));
return 0;
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
int dp[2][5001];
int main() {
int n, in;
scanf("%d", &n);
for (int i = 0; i <= n / 2; i++)
dp[0][i] = dp[1][i] = 2000000000;
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &in);
for (int j = n / 2 - 1; j >= 0; j--) {
dp[1][j + 1] = dp[1][j];
}
dp[1][0] = 2000000000;
for (int j = 0; j <= n / 2; j++) {
dp[0][j] = min(dp[1][j] + in, dp[0][j]);
dp[1][j] = min(dp[0][j] + in, dp[1][j]);
}
}
printf("%d\n", min(dp[0][n / 2], dp[1][n / 2]));
return 0;
}
|
[["-", 3, 4, 0, 69, 28, 69, 341, 342, 0, 13], ["+", 3, 4, 0, 69, 28, 69, 341, 342, 0, 13]]
| 1
| 266
|
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
static const int tx[] = {0, 1, 0, -1};
static const int ty[] = {-1, 0, 1, 0};
static const double EPS = 1e-8;
int dp[2][10001][2];
int main() {
int N;
while (~scanf("%d", &N)) {
vector<int> costs;
for (int i = 0; i < N; i++) {
int cost;
scanf("%d", &cost);
costs.push_back(cost);
}
memset(dp, 0x3f, sizeof(dp));
dp[0][0][0] = 0;
for (int pos = 0; pos < N; pos++) {
for (int num_of_zero = pos; num_of_zero >= 0; num_of_zero--) {
dp[(pos + 1) % 2][num_of_zero + 1][0] =
min(dp[pos % 2][num_of_zero][0],
dp[pos % 2][num_of_zero][1] + costs[pos]);
dp[(pos + 1) % 2][num_of_zero][1] =
min(dp[pos % 2][num_of_zero][1],
dp[pos % 2][num_of_zero][0] + costs[pos]);
}
memset(dp[pos % 2], 0x3f, sizeof(dp[pos % 2]));
}
printf("%d\n", dp[N % 2][N / 2][0]);
}
}
|
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
static const int tx[] = {0, 1, 0, -1};
static const int ty[] = {-1, 0, 1, 0};
static const double EPS = 1e-8;
int dp[2][10001][2];
int main() {
int N;
while (~scanf("%d", &N)) {
vector<int> costs;
for (int i = 0; i < N - 1; i++) {
int cost;
scanf("%d", &cost);
costs.push_back(cost);
}
memset(dp, 0x3f, sizeof(dp));
dp[0][0][0] = 0;
for (int pos = 0; pos < N; pos++) {
for (int num_of_zero = pos; num_of_zero >= 0; num_of_zero--) {
dp[(pos + 1) % 2][num_of_zero + 1][0] =
min(dp[pos % 2][num_of_zero][0],
dp[pos % 2][num_of_zero][1] + costs[pos]);
dp[(pos + 1) % 2][num_of_zero][1] =
min(dp[pos % 2][num_of_zero][1],
dp[pos % 2][num_of_zero][0] + costs[pos]);
}
memset(dp[pos % 2], 0x3f, sizeof(dp[pos % 2]));
}
printf("%d\n", dp[N % 2][N / 2][0]);
break;
}
}
|
[["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 52, 8, 9, 0, 93, 0, 94]]
| 1
| 393
|
#include <bits/stdc++.h>
using namespace std;
int N, cost[10000];
int dp[5010][2];
const int INF = 1e9;
int main() {
scanf("%d", &N);
for (int i = 0; i < N - 1; i++)
scanf("%d", &cost[i]);
fill_n(*dp, 2 * 5010, INF);
dp[1][0] = dp[0][1] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = N / 2; j > 0; j--) {
dp[j][0] = min(dp[j - 1][0], dp[j][1] + cost[i]);
dp[j][1] = min(dp[j][0] + cost[i], dp[j][1]);
}
}
printf("%d\n", min(dp[N / 2][0], dp[N / 2][1]));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, cost[10000];
int dp[5010][2];
const int INF = 1e9;
int main() {
scanf("%d", &N);
for (int i = 0; i < N - 1; i++)
scanf("%d", &cost[i]);
fill_n(*dp, 2 * 5010, INF);
dp[1][0] = dp[0][1] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = N / 2; j >= 0; j--) {
dp[j + 1][0] = min(dp[j][0], dp[j][1] + cost[i]);
dp[j][1] = min(dp[j][0] + cost[i], dp[j][1]);
}
}
printf("%d\n", min(dp[N / 2][0], dp[N / 2][1]));
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 69, 28, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 240
|
#include <bits/stdc++.h>
using namespace std;
int N, C, D[5010][2], i, j;
main() {
cin >> N;
fill_n(*D + 3, 1e4, 1e9);
D[0][0] = 1e9;
for (; cin >> C, i < N - 1; i++)
for (j = N / 2; ~j;)
D[j + 1][0] = min(D[j][0], D[j][1] + C),
D[j][1] = min(D[j][0] + C, D[j--][1]);
cout << min(D[N / 2][0], D[N / 2][1]) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, C, D[5010][2], i, j;
main() {
cin >> N;
fill_n(*D + 3, 1e4, 1e9);
D[0][0] = 1e9;
for (; cin >> C, i < N - 1; i++)
for (j = N / 2; ~j;)
D[j + 1][0] = min(D[j][0], D[j][1] + C),
D[j--][1] = min(D[j][0] + C, D[j][1]);
cout << min(D[N / 2][0], D[N / 2][1]) << endl;
}
|
[["+", 31, 69, 28, 69, 341, 342, 0, 27, 17, 68], ["-", 0, 69, 28, 69, 341, 342, 0, 27, 17, 68]]
| 1
| 170
|
#include <bits/stdc++.h>
using namespace std;
int N, C, D[2][5001], i, j, *A, *B;
main() {
A = *D, B = *D + 1;
cin >> N;
fill_n(*D, 1e4 + 2, 1e9);
A[1] = B[0] = 0;
for (; i++ < N - 1 && cin >> C;)
for (j = N / 2; ~j;)
A[j + 1] = min(A[j], B[j] + C), B[j--] = min(A[j] + C, B[j]);
cout << min(A[N / 2], B[N / 2]) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, C, D[2][5001], i, j, *A, *B;
main() {
A = *D, B = D[1];
cin >> N;
fill_n(*D, 1e4 + 2, 1e9);
A[1] = B[0] = 0;
for (; i++ < N - 1 && cin >> C;)
for (j = N / 2; ~j;)
A[j + 1] = min(A[j], B[j] + C), B[j--] = min(A[j] + C, B[j]);
cout << min(A[N / 2], B[N / 2]) << endl;
}
|
[["-", 0, 34, 12, 11, 12, 16, 31, 66, 17, 48], ["-", 0, 1, 0, 34, 12, 11, 12, 16, 17, 72], ["+", 0, 34, 12, 11, 12, 69, 341, 342, 0, 70], ["+", 0, 34, 12, 11, 12, 69, 341, 342, 0, 73]]
| 1
| 165
|
#include <iostream>
using namespace std;
const int INF = (int)2e9;
int n, cut[10000];
int dp[2][2][5001]; // not use 0
int main() {
// chap1
cin >> n;
for (int i = 1; i < n; i++)
cin >> cut[i];
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
for (int k = 1; k <= n / 2; k++)
dp[i][j][k] = INF;
dp[0][0][1] = 0;
// chap2
for (int i = 1; i < n; i++) {
// chap2-1
for (int j = 1; j <= n / 2; j++)
if (dp[0][0][j] != INF) {
dp[1][1][j] = min(dp[1][0][j], dp[0][0][j] + cut[i]);
if (j < n / 2)
dp[1][0][j + 1] = min(dp[1][0][j + 1], dp[0][0][j]);
}
// chap2-2
for (int j = 1; j <= n / 2; j++)
if (dp[0][1][j] != INF) {
dp[1][1][j] = min(dp[1][1][j], dp[0][1][j]);
if (j < n / 2)
dp[1][0][j + 1] = min(dp[1][0][j + 1], dp[0][1][j] + cut[i]);
}
// chap2-3
for (int i = 0; i < 2; i++)
for (int j = 1; j <= n / 2; j++) {
dp[0][i][j] = dp[1][i][j];
dp[1][i][j] = INF;
}
}
cout << min(dp[0][0][n / 2], dp[0][1][n / 2]) << endl;
return 0;
}
|
#include <cstring>
#include <iostream>
using namespace std;
const int INF = (int)2e9;
int n, cut[10000];
int dp[2][2][5001]; // not use 0
int main() {
// chap1
cin >> n;
for (int i = 1; i < n; i++)
cin >> cut[i];
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
for (int k = 1; k <= n / 2; k++)
dp[i][j][k] = INF;
dp[0][0][1] = 0;
// chap2
for (int i = 1; i < n; i++) {
// chap2-1
for (int j = 1; j <= n / 2; j++)
if (dp[0][0][j] != INF) {
dp[1][1][j] = min(dp[1][1][j], dp[0][0][j] + cut[i]);
if (j < n / 2)
dp[1][0][j + 1] = min(dp[1][0][j + 1], dp[0][0][j]);
}
// chap2-2
for (int j = 1; j <= n / 2; j++)
if (dp[0][1][j] != INF) {
dp[1][1][j] = min(dp[1][1][j], dp[0][1][j]);
if (j < n / 2)
dp[1][0][j + 1] = min(dp[1][0][j + 1], dp[0][1][j] + cut[i]);
}
// chap2-3
for (int i = 0; i < 2; i++)
for (int j = 1; j <= n / 2; j++) {
dp[0][i][j] = dp[1][i][j];
dp[1][i][j] = INF;
}
}
cout << min(dp[0][0][n / 2], dp[0][1][n / 2]) << endl;
return 0;
}
|
[["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["-", 3, 4, 0, 69, 28, 69, 341, 342, 0, 13], ["+", 3, 4, 0, 69, 28, 69, 341, 342, 0, 13]]
| 1
| 505
|
#include <cstdio>
#include <iostream>
using namespace std;
const int INF = 1000000000;
int N;
int DP1[10001];
int DP2[10001];
int DP3[10001];
int DP4[10001];
int T[10000];
int main() {
scanf("%d", &N);
N = N >> 1;
for (int i = 1; i < 2 * N; i++)
scanf("%d", &T[i]);
for (int i = 0; i <= 2 * N; i++) {
DP1[i] = INF;
DP2[i] = INF;
DP3[i] = INF;
DP4[i] = INF;
}
DP1[0] = 0;
DP2[0] = 0;
for (int i = 1; i < 2 * N; i++) {
DP3[0] = INF;
DP4[0] = 0;
DP3[i] = 0;
DP4[i] = INF;
for (int j = 1; j < i; j++) {
DP3[j] = min(DP1[j - 1], DP2[j - 1] + T[i - 1]);
DP4[j] = min(DP1[j] + T[i - 1], DP2[j]);
}
for (int j = 0; j <= i; j++) {
DP1[j] = DP3[j];
DP2[j] = DP4[j];
// printf("1:%d,%d:%d\n",i,j,DP1[j]);
// printf("2:%d,%d:%d\n",i,j,DP2[j]);
}
}
printf("%d\n", min(DP1[N], DP2[N]));
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
const int INF = 1000000000;
int N;
int DP1[10001];
int DP2[10001];
int DP3[10001];
int DP4[10001];
int T[10000];
int main() {
scanf("%d", &N);
N = N >> 1;
for (int i = 1; i < 2 * N; i++)
scanf("%d", &T[i]);
for (int i = 0; i <= 2 * N; i++) {
DP1[i] = INF;
DP2[i] = INF;
DP3[i] = INF;
DP4[i] = INF;
}
DP1[0] = 0;
DP2[0] = 0;
for (int i = 1; i <= 2 * N; i++) {
DP3[0] = INF;
DP4[0] = 0;
DP3[i] = 0;
DP4[i] = INF;
for (int j = 1; j < i; j++) {
DP3[j] = min(DP1[j - 1], DP2[j - 1] + T[i - 1]);
DP4[j] = min(DP1[j] + T[i - 1], DP2[j]);
}
for (int j = 0; j <= i; j++) {
DP1[j] = DP3[j];
DP2[j] = DP4[j];
// printf("1:%d,%d:%d\n",i,j,DP1[j]);
// printf("2:%d,%d:%d\n",i,j,DP2[j]);
}
}
printf("%d\n", min(DP1[N], DP2[N]));
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 336
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define omajinai \
ios::sync_with_stdio(false); \
cin.tie(0)
#define rep(i, x) for (int i = 0; i < (int)(x); ++i)
#define rep1(i, x) for (int i = 1; i <= (int)(x); ++i)
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vpii = vector<pii>;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> p) {
os << "(" << p.fst << ", " << p.scd << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
rep(i, v.size()) {
if (i)
os << ", ";
os << v[i];
}
return os;
}
template <typename T> T &max(T &a, T &b) {
if (a >= b)
return a;
return b;
}
template <typename T> T &min(T &a, T &b) {
if (a < b)
return a;
return b;
}
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int in() {
int a;
scanf("%d", &a);
return a;
}
ll lin() {
ll a;
scanf("%lld", &a);
return a;
}
constexpr int inf = 1e9;
constexpr ll linf = 3e18;
constexpr double eps = 1e-9;
int N;
int c[100010];
int dp[2][2][5002];
int main() {
N = in();
rep(i, N - 1) { c[i + 1] = in(); }
rep(i, 2) rep(j, 2) rep(k, N / 2 + 1) dp[i][j][k] = inf;
dp[0][0][0] = 0;
for (int i = 0; i < N; ++i) {
for (int j = 0; j <= min(i, N / 2); ++j) {
dp[(i + 1) & 1][0][j + 1] = min(dp[i & 1][0][j], dp[i & 1][1][j] + c[i]);
dp[(i + 1) & 1][1][j] = min(dp[i & 1][1][j], dp[i & 1][0][j] + c[i]);
}
dp[(i + 1) & 1][0][0] = inf;
}
printf("%d\n", min(dp[1][0][N / 2], dp[1][1][N / 2]));
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define omajinai \
ios::sync_with_stdio(false); \
cin.tie(0)
#define rep(i, x) for (int i = 0; i < (int)(x); ++i)
#define rep1(i, x) for (int i = 1; i <= (int)(x); ++i)
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vpii = vector<pii>;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> p) {
os << "(" << p.fst << ", " << p.scd << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
rep(i, v.size()) {
if (i)
os << ", ";
os << v[i];
}
return os;
}
template <typename T> T &max(T &a, T &b) {
if (a >= b)
return a;
return b;
}
template <typename T> T &min(T &a, T &b) {
if (a < b)
return a;
return b;
}
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int in() {
int a;
scanf("%d", &a);
return a;
}
ll lin() {
ll a;
scanf("%lld", &a);
return a;
}
constexpr int inf = 1e9;
constexpr ll linf = 3e18;
constexpr double eps = 1e-9;
int N;
int c[100010];
int dp[2][2][5002];
int main() {
N = in();
rep(i, N - 1) { c[i + 1] = in(); }
rep(i, 2) rep(j, 2) rep(k, N / 2 + 1) dp[i][j][k] = inf;
dp[0][0][0] = 0;
for (int i = 0; i < N; ++i) {
for (int j = 0; j <= min(i, N / 2); ++j) {
dp[(i + 1) & 1][0][j + 1] = min(dp[i & 1][0][j], dp[i & 1][1][j] + c[i]);
dp[(i + 1) & 1][1][j] = min(dp[i & 1][1][j], dp[i & 1][0][j] + c[i]);
}
dp[(i + 1) & 1][0][0] = inf;
}
printf("%d\n", min(dp[N & 1][0][N / 2], dp[N & 1][1][N / 2]));
}
|
[["+", 28, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 28, 69, 28, 69, 341, 342, 0, 16, 17, 67]]
| 1
| 735
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; ++i)
#define a a
const int inf = 1e9;
int dp[2][2][5050];
signed main() {
int n;
cin >> n;
vector<int> t(n - 1);
rep(i, n - 1) cin >> t[i + 1];
rep(i, 2) rep(j, 2) rep(k, n / 2 + 1) dp[i][j][k] = inf;
dp[0][1][0] = 0;
rep(i, n) {
// cout<<"t["<<i<<"] = " << t[i] << endl;
rep(j, min(n / 2, i) + 1) {
dp[(i + 1) % 2][1][j + 1] = min(dp[i & 1][1][j], dp[i & 1][0][j] + t[i]);
dp[(i + 1) % 2][0][j] = min(dp[i & 1][0][j], dp[i & 1][1][j] + t[i]);
}
dp[(i + 1) & 1][1][0] = inf;
}
// rep(i,n) rep(j,n/2+1) printf("dp[%d][%d] = %d\n", i,j,dp[i][j]);
cout << min(dp[1][0][n / 2], dp[1][1][n / 2]) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; ++i)
#define a a
const int inf = 1e9;
int dp[2][2][5050];
signed main() {
int n;
cin >> n;
vector<int> t(n - 1);
rep(i, n - 1) cin >> t[i + 1];
rep(i, 2) rep(j, 2) rep(k, n / 2 + 1) dp[i][j][k] = inf;
dp[0][1][0] = 0;
rep(i, n) {
// cout<<"t["<<i<<"] = " << t[i] << endl;
rep(j, min(n / 2, i) + 1) {
dp[(i + 1) % 2][1][j + 1] = min(dp[i & 1][1][j], dp[i & 1][0][j] + t[i]);
dp[(i + 1) % 2][0][j] = min(dp[i & 1][0][j], dp[i & 1][1][j] + t[i]);
}
dp[(i + 1) & 1][1][0] = inf;
}
// rep(i,n) rep(j,n/2+1) printf("dp[%d][%d] = %d\n", i,j,dp[i][j]);
cout << min(dp[0][0][n / 2], dp[0][1][n / 2]) << endl;
}
|
[["-", 0, 69, 28, 69, 28, 69, 341, 342, 0, 13], ["+", 0, 69, 28, 69, 28, 69, 341, 342, 0, 13]]
| 1
| 311
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 9;
int n;
int t[10101];
int dp[2][2][5050];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t[i];
}
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
for (int k = 0; k < 5050; k++)
dp[i][j][k] = inf;
dp[0][0][0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n / 2; j++) {
dp[(i + 1) & 1][0][j + 1] =
min(dp[i & 1][0][j], dp[i & 1][1][j] + t[i + 1]);
dp[(i + 1) & 1][1][j] = min(dp[i & 1][0][j] + t[i + 1], dp[i & 1][1][j]);
dp[i & 1][0][j] = dp[i & 1][1][j] = inf;
}
}
cout << dp[n & 1][0][n / 2] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 9;
int n;
int t[10101];
int dp[2][2][5050];
int main() {
cin >> n;
for (int i = 1; i < n; i++) {
cin >> t[i];
}
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
for (int k = 0; k < 5050; k++)
dp[i][j][k] = inf;
dp[0][0][0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n / 2; j++) {
dp[(i + 1) & 1][0][j + 1] =
min(dp[i & 1][0][j], dp[i & 1][1][j] + t[i + 1]);
dp[(i + 1) & 1][1][j] = min(dp[i & 1][0][j] + t[i + 1], dp[i & 1][1][j]);
dp[i & 1][0][j] = dp[i & 1][1][j] = inf;
}
}
cout << dp[n & 1][0][n / 2] << endl;
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]]
| 1
| 325
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i, s, x) for (int i = s; i < (int)(x); i++)
#define REP(i, x) FOR(i, 0, x)
#define ALL(c) c.begin(), c.end()
#define DUMP(x) cerr << #x << " = " << (x) << endl
const int INF = 1 << 29;
int dp[150][10][77];
int stones[150][10][2];
int col[150];
int main() {
// use scanf in CodeForces!
cin.tie(0);
ios_base::sync_with_stdio(false);
while (true) {
int N, M;
cin >> N >> M;
if (N == 0 && M == 0)
break;
REP(i, N) {
cin >> col[i];
REP(j, col[i]) { cin >> stones[i][j][0] >> stones[i][j][1]; }
}
REP(i, N) REP(j, col[i]) REP(k, M + 1) dp[i][j][k] = INF;
REP(j, col[0]) dp[0][j][0] = 0;
REP(j, col[1]) dp[1][j][1] = 0;
REP(i, N - 1) {
REP(j, col[i]) {
int x_now = stones[i][j][0], d_now = stones[i][j][1];
REP(m, M + 1) {
if (dp[i][j][m] == INF)
continue;
REP(k, col[i + 1]) {
dp[i + 1][k][m] =
min(dp[i + 1][k][m],
dp[i][j][m] + (d_now + stones[i + 1][k][1]) *
abs(x_now - stones[i + 1][k][0]));
}
if (i < N - 2 && m < M) {
REP(k, col[i + 2]) {
dp[i + 2][k][m + 1] =
min(dp[i + 2][k][m + 1],
dp[i][j][m] + (d_now + stones[i + 2][k][0]) *
abs(x_now - stones[i + 2][k][1]));
}
}
}
}
}
int ans = INF;
REP(j, col[N - 1]) REP(m, M + 1) ans = min(ans, dp[N - 1][j][m]);
REP(j, col[N - 2]) REP(m, M) ans = min(ans, dp[N - 2][j][m]);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i, s, x) for (int i = s; i < (int)(x); i++)
#define REP(i, x) FOR(i, 0, x)
#define ALL(c) c.begin(), c.end()
#define DUMP(x) cerr << #x << " = " << (x) << endl
const int INF = 1 << 29;
int dp[150][10][77];
int stones[150][10][2];
int col[150];
int main() {
// use scanf in CodeForces!
cin.tie(0);
ios_base::sync_with_stdio(false);
while (true) {
int N, M;
cin >> N >> M;
if (N == 0 && M == 0)
break;
REP(i, N) {
cin >> col[i];
REP(j, col[i]) { cin >> stones[i][j][0] >> stones[i][j][1]; }
}
REP(i, N) REP(j, col[i]) REP(k, M + 1) dp[i][j][k] = INF;
REP(j, col[0]) dp[0][j][0] = 0;
REP(j, col[1]) dp[1][j][1] = 0;
REP(i, N - 1) {
REP(j, col[i]) {
int x_now = stones[i][j][0], d_now = stones[i][j][1];
REP(m, M + 1) {
if (dp[i][j][m] == INF)
continue;
REP(k, col[i + 1]) {
dp[i + 1][k][m] =
min(dp[i + 1][k][m],
dp[i][j][m] + (d_now + stones[i + 1][k][1]) *
abs(x_now - stones[i + 1][k][0]));
}
if (i < N - 2 && m < M) {
REP(k, col[i + 2]) {
dp[i + 2][k][m + 1] =
min(dp[i + 2][k][m + 1],
dp[i][j][m] + (d_now + stones[i + 2][k][1]) *
abs(x_now - stones[i + 2][k][0]));
}
}
}
}
}
int ans = INF;
REP(j, col[N - 1]) REP(m, M + 1) ans = min(ans, dp[N - 1][j][m]);
REP(j, col[N - 2]) REP(m, M) ans = min(ans, dp[N - 2][j][m]);
cout << ans << endl;
}
return 0;
}
|
[["-", 31, 23, 0, 16, 12, 69, 341, 342, 0, 13], ["+", 31, 23, 0, 16, 12, 69, 341, 342, 0, 13], ["-", 3, 4, 0, 16, 12, 69, 341, 342, 0, 13], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 13]]
| 1
| 661
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, x) for (int i = 0; i < x; ++i)
#define all(a) begin(a), end(a)
const int inf = 3e17;
int dp[155][15][100];
int stone[155][15];
int X[155][15];
signed main() {
int n, m;
while (cin >> n >> m, n) {
rep(i, n + 5) rep(j, 15) stone[i][j] = inf, X[i][j] = inf;
rep(i, n + 5) rep(j, 15) rep(k, 100) dp[i][j][k] = inf;
rep(i, n) {
int k;
cin >> k;
rep(j, k) {
int x, d;
cin >> x >> d;
X[i][j] = x;
stone[i][j] = d;
if (i == 0)
dp[0][x][0] = 0;
if (i == 1)
dp[1][x][1] = 0;
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 11; ++j) {
if (stone[i][j] == inf)
continue;
for (int k = 0; k <= m; ++k) {
if (k < m) {
rep(l, 11) {
if (stone[i + 2][l] == inf)
continue;
dp[i + 2][l][k + 1] =
min(dp[i + 2][l][k + 1],
dp[i][j][k] + (stone[i][j] + stone[i + 2][l]) *
abs(X[i][j] - X[i + 2][l]));
}
}
rep(l, 11) {
if (stone[i + 1][l] == inf)
continue;
dp[i + 1][l][k] = min(
dp[i + 1][l][k], dp[i][j][k] + (stone[i][j] + stone[i + 1][l]) *
abs(X[i][j] - X[i + 1][l]));
}
}
}
}
int mi = inf;
for (int i = 0; i < 11; ++i) {
for (int j = 0; j <= m; ++j) {
mi = min(mi, dp[n - 1][i][j]);
}
}
for (int i = 0; i < 11; ++i) {
for (int j = 0; j <= m - 1; ++j) {
mi = min(mi, dp[n - 2][i][j]);
}
}
cout << mi << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, x) for (int i = 0; i < x; ++i)
#define all(a) begin(a), end(a)
const int inf = 3e17;
int dp[155][15][100];
int stone[155][15];
int X[155][15];
signed main() {
int n, m;
while (cin >> n >> m, n) {
rep(i, n + 5) rep(j, 15) stone[i][j] = inf, X[i][j] = inf;
rep(i, n + 5) rep(j, 15) rep(k, 100) dp[i][j][k] = inf;
rep(i, n) {
int k;
cin >> k;
rep(j, k) {
int x, d;
cin >> x >> d;
X[i][j] = x;
stone[i][j] = d;
if (i == 0)
dp[0][j][0] = 0;
if (i == 1)
dp[1][j][1] = 0;
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 11; ++j) {
if (stone[i][j] == inf)
continue;
for (int k = 0; k <= m; ++k) {
if (k < m) {
rep(l, 11) {
if (stone[i + 2][l] == inf)
continue;
dp[i + 2][l][k + 1] =
min(dp[i + 2][l][k + 1],
dp[i][j][k] + (stone[i][j] + stone[i + 2][l]) *
abs(X[i][j] - X[i + 2][l]));
}
}
rep(l, 11) {
if (stone[i + 1][l] == inf)
continue;
dp[i + 1][l][k] = min(
dp[i + 1][l][k], dp[i][j][k] + (stone[i][j] + stone[i + 1][l]) *
abs(X[i][j] - X[i + 1][l]));
}
}
}
}
int mi = inf;
for (int i = 0; i < 11; ++i) {
for (int j = 0; j <= m; ++j) {
mi = min(mi, dp[n - 1][i][j]);
}
}
for (int i = 0; i < 11; ++i) {
for (int j = 0; j <= m - 1; ++j) {
mi = min(mi, dp[n - 2][i][j]);
}
}
cout << mi << endl;
}
}
|
[["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22]]
| 1
| 646
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 1e18
#define INF 1e9
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fst first
#define snd second
using namespace std;
using ll = long long;
using PII = pair<int, int>;
ll dp[155][10][80];
int main(void) {
int n, m;
while (cin >> n >> m && n && m) {
vector<pair<ll, ll>> s[151];
REP(i, 155) {
REP(j, 10) { fill(dp[i][j], dp[i][j] + 80, INF_LL); }
}
REP(i, n) {
int k;
cin >> k;
REP(j, k) {
int x, d;
cin >> x >> d;
s[i].push_back({x, d});
}
}
REP(i, s[0].size()) { dp[0][i][0] = 0; }
REP(i, s[1].size()) { dp[1][i][1] = 0; }
REP(i, n - 1) {
REP(j, s[i].size()) {
REP(k, m + 1) {
REP(t, s[i + 1].size()) {
dp[i + 1][t][k] =
min(dp[i + 1][t][k],
dp[i][j][k] + (s[i][j].snd + s[i + 1][t].snd) *
abs(s[i][j].fst - s[i + 1][t].fst));
}
if (i < n - 2) {
REP(t, s[i + 2].size()) {
dp[i + 2][t][k + 1] =
min(dp[i + 2][t][k + 1],
dp[i][j][k] + (s[i][j].snd + s[i + 2][t].snd) *
abs(s[i][j].fst - s[i + 2][t].fst));
}
}
}
}
}
ll res = INF_LL;
REP(j, s[n - 1].size()) {
REP(k, m + 1) { res = min(dp[n - 1][j][k], res); }
}
REP(j, s[n - 2].size()) {
REP(k, m) { res = min(dp[n - 2][j][k], res); }
}
cout << res << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 1e18
#define INF 1e9
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fst first
#define snd second
using namespace std;
using ll = long long;
using PII = pair<int, int>;
ll dp[155][10][80];
int main(void) {
int n, m;
while (cin >> n >> m && (n || m)) {
vector<pair<ll, ll>> s[151];
REP(i, 155) {
REP(j, 10) { fill(dp[i][j], dp[i][j] + 80, INF_LL); }
}
REP(i, n) {
int k;
cin >> k;
REP(j, k) {
int x, d;
cin >> x >> d;
s[i].push_back({x, d});
}
}
REP(i, s[0].size()) { dp[0][i][0] = 0; }
REP(i, s[1].size()) { dp[1][i][1] = 0; }
REP(i, n - 1) {
REP(j, s[i].size()) {
REP(k, m + 1) {
REP(t, s[i + 1].size()) {
dp[i + 1][t][k] =
min(dp[i + 1][t][k],
dp[i][j][k] + (s[i][j].snd + s[i + 1][t].snd) *
abs(s[i][j].fst - s[i + 1][t].fst));
}
if (i < n - 2) {
REP(t, s[i + 2].size()) {
dp[i + 2][t][k + 1] =
min(dp[i + 2][t][k + 1],
dp[i][j][k] + (s[i][j].snd + s[i + 2][t].snd) *
abs(s[i][j].fst - s[i + 2][t].fst));
}
}
}
}
}
ll res = INF_LL;
REP(j, s[n - 1].size()) {
REP(k, m + 1) { res = min(dp[n - 1][j][k], res); }
}
REP(j, s[n - 2].size()) {
REP(k, m) { res = min(dp[n - 2][j][k], res); }
}
cout << res << endl;
}
}
|
[["+", 0, 52, 15, 339, 51, 16, 12, 23, 0, 24], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 106], ["+", 0, 52, 15, 339, 51, 16, 12, 23, 0, 25]]
| 1
| 654
|
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m;
while (cin >> n >> m, n) {
int pos[151][10] = {0};
int rate[151][10] = {0};
int cnt[151] = {0};
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
cnt[i] = k;
rep(j, k) { cin >> pos[i][j] >> rate[i][j]; }
}
n++;
int dp[152][10][80] = {0};
rep(i, 151) rep(j, 10) rep(k, 80) dp[i][j][k] = (1 << 29);
rep(j, 10) rep(k, 80) dp[0][j][k] = 0;
rep(j, 10) rate[0][j] = 0;
cnt[0] = 1;
for (int k = m; k >= 0; k--) {
for (int i = 1; i < n; i++) {
rep(prev, cnt[i - 1]) {
rep(cur, cnt[i]) {
if (i - 1) {
dp[i][cur][k] = min(dp[i][cur][k],
dp[i - 1][prev][k] +
(rate[i][cur] + rate[i - 1][prev]) *
abs(pos[i][cur] - pos[i - 1][prev]));
} else {
dp[i][cur][k] = 0;
}
}
}
}
if (k) {
for (int i = 2; i < n; i++) {
rep(prev, cnt[i - 2]) {
rep(cur, cnt[i]) {
if (i - 2) {
dp[i][cur][k - 1] =
min(dp[i][cur][k - 1],
dp[i - 2][prev][k] +
(rate[i][cur] + rate[i - 2][prev]) *
abs(pos[i][cur] - pos[i - 2][prev]));
} else {
dp[i][cur][k - 1] = 0;
}
}
}
}
}
}
int ret = (1 << 29);
rep(k, m + 1) {
if (k)
rep(i, cnt[n - 2]) ret = min(ret, dp[n - 2][i][k]);
rep(i, cnt[n - 1]) ret = min(ret, dp[n - 1][i][k]);
}
cout << ret << endl;
break;
}
}
|
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m;
while (cin >> n >> m, n) {
int pos[151][10] = {0};
int rate[151][10] = {0};
int cnt[151] = {0};
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
cnt[i] = k;
rep(j, k) { cin >> pos[i][j] >> rate[i][j]; }
}
n++;
int dp[152][10][80] = {0};
rep(i, 151) rep(j, 10) rep(k, 80) dp[i][j][k] = (1 << 29);
rep(j, 10) rep(k, 80) dp[0][j][k] = 0;
rep(j, 10) rate[0][j] = 0;
cnt[0] = 1;
for (int k = m; k >= 0; k--) {
for (int i = 1; i < n; i++) {
rep(prev, cnt[i - 1]) {
rep(cur, cnt[i]) {
if (i - 1) {
dp[i][cur][k] = min(dp[i][cur][k],
dp[i - 1][prev][k] +
(rate[i][cur] + rate[i - 1][prev]) *
abs(pos[i][cur] - pos[i - 1][prev]));
} else {
dp[i][cur][k] = 0;
}
}
}
}
if (k) {
for (int i = 2; i < n; i++) {
rep(prev, cnt[i - 2]) {
rep(cur, cnt[i]) {
if (i - 2) {
dp[i][cur][k - 1] =
min(dp[i][cur][k - 1],
dp[i - 2][prev][k] +
(rate[i][cur] + rate[i - 2][prev]) *
abs(pos[i][cur] - pos[i - 2][prev]));
} else {
dp[i][cur][k - 1] = 0;
}
}
}
}
}
}
int ret = (1 << 29);
rep(k, m + 1) {
if (k)
rep(i, cnt[n - 2]) ret = min(ret, dp[n - 2][i][k]);
rep(i, cnt[n - 1]) ret = min(ret, dp[n - 1][i][k]);
}
cout << ret << endl;
}
}
|
[["-", 8, 9, 0, 52, 8, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 52, 8, 9, 0, 93, 0, 35]]
| 1
| 646
|
#include <stdio.h>
#include <stdlib.h>
#define INF 1000000000
int n, m;
int d[80][150][10];
int r[150][1000];
int f[150][10];
int c[150];
int i, j, k, l;
int t;
int a, b;
int min(int a, int b) {
if (a >= b)
return b;
else
return a;
}
int main() {
// while(1){
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
return 0;
for (i = 0; i < n; i++)
c[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &t);
for (j = 0; j < t; j++) {
scanf("%d %d", &a, &b);
r[i][a - 1] = b;
f[i][c[i]++] = a - 1;
}
}
for (k = 0; k <= m; k++)
for (i = 0; i < n; i++)
for (j = 0; j < c[i]; j++) {
d[k][i][j] = INF;
}
for (i = 0; i < c[0]; i++) {
d[m][0][i] = 0;
}
if (m >= 1)
for (j = 0; j < c[1]; j++) {
d[m - 1][1][j] = 0;
}
for (i = 1; i < n; i++) {
if (i > 1) {
for (j = 0; j <= m - 1; j++) {
for (k = 0; k < c[i]; k++) {
for (l = 0; l < c[i - 2]; l++) {
d[j][i][k] = min(d[j][i][k],
d[j + 1][i - 2][l] +
abs(f[i][k] - f[i - 2][l]) *
(r[i][f[i][k]] + r[i - 2][f[i - 2][l]]));
}
}
}
}
for (j = 0; j <= m; j++) {
for (k = 0; k < c[i]; k++) {
for (l = 0; l < c[i - 1]; l++) {
d[j][i][k] =
min(d[j][i][k],
d[j][i - 1][l] + abs(f[i][k] - f[i - 1][l]) *
(r[i][f[i][k]] + r[i - 1][f[i - 1][l]]));
}
}
}
}
int ans = INF;
for (i = 0; i <= m; i++)
for (j = 0; j < c[n - 1]; j++) {
ans = min(ans, d[i][n - 1][j]);
}
for (i = 1; i <= m; i++)
for (j = 0; j < c[n - 2]; j++) {
ans = min(ans, d[i][n - 2][j]);
}
printf("%d\n", ans);
//}
}
|
#include <stdio.h>
#include <stdlib.h>
#define INF 1000000000
int n, m;
int d[80][150][10];
int r[150][1000];
int f[150][10];
int c[150];
int i, j, k, l;
int t;
int a, b;
int min(int a, int b) {
if (a >= b)
return b;
else
return a;
}
int main() {
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
return 0;
for (i = 0; i < n; i++)
c[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &t);
for (j = 0; j < t; j++) {
scanf("%d %d", &a, &b);
r[i][a - 1] = b;
f[i][c[i]++] = a - 1;
}
}
for (k = 0; k <= m; k++)
for (i = 0; i < n; i++)
for (j = 0; j < c[i]; j++) {
d[k][i][j] = INF;
}
for (i = 0; i < c[0]; i++) {
d[m][0][i] = 0;
}
if (m >= 1)
for (j = 0; j < c[1]; j++) {
d[m - 1][1][j] = 0;
}
for (i = 1; i < n; i++) {
if (i > 1) {
for (j = 0; j <= m - 1; j++) {
for (k = 0; k < c[i]; k++) {
for (l = 0; l < c[i - 2]; l++) {
d[j][i][k] = min(d[j][i][k],
d[j + 1][i - 2][l] +
abs(f[i][k] - f[i - 2][l]) *
(r[i][f[i][k]] + r[i - 2][f[i - 2][l]]));
}
}
}
}
for (j = 0; j <= m; j++) {
for (k = 0; k < c[i]; k++) {
for (l = 0; l < c[i - 1]; l++) {
d[j][i][k] = min(d[j][i][k],
d[j][i - 1][l] +
abs(f[i][k] - f[i - 1][l]) *
(r[i][f[i][k]] + r[i - 1][f[i - 1][l]]));
}
}
}
}
int ans = INF;
for (i = 0; i <= m; i++)
for (j = 0; j < c[n - 1]; j++) {
ans = min(ans, d[i][n - 1][j]);
}
for (i = 1; i <= m; i++)
for (j = 0; j < c[n - 2]; j++) {
ans = min(ans, d[i][n - 2][j]);
}
printf("%d\n", ans);
}
}
|
[["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 791
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 2000000000
int n, m;
int stone[155][11][2];
int dp[155][11][76];
int num[155];
int cost(int a, int b, int c) {
if (a == n || (a == n - 1 && c < m)) {
return 0;
}
if (dp[a][b][c] != -1)
return dp[a][b][c];
int mini = INF;
for (int i = 1; i <= num[a + 1]; i++) {
mini = min(mini, (stone[a + 1][i][1] + stone[a][b][1]) *
abs(stone[a][b][0] - stone[a + 1][i][0]) +
cost(a + 1, i, c));
}
if (c != m) {
for (int i = 1; i <= num[a + 2]; i++) {
mini = min(mini, (stone[a + 2][i][1] + stone[a][b][1]) *
abs(stone[a][b][0] - stone[a + 2][i][0]) +
cost(a + 2, i, 1 + c));
}
}
return dp[a][b][c] = mini;
}
int main() {
while (scanf("%d %d", &n, &m) && m) {
for (int i = 1; i <= n; i++) {
scanf("%d", &num[i]);
for (int g = 1; g <= num[i]; g++) {
scanf("%d %d", &stone[i][g][0], &stone[i][g][1]);
}
}
memset(dp, -1, sizeof(dp));
int ans = INF;
for (int i = 1; i <= num[1]; i++) {
ans = min(ans, cost(1, i, 0));
}
if (m > 0) {
for (int i = 1; i <= num[2]; i++) {
ans = min(ans, cost(2, i, 1));
}
}
printf("%d\n", ans);
}
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 2000000000
int n, m;
int stone[155][11][2];
int dp[155][11][76];
int num[155];
int cost(int a, int b, int c) {
if (a == n || (a == n - 1 && c < m)) {
return 0;
}
if (dp[a][b][c] != -1)
return dp[a][b][c];
int mini = INF;
for (int i = 1; i <= num[a + 1]; i++) {
mini = min(mini, (stone[a + 1][i][1] + stone[a][b][1]) *
abs(stone[a][b][0] - stone[a + 1][i][0]) +
cost(a + 1, i, c));
}
if (c != m) {
for (int i = 1; i <= num[a + 2]; i++) {
mini = min(mini, (stone[a + 2][i][1] + stone[a][b][1]) *
abs(stone[a][b][0] - stone[a + 2][i][0]) +
cost(a + 2, i, 1 + c));
}
}
return dp[a][b][c] = mini;
}
int main() {
while (scanf("%d %d", &n, &m) && n) {
for (int i = 1; i <= n; i++) {
scanf("%d", &num[i]);
for (int g = 1; g <= num[i]; g++) {
scanf("%d %d", &stone[i][g][0], &stone[i][g][1]);
}
}
memset(dp, -1, sizeof(dp));
int ans = INF;
for (int i = 1; i <= num[1]; i++) {
ans = min(ans, cost(1, i, 0));
}
if (m > 0) {
for (int i = 1; i <= num[2]; i++) {
ans = min(ans, cost(2, i, 1));
}
}
printf("%d\n", ans);
}
}
|
[["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]]
| 1
| 593
|
// Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 2000000000
//番号とx座標と滑りやすさ
vector<P1> s[155];
//滑りやすさ、x座標、y座標
P1 d[1505];
int n, m;
//石番号と残り数を状態にもつdijkstra用配列
int di[1505][76];
// beatmania iidx楽しい!!の部分文字列ではなくindexの部分文字列
int idx = 0;
int main() {
// while(1)
{
idx = 0;
scanf("%d %d", &n, &m);
if (!n)
return 0;
for (int i = 1; i <= n; i++) {
int k;
scanf("%d", &k);
s[i].clear();
for (int j = 0; j < k; j++) {
int a, b;
scanf("%d %d", &a, &b);
s[i].pb(mp(idx, mp(a, b)));
d[idx++] = mp(b, mp(a, i));
}
}
for (int i = 0; i < 1505; i++)
for (int j = 0; j < 76; j++)
di[i][j] = 1e9;
priority_queue<P1, vector<P1>, greater<P1>> que;
for (int i = 0; i < s[1].size(); i++) {
P1 p = s[1][i];
di[p.first][m] = 0;
que.push(mp(0, mp(p.first, m)));
}
for (int i = 0; m > 0 && i < s[2].size(); i++) {
P1 p = s[2][i];
di[p.first][m - 1] = 0;
que.push(mp(0, mp(p.first, m - 1)));
}
while (!que.empty()) {
P1 p = que.top();
que.pop();
int idd = p.second.first;
int slip1 = d[idd].first;
int x = d[idd].second.first;
int y = d[idd].second.second;
int zan = p.second.second;
if (p.first != di[idd][zan])
continue;
for (int i = 0; i < s[y + 1].size(); i++) {
P1 pp = s[y + 1][i];
int slip2 = pp.second.second;
int x2 = pp.second.first;
if (di[pp.first][zan] > p.first + (slip1 + slip2) * abs(x - x2)) {
di[pp.first][zan] = p.first + (slip1 + slip2) * abs(x - x2);
que.push(mp(di[pp.first][zan], mp(pp.first, zan)));
}
}
for (int i = 0; zan > 0 && i < s[y + 2].size(); i++) {
P1 pp = s[y + 2][i];
int slip2 = pp.second.second;
int x2 = pp.second.first;
if (di[pp.first][zan - 1] > p.first + (slip1 + slip2) * abs(x - x2)) {
di[pp.first][zan - 1] = p.first + (slip1 + slip2) * abs(x - x2);
que.push(mp(di[pp.first][zan - 1], mp(pp.first, zan - 1)));
}
}
}
int ret = INF;
for (int j = 0; j < s[n].size(); j++)
for (int i = 0; i < 76; i++)
ret = min(ret, di[s[n][j].first][i]);
for (int j = 0; j < s[n - 1].size(); j++)
for (int i = 1; i < 76; i++)
ret = min(ret, di[s[n - 1][j].first][i]);
printf("%d\n", ret);
}
}
|
// Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 2000000000
//番号とx座標と滑りやすさ
vector<P1> s[155];
//滑りやすさ、x座標、y座標
P1 d[1505];
int n, m;
//石番号と残り数を状態にもつdijkstra用配列
int di[1505][76];
// beatmania iidx楽しい!!の部分文字列ではなくindexの部分文字列
int idx = 0;
int main() {
while (1) {
idx = 0;
scanf("%d %d", &n, &m);
if (!n)
return 0;
for (int i = 1; i <= n; i++) {
int k;
scanf("%d", &k);
s[i].clear();
for (int j = 0; j < k; j++) {
int a, b;
scanf("%d %d", &a, &b);
s[i].pb(mp(idx, mp(a, b)));
d[idx++] = mp(b, mp(a, i));
}
}
for (int i = 0; i < 1505; i++)
for (int j = 0; j < 76; j++)
di[i][j] = 1e9;
priority_queue<P1, vector<P1>, greater<P1>> que;
for (int i = 0; i < s[1].size(); i++) {
P1 p = s[1][i];
di[p.first][m] = 0;
que.push(mp(0, mp(p.first, m)));
}
for (int i = 0; m > 0 && i < s[2].size(); i++) {
P1 p = s[2][i];
di[p.first][m - 1] = 0;
que.push(mp(0, mp(p.first, m - 1)));
}
while (!que.empty()) {
P1 p = que.top();
que.pop();
int idd = p.second.first;
int slip1 = d[idd].first;
int x = d[idd].second.first;
int y = d[idd].second.second;
int zan = p.second.second;
if (p.first != di[idd][zan])
continue;
for (int i = 0; i < s[y + 1].size(); i++) {
P1 pp = s[y + 1][i];
int slip2 = pp.second.second;
int x2 = pp.second.first;
if (di[pp.first][zan] > p.first + (slip1 + slip2) * abs(x - x2)) {
di[pp.first][zan] = p.first + (slip1 + slip2) * abs(x - x2);
que.push(mp(di[pp.first][zan], mp(pp.first, zan)));
}
}
for (int i = 0; zan > 0 && i < s[y + 2].size(); i++) {
P1 pp = s[y + 2][i];
int slip2 = pp.second.second;
int x2 = pp.second.first;
if (di[pp.first][zan - 1] > p.first + (slip1 + slip2) * abs(x - x2)) {
di[pp.first][zan - 1] = p.first + (slip1 + slip2) * abs(x - x2);
que.push(mp(di[pp.first][zan - 1], mp(pp.first, zan - 1)));
}
}
}
int ret = INF;
for (int j = 0; j < s[n].size(); j++)
for (int i = 0; i < 76; i++)
ret = min(ret, di[s[n][j].first][i]);
for (int j = 0; j < s[n - 1].size(); j++)
for (int i = 1; i < 76; i++)
ret = min(ret, di[s[n - 1][j].first][i]);
printf("%d\n", ret);
}
}
|
[["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25]]
| 1
| 971
|
#include "stdio.h"
#include "stdlib.h"
#include <iostream>
#include <vector>
using namespace std;
#define INF (int)(1e9)
int mb[10];
int ms[10];
int m[10][100];
int mk;
int mmb[10];
int mms[10];
int mm[10][100];
int mmk;
int n[10][100];
vector<pair<int, int>> isi[150];
int main() {
while (1) {
int nn, mn;
scanf("%d %d", &nn, &mn);
if (nn == 0 && mn == 0) {
break;
}
for (int i = 0; i < nn; i++) {
int k;
scanf("%d", &k);
for (int ii = 0; ii < k; ii++) {
int x, d;
scanf("%d %d", &x, &d);
isi[i].push_back(make_pair(x, d));
}
}
for (int i = 0; i < isi[0].size(); i++) {
mb[i] = isi[0][i].first;
ms[i] = 0;
mmb[i] = isi[0][i].first;
mms[i] = 0;
for (int ii = 0; ii <= mn; ii++) {
m[i][ii] = 0;
mm[i][ii] = 0;
}
}
mk = isi[0].size();
mmk = isi[0].size();
for (int i = 0; i < nn; i++) {
if (i == 1) {
for (int ii = 0; ii < isi[i].size(); ii++) {
for (int iii = 0; iii <= mn; iii++) {
mm[ii][iii] = 0;
}
mmb[ii] = isi[i][ii].first;
mms[ii] = isi[i][ii].second;
}
mmk = isi[i].size();
}
for (int ii = 0; ii < isi[i].size(); ii++) {
for (int iii = 0; iii <= mn; iii++) {
int min = INF;
for (int j = 0; j < mk; j++) {
if (min > m[j][iii] + (ms[j] + isi[i][ii].second) *
abs(mb[j] - isi[i][ii].first)) {
min = m[j][iii] +
(ms[j] + isi[i][ii].second) * abs(mb[j] - isi[i][ii].first);
}
}
n[ii][iii] = min;
}
for (int iii = 0; iii < mn; iii++) {
int min = INF;
for (int j = 0; j < mk; j++) {
if (min > mm[j][iii] + (mms[j] + isi[i][ii].second) *
abs(mmb[j] - isi[i][ii].first)) {
min = mm[j][iii] + (mms[j] + isi[i][ii].second) *
abs(mmb[j] - isi[i][ii].first);
}
}
if (n[ii][iii + 1] > min) {
n[ii][iii + 1] = min;
}
}
}
for (int ii = 0; ii < mk; ii++) {
for (int iii = 0; iii <= mn; iii++) {
mm[ii][iii] = m[ii][iii];
}
mmb[ii] = mb[ii];
mms[ii] = ms[ii];
}
mmk = mk;
for (int ii = 0; ii < isi[i].size(); ii++) {
for (int iii = 0; iii <= mn; iii++) {
m[ii][iii] = n[ii][iii];
}
mb[ii] = isi[i][ii].first;
ms[ii] = isi[i][ii].second;
}
mk = isi[i].size();
}
int allmin = INF;
for (int i = 0; i < mmk; i++) {
for (int ii = 0; ii < mn; ii++) {
if (allmin > mm[i][ii]) {
allmin = mm[i][ii];
}
}
}
for (int i = 0; i < mk; i++) {
for (int ii = 0; ii <= mn; ii++) {
if (allmin > m[i][ii]) {
allmin = m[i][ii];
}
}
}
printf("%d\n", allmin);
for (int i = 0; i < nn; i++) {
isi[i].clear();
}
}
return 0;
}
|
#include "stdio.h"
#include "stdlib.h"
#include <iostream>
#include <vector>
using namespace std;
#define INF (int)(1e9)
int mb[10];
int ms[10];
int m[10][100];
int mk;
int mmb[10];
int mms[10];
int mm[10][100];
int mmk;
int n[10][100];
vector<pair<int, int>> isi[150];
int main() {
while (1) {
int nn, mn;
scanf("%d %d", &nn, &mn);
if (nn == 0 && mn == 0) {
break;
}
for (int i = 0; i < nn; i++) {
int k;
scanf("%d", &k);
for (int ii = 0; ii < k; ii++) {
int x, d;
scanf("%d %d", &x, &d);
isi[i].push_back(make_pair(x, d));
}
}
for (int i = 0; i < isi[0].size(); i++) {
mb[i] = isi[0][i].first;
ms[i] = 0;
mmb[i] = isi[0][i].first;
mms[i] = 0;
for (int ii = 0; ii <= mn; ii++) {
m[i][ii] = 0;
mm[i][ii] = 0;
}
}
mk = isi[0].size();
mmk = isi[0].size();
for (int i = 0; i < nn; i++) {
if (i == 1) {
for (int ii = 0; ii < isi[i].size(); ii++) {
for (int iii = 0; iii <= mn; iii++) {
mm[ii][iii] = 0;
}
mmb[ii] = isi[i][ii].first;
mms[ii] = isi[i][ii].second;
}
mmk = isi[i].size();
}
for (int ii = 0; ii < isi[i].size(); ii++) {
for (int iii = 0; iii <= mn; iii++) {
int min = INF;
for (int j = 0; j < mk; j++) {
if (min > m[j][iii] + (ms[j] + isi[i][ii].second) *
abs(mb[j] - isi[i][ii].first)) {
min = m[j][iii] +
(ms[j] + isi[i][ii].second) * abs(mb[j] - isi[i][ii].first);
}
}
n[ii][iii] = min;
}
for (int iii = 0; iii < mn; iii++) {
int min = INF;
for (int j = 0; j < mmk; j++) {
if (min > mm[j][iii] + (mms[j] + isi[i][ii].second) *
abs(mmb[j] - isi[i][ii].first)) {
min = mm[j][iii] + (mms[j] + isi[i][ii].second) *
abs(mmb[j] - isi[i][ii].first);
}
}
if (n[ii][iii + 1] > min) {
n[ii][iii + 1] = min;
}
}
}
for (int ii = 0; ii < mk; ii++) {
for (int iii = 0; iii <= mn; iii++) {
mm[ii][iii] = m[ii][iii];
}
mmb[ii] = mb[ii];
mms[ii] = ms[ii];
}
mmk = mk;
for (int ii = 0; ii < isi[i].size(); ii++) {
for (int iii = 0; iii <= mn; iii++) {
m[ii][iii] = n[ii][iii];
}
mb[ii] = isi[i][ii].first;
ms[ii] = isi[i][ii].second;
}
mk = isi[i].size();
}
int allmin = INF;
for (int i = 0; i < mmk; i++) {
for (int ii = 0; ii < mn; ii++) {
if (allmin > mm[i][ii]) {
allmin = mm[i][ii];
}
}
}
for (int i = 0; i < mk; i++) {
for (int ii = 0; ii <= mn; ii++) {
if (allmin > m[i][ii]) {
allmin = m[i][ii];
}
}
}
printf("%d\n", allmin);
for (int i = 0; i < nn; i++) {
isi[i].clear();
}
}
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]]
| 1
| 1,097
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int W, H, N;
int X1[1000], X2[1000], Y1[1000], Y2[1000];
bool fld[1000 * 6][1000 * 6];
int compress(int *x1, int *x2, int w) {
vector<int> xs;
for (int i = 0; i < N; i++) {
for (int d = -1; d <= 1; d++) {
int tx1 = x1[i] + d, tx2 = x2[i] + d;
if (0 <= tx1 && tx1 < w)
xs.push_back(tx1);
if (0 <= tx2 && tx2 < w)
xs.push_back(tx2);
}
}
sort(xs.begin(), xs.end());
xs.erase(unique(xs.begin(), xs.end()), xs.end());
for (int i = 0; i < N; i++) {
x1[i] = find(xs.begin(), xs.end(), x1[i]) - xs.begin();
x2[i] = find(xs.begin(), xs.end(), x2[i]) - xs.begin();
}
return xs.size();
}
void solve() {
W = compress(X1, X2, W);
H = compress(Y1, Y2, H);
memset(fld, 0, sizeof(fld));
for (int i = 0; i < N; i++) {
for (int y = Y1[i]; y <= Y2[i]; y++) {
for (int x = X1[i]; x <= X2[i]; x++) {
fld[y][x] = true;
}
}
}
int ans = 0;
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
if (fld[y][x])
continue;
ans++;
queue<pair<int, int>> que;
que.push(make_pair(x, y));
while (!que.empty()) {
int sx = que.front().first, sy = que.front().second;
que.pop();
for (int i = 0; i < 4; i++) {
int tx = sx + dx[i], ty = sy + dy[i];
if (tx < 0 || ty < 0 || tx >= W || ty >= H)
continue;
if (fld[ty][tx])
continue;
que.push(make_pair(tx, ty));
fld[ty][tx] = true;
}
}
}
}
printf("%d\n", ans - 1);
}
int main() {
while (1) {
scanf("%d %d", &W, &H);
if (W == 0 && H == 0)
break;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d %d %d %d", &X1[i], &Y1[i], &X2[i], &Y2[i]);
}
solve();
}
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int W, H, N;
int X1[1000], X2[1000], Y1[1000], Y2[1000];
bool fld[1000 * 6][1000 * 6];
int compress(int *x1, int *x2, int w) {
vector<int> xs;
for (int i = 0; i < N; i++) {
for (int d = -1; d <= 1; d++) {
int tx1 = x1[i] + d, tx2 = x2[i] + d;
if (0 <= tx1 && tx1 < w)
xs.push_back(tx1);
if (0 <= tx2 && tx2 < w)
xs.push_back(tx2);
}
}
sort(xs.begin(), xs.end());
xs.erase(unique(xs.begin(), xs.end()), xs.end());
for (int i = 0; i < N; i++) {
x1[i] = find(xs.begin(), xs.end(), x1[i]) - xs.begin();
x2[i] = find(xs.begin(), xs.end(), x2[i]) - xs.begin();
}
return xs.size();
}
void solve() {
W = compress(X1, X2, W);
H = compress(Y1, Y2, H);
memset(fld, 0, sizeof(fld));
for (int i = 0; i < N; i++) {
for (int y = Y1[i]; y < Y2[i]; y++) {
for (int x = X1[i]; x < X2[i]; x++) {
fld[y][x] = true;
}
}
}
int ans = 0;
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
if (fld[y][x])
continue;
ans++;
queue<pair<int, int>> que;
que.push(make_pair(x, y));
while (!que.empty()) {
int sx = que.front().first, sy = que.front().second;
que.pop();
for (int i = 0; i < 4; i++) {
int tx = sx + dx[i], ty = sy + dy[i];
if (tx < 0 || ty < 0 || tx >= W || ty >= H)
continue;
if (fld[ty][tx])
continue;
que.push(make_pair(tx, ty));
fld[ty][tx] = true;
}
}
}
}
printf("%d\n", ans);
}
int main() {
while (1) {
scanf("%d %d", &W, &H);
if (W == 0 && H == 0)
break;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d %d %d %d", &X1[i], &Y1[i], &X2[i], &Y2[i]);
}
solve();
}
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 748
|
#include <bits/stdc++.h>
#define PB push_back
#define MP make pair
#define FI first
#define SE second
using namespace std;
static const int INF = 1ll << 60;
typedef pair<int, int> pii;
int W, H, N;
int X1[1001], Y1[1001], X2[1001], Y2[1001];
int fld[6000][6000];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int ans;
vector<int> xs;
int compress(int *x1, int *x2, int w) {
xs.clear();
for (int i = 0; i < N; ++i) {
for (int d = -1; d <= 1; ++d) {
int tx1 = x1[i] + d;
int tx2 = x2[i] + d;
if (0 <= tx1 && tx1 < w)
xs.PB(tx1);
if (0 <= tx2 && tx2 < w)
xs.PB(tx2);
}
}
sort(xs.begin(), xs.end());
xs.erase(unique(xs.begin(), xs.end()), xs.end());
for (int i = 0; i < N; ++i) {
x1[i] = find(xs.begin(), xs.end(), x1[i]) - xs.begin();
x2[i] = find(xs.begin(), xs.end(), x2[i]) - xs.begin();
}
return xs.size() - 1;
}
void bfs(int sx, int sy) {
queue<pii> que;
que.push(pii(sx, sy));
while (!que.empty()) {
pii p = que.front();
que.pop();
int x = p.FI;
int y = p.SE;
for (int i = 0; i < 4; ++i) {
int nx = x + dx[i];
int ny = y + dy[i];
if (nx < 0 || nx >= W || ny < 0 || ny >= H)
continue;
if (fld[ny][nx] == 1)
continue;
fld[ny][nx] = 1;
que.push(pii(nx, ny));
}
}
}
signed main() {
while (1) {
cin >> W >> H;
if (W == 0 && H == 0)
break;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> X1[i] >> Y1[i] >> X2[i] >> Y2[i];
}
W = compress(X1, X2, W);
H = compress(Y1, Y2, H);
for (int i = 0; i < N; ++i) {
for (int y = Y1[i]; y < Y2[i]; ++y) {
for (int x = X1[i]; x < X2[i]; ++x) {
fld[y][x] = 1;
}
}
}
for (int y = 0; y < H; ++y) {
for (int x = 0; x < W; ++x) {
if (fld[y][x] == 1)
continue;
queue<pii> que;
que.push(pii(x, y));
fld[y][x] = 1;
while (!que.empty()) {
pii p = que.front();
que.pop();
int x = p.FI;
int y = p.SE;
for (int i = 0; i < 4; ++i) {
int nx = x + dx[i];
int ny = y + dy[i];
if (nx < 0 || nx >= W || ny < 0 || ny >= H)
continue;
if (fld[ny][nx] == 1)
continue;
fld[ny][nx] = 1;
que.push(pii(nx, ny));
}
}
ans++;
}
}
cout << ans << endl;
memset(fld, 0, sizeof(fld));
ans = 0;
}
}
|
#include <bits/stdc++.h>
#define PB push_back
#define MP make pair
#define FI first
#define SE second
using namespace std;
static const int INF = 1ll << 60;
typedef pair<int, int> pii;
int W, H, N;
int X1[1001], Y1[1001], X2[1001], Y2[1001];
int fld[2000][2000];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int ans;
vector<int> xs;
int compress(int *x1, int *x2, int w) {
xs.clear();
for (int i = 0; i < N; ++i) {
for (int d = -1; d <= 1; ++d) {
int tx1 = x1[i] + d;
int tx2 = x2[i] + d;
if (0 <= tx1 && tx1 < w)
xs.PB(tx1);
if (0 <= tx2 && tx2 < w)
xs.PB(tx2);
}
}
sort(xs.begin(), xs.end());
xs.erase(unique(xs.begin(), xs.end()), xs.end());
for (int i = 0; i < N; ++i) {
x1[i] = find(xs.begin(), xs.end(), x1[i]) - xs.begin();
x2[i] = find(xs.begin(), xs.end(), x2[i]) - xs.begin();
}
return xs.size();
}
void bfs(int sx, int sy) {
queue<pii> que;
que.push(pii(sx, sy));
while (!que.empty()) {
pii p = que.front();
que.pop();
int x = p.FI;
int y = p.SE;
for (int i = 0; i < 4; ++i) {
int nx = x + dx[i];
int ny = y + dy[i];
if (nx < 0 || nx >= W || ny < 0 || ny >= H)
continue;
if (fld[ny][nx] == 1)
continue;
fld[ny][nx] = 1;
que.push(pii(nx, ny));
}
}
}
signed main() {
while (1) {
cin >> W >> H;
if (W == 0 && H == 0)
break;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> X1[i] >> Y1[i] >> X2[i] >> Y2[i];
}
W = compress(X1, X2, W);
H = compress(Y1, Y2, H);
for (int i = 0; i < N; ++i) {
for (int y = Y1[i]; y < Y2[i]; ++y) {
for (int x = X1[i]; x < X2[i]; ++x) {
fld[y][x] = 1;
}
}
}
for (int y = 0; y < H; ++y) {
for (int x = 0; x < W; ++x) {
if (fld[y][x] == 1)
continue;
queue<pii> que;
que.push(pii(x, y));
fld[y][x] = 1;
while (!que.empty()) {
pii p = que.front();
que.pop();
int x = p.FI;
int y = p.SE;
for (int i = 0; i < 4; ++i) {
int nx = x + dx[i];
int ny = y + dy[i];
if (nx < 0 || nx >= W || ny < 0 || ny >= H)
continue;
if (fld[ny][nx] == 1)
continue;
fld[ny][nx] = 1;
que.push(pii(nx, ny));
}
}
ans++;
}
}
cout << ans << endl;
memset(fld, 0, sizeof(fld));
ans = 0;
}
}
|
[["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 33], ["-", 0, 14, 8, 9, 0, 37, 0, 16, 12, 13]]
| 1
| 904
|
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
struct Compress {
map<int, int> mp;
map<int, int> revmp;
Compress(vector<int> vs) { setmp(vs); }
Compress(const set<int> &vs) { setmp(vs); }
Compress() : mp(), revmp() {}
void setmp(vector<int> vs) {
sort(vs.begin(), vs.end());
vs.erase(unique(vs.begin(), vs.end()), vs.end());
for (int i = 0; i < static_cast<int>(vs.size()); ++i) {
mp[vs[i]] = i;
revmp[i] = vs[i];
}
}
void setmp(const set<int> &vs) {
int num = 0;
for (auto v : vs) {
mp[v] = num;
revmp[num] = v;
num++;
}
}
};
struct rect {
int l, d, r, u;
};
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) {}
bool unionSet(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool findSet(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
int main() {
while (1) {
int W, H;
cin >> W >> H;
if (!W)
break;
vector<int> xs{0, W}, ys{0, H};
int N;
cin >> N;
vector<rect> rects;
for (int i = 0; i < N; ++i) {
int l, d, r, u;
cin >> l >> u >> r >> d;
xs.push_back(l);
xs.push_back(r);
ys.push_back(d);
ys.push_back(u);
rects.push_back(rect{l, d, r, u});
}
Compress compx(xs), compy(ys);
vector<vector<pair<int, int>>> pluss(compy.mp.size()),
minuss(compy.mp.size());
for (auto &rect : rects) {
rect.l = compx.mp[rect.l];
rect.r = compx.mp[rect.r];
rect.u = compy.mp[rect.u];
rect.d = compy.mp[rect.d];
pluss[rect.u].push_back(make_pair(rect.l, rect.r));
minuss[rect.d].push_back(make_pair(rect.l, rect.r));
}
vector<int> v(compx.mp.size());
vector<vector<int>> field(compy.mp.size(), vector<int>(compx.mp.size()));
for (int y = 0; y < compy.mp.size(); ++y) {
vector<int> nextv(v);
for (auto plus : pluss[y]) {
for (int x = plus.first; x < plus.second; ++x) {
nextv[x]++;
}
}
for (auto minus : minuss[y]) {
for (int x = minus.first; x < minus.second; ++x) {
nextv[x]--;
}
}
for (int x = 0; x < compx.mp.size(); ++x) {
field[y][x] = nextv[x];
}
v = nextv;
}
UnionFind uf(compx.mp.size() * compy.mp.size());
for (int i = 0; i < compy.mp.size() - 1; ++i) {
for (int j = 0; j < compx.mp.size(); ++j) {
const int num = i * compx.mp.size() + j;
if (!field[i][j]) {
if (i && !field[i - 1][j]) {
uf.unionSet(num, num - compx.mp.size());
}
if (j && !field[i][j - 1]) {
uf.unionSet(num, num - 1);
}
}
}
}
set<int> aset;
for (int y = 0; y < compy.mp.size() - 1; ++y) {
for (int x = 0; x < compx.mp.size(); ++x) {
if (!field[y][x]) {
aset.emplace(uf.root(y * compx.mp.size() + x));
}
}
}
int ans = aset.size();
cout << ans << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
struct Compress {
map<int, int> mp;
map<int, int> revmp;
Compress(vector<int> vs) { setmp(vs); }
Compress(const set<int> &vs) { setmp(vs); }
Compress() : mp(), revmp() {}
void setmp(vector<int> vs) {
sort(vs.begin(), vs.end());
vs.erase(unique(vs.begin(), vs.end()), vs.end());
for (int i = 0; i < static_cast<int>(vs.size()); ++i) {
mp[vs[i]] = i;
revmp[i] = vs[i];
}
}
void setmp(const set<int> &vs) {
int num = 0;
for (auto v : vs) {
mp[v] = num;
revmp[num] = v;
num++;
}
}
};
struct rect {
int l, d, r, u;
};
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) {}
bool unionSet(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool findSet(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
int main() {
while (1) {
int W, H;
cin >> W >> H;
if (!W)
break;
vector<int> xs{0, W}, ys{0, H};
int N;
cin >> N;
vector<rect> rects;
for (int i = 0; i < N; ++i) {
int l, d, r, u;
cin >> l >> u >> r >> d;
xs.push_back(l);
xs.push_back(r);
ys.push_back(d);
ys.push_back(u);
rects.push_back(rect{l, d, r, u});
}
Compress compx(xs), compy(ys);
vector<vector<pair<int, int>>> pluss(compy.mp.size()),
minuss(compy.mp.size());
for (auto &rect : rects) {
rect.l = compx.mp[rect.l];
rect.r = compx.mp[rect.r];
rect.u = compy.mp[rect.u];
rect.d = compy.mp[rect.d];
pluss[rect.u].push_back(make_pair(rect.l, rect.r));
minuss[rect.d].push_back(make_pair(rect.l, rect.r));
}
vector<int> v(compx.mp.size());
vector<vector<int>> field(compy.mp.size(), vector<int>(compx.mp.size()));
for (int y = 0; y < compy.mp.size(); ++y) {
vector<int> nextv(v);
for (auto plus : pluss[y]) {
for (int x = plus.first; x < plus.second; ++x) {
nextv[x]++;
}
}
for (auto minus : minuss[y]) {
for (int x = minus.first; x < minus.second; ++x) {
nextv[x]--;
}
}
for (int x = 0; x < compx.mp.size(); ++x) {
field[y][x] = nextv[x];
}
v = nextv;
}
UnionFind uf(compx.mp.size() * compy.mp.size());
for (int i = 0; i < compy.mp.size() - 1; ++i) {
for (int j = 0; j < compx.mp.size() - 1; ++j) {
const int num = i * compx.mp.size() + j;
if (!field[i][j]) {
if (i && !field[i - 1][j]) {
uf.unionSet(num, num - compx.mp.size());
}
if (j && !field[i][j - 1]) {
uf.unionSet(num, num - 1);
}
}
}
}
set<int> aset;
for (int y = 0; y < compy.mp.size() - 1; ++y) {
for (int x = 0; x < compx.mp.size() - 1; ++x) {
if (!field[y][x]) {
aset.emplace(uf.root(y * compx.mp.size() + x));
}
}
}
int ans = aset.size();
cout << ans << endl;
}
return 0;
}
|
[["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]]
| 1
| 1,162
|
#include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "math.h"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "utility"
using namespace std;
const long long int MOD = 1000000007;
int H, W;
list<long long int> ans;
int dir[5] = {1, 0, -1, 0, 1};
int main() {
ios::sync_with_stdio(false);
cin >> W >> H;
while (H) {
int N;
vector<int> x;
vector<int> y;
set<int> xbox;
set<int> ybox;
vector<int> xzip;
vector<int> yzip;
bool field[2005][2005] = {};
cin >> N;
for (int i = 0; i < N; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
x.push_back(a);
y.push_back(b);
x.push_back(c);
y.push_back(d);
xbox.insert(a);
xbox.insert(c);
ybox.insert(b);
ybox.insert(d);
}
xbox.insert(-1);
xbox.insert(W);
xbox.insert(0);
ybox.insert(-1);
ybox.insert(H);
ybox.insert(0);
for (auto i : xbox) {
xzip.push_back(i);
}
for (auto i : ybox) {
yzip.push_back(i);
}
for (int i = 0; i < N * 2; i++) {
for (int j = 0; j < xzip.size(); j++) {
if (x[i] == xzip[j]) {
x[i] = j;
break;
}
}
}
for (int i = 0; i < N * 2; i++) {
for (int j = 0; j < yzip.size(); j++) {
if (y[i] == yzip[j]) {
y[i] = j;
break;
}
}
}
for (int i = 1; i < yzip.size() - 1; i++) {
for (int j = 1; j < xzip.size() - 1; j++) {
field[i][j] = true;
}
}
for (int i = 0; i < N; i++) {
for (int j = y[i * 2]; j < y[i * 2 + 1]; j++) {
for (int k = x[i * 2]; k < x[i * 2 + 1]; k++) {
field[j][k] = false;
}
}
}
/*for (int i = yzip.size(); i >= 0; i--) {
for (int j = 0; j < xzip.size(); j++) {
if (field[i][j])cout << '.';
else cout << '#';
}
cout << endl;
}*/
// cout << yzip.size() << endl;
// cout << xzip.size() << endl;
int box = 0;
for (int i = 1; i < yzip.size(); i++) {
for (int j = 1; j < xzip.size(); j++) {
if (field[i][j]) {
box++;
queue<int> Q;
field[i][j] = false;
Q.push(i * 10000 + j);
while (!Q.empty()) {
int cy = Q.front() / 10000;
int cx = Q.front() % 10000;
for (int k = 0; k < 4; k++) {
if (field[cy + dir[k]][cx + dir[k + 1]]) {
Q.push((cy + dir[k] * 10000) + cx + dir[k + 1]);
field[cy + dir[k]][cx + dir[k + 1]] = false;
}
}
Q.pop();
}
}
}
}
ans.push_back(box);
cin >> W >> H;
}
for (auto i : ans)
cout << i << endl;
return 0;
}
|
#include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "math.h"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "utility"
using namespace std;
const long long int MOD = 1000000007;
int H, W;
list<long long int> ans;
int dir[5] = {1, 0, -1, 0, 1};
int main() {
ios::sync_with_stdio(false);
cin >> W >> H;
while (H) {
int N;
vector<int> x;
vector<int> y;
set<int> xbox;
set<int> ybox;
vector<int> xzip;
vector<int> yzip;
bool field[2005][2005] = {};
cin >> N;
for (int i = 0; i < N; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
x.push_back(a);
y.push_back(b);
x.push_back(c);
y.push_back(d);
xbox.insert(a);
xbox.insert(c);
ybox.insert(b);
ybox.insert(d);
}
xbox.insert(-1);
xbox.insert(W);
xbox.insert(0);
ybox.insert(-1);
ybox.insert(H);
ybox.insert(0);
for (auto i : xbox) {
xzip.push_back(i);
}
for (auto i : ybox) {
yzip.push_back(i);
}
for (int i = 0; i < N * 2; i++) {
for (int j = 0; j < xzip.size(); j++) {
if (x[i] == xzip[j]) {
x[i] = j;
break;
}
}
}
for (int i = 0; i < N * 2; i++) {
for (int j = 0; j < yzip.size(); j++) {
if (y[i] == yzip[j]) {
y[i] = j;
break;
}
}
}
for (int i = 1; i < yzip.size() - 1; i++) {
for (int j = 1; j < xzip.size() - 1; j++) {
field[i][j] = true;
}
}
for (int i = 0; i < N; i++) {
for (int j = y[i * 2]; j < y[i * 2 + 1]; j++) {
for (int k = x[i * 2]; k < x[i * 2 + 1]; k++) {
field[j][k] = false;
}
}
}
/*for (int i = yzip.size(); i >= 0; i--) {
for (int j = 0; j < xzip.size(); j++) {
if (field[i][j])cout << '.';
else cout << '#';
}
cout << endl;
}*/
// cout << yzip.size() << endl;
// cout << xzip.size() << endl;
int box = 0;
for (int i = 1; i < yzip.size(); i++) {
for (int j = 1; j < xzip.size(); j++) {
if (field[i][j]) {
box++;
queue<int> Q;
field[i][j] = false;
Q.push(i * 10000 + j);
while (!Q.empty()) {
int cy = Q.front() / 10000;
int cx = Q.front() % 10000;
for (int k = 0; k < 4; k++) {
if (field[cy + dir[k]][cx + dir[k + 1]]) {
Q.push((cy + dir[k]) * 10000 + cx + dir[k + 1]);
field[cy + dir[k]][cx + dir[k + 1]] = false;
}
}
Q.pop();
}
}
}
}
ans.push_back(box);
cin >> W >> H;
}
for (auto i : ans)
cout << i << endl;
return 0;
}
|
[["+", 0, 16, 31, 16, 31, 16, 31, 23, 0, 25], ["-", 3, 4, 0, 16, 31, 16, 31, 23, 0, 25]]
| 1
| 851
|
#include <algorithm>
#include <bitset>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MSG(a) cout << #a << " " << a << endl;
#define rep(i, n) for (unsigned int i = 0; i < n; i++)
const int MAX_N = 1000;
int compless(vector<int> &s, vector<int> &e, int w);
int main() {
// freopen("data/2008-ho-t5-in1", "r", stdin);
int W, H, N;
while (scanf("%d %d", &W, &H) != EOF && W) {
scanf("%d", &N);
vector<int> xs(N), xe(N), ys(N), ye(N);
vector<bitset<MAX_N * 6>> field(MAX_N * 6);
rep(i, N) scanf("%d %d %d %d", &xs[i], &ys[i], &xe[i], &ye[i]);
W = compless(xs, xe, W);
H = compless(ys, ye, H);
rep(i, N) for (int y = ys[i]; y < ye[i]; y++) for (int x = xs[i]; x < xe[i];
x++) field[y][x] = true;
int ans = 0;
rep(y, H) rep(x, W) {
if (field[y][x])
continue;
ans++;
queue<pair<int, int>> que;
for (que.push(make_pair(y, x)); !que.empty(); que.pop()) {
int tx = que.front().second, ty = que.front().first;
int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
rep(i, 4) {
int nx = tx + dx[i], ny = ty + dy[i];
if (0 <= nx && nx < W && 0 <= ny && ny < H && !field[ny][nx]) {
que.push(make_pair(ny, nx));
field[ny][nx] = true;
}
}
}
}
cout << ans << endl;
}
}
int compless(vector<int> &s, vector<int> &e, int u) {
vector<int> result;
rep(i, s.size()) for (int d = -1; d <= 1; d++) {
int ns = s[i] + d, ne = e[i] + d;
if (0 <= ns && ns <= u)
result.push_back(ns);
if (0 <= ne && ne <= u)
result.push_back(ne);
}
sort(result.begin(), result.end());
result.erase(unique(result.begin(), result.end()), result.end());
rep(i, s.size()) {
s[i] = find(result.begin(), result.end(), s[i]) - result.begin();
e[i] = find(result.begin(), result.end(), e[i]) - result.begin();
}
return result.size();
}
|
#include <algorithm>
#include <bitset>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MSG(a) cout << #a << " " << a << endl;
#define rep(i, n) for (unsigned int i = 0; i < n; i++)
const int MAX_N = 1000;
int compless(vector<int> &s, vector<int> &e, int w);
int main() {
int W, H, N;
while (scanf("%d %d", &W, &H) != EOF && W) {
scanf("%d", &N);
vector<int> xs(N), xe(N), ys(N), ye(N);
vector<bitset<MAX_N * 6>> field(MAX_N * 6);
rep(i, N) scanf("%d %d %d %d", &xs[i], &ys[i], &xe[i], &ye[i]);
W = compless(xs, xe, W);
H = compless(ys, ye, H);
rep(i, N) for (int y = ys[i]; y < ye[i]; y++) for (int x = xs[i]; x < xe[i];
x++) field[y][x] = true;
int ans = 0;
rep(y, H) rep(x, W) {
if (field[y][x])
continue;
ans++;
queue<pair<int, int>> que;
for (que.push(make_pair(y, x)); !que.empty(); que.pop()) {
int tx = que.front().second, ty = que.front().first;
int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
rep(i, 4) {
int nx = tx + dx[i], ny = ty + dy[i];
if (0 <= nx && nx < W && 0 <= ny && ny < H && !field[ny][nx]) {
que.push(make_pair(ny, nx));
field[ny][nx] = true;
}
}
}
}
cout << ans << endl;
}
}
int compless(vector<int> &s, vector<int> &e, int u) {
vector<int> result;
rep(i, s.size()) for (int d = -1; d <= 1; d++) {
int ns = s[i] + d, ne = e[i] + d;
if (0 <= ns && ns < u)
result.push_back(ns);
if (0 <= ne && ne < u)
result.push_back(ne);
}
sort(result.begin(), result.end());
result.erase(unique(result.begin(), result.end()), result.end());
rep(i, s.size()) {
s[i] = find(result.begin(), result.end(), s[i]) - result.begin();
e[i] = find(result.begin(), result.end(), e[i]) - result.begin();
}
return result.size();
}
|
[["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18]]
| 1
| 719
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int N;
int X1[1111], X2[1111], Y1[1111], Y2[1111];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int compress(int z1[], int z2[], int w) {
vector<int> xs;
// cout << "w = " << w << endl;
for (int i = 0; i < N; i++) {
for (int d = -1; d <= 1; d++) {
int tx1 = z1[i] + d;
int tx2 = z2[i] + d;
if (0 <= tx1 && tx1 < w)
xs.push_back(tx1);
if (0 <= tx2 && tx2 < w) {
// cout << "0 <= " << tx2 << " <= " << w << endl;
xs.push_back(tx2);
}
}
}
sort(xs.begin(), xs.end());
xs.erase(unique(xs.begin(), xs.end()), xs.end());
for (int i = 0; i < N; i++) {
z1[i] = find(xs.begin(), xs.end(), z1[i]) - xs.begin();
z2[i] = find(xs.begin(), xs.end(), z2[i]) - xs.begin();
}
// cout << xs[(int)xs.size()-1] << endl;
return xs.size();
}
bool f[3333][3333];
int main(void) {
int W, H;
while (cin >> W >> H && W) {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> X1[i] >> Y1[i] >> X2[i] >> Y2[i];
}
// cout << "W = " << W << endl;
W = compress(X1, X2, W);
H = compress(Y1, Y2, H);
memset(f, false, sizeof(f));
for (int i = 0; i < N; i++) {
for (int x = X1[i]; x < X2[i]; x++) {
for (int y = Y1[i]; y < Y2[i]; y++) {
f[x][y] = true;
}
}
}
/*
for(int y = 0; y < H; y++){
for(int x = 0; x < W; x++){
cout << ((f[x][y])?"■":"□") << " ";
}
cout << endl;
}
cout << W << ":" << H << endl;
//*/
int res = 0;
for (int x = 1; x < W; x++) {
for (int y = 1; y < H; y++) {
if (f[x][y])
continue;
res++;
queue<pair<int, int>> que;
que.push(make_pair(x, y));
while (!que.empty()) {
int sx = que.front().first;
int sy = que.front().second;
que.pop();
for (int i = 0; i < 4; i++) {
int nx = sx + dx[i];
int ny = sy + dy[i];
if (nx < 0 || ny < 0 || W <= nx || H <= ny)
continue;
if (f[nx][ny])
continue;
que.push(make_pair(nx, ny));
f[nx][ny] = true;
}
}
}
}
cout << res << endl;
}
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int N;
int X1[1111], X2[1111], Y1[1111], Y2[1111];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int compress(int z1[], int z2[], int w) {
vector<int> xs;
for (int i = 0; i < N; i++) {
for (int d = -1; d <= 1; d++) {
int tx1 = z1[i] + d;
int tx2 = z2[i] + d;
if (0 <= tx1 && tx1 < w)
xs.push_back(tx1);
if (0 <= tx2 && tx2 < w)
xs.push_back(tx2);
}
}
sort(xs.begin(), xs.end());
xs.erase(unique(xs.begin(), xs.end()), xs.end());
for (int i = 0; i < N; i++) {
z1[i] = find(xs.begin(), xs.end(), z1[i]) - xs.begin();
z2[i] = find(xs.begin(), xs.end(), z2[i]) - xs.begin();
}
return xs.size();
}
bool f[3333][3333];
int main(void) {
int W, H;
while (cin >> W >> H && W) {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> X1[i] >> Y1[i] >> X2[i] >> Y2[i];
}
W = compress(X1, X2, W);
H = compress(Y1, Y2, H);
memset(f, false, sizeof(f));
for (int i = 0; i < N; i++) {
for (int x = X1[i]; x < X2[i]; x++) {
for (int y = Y1[i]; y < Y2[i]; y++) {
f[x][y] = true;
}
}
}
int res = 0;
for (int x = 0; x < W; x++) {
for (int y = 0; y < H; y++) {
if (f[x][y])
continue;
res++;
queue<pair<int, int>> que;
que.push(make_pair(x, y));
while (!que.empty()) {
int sx = que.front().first;
int sy = que.front().second;
que.pop();
for (int i = 0; i < 4; i++) {
int nx = sx + dx[i];
int ny = sy + dy[i];
if (nx < 0 || ny < 0 || W <= nx || H <= ny)
continue;
if (f[nx][ny])
continue;
que.push(make_pair(nx, ny));
f[nx][ny] = true;
}
}
}
}
cout << res << endl;
}
}
|
[["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]]
| 1
| 704
|
import sys
def find_color(n, ai, bi):
color = (3, 1, 2)
if n % 2 != 0:
if ai > int((n+1)/2):
ai = int((n+1)/2) - (ai - int((n+1)/2))
if bi > int((n+1)/2):
bi = int((n+1)/2) - (bi - int((n+1)/2))
else:
if ai > int(n/2):
ai = int(n/2) - (ai - int(n/2)) + 1
if bi > int(n/2):
bi = int(n/2) - (bi - int(n/2)) + 1
print(ai, bi)
if bi >= ai and bi <= n - ai:
return color[ai % 3]
else:
return color[bi % 3]
n = int(sys.stdin.readline())
k = int(sys.stdin.readline())
for i in range(0, k):
ai, bi = (int(x) for x in sys.stdin.readline().split())
print(find_color(n, ai, bi))
|
import sys
def find_color(n, ai, bi):
color = (3, 1, 2)
if n % 2 != 0:
if ai > int((n+1)/2):
ai = int((n+1)/2) - (ai - int((n+1)/2))
if bi > int((n+1)/2):
bi = int((n+1)/2) - (bi - int((n+1)/2))
else:
if ai > int(n/2):
ai = int(n/2) - (ai - int(n/2)) + 1
if bi > int(n/2):
bi = int(n/2) - (bi - int(n/2)) + 1
if bi >= ai and bi <= n - ai:
return color[ai % 3]
else:
return color[bi % 3]
n = int(sys.stdin.readline())
k = int(sys.stdin.readline())
for i in range(0, k):
ai, bi = (int(x) for x in sys.stdin.readline().split())
print(find_color(n, ai, bi))
|
[["-", 0, 14, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 21], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]]
| 5
| 276
|
// First Grader
import java.util.Scanner;
public class Main {
public static void main(String[] args) { new Main().run(); }
void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] number = new int[n];
for (int i = 0; i < n; i++)
number[i] = sc.nextInt();
long[][] dp = new long[n][21];
dp[0][0] = 1;
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < 21; j++) {
if (dp[i][j] > 0) {
if (j + number[i] < 21)
dp[i + 1][j + number[i]] += dp[i][j];
if (number[i] > 0 && j - number[i] >= 0)
dp[i + 1][j - number[i]] += dp[i][j];
}
}
}
System.out.println(dp[n - 1][number[n - 1]]);
sc.close();
}
}
|
// First Grader
import java.util.Scanner;
public class Main {
public static void main(String[] args) { new Main().run(); }
void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] number = new int[n];
for (int i = 0; i < n; i++)
number[i] = sc.nextInt();
long[][] dp = new long[n][21];
dp[0][0] = 1;
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < 21; j++) {
if (dp[i][j] > 0) {
if (j + number[i] < 21)
dp[i + 1][j + number[i]] += dp[i][j];
if ((i > 0 || number[i] > 0) && j - number[i] >= 0)
dp[i + 1][j - number[i]] += dp[i][j];
}
}
}
System.out.println(dp[n - 1][number[n - 1]]);
sc.close();
}
}
|
[["+", 0, 57, 15, 15, 0, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 17, 47], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 12, 499], ["+", 15, 15, 0, 16, 31, 23, 0, 16, 17, 106], ["+", 0, 57, 15, 15, 0, 16, 31, 23, 0, 25]]
| 3
| 273
|
#include <stdio.h>
int main(void) {
int i, j, n, a[100], dp[21][100];
scanf("%d", &n);
for (i = 0; i <= n - 1; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i <= 20; i++) {
for (j = 0; j <= n - 1; j++) {
dp[i][j] = 0;
}
}
dp[a[0]][0] = 1;
for (i = 1; i <= n - 2; i++) {
for (j = 0; j <= 20; j++) {
if (dp[j][i - 1] != 0) {
if (j - a[i] >= 0)
dp[j - a[i]][i] += dp[j][i - 1];
if (j + a[i] <= 20)
dp[j + a[i]][i] += dp[j][i - 1];
}
}
}
printf("%d\n", dp[a[n - 1]][n - 2]);
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, j, n, a[100];
long long int dp[21][100];
scanf("%d", &n);
for (i = 0; i <= n - 1; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i <= 20; i++) {
for (j = 0; j <= n - 1; j++) {
dp[i][j] = 0;
}
}
dp[a[0]][0] = 1;
for (i = 1; i <= n - 2; i++) {
for (j = 0; j <= 20; j++) {
if (dp[j][i - 1] != 0) {
if (j - a[i] >= 0)
dp[j - a[i]][i] += dp[j][i - 1];
if (j + a[i] <= 20)
dp[j + a[i]][i] += dp[j][i - 1];
}
}
}
printf("%lld\n", dp[a[n - 1]][n - 2]);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 266
|
D[], j;
double *d = D;
main(i, v) {
for (; j || ~scanf("%d", &v, i++); j = -~j % 30)
30 [d++] = j < 21 && i > 3 ? d[-v] + d[v] : j == v;
d = !printf("%.f\n", *d);
}
|
D[9999], j;
double *d = D;
main(i, v) {
for (; j || ~scanf("%d", &v, i++); j = -~j % 30)
30 [d++] = j<21 & i> 3 ? d[-v] + d[v] : j == v;
d = !printf("%.f\n", *d);
}
|
[["+", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13], ["-", 0, 30, 0, 1, 0, 69, 71, 22, 0, 73], ["-", 8, 1, 0, 11, 12, 41, 15, 16, 17, 98], ["+", 8, 1, 0, 11, 12, 41, 15, 16, 17, 67]]
| 0
| 92
|
t[21][2], a, d;
int main(b) {
for (scanf("%d%d", &a, &b); d < 21; d++)
t[d][a & 1] = !(b - d);
for (; --a - 1 && scanf("%d", &b);)
for (d = 0; d < 21;
t[d++][a & 1] = ((b > d ? 0 : t[d - b][!(a & 1)]) +
((b < (21 - d)) ? t[b + d][!(a & 1)] : 0)))
;
scanf("%d", &b), printf("%lld", t[b][0]);
}
|
long long t[21][2], a, d;
int main(b) {
for (scanf("%d%d", &a, &b); d < 21; d++)
t[d][a & 1] = !(b - d);
for (; --a - 1 && scanf("%d", &b);)
for (d = 0; d < 21;
t[d++][a & 1] = ((b > d ? 0 : t[d - b][!(a & 1)]) +
((b < (21 - d)) ? t[b + d][!(a & 1)] : 0)))
;
scanf("%d", &b), a = !printf("%lld\n", t[b][0]);
}
|
[["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["+", 8, 9, 0, 1, 0, 34, 12, 11, 31, 22], ["+", 8, 9, 0, 1, 0, 34, 12, 11, 17, 32], ["+", 0, 1, 0, 34, 12, 11, 12, 91, 17, 111], ["+", 12, 91, 28, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 178
|
#include <stdio.h>
unsigned long long kazu[100][21];
unsigned long long kazoe(int *, int, int, int);
int main(int argc, char *argv[]) {
/*declare values*/
int suuzi[100];
int kosuu;
unsigned long long count;
int i, j;
/*do work*/
scanf("%d", &kosuu);
for (i = 0; i < kosuu; i++) {
scanf("%d", &suuzi[i]);
for (j = 0; j <= 20; j++)
kazu[i][j] = -1;
}
count = kazoe(suuzi, 1, suuzi[0], kosuu);
printf("%llu\n", count);
free(suuzi);
return 0;
}
unsigned long long kazoe(int *suuzi, int now, int nowsum, int max) {
unsigned long long sum = 0, result;
int nowsuuzi;
if (now == max - 1) {
if (nowsum == suuzi[now])
return 1;
else
return 0;
}
if (suuzi[now] != 0) {
nowsuuzi = nowsum + suuzi[now];
if (nowsuuzi >= 0 && nowsuuzi <= 20) {
if (kazu[now][nowsuuzi] == -1) {
result = kazoe(suuzi, now + 1, nowsuuzi, max);
kazu[now][nowsuuzi] = result;
}
sum += kazu[now][nowsuuzi];
}
nowsuuzi = nowsum - suuzi[now];
if (nowsuuzi >= 0 && nowsuuzi <= 20) {
if (kazu[now][nowsuuzi] == -1) {
result = kazoe(suuzi, now + 1, nowsuuzi, max);
kazu[now][nowsuuzi] = result;
}
sum += kazu[now][nowsuuzi];
}
} else {
if (kazu[now][nowsum] == -1) {
result = kazoe(suuzi, now + 1, nowsum, max) * 2;
kazu[now][nowsum] = result;
}
sum += kazu[now][nowsum];
}
return sum;
}
|
#include <stdio.h>
unsigned long long kazu[100][21];
unsigned long long kazoe(int *, int, int, int);
int main(int argc, char *argv[]) {
/*declare values*/
int suuzi[100];
int kosuu;
unsigned long long count;
int i, j;
/*do work*/
scanf("%d", &kosuu);
for (i = 0; i < kosuu; i++) {
scanf("%d", &suuzi[i]);
for (j = 0; j <= 20; j++)
kazu[i][j] = -1;
}
count = kazoe(suuzi, 1, suuzi[0], kosuu);
printf("%llu\n", count);
return 0;
}
unsigned long long kazoe(int *suuzi, int now, int nowsum, int max) {
unsigned long long sum = 0, result;
int nowsuuzi;
if (now == max - 1) {
if (nowsum == suuzi[now])
return 1;
else
return 0;
}
if (suuzi[now] != 0) {
nowsuuzi = nowsum + suuzi[now];
if (nowsuuzi >= 0 && nowsuuzi <= 20) {
if (kazu[now][nowsuuzi] == -1) {
result = kazoe(suuzi, now + 1, nowsuuzi, max);
kazu[now][nowsuuzi] = result;
}
sum += kazu[now][nowsuuzi];
}
nowsuuzi = nowsum - suuzi[now];
if (nowsuuzi >= 0 && nowsuuzi <= 20) {
if (kazu[now][nowsuuzi] == -1) {
result = kazoe(suuzi, now + 1, nowsuuzi, max);
kazu[now][nowsuuzi] = result;
}
sum += kazu[now][nowsuuzi];
}
} else {
if (kazu[now][nowsum] == -1) {
result = kazoe(suuzi, now + 1, nowsum, max) * 2;
kazu[now][nowsum] = result;
}
sum += kazu[now][nowsum];
}
return sum;
}
|
[["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]]
| 0
| 424
|
#include <iostream>
using namespace std;
int main() {
int N, num[101];
cin >> N;
for (int i = 0; i < N; i++)
cin >> num[i];
int dp[101][21] = {{0}};
dp[0][num[0]] = 1;
for (int i = 1; i < N - 1; i++) {
for (int j = 0; j <= 20; j++) {
if (j - num[i] >= 0)
dp[i][j - num[i]] += dp[i - 1][j];
if (j + num[i] <= 20)
dp[i][j + num[i]] += dp[i - 1][j];
}
}
cout << dp[N - 2][num[N - 1]] << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int N, num[101];
cin >> N;
for (int i = 0; i < N; i++)
cin >> num[i];
long long dp[101][21] = {{0}};
dp[0][num[0]] = 1;
for (int i = 1; i < N - 1; i++) {
for (int j = 0; j <= 20; j++) {
if (j - num[i] >= 0)
dp[i][j - num[i]] += dp[i - 1][j];
if (j + num[i] <= 20)
dp[i][j + num[i]] += dp[i - 1][j];
}
}
cout << dp[N - 2][num[N - 1]] << endl;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]]
| 1
| 197
|
#include <iostream>
int main() {
int a;
int dp[101][101] = {0};
int x[101];
std::cin >> a;
for (int i = 1; i <= a; i++)
std::cin >> x[i];
dp[1][x[1]] = 1;
for (int j = 2; j < a; j++) {
for (int s = 0; s <= 20; s++) {
if (s + x[j] <= 20 && s - x[j] >= 0) {
dp[j][s] = dp[j - 1][s - x[j]] + dp[j - 1][s + x[j]];
} else if (s + x[j] <= 20 && s - x[j] < 0) {
dp[j][s] = dp[j - 1][s + x[j]];
} else if (s + x[j] > 20 && s - x[j] >= 0) {
dp[j][s] = dp[j - 1][s - x[j]];
}
}
}
std::cout << dp[a - 1][x[a]] << std::endl;
return 0;
}
|
#include <iostream>
int main() {
int a;
long long int dp[101][101] = {0};
int x[101];
std::cin >> a;
for (int i = 1; i <= a; i++)
std::cin >> x[i];
dp[1][x[1]] = 1;
for (int j = 2; j < a; j++) {
for (int s = 0; s <= 20; s++) {
if (s + x[j] <= 20 && s - x[j] >= 0) {
dp[j][s] = dp[j - 1][s - x[j]] + dp[j - 1][s + x[j]];
} else if (s + x[j] <= 20 && s - x[j] < 0) {
dp[j][s] = dp[j - 1][s + x[j]];
} else if (s + x[j] > 20 && s - x[j] >= 0) {
dp[j][s] = dp[j - 1][s - x[j]];
}
}
}
std::cout << dp[a - 1][x[a]] << std::endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 280
|
#include <stdio.h>
long long int dp[105][25] = {};
int n;
int dat[105];
int main(void) {
scanf("%d", &n);
int i, t1, t2, s;
for (i = 1; i <= n; i++) {
scanf("%d", &dat[i]);
}
for (i = 0; i <= 20; i++) {
dp[1][i] = 0;
}
dp[1][dat[1]] = 1;
for (i = 2; i <= n - 1; i++) {
for (s = 0; s <= 20; s++) {
dp[i][s] = 0;
t1 = s + dat[i];
if (0 <= t1 && t1 <= 20) {
dp[i][s] += dp[i - 1][t1];
}
t2 = s - dat[i];
if (0 <= t2 && t2 <= 20) {
dp[i][s] += dp[i - 1][t2];
}
}
}
long long int ans = dp[n - 1][dat[n]];
printf("%I64d\n", ans);
return 0;
}
|
#include <stdio.h>
long long int dp[105][25] = {};
int n;
int dat[105];
int main(void) {
scanf("%d", &n);
int i, t1, t2, s;
for (i = 1; i <= n; i++) {
scanf("%d", &dat[i]);
}
for (i = 0; i <= 20; i++) {
dp[1][i] = 0;
}
dp[1][dat[1]] = 1;
for (i = 2; i <= n - 1; i++) {
for (s = 0; s <= 20; s++) {
dp[i][s] = 0;
t1 = s + dat[i];
if (0 <= t1 && t1 <= 20) {
dp[i][s] += dp[i - 1][t1];
}
t2 = s - dat[i];
if (0 <= t2 && t2 <= 20) {
dp[i][s] += dp[i - 1][t2];
}
}
}
long long int ans = dp[n - 1][dat[n]];
printf("%lld\n", ans);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 268
|
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int count_num;
std::cin >> count_num;
std::vector<int> fig;
fig.resize(count_num);
for (int i = 0; i < count_num; ++i) {
std::cin >> fig[i];
}
std::vector<int> ans_number;
ans_number.resize(21);
ans_number[fig[0]] = 1;
for (int i = 1; i < count_num - 1; ++i) {
std::vector<int> number;
number.resize(21);
for (int j = 0; j < 21; ++j) {
if (ans_number[j] != 0) {
if (j + fig[i] <= 20)
number[j + fig[i]] += ans_number[j];
if (j - fig[i] >= 0)
number[j - fig[i]] += ans_number[j];
}
}
std::copy(number.begin(), number.end(), ans_number.begin());
}
std::cout << ans_number[fig.back()] << std::endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int count_num;
std::cin >> count_num;
std::vector<int> fig;
fig.resize(count_num);
for (int i = 0; i < count_num; ++i) {
std::cin >> fig[i];
}
std::vector<long int> ans_number;
ans_number.resize(21);
ans_number[fig[0]] = 1;
for (int i = 1; i < count_num - 1; ++i) {
std::vector<long int> number;
number.resize(21);
for (int j = 0; j < 21; ++j) {
if (ans_number[j] != 0) {
if (j + fig[i] <= 20)
number[j + fig[i]] += ans_number[j];
if (j - fig[i] >= 0)
number[j - fig[i]] += ans_number[j];
}
}
std::copy(number.begin(), number.end(), ans_number.begin());
}
std::cout << ans_number[fig.back()] << std::endl;
return 0;
}
|
[["+", 141, 344, 3, 347, 0, 77, 39, 86, 0, 96]]
| 1
| 241
|
#include <iostream>
#include <vector>
const int Max_N = 101; // 3 <= N <= 100
const int Max_ans = 21; // 0 <= answer <= 20
bool memo[Max_N][Max_ans]; // memo for dp
int dp[Max_N][Max_ans] = {0};
std::vector<int> seq;
// memo[0][seq[0]] = true;
// memo[i][j] : caliculated up to i+1 and the num of result is j
void format() {
for (u_int i = 0; i < Max_N; ++i) {
for (u_int j = 0; j < Max_ans; ++j) {
memo[i][j] = false;
dp[i][j] = 0;
}
}
memo[0][seq[0]] = true;
dp[0][seq[0]] = 1;
}
/*
term - 1 ?????§????????????num??§???????????°???= term - 2?????§????????????num
- seq[num - 1]??§???????????°???+???term - 2?????§????????????num + seq[num -
1]??§???????????°
*/
int calcEq(
int term,
int num) { // term-1?????§????????????number(term)??§???????????°?????????
if (num < 0 || num > 20) {
return 0;
} else if (term == 3) {
int count = 0;
if (seq[0] + seq[1] == num) {
count += 1;
}
if (seq[0] - seq[1] == num) {
count += 1;
}
memo[1][num] = true;
dp[1][num] = count;
return dp[1][num];
} else { //?¨???????????????????????????????????????´???
if (!memo[term - 2][num]) {
// dp[term - 2][num] = dp[term - 3][num - seq[num - 1]] + dp[term - 3][num
// + seq[num - 1]];
dp[term - 2][num] = calcEq(term - 1, num - seq[term - 2]) +
calcEq(term - 1, num + seq[term - 2]);
memo[term - 2][num] = true;
}
return dp[term - 2][num];
}
}
int main(void) {
u_int N; // the number of integer
// input
std::cin >> N;
seq.reserve(N);
for (u_int i = 0; i < N; ++i) {
u_int tmp;
std::cin >> tmp;
seq.push_back(tmp);
}
// bounding condition
format();
// solve by dp
std::cout << calcEq(N, seq[N - 1]) << std::endl;
return 0;
}
|
#include <iostream>
#include <vector>
const int Max_N = 101; // 3 <= N <= 100
const int Max_ans = 21; // 0 <= answer <= 20
bool memo[Max_N][Max_ans]; // memo for dp
long long int dp[Max_N][Max_ans] = {0};
std::vector<int> seq;
// memo[0][seq[0]] = true;
// memo[i][j] : caliculated up to i+1 and the num of result is j
void format() {
for (u_int i = 0; i < Max_N; ++i) {
for (u_int j = 0; j < Max_ans; ++j) {
memo[i][j] = false;
dp[i][j] = 0;
}
}
memo[0][seq[0]] = true;
dp[0][seq[0]] = 1;
}
/*
term - 1 ?????§????????????num??§???????????°???= term - 2?????§????????????num
- seq[num - 1]??§???????????°???+???term - 2?????§????????????num + seq[num -
1]??§???????????°
*/
long long int calcEq(
int term,
int num) { // term-1?????§????????????number(term)??§???????????°?????????
if (num < 0 || num > 20) {
return 0;
} else if (term == 3) {
int count = 0;
if (seq[0] + seq[1] == num) {
count += 1;
}
if (seq[0] - seq[1] == num) {
count += 1;
}
memo[1][num] = true;
dp[1][num] = count;
return dp[1][num];
} else { //?¨???????????????????????????????????????´???
if (!memo[term - 2][num]) {
// dp[term - 2][num] = dp[term - 3][num - seq[num - 1]] + dp[term - 3][num
// + seq[num - 1]];
dp[term - 2][num] = calcEq(term - 1, num - seq[term - 2]) +
calcEq(term - 1, num + seq[term - 2]);
memo[term - 2][num] = true;
}
return dp[term - 2][num];
}
}
int main(void) {
u_int N; // the number of integer
// input
std::cin >> N;
seq.reserve(N);
for (u_int i = 0; i < N; ++i) {
u_int tmp;
std::cin >> tmp;
seq.push_back(tmp);
}
// bounding condition
format();
// solve by dp
std::cout << calcEq(N, seq[N - 1]) << std::endl;
return 0;
}
|
[["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 1
| 418
|
#include <iostream>
#define MAX_N 100
int n;
unsigned long long dp[MAX_N][21];
int a[MAX_N];
int main() {
std::cin >> n;
for (int i = 0; i < n; ++i)
std::cin >> a[i];
dp[0][a[0]] = 1;
for (int i = 1; i < n - 1; ++i) {
for (int j = 0; j <= 20; ++j) {
if (j + a[i] <= 20)
dp[i][j] += dp[i][j + a[i]];
if (j - a[i] >= 0)
dp[i][j] += dp[i][j - a[i]];
}
}
std::cout << dp[n - 2][a[n - 1]] << std::endl;
return 0;
}
|
#include <iostream>
#define MAX_N 100
int n;
unsigned long long dp[MAX_N][21];
int a[MAX_N];
int main() {
std::cin >> n;
for (int i = 0; i < n; ++i)
std::cin >> a[i];
dp[0][a[0]] = 1;
for (int i = 1; i < n - 1; ++i) {
for (int j = 0; j <= 20; ++j) {
if (j + a[i] <= 20)
dp[i][j] += dp[i - 1][j + a[i]];
if (j - a[i] >= 0)
dp[i][j] += dp[i - 1][j - a[i]];
}
}
std::cout << dp[n - 2][a[n - 1]] << std::endl;
return 0;
}
|
[["+", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 197
|
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int num[21];
for (int i = 1; i <= n; i++)
cin >> num[i];
ll dp[101][21];
memset(dp, 0, sizeof(dp));
dp[1][num[1]] = 1;
for (int i = 2; i < n; i++) {
for (int j = 0; j <= 20; j++) {
if (j + num[i] <= 20)
dp[i][j + num[i]] += dp[i - 1][j];
if (j - num[i] >= 0)
dp[i][j - num[i]] += dp[i - 1][j];
}
}
cout << dp[n - 1][num[n]] << endl;
return 0;
}
|
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int num[101];
for (int i = 1; i <= n; i++)
cin >> num[i];
ll dp[101][21];
memset(dp, 0, sizeof(dp));
dp[1][num[1]] = 1;
for (int i = 2; i < n; i++) {
for (int j = 0; j <= 20; j++) {
if (j + num[i] <= 20)
dp[i][j + num[i]] += dp[i - 1][j];
if (j - num[i] >= 0)
dp[i][j - num[i]] += dp[i - 1][j];
}
}
cout << dp[n - 1][num[n]] << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]]
| 1
| 207
|
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#define MAX_N 25
using namespace std;
long long int dp[110][MAX_N];
int n, num[110];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> num[i];
}
dp[0][num[0]] = 1;
for (int i = 1; i < n; ++i) {
for (int j = 0; j <= n; j++) {
if (j + num[i] <= 20) {
dp[i][j + num[i]] += dp[i - 1][j];
}
if (j - num[i] >= 0) {
dp[i][j - num[i]] += dp[i - 1][j];
}
}
}
cout << dp[n - 2][num[n - 1]] << endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#define MAX_N 25
using namespace std;
long long int dp[110][MAX_N];
int n, num[110];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> num[i];
}
dp[0][num[0]] = 1;
for (int i = 1; i < n; ++i) {
for (int j = 0; j <= 20; j++) {
if (j + num[i] <= 20) {
dp[i][j + num[i]] += dp[i - 1][j];
}
if (j - num[i] >= 0) {
dp[i][j - num[i]] += dp[i - 1][j];
}
}
}
cout << dp[n - 2][num[n - 1]] << endl;
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 206
|
#include <iostream>
using namespace std;
int main() {
long long int a[100][21];
for (int i = 0; i < 100; i++) {
for (int j = 0; j < 20; j++) {
a[i][j] = 0;
}
}
int n;
cin >> n;
int y;
cin >> y;
a[0][y] = 1;
for (int i = 1; i < n - 1; i++) {
int p;
cin >> p;
for (int j = 0; j < 20; j++) {
if (j + p <= 20) {
a[i][j + p] += a[i - 1][j];
}
if (j - p >= 0) {
a[i][j - p] += a[i - 1][j];
}
}
}
int ans;
cin >> ans;
cout << a[n - 2][ans] << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int a[100][21];
for (int i = 0; i < 100; i++) {
for (int j = 0; j < 21; j++) {
a[i][j] = 0;
}
}
int n;
cin >> n;
int y;
cin >> y;
a[0][y] = 1;
for (int i = 1; i < n - 1; i++) {
int p;
cin >> p;
for (int j = 0; j < 21; j++) {
if (j + p <= 20) {
a[i][j + p] += a[i - 1][j];
}
if (j - p >= 0) {
a[i][j - p] += a[i - 1][j];
}
}
}
int ans;
cin >> ans;
cout << a[n - 2][ans] << endl;
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 214
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repp(i, k, n) for (int i = k; i < (int)n; i++)
#define rei(n) for (int i = 0; i < (int)n; i++)
#define rel(n) for (int l = 0; l < (int)n; l++)
#define all(s) s.begin(), s.end()
#define INT_MAX 2147483647
#define debug(x) cout << #x << ": " << x << endl;
#define PI 2 * acos(0, 0)
#define pb push_back
#define inin(x) \
int x; \
cin >> x;
#define ll long long
#define pb push_back
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
struct Calendar {
long long year;
long long month;
long long day;
long long dat[2][13];
Calendar(long long y, long long m, long long d) {
year = y;
month = m;
day = d;
dat[0][0] = dat[1][0] = 0;
dat[0][1] = dat[1][1] = 31;
dat[0][2] = dat[1][2] = 28;
dat[0][3] = dat[1][3] = 31;
dat[0][4] = dat[1][4] = 30;
dat[0][5] = dat[1][5] = 31;
dat[0][6] = dat[1][6] = 30;
dat[0][7] = dat[1][7] = 31;
dat[0][8] = dat[1][8] = 31;
dat[0][9] = dat[1][9] = 30;
dat[0][10] = dat[1][10] = 31;
dat[0][11] = dat[1][11] = 30;
dat[0][12] = dat[1][12] = 31;
dat[1][2] = 29;
}
int uruu() {
if (year % 4 == 0) {
if (year % 400 != 0 && year % 100 == 0) {
return 0;
} else {
return 1;
}
}
return 0;
}
int uruu(long long y) {
if (y % 4 == 0) {
if (y % 400 != 0 && y % 100 == 0) {
return 0;
} else {
return 1;
}
}
return 0;
}
long long pday(long long d) {
day += d;
for (;; month++) {
if (month >= 13) {
year++;
month = 1;
}
if (dat[uruu()][month] < day) {
day -= dat[uruu()][month];
} else {
break;
}
}
pmonth(0);
return d;
}
long long pmonth(long long m) {
month += m;
for (;; year++) {
if (month > 12) {
month -= 12;
} else {
break;
}
}
return m;
}
long long pyear(long long y) {
year += y;
return y;
}
long long dif(Calendar c) {
long long ans = 0;
Calendar a(year, month, day);
ans -= a.day;
ans += c.day;
a.day = 0;
c.day = 0;
for (; a.month >= 1; a.month--) {
ans -= dat[a.uruu()][a.month - 1];
}
for (; c.month >= 1; c.month--) {
ans += dat[c.uruu()][c.month - 1];
}
for (; a.year != c.year; a.year++) {
ans += 365;
if (a.uruu())
ans++;
}
return ans;
}
};
int n;
vector<unsigned long long int> seq;
int memo[21][120];
int obj;
unsigned long long dp(int num, int now) {
unsigned long long ans = 0;
if (num > 20 || num < 0)
return 0;
if (memo[num][now] != -1)
return memo[num][now];
if (now == n && num == obj)
return 1;
if (now == n)
return 0;
ans += dp(num + seq[now], now + 1);
ans += dp(num - seq[now], now + 1);
return memo[num][now] = ans;
}
int main() {
memset(memo, -1, sizeof(memo));
cin >> n;
n--;
rep(i, n) {
unsigned long long int a;
cin >> a;
seq.pb(a);
}
cin >> obj;
cout << dp(seq[0], 1) << endl;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repp(i, k, n) for (int i = k; i < (int)n; i++)
#define rei(n) for (int i = 0; i < (int)n; i++)
#define rel(n) for (int l = 0; l < (int)n; l++)
#define all(s) s.begin(), s.end()
#define INT_MAX 2147483647
#define debug(x) cout << #x << ": " << x << endl;
#define PI 2 * acos(0, 0)
#define pb push_back
#define inin(x) \
int x; \
cin >> x;
#define ll long long
#define pb push_back
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
struct Calendar {
long long year;
long long month;
long long day;
long long dat[2][13];
Calendar(long long y, long long m, long long d) {
year = y;
month = m;
day = d;
dat[0][0] = dat[1][0] = 0;
dat[0][1] = dat[1][1] = 31;
dat[0][2] = dat[1][2] = 28;
dat[0][3] = dat[1][3] = 31;
dat[0][4] = dat[1][4] = 30;
dat[0][5] = dat[1][5] = 31;
dat[0][6] = dat[1][6] = 30;
dat[0][7] = dat[1][7] = 31;
dat[0][8] = dat[1][8] = 31;
dat[0][9] = dat[1][9] = 30;
dat[0][10] = dat[1][10] = 31;
dat[0][11] = dat[1][11] = 30;
dat[0][12] = dat[1][12] = 31;
dat[1][2] = 29;
}
int uruu() {
if (year % 4 == 0) {
if (year % 400 != 0 && year % 100 == 0) {
return 0;
} else {
return 1;
}
}
return 0;
}
int uruu(long long y) {
if (y % 4 == 0) {
if (y % 400 != 0 && y % 100 == 0) {
return 0;
} else {
return 1;
}
}
return 0;
}
long long pday(long long d) {
day += d;
for (;; month++) {
if (month >= 13) {
year++;
month = 1;
}
if (dat[uruu()][month] < day) {
day -= dat[uruu()][month];
} else {
break;
}
}
pmonth(0);
return d;
}
long long pmonth(long long m) {
month += m;
for (;; year++) {
if (month > 12) {
month -= 12;
} else {
break;
}
}
return m;
}
long long pyear(long long y) {
year += y;
return y;
}
long long dif(Calendar c) {
long long ans = 0;
Calendar a(year, month, day);
ans -= a.day;
ans += c.day;
a.day = 0;
c.day = 0;
for (; a.month >= 1; a.month--) {
ans -= dat[a.uruu()][a.month - 1];
}
for (; c.month >= 1; c.month--) {
ans += dat[c.uruu()][c.month - 1];
}
for (; a.year != c.year; a.year++) {
ans += 365;
if (a.uruu())
ans++;
}
return ans;
}
};
int n;
vector<unsigned long long int> seq;
unsigned long long memo[21][120];
int obj;
unsigned long long dp(int num, int now) {
unsigned long long ans = 0;
if (num > 20 || num < 0)
return 0;
if (memo[num][now] != -1)
return memo[num][now];
if (now == n && num == obj)
return 1;
if (now == n)
return 0;
ans += dp(num + seq[now], now + 1);
ans += dp(num - seq[now], now + 1);
return memo[num][now] = ans;
}
int main() {
memset(memo, -1, sizeof(memo));
cin >> n;
n--;
rep(i, n) {
unsigned long long int a;
cin >> a;
seq.pb(a);
}
cin >> obj;
cout << dp(seq[0], 1) << endl;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 87], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]]
| 1
| 1,005
|
#include <bits/stdc++.h>
#define LLI long long int
LLI n, num[110], a, memo[1000][20], ans;
using namespace std;
LLI po(int low, int sum) {
LLI a = 0, b = 0;
if (memo[low][sum] != 0)
return memo[low][sum];
if (low == n - 2) {
if (sum == num[low + 1])
return 1;
return 0;
} else {
if (sum + num[low + 1] <= 20)
a = po(low + 1, sum + num[low + 1]);
if (sum - num[low + 1] >= 0)
b = po(low + 1, sum - num[low + 1]);
}
ans = a + b;
memo[low][sum] = ans;
return ans;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
num[i] = a;
}
cout << po(0, num[0]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define LLI long long int
LLI n, num[110], a, memo[1000][30], ans;
using namespace std;
LLI po(int low, int sum) {
LLI a = 0, b = 0;
if (memo[low][sum] != 0)
return memo[low][sum];
if (low == n - 2) {
if (sum == num[low + 1])
return 1;
return 0;
} else {
if (sum + num[low + 1] <= 20)
a = po(low + 1, sum + num[low + 1]);
if (sum - num[low + 1] >= 0)
b = po(low + 1, sum - num[low + 1]);
}
ans = a + b;
memo[low][sum] = ans;
return ans;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
num[i] = a;
}
cout << po(0, num[0]) << endl;
return 0;
}
|
[["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13]]
| 1
| 235
|
#include <iostream>
#define max 100
using namespace std;
int main() {
int cal[max]; //?¨???????
int num[21][max]; // 0???21?????°???
int n; //????????\???????????????
int i = 0; //?????????????????????
int y = 0; // 20?????§??????????¢??????????
int sum = 0;
cin >> n;
while (n > i) {
cin >> cal[i];
while (y < 21) {
num[y][i] = 0;
y++;
}
i++;
y = 0;
}
i = 0;
num[cal[0]][0] = 1;
while (n - 1 > i) {
y = 0;
while (y < 21) {
if (num[y][i] >= 1) {
// cout << 5 << endl;
if ((y + cal[i + 1]) <= 20) {
sum = y + cal[i + 1];
num[sum][i + 1] = num[sum][i + 1] + num[y][i];
}
if ((y - cal[i + 1]) >= 0) {
sum = y - cal[i + 1];
num[sum][i + 1] = num[sum][i + 1] + num[y][i];
}
}
y++;
}
// cout << num[1][i] << endl;
i++;
}
cout << num[cal[n - 1]][i - 1] << endl;
}
|
#include <iostream>
#define max 100
using namespace std;
int main() {
int cal[max]; //?¨???????
long long int num[21][max]; // 0???21?????°???
int n; //????????\???????????????
int i = 0; //?????????????????????
int y = 0; // 20?????§??????????¢??????????
int sum = 0;
cin >> n;
while (n > i) {
cin >> cal[i];
while (y < 21) {
num[y][i] = 0;
y++;
}
i++;
y = 0;
}
i = 0;
num[cal[0]][0] = 1;
while (n - 1 > i) {
y = 0;
while (y < 21) {
if (num[y][i] >= 1) {
// cout << 5 << endl;
if ((y + cal[i + 1]) <= 20) {
sum = y + cal[i + 1];
num[sum][i + 1] = num[sum][i + 1] + num[y][i];
}
if ((y - cal[i + 1]) >= 0) {
sum = y - cal[i + 1];
num[sum][i + 1] = num[sum][i + 1] + num[y][i];
}
}
y++;
}
// cout << num[1][i] << endl;
i++;
}
cout << num[cal[n - 1]][i - 1] << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 292
|
#include <cmath>
#include <iostream>
#include <vector>
#define rep(a, b, c) for (int a = b; a < (c); a++)
#define repe(a, b, c) for (int a = b; a <= (c); a++)
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<long long unsigned>> dp(N, vector<long long unsigned>(21, 0));
int num;
cin >> num;
dp[0][num] = 1;
rep(i, 0, N - 1) {
cin >> num;
repe(j, 0, 20) {
if (j + num <= 20)
dp[i][j + num] += dp[i - 1][j];
if (j - num >= 0)
dp[i][j - num] += dp[i - 1][j];
}
}
cin >> num;
cout << dp[N - 2][num] << endl;
return 0;
}
|
#include <cmath>
#include <iostream>
#include <vector>
#define rep(a, b, c) for (int a = b; a < (c); a++)
#define repe(a, b, c) for (int a = b; a <= (c); a++)
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<long long unsigned>> dp(N, vector<long long unsigned>(21, 0));
int num;
cin >> num;
dp[0][num] = 1;
rep(i, 1, N) {
cin >> num;
repe(j, 0, 20) {
if (j + num <= 20)
dp[i][j + num] += dp[i - 1][j];
if (j - num >= 0)
dp[i][j - num] += dp[i - 1][j];
}
}
cin >> num;
cout << dp[N - 2][num] << endl;
return 0;
}
|
[["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 191
|
#include <deque>
#include <iostream>
#include <sstream>
#include <vector>
std::vector<std::vector<long int>> table;
void outtable(std::vector<std::vector<long int>> t) {
for (int i = 0; i < t.size(); ++i) {
for (int j = 0; j < t[i].size(); ++j) {
std::cout << t[i][j] << " ";
}
std::cout << std::endl;
}
std::cout << std::endl;
}
int calc(std::deque<int> num, int input_data_num) {
for (int i = 0; i < input_data_num - 1; ++i) {
for (int j = 0; j < 21; ++j) {
if (table[i][j] != 0) {
// std::cout << i << " " << j << std::endl;
if (j + num.front() <= 20) {
table[i + 1][j + num.front()] += table[i][j];
}
if (j - num.front() >= 0) {
table[i + 1][j - num.front()] += table[i][j];
}
// outtable(table);
}
}
num.pop_front();
}
}
int main() {
std::deque<int> num;
int input_data;
int input_data_num;
std::string str;
std::cin >> input_data_num;
std::cin.ignore();
std::getline(std::cin, str);
std::istringstream iss(str);
while (!iss.eof()) {
iss >> input_data;
num.push_back(input_data);
}
table = std::vector<std::vector<long int>>(input_data_num,
std::vector<long int>(21, 0));
++table[0][num.front()];
// outtable(table);
num.pop_front();
calc(num, input_data_num);
outtable(table);
std::cout << table[input_data_num - 1][0] << std::endl;
return 0;
}
|
#include <deque>
#include <iostream>
#include <sstream>
#include <vector>
std::vector<std::vector<long int>> table;
void outtable(std::vector<std::vector<long int>> t) {
for (int i = 0; i < t.size(); ++i) {
for (int j = 0; j < t[i].size(); ++j) {
std::cout << t[i][j] << " ";
}
std::cout << std::endl;
}
std::cout << std::endl;
}
int calc(std::deque<int> num, int input_data_num) {
for (int i = 0; i < input_data_num - 1; ++i) {
for (int j = 0; j < 21; ++j) {
if (table[i][j] != 0) {
// std::cout << i << " " << j << std::endl;
if (j + num.front() <= 20) {
table[i + 1][j + num.front()] += table[i][j];
}
if (j - num.front() >= 0) {
table[i + 1][j - num.front()] += table[i][j];
}
// outtable(table);
}
}
num.pop_front();
}
}
int main() {
std::deque<int> num;
int input_data;
int input_data_num;
std::string str;
std::cin >> input_data_num;
std::cin.ignore();
std::getline(std::cin, str);
std::istringstream iss(str);
while (!iss.eof()) {
iss >> input_data;
num.push_back(input_data);
}
table = std::vector<std::vector<long int>>(input_data_num,
std::vector<long int>(21, 0));
++table[0][num.front()];
// outtable(table);
num.pop_front();
calc(num, input_data_num);
// outtable(table);
std::cout << table[input_data_num - 1][0] << std::endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]]
| 1
| 428
|
#include <iostream>
using namespace std;
int n, a[105] = {0}, dp[105][105] = {0};
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0][a[0]] = 1;
for (int i = 1; i <= n - 2; i++) {
for (int j = 0; j <= 20; j++) {
if (j + a[i] <= 20 && j - a[i] >= 0)
dp[i][j] = dp[i - 1][j + a[i]] + dp[i - 1][j - a[i]];
else if (j + a[i] <= 20)
dp[i][j] = dp[i - 1][j + a[i]];
else
dp[i][j] = dp[i - 1][j - a[i]];
}
}
cout << dp[n - 2][a[n - 1]] << endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long n, a[105] = {0}, dp[105][105] = {0};
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0][a[0]] = 1;
for (int i = 1; i <= n - 2; i++) {
for (int j = 0; j <= 20; j++) {
if (j + a[i] <= 20 && j - a[i] >= 0)
dp[i][j] = dp[i - 1][j + a[i]] + dp[i - 1][j - a[i]];
else if (j + a[i] <= 20)
dp[i][j] = dp[i - 1][j + a[i]];
else
dp[i][j] = dp[i - 1][j - a[i]];
}
}
cout << dp[n - 2][a[n - 1]] << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]]
| 1
| 249
|
#include <iostream>
using namespace std;
int sum[100 + 10][21 + 10] = {0};
int main() {
int n;
int a;
// int suu[100 + 10];
int i, j;
cin >> n;
cin >> a;
sum[0][a] = 1;
for (i = 0; i < n - 2; i++) {
cin >> a;
for (j = 0; j <= 20; j++) {
if (sum[i][j] > 0) {
if (j + a <= 20) {
sum[i + 1][j + a] += sum[i][j];
}
if (j - a >= 0) {
sum[i + 1][j - a] += sum[i][j];
}
}
}
}
cin >> a;
cout << sum[n - 2][a] << endl;
return 0;
}
|
#include <iostream>
using namespace std;
unsigned long long int sum[100 + 10][21 + 10] = {
0}; // unsigned???+??????????????\????????????
int main() {
int n;
int a;
// int suu[100 + 10];
int i, j;
cin >> n;
cin >> a;
sum[0][a] = 1;
for (i = 0; i < n - 2; i++) {
cin >> a;
for (j = 0; j <= 20; j++) {
if (sum[i][j] > 0) {
if (j + a <= 20) {
sum[i + 1][j + a] += sum[i][j];
}
if (j - a >= 0) {
sum[i + 1][j - a] += sum[i][j];
}
}
}
}
cin >> a;
cout << sum[n - 2][a] << endl;
return 0;
}
|
[["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 87], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]]
| 1
| 190
|
#include <iostream>
int main() {
int input_num, finger_num, max_data;
finger_num = 21, max_data = 100;
std::cin >> input_num;
int data[max_data];
int fingers[max_data][finger_num];
for (int i = 0; i < input_num - 1; i++) {
std::cin >> data[i];
}
//初期化
for (int j = 0; j < finger_num; j++) {
fingers[0][j] = 0;
}
fingers[0][data[0]] = 1;
for (int i = 1; i < input_num - 1; i++) {
for (int j = 0; j < finger_num; j++) {
if (data[i] + j <= 20) {
fingers[i][data[i] + j] += fingers[i - 1][j];
}
if (j - data[i] >= 0) {
fingers[i][j - data[i]] += fingers[i - 1][j];
}
}
}
int tmp;
std::cin >> tmp;
std::cout << fingers[input_num - 2][tmp] << std::endl;
return 0;
}
|
#include <iostream>
int main() {
int input_num, finger_num, max_data;
finger_num = 21, max_data = 100;
std::cin >> input_num;
int data[max_data];
long long fingers[max_data][finger_num];
for (int i = 0; i < input_num - 1; i++) {
std::cin >> data[i];
for (int j = 0; j < finger_num; j++) {
fingers[i][j] = 0;
}
}
//初期化
fingers[0][data[0]] = 1;
for (int i = 1; i < input_num - 1; i++) {
for (int j = 0; j < finger_num; j++) {
if (data[i] + j <= 20) {
fingers[i][data[i] + j] += fingers[i - 1][j];
}
if (j - data[i] >= 0) {
fingers[i][j - data[i]] += fingers[i - 1][j];
}
}
}
int tmp;
std::cin >> tmp;
std::cout << fingers[input_num - 2][tmp] << std::endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 13], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 247
|
#include <iostream>
#include <vector>
int main() {
int n, answer, a;
std::cin >> n;
std::vector<int> number(n - 1);
std::vector<int> move(21, 0), moving(21, 0);
for (int i = 0; i < n - 1; ++i) {
std::cin >> number[i];
}
std::cin >> answer;
move[number[0]] = 1;
for (int i = 1; i < n - 1; i++) {
for (int j = 0; j < 21; j++) {
if (move[j] != 0) {
if ((a = j + number[i]) <= 20) {
moving[a] += move[j];
}
if ((a = j - number[i]) >= 0) {
moving[a] += move[j];
}
move[j] = 0;
}
}
for (int j = 0; j < 21; j++) {
move[j] = moving[j];
moving[j] = 0;
}
}
std::cout << move[answer] << std::endl;
return 0;
}
|
#include <iostream>
#include <vector>
int main() {
int n, answer, a;
std::cin >> n;
std::vector<int> number(n - 1); //足し算に使う数を入れる
std::vector<long int> move(21, 0), moving(21, 0); //０から２０までの箱
for (int i = 0; i < n - 1; ++i) {
std::cin >> number[i];
}
std::cin >> answer;
move[number[0]] = 1;
/*
０から２０までの箱を用意し、加算減算によって出た答えの箱に１票入れる。
最後、求める答えの箱に入っていた票数が何通りかを表す。
*/
for (int i = 1; i < n - 1; i++) {
for (int j = 0; j < 21; j++) {
if (move[j] != 0) {
if ((a = j + number[i]) <= 20) {
moving[a] += move[j];
}
if ((a = j - number[i]) >= 0) {
moving[a] += move[j];
}
move[j] = 0;
}
}
for (int j = 0; j < 21; j++) {
move[j] = moving[j];
moving[j] = 0;
}
}
std::cout << move[answer] << std::endl;
return 0;
}
|
[["+", 141, 344, 3, 347, 0, 77, 39, 86, 0, 96]]
| 1
| 254
|
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
int x, ans;
long int i = 0;
std::vector<std::vector<int>> num(N, std::vector<int>(21, 0));
while (N > 0 && std::cin >> x) {
if (N == 1) {
ans = x;
break;
}
if (i == 0) {
++num[i][x];
++i;
--N;
} else {
for (int j = 0; j < 21; ++j) {
if (num[i - 1][j] > 0) {
if (j + x <= 20) {
num[i][j + x] += num[i - 1][j];
}
if (j - x >= 0) {
num[i][j - x] += num[i - 1][j];
}
}
}
++i;
--N;
}
}
for (int j = 0; j < 21; ++j)
if (ans == j)
std::cout << num[i - 1][j] << std::endl;
}
|
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
int x, ans;
int i = 0;
std::vector<std::vector<long int>> num(N, std::vector<long int>(21, 0));
while (N > 0 && std::cin >> x) {
if (N == 1) {
ans = x;
break;
}
if (i == 0) {
++num[i][x];
++i;
--N;
} else {
for (int j = 0; j < 21; ++j) {
if (num[i - 1][j] > 0) {
if (j + x <= 20) {
num[i][j + x] += num[i - 1][j];
}
if (j - x >= 0) {
num[i][j - x] += num[i - 1][j];
}
}
}
++i;
--N;
}
}
for (int j = 0; j < 21; ++j)
if (ans == j)
std::cout << num[i - 1][j] << std::endl;
}
|
[["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 141, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["+", 141, 346, 3, 347, 0, 77, 39, 86, 0, 96]]
| 1
| 248
|
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;
typedef pair<int, int> PI;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#define PB push_back
ll dp[21][100];
int n;
int num[100];
main() {
cin >> n;
rep(i, n) cin >> num[i];
dp[num[0]][0] = 1;
for (int i = 1; i < n - 1; i++) {
rep(j, 20) {
int nn = j - num[i];
if (nn >= 0)
dp[j][i] += dp[nn][i - 1];
nn = j + num[i];
if (nn < 21)
dp[j][i] += dp[nn][i - 1];
}
}
cout << dp[num[n - 1]][n - 2] << endl;
}
|
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;
typedef pair<int, int> PI;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#define PB push_back
ll dp[21][100];
int n;
int num[100];
main() {
cin >> n;
rep(i, n) cin >> num[i];
dp[num[0]][0] = 1;
for (int i = 1; i < n - 1; i++) {
rep(j, 21) {
int nn = j - num[i];
if (nn >= 0)
dp[j][i] += dp[nn][i - 1];
nn = j + num[i];
if (nn < 21)
dp[j][i] += dp[nn][i - 1];
}
}
cout << dp[num[n - 1]][n - 2] << endl;
}
|
[["-", 8, 9, 0, 42, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 42, 0, 2, 3, 4, 0, 13]]
| 1
| 260
|
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long Int;
Int dp[105][25], n, ans, num[105];
int main() {
cin >> n;
for (int i = 0; i < n - 1; i++)
cin >> num[i];
cin >> ans;
dp[0][num[0]] = 1;
for (int i = 1; i < n - 1; i++) {
for (int j = 0; j < 20; j++) {
if (j - num[i] >= 0)
dp[i][j] += dp[i - 1][j - num[i]];
if (j + num[i] <= 20)
dp[i][j] += dp[i - 1][j + num[i]];
}
}
cout << dp[n - 2][ans] << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long Int;
Int dp[105][25], n, ans, num[105];
int main() {
cin >> n;
for (int i = 0; i < n - 1; i++)
cin >> num[i];
cin >> ans;
dp[0][num[0]] = 1;
for (int i = 1; i < n - 1; i++) {
for (int j = 0; j <= 20; j++) {
if (j - num[i] >= 0)
dp[i][j] += dp[i - 1][j - num[i]];
if (j + num[i] <= 20)
dp[i][j] += dp[i - 1][j + num[i]];
}
}
cout << dp[n - 2][ans] << endl;
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 200
|
#include <iostream>
#define ll long long int
using namespace std;
int n;
ll t[1000], dp[1000][1000];
ll func(int now, ll sum) {
if (dp[now][sum] != -1)
return dp[now][sum];
if (sum < 0 || sum > 20)
return 0;
if (now == n - 1) {
if (sum == t[n - 1])
return dp[now][sum] = 1;
return dp[now][sum] = 0;
}
int pre = 0;
pre += func(now + 1, sum + t[now]);
pre += func(now + 1, sum - t[now]);
return dp[now][sum] = pre;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= 1000; j++)
dp[i][j] = -1;
cin >> t[i];
}
func(1, t[0]);
cout << dp[1][t[0]] << endl;
return 0;
}
|
#include <iostream>
#define ll long long int
using namespace std;
int n;
ll t[1000], dp[1000][1000];
ll func(int now, ll sum) {
if (dp[now][sum] != -1)
return dp[now][sum];
if (sum < 0 || sum > 20)
return 0;
if (now == n - 1) {
if (sum == t[n - 1])
return dp[now][sum] = 1;
return dp[now][sum] = 0;
}
ll pre = 0;
pre += func(now + 1, sum + t[now]);
pre += func(now + 1, sum - t[now]);
return dp[now][sum] = pre;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= 1000; j++)
dp[i][j] = -1;
cin >> t[i];
}
func(1, t[0]);
cout << dp[1][t[0]] << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]]
| 1
| 247
|
#include <iostream>
int n, a[100];
int b, i, j;
unsigned long long int dp[102][22];
int main(void) {
scanf("%d", &n);
for (b = 0; b < n; b++) {
scanf("%d", &a[b]);
}
dp[1][a[0]] = 1;
for (i = 1; i < n - 1; i++) {
for (j = 0; j <= 20; j++) {
if (dp[i][j] > 0) {
int plus = j + a[i];
int minus = j - a[i];
if (plus >= 0 && plus <= 20) {
dp[i + 1][plus] += dp[i][j];
}
if (minus >= 0 && minus <= 20) {
dp[i + 1][minus] += dp[i][j];
}
}
}
}
printf("%d\n", dp[n - 1][a[n - 1]]);
return 0;
}
|
#include <iostream>
int n, a[100];
int b, i, j;
unsigned long long int dp[102][22];
int main(void) {
scanf("%d", &n);
for (b = 0; b < n; b++) {
scanf("%d", &a[b]);
}
dp[1][a[0]] = 1;
for (i = 1; i < n - 1; i++) {
for (j = 0; j <= 20; j++) {
if (dp[i][j] > 0) {
int plus = j + a[i];
int minus = j - a[i];
if (plus >= 0 && plus <= 20) {
dp[i + 1][plus] += dp[i][j];
}
if (minus >= 0 && minus <= 20) {
dp[i + 1][minus] += dp[i][j];
}
}
}
}
printf("%llu\n", dp[n - 1][a[n - 1]]);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 239
|
a[], i;
main() {
for (; ~scanf("%d", a + i++);)
;
*a = !printf("%.f\n", fmin(fmin(*a, a[1]), a[2]) + fmin(a[3], a[4]) - 50);
}
|
a[5], i;
main() {
for (; ~scanf("%d", a + i++);)
;
*a = !printf("%.f\n", fmin(fmin(*a, a[1]), a[2]) + fmin(a[3], a[4]) - 50);
}
|
[["+", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]]
| 0
| 75
|
#include <stdio.h>
int main(void) {
int p1, p2, p3, j1, j2;
int pst, jic;
scanf("%d %d %d %d %d", &p1, &p2, &p3, &j1, &j2);
pst = p1;
if (pst > p2) {
pst = p2;
} else if (pst > p3) {
pst = p3;
}
jic = (j1 > j2) ? j2 : j1;
printf("%d\n", pst + jic - 50);
return (0);
}
|
#include <stdio.h>
int main(void) {
int p1, p2, p3, j1, j2;
int pst, jic;
scanf("%d %d %d %d %d", &p1, &p2, &p3, &j1, &j2);
pst = p1;
if (pst > p2) {
pst = p2;
}
if (pst > p3) {
pst = p3;
}
jic = (j1 > j2) ? j2 : j1;
printf("%d\n", pst + jic - 50);
return (0);
}
|
[["-", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95]]
| 0
| 107
|
#include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
int main(void) {
int pa[3];
int ju[2];
rep(i, 3) cin >> pa[i];
rep(i, 2) cin >> ju[i];
sort(pa, pa + 2);
sort(ju, ju + 1);
cout << pa[0] + ju[0] - 50 << endl;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
int main(void) {
int pa[3];
int ju[2];
rep(i, 3) cin >> pa[i];
rep(i, 2) cin >> ju[i];
sort(pa, pa + 3);
sort(ju, ju + 2);
cout << pa[0] + ju[0] - 50 << endl;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 97
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reep(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) reep((i), 0, (n))
#define ALL(v) (v).begin(), (v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair
static const double PI = 6 * asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
static const int INF = 1 << 24;
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
// v.erase(unique(v.begin(),v.end()),v.end());
int main() {
int a, b;
cin >> a;
rep(i, 2) {
int t;
cin >> t;
a = min(a, t);
}
int t;
cin >> t;
b = min(b, t);
cout << a + b - 50 << endl;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reep(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) reep((i), 0, (n))
#define ALL(v) (v).begin(), (v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair
static const double PI = 6 * asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
static const int INF = 1 << 24;
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
// v.erase(unique(v.begin(),v.end()),v.end());
int main() {
int a, b;
cin >> a;
rep(i, 2) {
int t;
cin >> t;
a = min(a, t);
}
cin >> b;
int t;
cin >> t;
b = min(b, t);
cout << a + b - 50 << endl;
}
|
[["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]]
| 1
| 246
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
typedef vector<int> vint;
typedef pair<int, int> pint;
int get(int n) {
int ret = 114514;
rep(i, n) {
int a;
cin >> a;
ret = min(ret, a);
}
return ret;
}
int main() {
int x = get(3);
int y = get(2);
cout << x + y << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
typedef vector<int> vint;
typedef pair<int, int> pint;
int get(int n) {
int ret = 114514;
rep(i, n) {
int a;
cin >> a;
ret = min(ret, a);
}
return ret;
}
int main() {
int x = get(3);
int y = get(2);
cout << x + y - 50 << endl;
return 0;
}
|
[["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]]
| 1
| 106
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
//#define PI 3.141592653589
using namespace std;
int main() {
int pasta[3];
int juice[2];
for (int i = 0; i < 3; i++)
cin >> pasta[i];
for (int i = 0; i < 2; i++)
cin >> juice[i];
sort(pasta, pasta + 3);
sort(juice, juice + 3);
cout << pasta[0] + juice[0] - 50 << endl;
// for (int i=0; i<3; i++) cout << pasta[i] << endl;
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
//#define PI 3.141592653589
using namespace std;
int main() {
int pasta[3];
int juice[2];
for (int i = 0; i < 3; i++)
cin >> pasta[i];
for (int i = 0; i < 2; i++)
cin >> juice[i];
sort(pasta, pasta + 3);
sort(juice, juice + 2);
cout << pasta[0] + juice[0] - 50 << endl;
// for (int i=0; i<3; i++) cout << pasta[i] << endl;
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 111
|
#include <stdio.h>
int main() {
int x, y;
int t1 = 2000, t2 = 2000;
for (int i = 0; i < 3; i++) {
scanf("%d", &x);
if (t1 > x)
t1 = x;
}
for (int i = 0; i < 2; i++) {
scanf("%d", &y);
if (t2 > y)
t2 = y;
}
t1 = t2 + t1;
printf("%d\n", t1);
return 0;
}
|
#include <stdio.h>
int main() {
int x, y;
int t1 = 2000, t2 = 2000;
for (int i = 0; i < 3; i++) {
scanf("%d", &x);
if (t1 > x)
t1 = x;
}
for (int i = 0; i < 2; i++) {
scanf("%d", &y);
if (t2 > y)
t2 = y;
}
t1 = t2 + t1 - 50;
printf("%d\n", t1);
return 0;
}
|
[["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]]
| 1
| 113
|
#include <iostream>
using namespace std;
int main() {
int p1, p2, p3, j1, j2;
cin >> p1 >> p2 >> p3 >> j1 >> j2;
int t = 0;
t += (p1 < p2 ? (p1 < p3 ? p1 : p3) : (p2 < p3 ? p2 : p3));
t += (p1 < p2 ? p1 : p2);
t -= 50;
cout << t << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int p1, p2, p3, j1, j2;
cin >> p1 >> p2 >> p3 >> j1 >> j2;
int t = 0;
t += (p1 < p2 ? (p1 < p3 ? p1 : p3) : (p2 < p3 ? p2 : p3));
t += (j1 < j2 ? j1 : j2);
t -= 50;
cout << t << endl;
return 0;
}
|
[["-", 0, 11, 12, 23, 0, 41, 15, 16, 31, 22], ["+", 0, 11, 12, 23, 0, 41, 15, 16, 31, 22], ["-", 0, 11, 12, 23, 0, 41, 15, 16, 12, 22], ["+", 0, 11, 12, 23, 0, 41, 15, 16, 12, 22], ["-", 0, 1, 0, 11, 12, 23, 0, 41, 64, 22], ["+", 0, 1, 0, 11, 12, 23, 0, 41, 64, 22], ["-", 0, 1, 0, 11, 12, 23, 0, 41, 75, 22], ["+", 0, 1, 0, 11, 12, 23, 0, 41, 75, 22]]
| 1
| 93
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int price[5];
for (int i = 0; i < 5; i++) {
cin >> price[i];
}
sort(price, price + 3);
cout << price[0] - min(price[3], price[4]) << endl;
return (0);
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int price[5];
for (int i = 0; i < 5; i++) {
cin >> price[i];
}
sort(price, price + 3);
cout << price[0] + min(price[3], price[4]) - 50 << endl;
return (0);
}
|
[["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]]
| 1
| 79
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rev(i, a, b) for (int i = (a)-1; i >= b; i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int p = -1, g = -1;
rep(i, 0, 3) {
int a;
cin >> a;
p = min(p, a);
}
rep(i, 0, 2) {
int a;
cin >> a;
g = min(g, a);
}
cout << p + g - 50 << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rev(i, a, b) for (int i = (a)-1; i >= b; i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int p = INF, g = INF;
rep(i, 0, 3) {
int a;
cin >> a;
p = min(p, a);
}
rep(i, 0, 2) {
int a;
cin >> a;
g = min(g, a);
}
cout << p + g - 50 << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22]]
| 1
| 220
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << min(a, min(b, c)) + min(b, c) - 50 << endl;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << min(a, min(b, c)) + min(d, e) - 50 << endl;
}
|
[["-", 12, 16, 31, 16, 12, 2, 3, 4, 0, 22], ["+", 12, 16, 31, 16, 12, 2, 3, 4, 0, 22]]
| 1
| 62
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
int b = INT_MAX;
int c;
for (int d = 0; d < 3; d++) {
scanf("%d", &c);
b = min(b, c);
}
a += b;
b = INT_MAX;
for (int d = 0; d < 2; d++) {
scanf("%d", &c);
b = min(b, c);
}
printf("%d\n", a + b);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
int b = INT_MAX;
int c;
for (int d = 0; d < 3; d++) {
scanf("%d", &c);
b = min(b, c);
}
a += b;
b = INT_MAX;
for (int d = 0; d < 2; d++) {
scanf("%d", &c);
b = min(b, c);
}
printf("%d\n", a + b - 50);
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 115
|
#include <math.h>
#include <stack>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c, d, e;
scanf("%d\n%d\n%d\n%d\n%d", &a, &b, &c, &d, &e);
printf("%d\n", min(a, min(b, c)) + min(c, d) - 50);
return 0;
}
|
#include <math.h>
#include <stack>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c, d, e;
scanf("%d\n%d\n%d\n%d\n%d", &a, &b, &c, &d, &e);
printf("%d\n", min(a, min(b, c)) + min(d, e) - 50);
return 0;
}
|
[["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 22], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 21], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 21], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 22]]
| 1
| 89
|
#include <iostream>
int main() {
int p[3], j[2];
int pmin = 2000, jmin = 2000;
for (int i = 0; i < 3; i++) {
std::cin >> p[i];
if (p[i] < 2000) {
pmin = p[i];
}
}
for (int i = 0; i < 2; i++) {
std::cin >> j[i];
if (j[i] < 2000) {
jmin = j[i];
}
}
std::cout << jmin + pmin - 50 << std::endl;
return 0;
}
|
#include <iostream>
int main() {
int p[3], j[2];
int pmin = 2000, jmin = 2000;
for (int i = 0; i < 3; i++) {
std::cin >> p[i];
if (p[i] < pmin) {
pmin = p[i];
}
}
for (int i = 0; i < 2; i++) {
std::cin >> j[i];
if (j[i] < jmin) {
jmin = j[i];
}
}
std::cout << jmin + pmin - 50 << std::endl;
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]]
| 1
| 131
|
#include <stdio.h>
int main() {
int i, j, A, B, a, b;
a = 999999;
b = 999999;
for (i = 0; i < 3; i++) {
scanf("%d", &A);
if (a > A) {
a = A;
}
}
for (i = 0; i < 2; i++) {
scanf("%d", &B);
if (b > B) {
b = B;
}
A = A + B - 50;
}
printf("%d\n", A);
return 0;
}
|
#include <stdio.h>
int main() {
int i, j, A, B, a, b;
a = 999999;
b = 999999;
for (i = 0; i < 3; i++) {
scanf("%d", &A);
if (a > A) {
a = A;
}
}
for (i = 0; i < 2; i++) {
scanf("%d", &B);
if (b > B) {
b = B;
}
}
a = a + b - 50;
printf("%d\n", a);
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]]
| 1
| 124
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int p[3], j[2], i, t, a;
for (i = 0; i != 3; i++)
cin >> p[i];
for (i = 0; i != 2; i++) {
for (a = i; a != 3; a++) {
if (p[i] > p[i + 1]) {
t = p[i];
p[i] = p[a];
p[a] = t;
}
}
}
t = p[0];
cin >> j[0] >> j[1];
if (j[0] < j[1])
t += j[0];
else
t += j[1];
cout << t - 50 << endl;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int p[3], j[2], i, t, a;
for (i = 0; i != 3; i++)
cin >> p[i];
for (i = 0; i != 2; i++) {
for (a = i; a != 3; a++) {
if (p[i] > p[a]) {
t = p[i];
p[i] = p[a];
p[a] = t;
}
}
}
t = p[0];
cin >> j[0] >> j[1];
if (j[0] < j[1])
t += j[0];
else
t += j[1];
cout << t - 50 << endl;
}
|
[["-", 51, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["-", 51, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["-", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22]]
| 1
| 176
|
//
// main.cpp
#include <iostream>
using namespace std;
int main() {
int pastamin = 0;
int juicemin = 0;
int input;
for (int i = 0; i < 3; i++) {
cin >> input;
pastamin = min(input, pastamin);
}
for (int i = 0; i < 2; i++) {
cin >> input;
juicemin = min(input, juicemin);
}
cout << pastamin + juicemin - 50 << endl;
return 0;
}
|
//
// main.cpp
#include <iostream>
using namespace std;
int main() {
int pastamin = 1000000;
int juicemin = 1000000;
int input;
for (int i = 0; i < 3; i++) {
cin >> input;
pastamin = min(input, pastamin);
}
for (int i = 0; i < 2; i++) {
cin >> input;
juicemin = min(input, juicemin);
}
cout << pastamin + juicemin - 50 << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]]
| 1
| 98
|
#include <iostream>
using namespace std;
int main(void) {
int a, b, c, d, e, f, g;
cin >> c;
for (a = 0; a < 2; a++) {
cin >> b;
if (c > b) {
c = b;
}
}
cin >> d >> e;
if (d < e) {
f = d + c - 50;
cout << f << endl;
} else if (d > e) {
f = e + c - 50;
cout << f << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int a, b, c, d, e, f, g;
cin >> c;
for (a = 0; a < 2; a++) {
cin >> b;
if (c > b) {
c = b;
}
}
cin >> d >> e;
if (d <= e) {
f = d + c - 50;
cout << f << endl;
} else if (d >= e) {
f = e + c - 50;
cout << f << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 20]]
| 1
| 117
|
#include <iostream>
#include <string>
using namespace std;
int main() {
/*
int a,b,c,d,e;
cin >> a >> b >> c >> d >> e;
int x;
if(a > 0){
x = e*(b-a);
}
if(a == 0){
x = e*b + d;
}
if(a < 0){
x = -c*a + e*b + d;
}
cout << x <<endl;
*/
/*
int a,b,c,d,e,f;
cin >> a >> b >> c >> d >> e >> f;
int m,n;
int x = a + b + c + d + e + f;
if(e<f)
{
x = x - e;
if(a<b)
{
if(a<c)
{
if(a<d)
{
cout << x-a << endl;
}
else
{
cout << x-d << endl;
}
}
else
{
if(c<d)
{
cout << x-c << endl;
}
else
{
cout << x-d << endl;
}
}
}
else
{
if(b<c)
{
if(b<d)
{
cout << x-b << endl;
}
else
{
cout << x-d << endl;
}
}
else
{
if(c<d)
{
cout << x-c << endl;
}
else
{
cout << x-d << endl;
}
}
}
}
else
{
x = x - f;
if(a<b)
{
if(a<c)
{
if(a<d)
{
cout << x-a << endl;
}
else
{
cout << x-d << endl;
}
}
else
{
if(c<d)
{
cout << x-c << endl;
}
else
{
cout << x-d << endl;
}
}
}
else
{
if(b<c)
{
if(b<d)
{
cout << x-b << endl;
}
else
{
cout << x-d << endl;
}
}
else
{
if(c<d)
{
cout << x-c << endl;
}
else
{
cout << x-d << endl;
}
}
}
}
*/
/*
int n;
cin >> n;
int a;
cin >> a;
int max = a,min = a;
int i = 1;
while(i<n){
cin >> a;
if(a > max){
max = a;
}
if(a < min){
min = a;
}
i++;
}
cout << max << endl << min << endl;
*/
/*
string s;
cin >> s;
int j,o,i;
for(int i;i < s.size;i++){
}
*/
/*
int n;
cin >> n;
int A;
int X[100000];
int n=0;
for(int i=0;i<n;i++){
cin >> A;
}
*/
/*
int a,b,c,d,p;
cin >> a >> b >> c >> d >> p;
int X,Y=b;
X = a*p;
if(p>c){
Y += d*(p-c);
}
if(X > Y){
cout << Y << endl;
}
else{
cout << X << endl;
}
*/
/*
int l,a,b,c,d;
cin >> l >> a >> b >> c >> d;
int Jap = a/c;
if(a%c != 0){
Jap += 1;
}
int Math = b/d;
if(b%d != 0){
Math += 1;
}
int day = Jap;
if(Jap < Math) {
day = Math;
}
cout << l - day << endl;
*/
int pa, pb, pc, ja, jb;
cin >> pa >> pb >> pc >> ja >> jb;
if (pa > pb) {
pa = pb;
}
if (pa > pc) {
pa = pc;
}
if (ja > jb) {
ja = jb;
}
cout << pa + jb - 50 << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
/*
int a,b,c,d,e;
cin >> a >> b >> c >> d >> e;
int x;
if(a > 0){
x = e*(b-a);
}
if(a == 0){
x = e*b + d;
}
if(a < 0){
x = -c*a + e*b + d;
}
cout << x <<endl;
*/
/*
int a,b,c,d,e,f;
cin >> a >> b >> c >> d >> e >> f;
int m,n;
int x = a + b + c + d + e + f;
if(e<f)
{
x = x - e;
if(a<b)
{
if(a<c)
{
if(a<d)
{
cout << x-a << endl;
}
else
{
cout << x-d << endl;
}
}
else
{
if(c<d)
{
cout << x-c << endl;
}
else
{
cout << x-d << endl;
}
}
}
else
{
if(b<c)
{
if(b<d)
{
cout << x-b << endl;
}
else
{
cout << x-d << endl;
}
}
else
{
if(c<d)
{
cout << x-c << endl;
}
else
{
cout << x-d << endl;
}
}
}
}
else
{
x = x - f;
if(a<b)
{
if(a<c)
{
if(a<d)
{
cout << x-a << endl;
}
else
{
cout << x-d << endl;
}
}
else
{
if(c<d)
{
cout << x-c << endl;
}
else
{
cout << x-d << endl;
}
}
}
else
{
if(b<c)
{
if(b<d)
{
cout << x-b << endl;
}
else
{
cout << x-d << endl;
}
}
else
{
if(c<d)
{
cout << x-c << endl;
}
else
{
cout << x-d << endl;
}
}
}
}
*/
/*
int n;
cin >> n;
int a;
cin >> a;
int max = a,min = a;
int i = 1;
while(i<n){
cin >> a;
if(a > max){
max = a;
}
if(a < min){
min = a;
}
i++;
}
cout << max << endl << min << endl;
*/
/*
string s;
cin >> s;
int j,o,i;
for(int i;i < s.size;i++){
}
*/
/*
int n;
cin >> n;
int A;
int X[100000];
int n=0;
for(int i=0;i<n;i++){
cin >> A;
}
*/
/*
int a,b,c,d,p;
cin >> a >> b >> c >> d >> p;
int X,Y=b;
X = a*p;
if(p>c){
Y += d*(p-c);
}
if(X > Y){
cout << Y << endl;
}
else{
cout << X << endl;
}
*/
/*
int l,a,b,c,d;
cin >> l >> a >> b >> c >> d;
int Jap = a/c;
if(a%c != 0){
Jap += 1;
}
int Math = b/d;
if(b%d != 0){
Math += 1;
}
int day = Jap;
if(Jap < Math) {
day = Math;
}
cout << l - day << endl;
*/
int pa, pb, pc, ja, jb;
cin >> pa >> pb >> pc >> ja >> jb;
if (pa > pb) {
pa = pb;
}
if (pa > pc) {
pa = pc;
}
if (ja > jb) {
ja = jb;
}
cout << pa + ja - 50 << endl;
return 0;
}
|
[["-", 0, 16, 31, 16, 12, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 22]]
| 1
| 93
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, pasta, juice;
cin >> a >> b >> c >> d >> e;
pasta = a;
if (a >= b) {
pasta = b;
if (b >= c) {
pasta = c;
}
}
juice = d;
if (d >= e)
juice = e;
int sum = pasta + juice - 50;
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, pasta, juice;
cin >> a >> b >> c >> d >> e;
pasta = a;
if (a >= b)
pasta = b;
if (pasta >= c)
pasta = c;
juice = d;
if (d >= e)
juice = e;
int sum = pasta + juice - 50;
cout << sum << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 99
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int price[3];
int price_j[2];
for (int i = 0; i < 3; i++) {
cin >> price[i];
}
for (int i = 0; i < 2; i++) {
cin >> price_j[i];
}
int min, min_j;
min = min_j = 3000;
for (int i = 0; i < 3; i++) {
if (min > price[i]) {
min = price[i];
}
}
for (int i = 0; i < 2; i++) {
if (min > price_j[i]) {
min = price_j[i];
}
}
cout << min + min_j - 50 << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int price[3];
int price_j[2];
for (int i = 0; i < 3; i++) {
cin >> price[i];
}
for (int i = 0; i < 2; i++) {
cin >> price_j[i];
}
int min, min_j;
min = min_j = 3000;
for (int i = 0; i < 3; i++) {
if (min > price[i]) {
min = price[i];
}
}
for (int i = 0; i < 2; i++) {
if (min_j > price_j[i]) {
min_j = price_j[i];
}
}
cout << min + min_j - 50 << endl;
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22]]
| 1
| 164
|
#include <stdio.h>
main() {
int a, b, c, d, e;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
int m, n;
if (a < b)
if (a > c)
m = c;
else
m = a;
else if (b > c)
m = c;
else
m = b;
if (d < e)
n = d;
else
n = e;
int S;
S = m + n - 50;
printf("%d", "S\n");
}
|
#include <stdio.h>
main() {
int a, b, c, d, e;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
int m, n;
if (a < b)
if (a > c)
m = c;
else
m = a;
else if (b > c)
m = c;
else
m = b;
if (d < e)
n = d;
else
n = e;
int S;
S = m + n - 50;
printf("%d\n", S);
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 148
|
#include <iostream>
using namespace std;
int main() {
int pa, ju, most = 10000, ans;
for (int i = 0; i < 3; i++) {
cin >> pa;
if (pa < ans) {
most = pa;
}
}
ans = most;
most = 10000;
for (int i = 0; i < 2; i++) {
cin >> ju;
if (ju < most) {
most = ju;
}
}
ans += most - 50;
cout << ans << endl;
return (0);
}
|
#include <iostream>
using namespace std;
int main() {
int pa, ju, most = 10000, ans;
for (int i = 0; i < 3; i++) {
cin >> pa;
if (pa < most) {
most = pa;
}
}
ans = most;
most = 10000;
for (int i = 0; i < 2; i++) {
cin >> ju;
if (ju < most) {
most = ju;
}
}
ans += most;
ans -= 50;
cout << ans << endl;
return (0);
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 110]]
| 1
| 112
|
#include <iostream>
using namespace std;
int main() {
int p[3], j[2], t, p2, j2;
for (int i = 0; i < 3; i++)
cin >> p[i];
for (int i = 0; i < 2; i++)
cin >> j[i];
for (int i = 0; i < 3; i++) {
for (int k = 0; k < 2; k++)
if (p[k] > p[k + 1]) {
t = p[k];
p[k] = p[k + 1];
p[k + 1] = t;
}
}
p2 = p[0];
if (j[0] > j[1])
j2 = j[1];
if (j[0] < j[1])
j2 = j[0];
cout << j2 + p2 - 50 << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int p[3], j[2], t, p2, j2;
for (int i = 0; i < 3; i++)
cin >> p[i];
for (int i = 0; i < 2; i++)
cin >> j[i];
for (int i = 0; i < 3; i++) {
for (int k = 0; k < 2; k++)
if (p[k] > p[k + 1]) {
t = p[k];
p[k] = p[k + 1];
p[k + 1] = t;
}
}
p2 = p[0];
if (j[0] > j[1])
j2 = j[1];
if (j[0] <= j[1])
j2 = j[0];
cout << j2 + p2 - 50 << endl;
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]]
| 1
| 203
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << min(a, b) + min({c, d, e}) - 50 << endl;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << min({a, b, c}) + min({d, e}) - 50 << endl;
}
|
[["+", 31, 16, 31, 2, 3, 4, 0, 83, 0, 45], ["+", 31, 16, 31, 2, 3, 4, 0, 83, 0, 21], ["+", 31, 16, 31, 2, 3, 4, 0, 83, 0, 22], ["+", 31, 16, 31, 2, 3, 4, 0, 83, 0, 46], ["-", 31, 16, 12, 2, 3, 4, 0, 83, 0, 22], ["-", 31, 16, 12, 2, 3, 4, 0, 83, 0, 21]]
| 1
| 61
|
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
new Main().run();
}
@SuppressWarnings("unchecked")
private void run() throws IOException {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int m = scanner.nextInt();
List<Integer>[] books = new List[n];
for (int i = 0; i < 10; i++)
books[i] = new ArrayList<Integer>();
while (n-- > 0) {
int c = scanner.nextInt();
int g = scanner.nextInt() - 1;
books[g].add(c);
}
int[] dp = new int[m + 1];
Arrays.fill(dp, -1);
dp[0] = 0;
for (int i = 0; i < 10; i++) {
Collections.sort(books[i], Collections.reverseOrder());
for (int j = m - 1; j >= 0; j--) {
int sum = 0;
for (int k = 0; k < books[i].size() && j + k < m; k++) {
sum += books[i].get(k);
dp[j + k + 1] = Math.max(dp[j + k + 1], dp[j] + sum + (k + 1) * k);
}
}
}
System.out.println(dp[m]);
}
}
|
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
new Main().run();
}
@SuppressWarnings("unchecked")
private void run() throws IOException {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int m = scanner.nextInt();
List<Integer>[] books = new List[10];
for (int i = 0; i < 10; i++)
books[i] = new ArrayList<Integer>();
while (n-- > 0) {
int c = scanner.nextInt();
int g = scanner.nextInt() - 1;
books[g].add(c);
}
int[] dp = new int[m + 1];
Arrays.fill(dp, -1);
dp[0] = 0;
for (int i = 0; i < 10; i++) {
Collections.sort(books[i], Collections.reverseOrder());
for (int j = m - 1; j >= 0; j--) {
int sum = 0;
for (int k = 0; k < books[i].size() && j + k < m; k++) {
sum += books[i].get(k);
dp[j + k + 1] = Math.max(dp[j + k + 1], dp[j] + sum + (k + 1) * k);
}
}
}
System.out.println(dp[m]);
}
}
|
[["-", 0, 503, 49, 200, 51, 227, 497, 505, 0, 22], ["+", 0, 503, 49, 200, 51, 227, 497, 505, 0, 499]]
| 3
| 371
|
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
final int N = sc.nextInt();
final int K = sc.nextInt();
int[] g_count = new int[10];
Arrays.fill(g_count, 1);
int[][] data_tmp = new int[10][N + 1];
for (int i = 0; i < N; i++) {
final int c = sc.nextInt();
final int g = sc.nextInt() - 1;
data_tmp[g][g_count[g]++] = c;
}
int[][] data = new int[10][];
for (int i = 0; i < 10; i++) {
data[i] = new int[g_count[i]];
System.arraycopy(data_tmp[i], 0, data[i], 0, g_count[i]);
}
for (int i = 0; i < data.length; i++) {
Arrays.sort(data[i]);
for (int start = 1; start < (data[i].length + 1) / 2; start++) {
int tmp = data[i][start];
data[i][start] = data[i][data[i].length - start];
data[i][data[i].length - start] = tmp;
}
}
/*
for(int g = 0; g < 10; g++){
System.out.print(g + " :");
for(int i : data[g]){
System.out.printf(" %3d", i);
}
System.out.println();
}
System.out.println("--------------------------------------");
*/
for (int i = 0; i < data.length; i++) {
for (int j = 0; j < g_count[i]; j++) {
if (j == 0) {
continue;
}
data[i][j] += data[i][j - 1];
}
}
for (int i = 0; i < data.length; i++) {
for (int j = 0; j < g_count[i]; j++) {
data[i][j] += j * (j - 1);
}
}
/*
for(int g = 0; g < 10; g++){
System.out.print(g + " :");
for(int i : data[g]){
System.out.printf(" %3d", i);
}
System.out.println();
}
System.out.println("--------------------------------------");
*/
int[][] DP = new int[K + 1][10];
for (int g = 0; g < 10; g++) {
if (g == 0) {
final int min = Math.min(g_count[g], DP.length);
for (int k = 0; k < min; k++) {
DP[k][g] = data[g][k];
}
} else {
for (int k = 0; k < DP.length; k++) {
for (int pos = k - (g_count[g] - 1); pos <= k; pos++) {
if (pos < 0) {
continue;
}
DP[k][g] = Math.max(DP[k][g], DP[pos][g - 1] + data[g][k - pos]);
}
}
}
/*
for(int k = 0; k < DP.length; k++){
System.out.print(k + " :");
for(int i = 0; i < 10; i++){
System.out.printf(" %3d", DP[k][i]);
}
System.out.println();
}
System.out.println("------------------------------------");
*/
}
System.out.println(DP[K][10]);
}
}
|
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
final int N = sc.nextInt();
final int K = sc.nextInt();
int[] g_count = new int[10];
Arrays.fill(g_count, 1);
int[][] data_tmp = new int[10][N + 1];
for (int i = 0; i < N; i++) {
final int c = sc.nextInt();
final int g = sc.nextInt() - 1;
data_tmp[g][g_count[g]++] = c;
}
int[][] data = new int[10][];
for (int i = 0; i < 10; i++) {
data[i] = new int[g_count[i]];
System.arraycopy(data_tmp[i], 0, data[i], 0, g_count[i]);
}
for (int i = 0; i < data.length; i++) {
Arrays.sort(data[i]);
for (int start = 1; start < (data[i].length + 1) / 2; start++) {
int tmp = data[i][start];
data[i][start] = data[i][data[i].length - start];
data[i][data[i].length - start] = tmp;
}
}
/*
for(int g = 0; g < 10; g++){
System.out.print(g + " :");
for(int i : data[g]){
System.out.printf(" %3d", i);
}
System.out.println();
}
System.out.println("--------------------------------------");
*/
for (int i = 0; i < data.length; i++) {
for (int j = 0; j < g_count[i]; j++) {
if (j == 0) {
continue;
}
data[i][j] += data[i][j - 1];
}
}
for (int i = 0; i < data.length; i++) {
for (int j = 0; j < g_count[i]; j++) {
data[i][j] += j * (j - 1);
}
}
/*
for(int g = 0; g < 10; g++){
System.out.print(g + " :");
for(int i : data[g]){
System.out.printf(" %3d", i);
}
System.out.println();
}
System.out.println("--------------------------------------");
*/
int[][] DP = new int[K + 1][10];
for (int g = 0; g < 10; g++) {
if (g == 0) {
final int min = Math.min(g_count[g], DP.length);
for (int k = 0; k < min; k++) {
DP[k][g] = data[g][k];
}
} else {
for (int k = 0; k < DP.length; k++) {
for (int pos = k - (g_count[g] - 1); pos <= k; pos++) {
if (pos < 0) {
continue;
}
DP[k][g] = Math.max(DP[k][g], DP[pos][g - 1] + data[g][k - pos]);
}
}
}
/*
for(int k = 0; k < DP.length; k++){
System.out.print(k + " :");
for(int i = 0; i < 10; i++){
System.out.printf(" %3d", DP[k][i]);
}
System.out.println();
}
System.out.println("------------------------------------");
*/
}
System.out.println(DP[K][9]);
}
}
|
[["-", 0, 1, 0, 492, 3, 4, 0, 504, 71, 499], ["+", 0, 1, 0, 492, 3, 4, 0, 504, 71, 499]]
| 3
| 666
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> pr(10, vector<int>(n + 1, 0));
vector<int> ko(10, 0);
for (int i = 0; i < n; i++) {
int c, g;
cin >> c >> g;
g--;
pr[g][ko[g]] = c;
ko[g]++;
}
for (int i = 0; i < 10; i++) {
sort(pr[i].begin(), pr[i].end());
reverse(pr[i].begin(), pr[i].end());
}
vector<vector<int>> sum(10, vector<int>(n + 1, 0));
for (int i = 0; i < n; i++) {
int su = 0;
for (int j = 1; j <= ko[i]; j++) {
su += pr[i][j - 1];
sum[i][j] = su + j * (j - 1);
}
}
vector<vector<int>> dp(10, vector<int>(n + 1, 0));
dp[0] = sum[0];
for (int i = 1; i < 10; i++) {
for (int j = 0; j <= k; j++) {
for (int kk = j; kk <= k; kk++) {
dp[i][kk] = max(dp[i][kk], dp[i - 1][j] + sum[i][kk - j]);
}
}
}
cout << dp[9][k] << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> pr(10, vector<int>(n + 1, 0));
vector<int> ko(10, 0);
for (int i = 0; i < n; i++) {
int c, g;
cin >> c >> g;
g--;
pr[g][ko[g]] = c;
ko[g]++;
}
for (int i = 0; i < 10; i++) {
sort(pr[i].begin(), pr[i].end());
reverse(pr[i].begin(), pr[i].end());
}
vector<vector<int>> sum(10, vector<int>(n + 1, 0));
for (int i = 0; i < 10; i++) {
int su = 0;
for (int j = 1; j <= ko[i]; j++) {
su += pr[i][j - 1];
sum[i][j] = su + j * (j - 1);
}
}
vector<vector<int>> dp(10, vector<int>(n + 1, 0));
dp[0] = sum[0];
for (int i = 1; i < 10; i++) {
for (int j = 0; j <= k; j++) {
for (int kk = j; kk <= k; kk++) {
dp[i][kk] = max(dp[i][kk], dp[i - 1][j] + sum[i][kk - j]);
}
}
}
cout << dp[9][k] << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 401
|
/*
* 低知能マン
*/
#include <stdio.h>
#include <stdlib.h>
int dp[11][2001];
int books[10][2001];
int book_nums[10];
int sell_prices[10][2001];
int greater_int(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int a, b, c, d;
int n, k;
int max;
scanf("%d %d", &n, &k);
for (a = 0; a < n; a++) {
int c, g;
int ind;
scanf("%d %d", &c, &g);
--g;
ind = book_nums[g];
books[g][ind] = c;
++book_nums[g];
}
for (a = 0; a < 10; a++) {
qsort(books[a], book_nums[a], sizeof(int), greater_int);
sell_prices[a][1] = books[a][0];
for (b = 2; b <= book_nums[a]; b++) {
sell_prices[a][b] = sell_prices[a][b - 1] + books[a][b - 1] + (b - 1) * 2;
}
}
for (a = 0; a < 10; a++) {
for (b = 0; b < k; b++) {
int num;
num = book_nums[a];
if (num > k - a) {
num = k - a;
}
for (c = 1; c <= num; c++) {
int val = dp[a][b] + sell_prices[a][c];
int *p = &dp[a + 1][b + c];
if (*p < val)
*p = val;
}
}
}
max = 0;
for (a = 0; a <= 10; a++) {
if (max < dp[a][k]) {
max = dp[a][k];
}
}
printf("%d\n", max);
}
|
/*
* 低知能マン
*/
#include <stdio.h>
#include <stdlib.h>
int dp[11][2001];
int books[10][2001];
int book_nums[10];
int sell_prices[10][2001];
int greater_int(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int a, b, c, d;
int n, k;
int max;
scanf("%d %d", &n, &k);
for (a = 0; a < n; a++) {
int c, g;
int ind;
scanf("%d %d", &c, &g);
--g;
ind = book_nums[g];
books[g][ind] = c;
++book_nums[g];
}
for (a = 0; a < 10; a++) {
qsort(books[a], book_nums[a], sizeof(int), greater_int);
sell_prices[a][1] = books[a][0];
for (b = 2; b <= book_nums[a]; b++) {
sell_prices[a][b] = sell_prices[a][b - 1] + books[a][b - 1] + (b - 1) * 2;
}
}
for (a = 0; a < 10; a++) {
for (b = 0; b < k; b++) {
int num;
num = book_nums[a];
if (num > k - b) {
num = k - b;
}
for (c = 0; c <= num; c++) {
int val = dp[a][b] + sell_prices[a][c];
int *p = &dp[a + 1][b + c];
if (*p < val)
*p = val;
}
}
}
max = 0;
for (a = 0; a <= 10; a++) {
if (max < dp[a][k]) {
max = dp[a][k];
}
}
printf("%d\n", max);
}
|
[["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13]]
| 1
| 443
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, latte[2001] = {0};
for (int i = 1; i <= 2000; i++)
latte[i] = (i - 1) * i;
cin >> N >> K;
vector<vector<int>> books(10);
for (int i = 0; i < N; i++) {
int v, j;
cin >> v >> j;
j--;
books[j].push_back(v);
}
for (int i = 0; i < 10; i++) {
sort(books[i].begin(), books[i].end(), greater<int>());
for (int j = 0; j < books[i].size(); j++) {
if (j + 1 == books[i].size()) {
books[i][j] += j * (j + 1);
continue;
}
books[i][j + 1] += books[i][j];
books[i][j] += j * (j + 1);
}
}
int dp[11][2001];
fill(dp[0], dp[0] + 11 * 2001, -1);
for (int i = 0; i <= N; i++)
dp[i][0] = 0;
for (int i = 0; i < 10; i++) {
for (int j = 0; j <= K; j++) {
if (dp[i][j] == -1)
break;
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
for (int k = 0; k < books[i].size(); k++) {
if (j + k + 1 > K)
break;
dp[i + 1][j + k + 1] =
max(dp[i + 1][j + k + 1], dp[i][j] + books[i][k]);
}
}
}
/*
for(int i=0;i<10;i++){
if(!books[i].size())continue;
cout<<i<<":";
for(int j=0;j<books[i].size();j++)cout<<books[i][j]<<" ";
cout<<endl;
}
cout<<endl<<endl;
for(int i=0;i<=10;i++){
for(int j=0;j<=K;j++)cout<<dp[i][j]<<" ";
cout<<endl;
}
*/
cout << dp[N][K] << endl;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, latte[2001] = {0};
for (int i = 1; i <= 2000; i++)
latte[i] = (i - 1) * i;
cin >> N >> K;
vector<vector<int>> books(10);
for (int i = 0; i < N; i++) {
int v, j;
cin >> v >> j;
j--;
books[j].push_back(v);
}
for (int i = 0; i < 10; i++) {
sort(books[i].begin(), books[i].end(), greater<int>());
for (int j = 0; j < books[i].size(); j++) {
if (j + 1 == books[i].size()) {
books[i][j] += j * (j + 1);
continue;
}
books[i][j + 1] += books[i][j];
books[i][j] += j * (j + 1);
}
}
int dp[11][2001];
fill(dp[0], dp[0] + 11 * 2001, -1);
for (int i = 0; i <= 10; i++)
dp[i][0] = 0;
for (int i = 0; i < 10; i++) {
for (int j = 0; j <= K; j++) {
if (dp[i][j] == -1)
break;
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
for (int k = 0; k < books[i].size(); k++) {
if (j + k + 1 > K)
break;
dp[i + 1][j + k + 1] =
max(dp[i + 1][j + k + 1], dp[i][j] + books[i][k]);
}
}
}
/*
for(int i=0;i<10;i++){
if(!books[i].size())continue;
cout<<i<<":";
for(int j=0;j<books[i].size();j++)cout<<books[i][j]<<" ";
cout<<endl;
}
cout<<endl<<endl;
for(int i=0;i<=10;i++){
for(int j=0;j<=K;j++)cout<<dp[i][j]<<" ";
cout<<endl;
}
*/
cout << dp[10][K] << endl;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 31, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 31, 16, 12, 69, 28, 69, 341, 342, 0, 13]]
| 1
| 475
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int memo[11][2001];
int N, K, sum[11][2010];
vector<int> B[11];
int rec(int g, int k) {
if (memo[g][k] != -1)
return memo[g][k];
if (g > 10)
return 0;
int res = 0;
int s = B[g].size();
for (int i = 0; i <= s && i + k <= K; ++i) {
res = max(res, rec(g + 1, k + i) + sum[g][i]);
}
return memo[g][k] = res;
}
int main() {
int c, g;
memset(memo, -1, sizeof(memo));
cin >> N >> K;
for (int i = 0; i < N; ++i) {
scanf("%d%d", &c, &g);
B[g].push_back(c);
}
for (int i = 1; i <= 10; ++i) {
sort(B[i].begin(), B[i].end(), greater<int>());
for (int j = 1; j <= B[i].size(); ++j) {
sum[i][j] = sum[i][j - 1] + B[i][j - 1] + (j - 1) * 2;
}
}
cout << rec(1, 0) << endl;
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int memo[12][2010];
int N, K, sum[12][2010];
vector<int> B[11];
int rec(int g, int k) {
if (memo[g][k] != -1)
return memo[g][k];
if (g > 10)
return 0;
int res = 0;
int s = B[g].size();
for (int i = 0; i <= s && i + k <= K; ++i) {
res = max(res, rec(g + 1, k + i) + sum[g][i]);
}
return memo[g][k] = res;
}
int main() {
int c, g;
memset(memo, -1, sizeof(memo));
cin >> N >> K;
for (int i = 0; i < N; ++i) {
scanf("%d%d", &c, &g);
B[g].emplace_back(c);
}
for (int i = 1; i <= 10; ++i) {
sort(B[i].begin(), B[i].end(), greater<int>());
for (int j = 1; j <= B[i].size(); ++j) {
sum[i][j] = sum[i][j - 1] + B[i][j - 1] + (j - 1) * 2;
}
}
cout << rec(1, 0) << endl;
return 0;
}
|
[["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120]]
| 1
| 347
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.