4
01011
01001
01101
10111

01001

#include <cstdio>
#include <cstring>
using namespace std;
char ch[1005];
int n, len, p[1005][2];
int main() {scanf("%d", &n);for(int i = 1;i <= n;i ++) {scanf("%s", ch + 1);if(len == 0) len = strlen(ch + 1);for(int j = 1;j <= len;j ++) p[j][(ch[j] - '0') & 1] ++;}for(int i = 1;i <= len;i ++)printf("%c", p[i][0] >= p[i][1] ? '0' : '1');return 0;
}

3 1 1
22
17

4 

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 2e3 + 5;
int read() {int x = 0, f = 1; char ch = getchar();while(ch < '0'||ch > '9') f = (ch=='-')?-1:1, ch = getchar();while(ch >= '0'&&ch <= '9') x=(x<<3)+(x<<1)+ch-'0', ch = getchar();return x * f;
}
int n, r, g, a[N], f[N][N], p[N], q[N];
bool check(int x) {memset(f, 0, sizeof(f));memset(p, 0, sizeof(p));memset(q, 0, sizeof(q));for(int i = 1;i <= n;i ++) {for(int j = i;j <= n;j ++) {if(a[j] - a[i] + 1 <= x) p[i] = j;if(a[j] - a[i] + 1 <= x * 2) q[i] = j;}}p[n+1] = q[n+1] = n;for(int i = 0;i <= r;i ++) {for(int j = 0;j <= g;j ++) {if(i > 0) f[i][j] = max(f[i][j], p[f[i-1][j]+1]);if(j > 0) f[i][j] = max(f[i][j], q[f[i][j-1]+1]);}}return f[r][g] == n;
}
int main() {n = read(); r = read(); g = read();if(n <= r + g) { printf("1\n"); return 0; }for(int i = 1;i <= n;i ++) a[i] = read();sort(a + 1, a + n + 1);int l = 1, r = 1e9 + 5;while(l < r) {int mid = (l + r) >> 1;if(check(mid)) r = mid;else l = mid + 1;}printf("%d\n", l);return 0;
}

4 4
1 2 2
2 4 4
2 3 3
3 4 4

9

#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
const int N = 5e3 + 5, M = 1e6 + 5;
int read() {int x = 0, f = 1; char ch = getchar();while(ch < '0'||ch > '9') f = (ch=='-')?-1:1, ch = getchar();while(ch >= '0'&&ch <= '9') x=(x<<3)+(x<<1)+ch-'0', ch = getchar();return x * f;
}
int n, m, ans = 2e9 + 5;
struct edge { int from, nxt, to, val; } e[M];
int cnt, head[N], dis[N], b[N], dis_[N];
void add(int from, int to, int val) {e[++ cnt].to = to;e[cnt].from = from;e[cnt].val = val;e[cnt].nxt = head[from];head[from] = cnt;
}
void spfa() {queue <int> q; q.push(1); b[1] = 1;memset(dis, 0x3f, sizeof(dis)); dis[1] = 0;while(!q.empty()) {int tp = q.front(); q.pop(); b[tp] = 0;for(int i = head[tp]; i ;i = e[i].nxt) {if(dis[e[i].to] > dis[tp] + e[i].val) {dis[e[i].to] = dis[tp] + e[i].val;if(! b[e[i].to]) q.push(e[i].to), b[e[i].to] = 1;}}}
}
void spfa_() {memset(b, 0, sizeof(b));queue <int> q; q.push(n); b[n] = 1;memset(dis_, 0x3f, sizeof(dis_)); dis_[n] = 0;while(!q.empty()) {int tp = q.front(); q.pop(); b[tp] = 0;for(int i = head[tp]; i ;i = e[i].nxt) {if(dis_[e[i].to] > dis_[tp] + e[i].val) {dis_[e[i].to] = dis_[tp] + e[i].val;if(! b[e[i].to]) q.push(e[i].to), b[e[i].to] = 1;}}}
}
int main() {n = read(); m = read();for(int i = 1, x, y, z;i <= m;i ++) x = read(), y = read(), z = read(), add(x, y, z), add(y, x, z);spfa(); spfa_();for(int i = 1;i <= cnt;i ++) {int len = dis[e[i].from] + dis_[e[i].to] + e[i].val;if(len > dis[n]) ans = min(ans, len);}printf("%d\n", ans);return 0;
}