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
|
|---|---|---|---|---|
from functools import reduce
w = []; k = [];
for i in range(10):
w += [eval(input())]
for i in range(10):
k += [eval(input())]
print(reduce(lambda a,x:a+x, sorted(w)[7:]))
print(reduce(lambda a,x:a+x, sorted(k)[7:]))
|
from functools import reduce
w = []; k = [];
for i in range(10):
w += [eval(input())]
for i in range(10):
k += [eval(input())]
print(reduce(lambda a,x:a+x, sorted(w)[7:]), reduce(lambda a,x:a+x, sorted(k)[7:]))
|
[["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25], ["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 21]]
| 5
| 96
|
def func():
lst = []
for i in range(10):
lst.append(int(input()))
lst.sort()
print(sum(lst[-3:]))
func()
func()
|
def func():
lst = []
for i in range(10):
lst.append(int(input()))
lst.sort()
return sum(lst[-3:])
print(func(),func())
|
[["-", 0, 14, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 14, 8, 196, 0, 37, 0, 38], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25], ["+", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 21], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]]
| 5
| 51
|
import sys
l = [int(s) for s in sys.stdin]
w = sorted(l[0:10])[:-4:-1]
k = sorted(l[10:20])[:-4:-1]
print(w, k)
|
import sys
l = [int(s) for s in sys.stdin]
w = sum(sorted(l[0:10])[:-4:-1])
k = sum(sorted(l[10:20])[:-4:-1])
print(w, k)
|
[["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25]]
| 5
| 60
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 114514
using namespace std;
int path[101][101];
int dijkstra(int s, int g, int n) {
long long d[101];
bool used[101];
memset(d, 0x3f, sizeof(d));
memset(used, 0, sizeof(used));
d[s] = 0;
while (1) {
int v = -1;
for (int u = 1; u <= n; u++) {
if (!used[u] && (v == -1 || d[u] < d[v]))
v = u;
}
if (v == -1)
break;
used[v] = true;
for (int u = 1; u <= n; u++) {
d[u] = min(d[u], d[v] + path[v][u]);
}
}
return d[g];
}
int main() {
int n, k;
while (1) {
cin >> n >> k;
if (n == 0 && k == 0)
return 0;
memset(path, 0x3f, sizeof(path));
for (int i = 0; i < k; i++) {
int tmp;
cin >> tmp;
if (tmp) {
int c, d, e;
cin >> c >> d >> e;
path[c][d] = path[d][c] = min(e, path[c][d]);
} else {
int a, b;
long long res = 0;
cin >> a >> b;
res = dijkstra(a, b, n);
if (res > INF)
cout << "-1" << endl;
else
cout << res << endl;
}
}
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 100000000
using namespace std;
int path[101][101];
int dijkstra(int s, int g, int n) {
long long d[101];
bool used[101];
memset(d, 0x3f, sizeof(d));
memset(used, 0, sizeof(used));
d[s] = 0;
while (1) {
int v = -1;
for (int u = 1; u <= n; u++) {
if (!used[u] && (v == -1 || d[u] < d[v]))
v = u;
}
if (v == -1)
break;
used[v] = true;
for (int u = 1; u <= n; u++) {
d[u] = min(d[u], d[v] + path[v][u]);
}
}
return d[g];
}
int main() {
int n, k;
while (1) {
cin >> n >> k;
if (n == 0 && k == 0)
return 0;
memset(path, 0x3f, sizeof(path));
for (int i = 0; i < k; i++) {
int tmp;
cin >> tmp;
if (tmp) {
int c, d, e;
cin >> c >> d >> e;
path[c][d] = path[d][c] = min(e, path[c][d]); // c??¨d?????????e
} else {
int a, b;
long long res = 0;
cin >> a >> b;
res = dijkstra(a, b, n); // a??????b?????§?????????????????????
if (res > INF)
cout << "-1" << endl;
else
cout << res << endl;
}
}
}
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]]
| 1
| 411
|
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define INF 700000000
using namespace std;
vector<pair<int, int>> adj[110];
int solve(int x, int d) {
int dst[110];
bool done[110];
priority_queue<pair<int, int>> que;
for (int i = 0; i < 110; i++)
dst[i] = INF;
memset(done, false, sizeof(done));
dst[x] = 0;
que.push({0, x});
while (!que.empty()) {
int a = que.top().second;
que.pop();
if (done[a])
continue;
done[a] = true;
for (auto u : adj[a]) {
int b = u.first, w = u.second;
if (dst[a] + w < dst[b]) {
dst[b] = dst[a] + w;
que.push({-dst[b], b});
}
}
}
if (dst[d] == INF)
return -1;
else
return dst[d];
}
int main() {
while (1) {
for (int i = 0; i < 110; i++)
adj[i].clear();
int n, k, a, b, c, d;
bool ok;
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 0; i < k; i++) {
cin >> a >> b >> c;
if (a == 0) {
cout << solve(b, c) << '\n';
} else {
cin >> d;
ok = true;
for (auto itr = adj[b].begin(); itr != adj[b].end(); itr++) {
if (itr->first == c) {
itr->second = min(itr->second, d);
ok = false;
}
}
if (ok)
adj[b].push_back({c, d});
ok = true;
for (auto itr = adj[c].begin(); itr != adj[c].end(); itr++) {
if (itr->first == b) {
itr->second = min(itr->second, d);
ok = false;
}
}
if (ok)
adj[c].push_back({b, d});
}
}
return 0;
}
}
|
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define INF 700000000
using namespace std;
vector<pair<int, int>> adj[110];
int solve(int x, int d) {
int dst[110];
bool done[110];
priority_queue<pair<int, int>> que;
for (int i = 0; i < 110; i++)
dst[i] = INF;
memset(done, false, sizeof(done));
dst[x] = 0;
que.push({0, x});
while (!que.empty()) {
int a = que.top().second;
que.pop();
if (done[a])
continue;
done[a] = true;
for (auto u : adj[a]) {
int b = u.first, w = u.second;
if (dst[a] + w < dst[b]) {
dst[b] = dst[a] + w;
que.push({-dst[b], b});
}
}
}
if (dst[d] == INF)
return -1;
else
return dst[d];
}
int main() {
while (1) {
for (int i = 0; i < 110; i++)
adj[i].clear();
int n, k, a, b, c, d;
bool ok;
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 0; i < k; i++) {
cin >> a >> b >> c;
if (a == 0) {
cout << solve(b, c) << '\n';
} else {
cin >> d;
ok = true;
for (auto itr = adj[b].begin(); itr != adj[b].end(); itr++) {
if (itr->first == c) {
itr->second = min(itr->second, d);
ok = false;
}
}
if (ok)
adj[b].push_back({c, d});
ok = true;
for (auto itr = adj[c].begin(); itr != adj[c].end(); itr++) {
if (itr->first == b) {
itr->second = min(itr->second, d);
ok = false;
}
}
if (ok)
adj[c].push_back({b, d});
}
}
}
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 531
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef vector<vector<int>> VVI;
struct edge {
int to, cost;
edge(int t, int c) : to(t), cost(c) {}
};
typedef pair<int, int> P; // firstは最短距離, secondは頂点の番号
const int INF = (1e9);
void wFloyd(VVI &v) {
int len = v.size();
for (int k = 0; k < len; ++k) {
for (int i = 0; i < len; ++i) {
for (int j = 0; j < len; ++j) {
v[i][j] = min(v[i][j], v[i][k] + v[k][j]);
}
}
}
}
int dijkstra(int s, int e, int size, vector<vector<edge>> &graph) {
priority_queue<P, vector<P>, greater<P>> que;
vector<int> cost(size, INF);
cost[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (cost[v] < p.first)
continue;
for (int i = 0, ilen = graph[v].size(); i < ilen; ++i) {
edge e = graph[v][i];
if (cost[e.to] > (cost[v] + e.cost)) {
cost[e.to] = cost[v] + e.cost;
que.push(P(cost[e.to], e.to));
}
}
}
return cost[e];
}
int main(void) {
int n, k;
while (cin >> n >> k, (n | k)) {
// VVI v(n, vector<int>(n, INF));
vector<vector<edge>> v(n);
for (int i = 0; i < k; ++i) {
int x;
cin >> x;
if (x) {
int c, d, e;
cin >> c >> d >> e;
--c;
--d;
bool hit = false;
for (int j = 0, jlen = v[c].size(); j < jlen && !hit; ++j) {
if ((v[c][j].to == d) && (v[c][j].cost > e)) {
v[c][j].cost = e;
hit = true;
}
}
if (!hit)
v[c].push_back(edge(d, e));
for (int j = 0, jlen = v[d].size(); j < jlen && !hit; ++j) {
if ((v[d][j].to == c) && (v[d][j].cost > e)) {
v[d][j].cost = e;
hit = true;
}
}
if (!hit)
v[d].push_back(edge(c, e));
// v[c].push_back(edge(d, e));
// v[d].push_back(edge(c, e));
// if ((v[c][d] > e) || (v[d][c] > e))
//{
// v[c][d] = v[d][c] = e;
// wFloyd(v);
//}
} else {
int a, b;
cin >> a >> b;
--a;
--b;
int cost = dijkstra(a, b, n, v);
if (cost == INF) {
cout << -1 << endl;
} else {
cout << cost << endl;
}
// if (v[a][b] == INF)
//{
// cout << -1 << endl;
//}
// else
//{
// cout << v[a][b] << endl;
//}
}
}
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef vector<vector<int>> VVI;
struct edge {
int to, cost;
edge(int t, int c) : to(t), cost(c) {}
};
typedef pair<int, int> P; // firstは最短距離, secondは頂点の番号
const int INF = (1e9);
void wFloyd(VVI &v) {
int len = v.size();
for (int k = 0; k < len; ++k) {
for (int i = 0; i < len; ++i) {
for (int j = 0; j < len; ++j) {
v[i][j] = min(v[i][j], v[i][k] + v[k][j]);
}
}
}
}
int dijkstra(int s, int e, int size, vector<vector<edge>> &graph) {
priority_queue<P, vector<P>, greater<P>> que;
vector<int> cost(size, INF);
cost[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (cost[v] < p.first)
continue;
for (int i = 0, ilen = graph[v].size(); i < ilen; ++i) {
edge e = graph[v][i];
if (cost[e.to] > (cost[v] + e.cost)) {
cost[e.to] = cost[v] + e.cost;
que.push(P(cost[e.to], e.to));
}
}
}
return cost[e];
}
int main(void) {
int n, k;
while (cin >> n >> k, (n | k)) {
// VVI v(n, vector<int>(n, INF));
vector<vector<edge>> v(n);
for (int i = 0; i < k; ++i) {
int x;
cin >> x;
if (x) {
int c, d, e;
cin >> c >> d >> e;
--c;
--d;
bool hit = false;
for (int j = 0, jlen = v[c].size(); j < jlen && !hit; ++j) {
if ((v[c][j].to == d) && (v[c][j].cost > e)) {
v[c][j].cost = e;
hit = true;
}
}
if (!hit)
v[c].push_back(edge(d, e));
hit = false;
for (int j = 0, jlen = v[d].size(); j < jlen && !hit; ++j) {
if ((v[d][j].to == c) && (v[d][j].cost > e)) {
v[d][j].cost = e;
hit = true;
}
}
if (!hit)
v[d].push_back(edge(c, e));
// v[c].push_back(edge(d, e));
// v[d].push_back(edge(c, e));
// if ((v[c][d] > e) || (v[d][c] > e))
//{
// v[c][d] = v[d][c] = e;
// wFloyd(v);
//}
} else {
int a, b;
cin >> a >> b;
--a;
--b;
int cost = dijkstra(a, b, n, v);
if (cost == INF) {
cout << -1 << endl;
} else {
cout << cost << endl;
}
// if (v[a][b] == INF)
//{
// cout << -1 << endl;
//}
// else
//{
// cout << v[a][b] << endl;
//}
}
}
}
return 0;
}
|
[["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 147], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]]
| 1
| 755
|
#include <iostream>
using namespace std;
const int INF = 1e9 + 1;
int main(void) {
int n, k;
while (cin >> n >> k, n || k) {
int g[101][101];
for (int i = 0; i <= 100; ++i) {
for (int j = 0; j <= 100; ++j) {
g[i][j] = INF;
}
}
for (int i = 0; i < k; ++i) {
int t, a, b, c, d, e;
cin >> t;
if (t) {
cin >> c >> d >> e;
if (e < g[c][d])
g[c][d] = e;
g[d][c] = e;
} else {
int cost[101];
for (int j = 0; j <= 100; ++j)
cost[j] = INF;
cin >> a >> b;
cost[a] = 0;
bool f;
do {
f = false;
for (int from = 1; from <= n; ++from) {
for (int to = 1; to <= n; ++to) {
if (cost[from] != INF && cost[to] > cost[from] + g[from][to]) {
cost[to] = cost[from] + g[from][to];
f = true;
}
}
}
} while (f);
cout << ((cost[b] == INF) ? -1 : cost[b]) << endl;
}
}
}
return 0;
}
|
#include <iostream>
using namespace std;
const int INF = 1e9;
int main(void) {
int n, k;
while (cin >> n >> k, n || k) {
int g[101][101];
for (int i = 0; i <= 100; ++i) {
for (int j = 0; j <= 100; ++j) {
g[i][j] = INF;
}
}
for (int i = 0; i < k; ++i) {
int t, a, b, c, d, e;
cin >> t;
if (t) {
cin >> c >> d >> e;
if (e < g[c][d])
g[c][d] = g[d][c] = e;
} else {
int cost[101];
for (int j = 0; j <= 100; ++j)
cost[j] = INF;
cin >> a >> b;
cost[a] = 0;
bool f;
do {
f = false;
for (int from = 1; from <= n; ++from) {
for (int to = 1; to <= n; ++to) {
if (cost[from] != INF && cost[to] > cost[from] + g[from][to]) {
cost[to] = cost[from] + g[from][to];
f = true;
}
}
}
} while (f);
cout << ((cost[b] == INF) ? -1 : cost[b]) << endl;
}
}
}
return 0;
}
|
[["-", 0, 30, 0, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["-", 64, 9, 0, 57, 64, 1, 0, 11, 12, 22], ["-", 0, 57, 64, 9, 0, 57, 64, 1, 0, 35]]
| 1
| 336
|
def main():
from heapq import*
import sys
r=sys.stdin.readline
def g(n,E,S,G):
F=[1e7]*-~n;F[S],H=0,[(0,S)]
while H:
c,u=heappop(H)
if u==G:return c
for f,v in E[u]:
t=c+f
if t<F[v]:F[v]=t;heappush(H,(t,v))
return-1
def s(n,k):
E=[[]for _ in[0]*-~n]
for _ in[0]*k:
f=r();p=map(int,f[2:].split())
if'0'==f[0]:print(g(n,E,*p))
else:c,d,e=p;E[c]+=[(e,d)];E[d]+=[(e,c)]
for e in iter(r,'0 0\n'):s(*map(int,e.split()))
if __name__ == '__main__':
main()
|
def main():
from heapq import heappush, heappop
import sys
r=sys.stdin.readline
def g(n,E,S,G):
F=[1e7]*-~n;F[S],H=0,[(0,S)]
while H:
c,u=heappop(H)
if u==G:return c
for f,v in E[u]:
t=c+f
if t<F[v]:F[v]=t;heappush(H,(t,v))
return-1
def s(n,k):
E=[[]for _ in[0]*-~n]
for _ in[0]*k:
f=r();p=map(int,f[2:].split())
if'0'==f[0]:print(g(n,E,*p))
else:c,d,e=p;E[c]+=[(e,d)];E[d]+=[(e,c)]
for e in iter(r,'0 0\n'):s(*map(int,e.split()))
if __name__ == '__main__':
main()
|
[["-", 0, 14, 8, 196, 0, 686, 0, 690, 0, 48], ["+", 0, 14, 8, 196, 0, 686, 141, 673, 0, 22], ["+", 0, 656, 0, 14, 8, 196, 0, 686, 0, 21]]
| 5
| 266
|
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
LinkedList<Integer> gos;
void run() {
Scanner sc = new Scanner(System.in);
for (;;) {
int n = sc.nextInt();
if (n == 0)
break;
int s = sc.nextInt();
int cnt = 1;
int st = s;
gos = new LinkedList<Integer>();
for (int i = 2; i <= n; i++) {
int go = sc.nextInt();
if (i % 2 == 0) {
if (go == st)
cnt++;
else {
if (!gos.isEmpty())
cnt += gos.removeLast();
cnt++;
st = go;
}
} else {
if (go == st)
cnt++;
else {
gos.add(cnt);
st = go;
cnt = 1;
}
}
}
gos.add(cnt);
// debug(gos);
int ans = 0;
int size = gos.size();
for (int i = 0; i < size; i++) {
int val = gos.removeFirst();
if ((i + s) % 2 == 1)
ans += val;
}
System.out.println(ans);
}
}
public static void main(String[] args) { new Main().run(); }
void debug(Object... os) { System.err.println(Arrays.deepToString(os)); }
}
|
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
LinkedList<Integer> gos;
void run() {
Scanner sc = new Scanner(System.in);
for (;;) {
int n = sc.nextInt();
if (n == 0)
break;
int s = sc.nextInt();
int cnt = 1;
int st = s;
gos = new LinkedList<Integer>();
for (int i = 2; i <= n; i++) {
int go = sc.nextInt();
if (i % 2 == 0) {
if (go == st)
cnt++;
else {
if (!gos.isEmpty())
cnt += gos.removeLast();
else
s = go;
cnt++;
st = go;
}
} else {
if (go == st)
cnt++;
else {
gos.add(cnt);
st = go;
cnt = 1;
}
}
}
gos.add(cnt);
// debug(gos);
int ans = 0;
int size = gos.size();
for (int i = 0; i < size; i++) {
int val = gos.removeFirst();
if ((i + s) % 2 == 0)
ans += val;
}
System.out.println(ans);
}
}
public static void main(String[] args) { new Main().run(); }
void debug(Object... os) { System.err.println(Arrays.deepToString(os)); }
}
|
[["+", 64, 196, 0, 57, 75, 196, 0, 57, 0, 95], ["+", 75, 196, 0, 57, 75, 1, 0, 11, 31, 22], ["+", 75, 196, 0, 57, 75, 1, 0, 11, 17, 32], ["+", 75, 196, 0, 57, 75, 1, 0, 11, 12, 22], ["+", 0, 57, 75, 196, 0, 57, 75, 1, 0, 35], ["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499]]
| 3
| 332
|
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define val first
#define num second
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<P> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i == 0)
mp.push_back(P(a, 1));
else if (i % 2 == 0) {
if (mp.back().val == a)
mp[mp.size() - 1].num++;
else
mp.push_back(P(a, 1));
} else if (i % 2 == 1) {
if (mp.back().val == a)
mp[mp.size() - 1].num++;
else if (i == 1)
mp[0].val = a, mp[0].num++;
else
mp[mp.size() - 2].num += mp[mp.size() - 1].num + 1, mp.pop_back();
}
}
int ans = 0;
for (int i = 0; i < mp.size(); i++)
if (mp[i].val == 0)
ans += mp[i].num;
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define val first
#define num second
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<P> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i == 0)
mp.push_back(P(a, 1));
else if (i % 2 == 0) {
if (mp.back().val == a)
mp[mp.size() - 1].num++;
else
mp.push_back(P(a, 1));
} else if (i % 2 == 1) {
if (mp.back().val == a)
mp[mp.size() - 1].num++;
else if (mp.size() == 1)
mp[0].val = a, mp[0].num++;
else
mp[mp.size() - 2].num += mp[mp.size() - 1].num + 1, mp.pop_back();
}
}
int ans = 0;
for (int i = 0; i < mp.size(); i++)
if (mp[i].val == 0)
ans += mp[i].num;
cout << ans << endl;
}
return 0;
}
|
[["-", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 15, 339, 51, 16, 31, 2, 63, 118, 28, 22], ["+", 15, 339, 51, 16, 31, 2, 63, 118, 17, 131], ["+", 15, 339, 51, 16, 31, 2, 63, 118, 119, 120], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 24], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 25]]
| 1
| 295
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, c;
while (true) {
scanf("%d", &n);
if (n == 0) {
break;
}
vector<pair<int, int>> r; // (color, number)
for (int i = 0; i < n; i++) {
scanf("%d", &c);
if (i == 0) {
r.push_back(make_pair(c, 1));
} else if (i % 2 == 0) {
if (r.back().first == c) {
r.back().second++;
} else {
r.push_back(make_pair(c, 1));
}
} else {
if (r.back().first == c) {
r.back().second++;
} else {
int prevc = r.back().first;
int prevn = r.back().second;
r.pop_back();
if (!r.empty()) {
r.back().second += prevc + 1;
} else {
r.push_back(make_pair(prevc, prevn + 1));
}
}
}
}
int ret = 0;
for (int i = 0; i < r.size(); i++) {
if (r[i].first == 0) {
ret += r[i].second;
}
}
printf("%d\n", ret);
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, c;
while (true) {
scanf("%d", &n);
if (n == 0) {
break;
}
vector<pair<int, int>> r; // (color, number)
for (int i = 0; i < n; i++) {
scanf("%d", &c);
if (i == 0) {
r.push_back(make_pair(c, 1));
} else if (i % 2 == 0) {
if (r.back().first == c) {
r.back().second++;
} else {
r.push_back(make_pair(c, 1));
}
} else {
if (r.back().first == c) {
r.back().second++;
} else {
int prevc = r.back().first;
int prevn = r.back().second;
r.pop_back();
if (!r.empty()) {
r.back().second += prevn + 1;
} else {
r.push_back(make_pair(c, prevn + 1));
}
}
}
}
int ret = 0;
for (int i = 0; i < r.size(); i++) {
if (r[i].first == 0) {
ret += r[i].second;
}
}
printf("%d\n", ret);
}
return 0;
}
|
[["-", 64, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22]]
| 1
| 309
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
typedef pair<int, int> pii;
static const int INF = 1LL << 61;
pii go[100005];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
while (cin >> n, n) {
fill(go, go + 100005, pii(-1, -1));
int head = 0, a;
cin >> a;
go[0] = pii(a, 1);
for (int i = 2; i < n; ++i) {
cin >> a;
if (i % 2 == 1 || go[head].first == a) {
if (go[head].first != a) {
head++;
go[head] = pii(a, 1);
continue;
}
go[head].second++;
continue;
}
if (go[head - 1].first == a) {
go[head - 1].second += go[head].second + 1;
go[head] = pii(-1, -1);
head--;
} else {
go[head] = pii(a, go[head].second + 1);
}
}
int ans = 0;
for (int i = 0; i <= head; ++i) {
if (go[i].first == 0)
ans += go[i].second;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
typedef pair<int, int> pii;
static const int INF = 1LL << 61;
pii go[100005];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
while (cin >> n, n) {
fill(go, go + 100005, pii(-1, -1));
int head = 0, a;
cin >> a;
go[0] = pii(a, 1);
for (int i = 2; i <= n; ++i) {
cin >> a;
if (i % 2 == 1 || go[head].first == a) {
if (go[head].first != a) {
head++;
go[head] = pii(a, 1);
continue;
}
go[head].second++;
continue;
}
if (0 < head && go[head - 1].first == a) {
go[head - 1].second += go[head].second + 1;
go[head] = pii(-1, -1);
head--;
} else {
go[head] = pii(a, go[head].second + 1);
}
}
int ans = 0;
for (int i = 0; i <= head; ++i) {
if (go[i].first == 0)
ans += go[i].second;
}
cout << ans << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]]
| 1
| 307
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define VI vector<int>
#define VS vector<string>
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef string::const_iterator State;
typedef pair<int, int> P;
class ParseError {};
const int INF = 1e9;
char fi[101][101];
int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
double EPS = 1e-10;
int N, M;
int sx, sy;
int gx, gy;
int w, h;
int ans;
const int MAX_V = 100;
const int MAX_N = 100;
char o[3] = {'+', '-', '*'};
#define md 1000003
int bow[353][353] = {0};
double add(double a, double b) {
if (abs(a + b) < EPS * (abs(a) + abs(b)))
return 0;
return a + b;
}
/*struct P{
double x,y;
P(){}
P(double x,double y):x(x),y(y){
}
P operator + (P p){
return P(add(x,p.x),add(y,p.y));
}
P operator - (P p){
return P(add(x,-p.x),add(y,-p.y));
}
P operator *(double d){
return P(x*d,y*d);
}
double dot(P p){
return add(x*p.x,y*p.y);
}
double det(P p){
return add(x*p.y,-y*p.x);
}
};
bool cmp_x(const P& p,const P& q){
if(p.x!=q.x) return p.x<q.x;
return p.y<q.y;
}
vector<P> convex_hull(P* ps, int n){
sort(ps,ps+n,cmp_x);
int k=0;
vector<P> qs(n*2);
rep(i,n){
while(k>1&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)
k--;
qs[k++]=ps[i];
}
for(int i=n-2,t=k;i>=0;i--){
while(k>t&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)
k--;
qs[k++]=ps[i];
}
qs.resize(k-1);
return qs;
}
int n,m;
vector<double> p;
P ps[101];
*/
char c[520][520];
long long mod = 1000000007;
long long pow(ll i, ll j) {
ll tmp = 1;
while (j) {
if (j % 2)
tmp = tmp * i % mod;
i = i * i % mod;
j /= 2;
}
return tmp;
}
int expression(State &);
int term(State &);
int factor(State &);
int number(State &);
int expression(State &begin) {
int ret = term(begin);
for (;;) {
if (*begin == '+') {
begin++;
ret += term(begin);
} else if (*begin == '-') {
begin++;
ret -= term(begin);
} else
break;
}
return ret;
}
int term(State &begin) {
int ret = factor(begin);
for (;;) {
if (*begin == '*') {
begin++;
ret *= factor(begin);
} else if (*begin == '/') {
begin++;
ret /= factor(begin);
} else
break;
}
return ret;
}
int factor(State &begin) {
int ret;
if (*begin == '(') {
begin++;
ret = expression(begin);
begin++;
} else
ret = number(begin);
return ret;
}
int number(State &begin) {
int ret = 0;
while (isdigit(*begin)) {
ret *= 10;
ret += *begin - '0';
begin++;
}
return ret;
}
int henkan(string s) {
map<char, int> moji;
moji['m'] = 1000;
moji['c'] = 100;
moji['x'] = 10;
moji['i'] = 1;
int value = 0;
int temp = 1;
for (int i = 0; i < s.size(); i++) {
if (s[i] >= '2' && s[i] <= '9')
temp = temp * (s[i] - '0');
else {
value += temp * moji[s[i]];
temp = 1;
}
}
return value;
}
int main() {
int n;
while (cin >> n, n != 0) {
vector<P> p;
int a;
rep(i, n) {
cin >> a;
if (i == 0)
p.push_back(P(a, 1));
else {
int sz = p.size();
if (p[sz - 1].first == a)
p[sz - 1].second++;
else {
if (i % 2 == 0)
p.push_back(P(a, 1));
else {
if (sz - 2 < 0) {
p[sz - 1].first = a;
p[sz - 1].second++;
} else {
p[sz - 2].second = p[sz - 1].second + 1;
p.erase(p.begin() + sz - 1);
}
}
}
}
}
int ans = 0;
rep(i, p.size()) {
if (p[i].first == 0)
ans += p[i].second;
}
cout << ans << endl;
}
}
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define VI vector<int>
#define VS vector<string>
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef string::const_iterator State;
typedef pair<int, int> P;
class ParseError {};
const int INF = 1e9;
char fi[101][101];
int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
double EPS = 1e-10;
int N, M;
int sx, sy;
int gx, gy;
int w, h;
int ans;
const int MAX_V = 100;
const int MAX_N = 100;
char o[3] = {'+', '-', '*'};
#define md 1000003
int bow[353][353] = {0};
double add(double a, double b) {
if (abs(a + b) < EPS * (abs(a) + abs(b)))
return 0;
return a + b;
}
/*struct P{
double x,y;
P(){}
P(double x,double y):x(x),y(y){
}
P operator + (P p){
return P(add(x,p.x),add(y,p.y));
}
P operator - (P p){
return P(add(x,-p.x),add(y,-p.y));
}
P operator *(double d){
return P(x*d,y*d);
}
double dot(P p){
return add(x*p.x,y*p.y);
}
double det(P p){
return add(x*p.y,-y*p.x);
}
};
bool cmp_x(const P& p,const P& q){
if(p.x!=q.x) return p.x<q.x;
return p.y<q.y;
}
vector<P> convex_hull(P* ps, int n){
sort(ps,ps+n,cmp_x);
int k=0;
vector<P> qs(n*2);
rep(i,n){
while(k>1&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)
k--;
qs[k++]=ps[i];
}
for(int i=n-2,t=k;i>=0;i--){
while(k>t&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)
k--;
qs[k++]=ps[i];
}
qs.resize(k-1);
return qs;
}
int n,m;
vector<double> p;
P ps[101];
*/
char c[520][520];
long long mod = 1000000007;
long long pow(ll i, ll j) {
ll tmp = 1;
while (j) {
if (j % 2)
tmp = tmp * i % mod;
i = i * i % mod;
j /= 2;
}
return tmp;
}
int expression(State &);
int term(State &);
int factor(State &);
int number(State &);
int expression(State &begin) {
int ret = term(begin);
for (;;) {
if (*begin == '+') {
begin++;
ret += term(begin);
} else if (*begin == '-') {
begin++;
ret -= term(begin);
} else
break;
}
return ret;
}
int term(State &begin) {
int ret = factor(begin);
for (;;) {
if (*begin == '*') {
begin++;
ret *= factor(begin);
} else if (*begin == '/') {
begin++;
ret /= factor(begin);
} else
break;
}
return ret;
}
int factor(State &begin) {
int ret;
if (*begin == '(') {
begin++;
ret = expression(begin);
begin++;
} else
ret = number(begin);
return ret;
}
int number(State &begin) {
int ret = 0;
while (isdigit(*begin)) {
ret *= 10;
ret += *begin - '0';
begin++;
}
return ret;
}
int henkan(string s) {
map<char, int> moji;
moji['m'] = 1000;
moji['c'] = 100;
moji['x'] = 10;
moji['i'] = 1;
int value = 0;
int temp = 1;
for (int i = 0; i < s.size(); i++) {
if (s[i] >= '2' && s[i] <= '9')
temp = temp * (s[i] - '0');
else {
value += temp * moji[s[i]];
temp = 1;
}
}
return value;
}
int main() {
int n;
while (cin >> n, n != 0) {
vector<P> p;
int a;
rep(i, n) {
cin >> a;
if (i == 0)
p.push_back(P(a, 1));
else {
int sz = p.size();
if (p[sz - 1].first == a)
p[sz - 1].second++;
else {
if (i % 2 == 0)
p.push_back(P(a, 1));
else {
if (sz - 2 < 0) {
p[sz - 1].first = a;
p[sz - 1].second++;
} else {
p[sz - 2].second += p[sz - 1].second + 1;
p.erase(p.begin() + sz - 1);
}
}
}
}
}
int ans = 0;
rep(i, p.size()) {
if (p[i].first == 0)
ans += p[i].second;
}
cout << ans << endl;
}
}
|
[["-", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 107]]
| 1
| 983
|
#include <iostream>
using namespace std;
int main() {
int n, *in, *table, cnt = 0;
in = new int[100000];
table = new int[100000];
cin >> n;
while (n != 0) {
for (int i = 0; i < n; i++) {
cin >> in[i];
}
for (int i = 0; i < n; i++) {
table[i] = in[i];
if (i % 2 == 1) {
for (int j = i - 1; table[j] != in[i] && j >= 0; j--) {
table[j] = in[i];
}
}
}
for (int i = 0; i < n; i++) {
if (table[i] == 0) {
cnt++;
}
}
cout << cnt << endl;
cin >> n;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, *in, *table, cnt = 0;
in = new int[100000];
table = new int[100000];
cin >> n;
while (n != 0) {
for (int i = 0; i < n; i++) {
cin >> in[i];
}
for (int i = 0; i < n; i++) {
table[i] = in[i];
if (i % 2 == 1) {
for (int j = i - 1; table[j] != in[i] && j >= 0; j--) {
table[j] = in[i];
}
}
}
cnt = 0;
for (int i = 0; i < n; i++) {
if (table[i] == 0) {
cnt++;
}
}
cout << cnt << endl;
cin >> n;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 193
|
#include <cstdio>
int main(void) {
int n = 0;
scanf("%d", &n);
while (n != 0) {
int stm[100000][2] = {0};
int stp = 0;
/*int clm[100000]={0};
int clp=0;*/
int i = 0;
scanf("%d", &(stm[0][1]));
stm[0][0] = 1;
int yomi = 0;
for (i = 1; i < n; i++) {
scanf("%d", &yomi);
if (yomi == stm[stp][1]) {
stm[stp][0]++;
} else {
if (i % 2 == 0) {
// printf("%da%d%d\n",i,stp,yomi);
stp++;
stm[stp][1] = yomi;
stm[stp][0] = 1;
} else {
if (stp != 0) {
// printf("%db\n",i);
stp--;
stm[stp][0] += stm[stp + 1][0] + 1;
stm[stp + 1][0] = 0;
stm[stp + 1][1] = yomi;
} else {
// printf("%dc\n",i);
stm[stp][0]++;
stm[stp][1] = yomi;
}
}
}
}
int ans = 0;
for (i = 0; i <= stp; i++) {
if (stm[stp][1] == 0) {
ans += stm[stp][0];
}
// printf("%d%d\n",stm[stp][0],stm[stp][1]);
}
printf("%d\n", ans);
scanf("%d", &n);
}
return 0;
}
|
#include <cstdio>
int main(void) {
int n = 0;
scanf("%d", &n);
while (n != 0) {
int stm[100000][2] = {0};
int stp = 0;
/*int clm[100000]={0};
int clp=0;*/
int i = 0;
scanf("%d", &(stm[0][1]));
stm[0][0] = 1;
int yomi = 0;
for (i = 1; i < n; i++) {
scanf("%d", &yomi);
if (yomi == stm[stp][1]) {
stm[stp][0]++;
} else {
if (i % 2 == 0) {
// printf("%da%d%d\n",i,stp,yomi);
stp++;
stm[stp][1] = yomi;
stm[stp][0] = 1;
} else {
if (stp != 0) {
// printf("%db\n",i);
stp--;
stm[stp][0] += stm[stp + 1][0] + 1;
stm[stp + 1][0] = 0;
stm[stp + 1][1] = yomi;
} else {
// printf("%dc\n",i);
stm[stp][0]++;
stm[stp][1] = yomi;
}
}
}
}
int ans = 0;
for (i = 0; i <= stp; i++) {
if (stm[i][1] == 0) {
ans += stm[i][0];
}
// printf("%d%d\n",stm[i][0],stm[i][1]);
}
printf("%d\n", ans);
scanf("%d", &n);
}
return 0;
}
|
[["-", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22]]
| 1
| 324
|
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define reps(i, j, n) for (int i = j; i < n; ++i)
#define rep(i, n) reps(i, 0, n)
#define fr first
#define sc second
#define SQR(x) ((x) * (x))
#define INF (1 << 28)
typedef pair<int, int> Pt;
int main() {
int n, c;
while (cin >> n, n) {
vector<Pt> mas;
rep(i, n) {
cin >> c;
int back = mas.size() - 1;
if (i % 2 == 0) {
if (mas.empty() || c != mas[back].first) {
mas.push_back(Pt(c, 1));
} else
mas[back].second++;
} else {
if (c != mas[back].first) {
int rec = 1 + mas[back].second;
mas.pop_back();
if (mas.empty())
mas.push_back(Pt(c, rec));
else
mas[back].second += rec;
} else
mas[back].second++;
}
}
int rec = 0;
rep(i, mas.size()) if (mas[i].first == 0) rec += mas[i].second;
cout << rec << endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define reps(i, j, n) for (int i = j; i < n; ++i)
#define rep(i, n) reps(i, 0, n)
#define fr first
#define sc second
#define SQR(x) ((x) * (x))
#define INF (1 << 28)
typedef pair<int, int> Pt;
int main() {
int n, c;
while (cin >> n, n) {
vector<Pt> mas;
rep(i, n) {
cin >> c;
int back = mas.size() - 1;
if (i % 2 == 0) {
if (mas.empty() || c != mas[back].first) {
mas.push_back(Pt(c, 1));
} else
mas[back].second++;
} else {
if (c != mas[back].first) {
int rec = 1 + mas[back].second;
mas.pop_back();
back--;
if (mas.empty())
mas.push_back(Pt(c, rec));
else
mas[back].second += rec;
} else
mas[back].second++;
}
}
int rec = 0;
rep(i, mas.size()) if (mas[i].first == 0) rec += mas[i].second;
cout << rec << endl;
}
}
|
[["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 68], ["+", 0, 9, 0, 57, 64, 9, 0, 1, 0, 35]]
| 1
| 271
|
(function(input) {
var inputs = input.replace(/\r/g, '').split("\n"), str = [], s, l, tmp, count,
max;
while (true) {
max = 0;
str[0] = inputs.shift();
if (str[0] === '') {
break;
}
str[1] = inputs.shift();
if (str[0].length < str[1].length) {
s = str[0];
l = str[1];
} else {
s = str[1];
l = str[0];
}
for (var i = 0, len = s.length; i < len; i++) {
count = max + 1;
while (s[i + count] && l.indexOf(s.slice(i, i + count)) > 0) {
count++;
}
if (count > max) {
max = count - 1;
}
}
console.log(max);
}
})(require("fs").readFileSync("/dev/stdin", "utf8"));
|
(function(input) {
var inputs = input.replace(/\r/g, '').split("\n"), str = [], s, l, tmp, count,
max;
while (true) {
max = 0;
str[0] = inputs.shift();
if (str[0] === '') {
break;
}
str[1] = inputs.shift();
if (str[0].length < str[1].length) {
s = str[0];
l = str[1];
} else {
s = str[1];
l = str[0];
}
for (var i = 0, len = s.length; i < len; i++) {
count = max + 1;
while (s[i + count - 1] && l.indexOf(s.slice(i, i + count)) >= 0) {
count++;
}
if (count > max) {
max = count - 1;
}
}
console.log(max);
}
})(require("fs").readFileSync("/dev/stdin", "utf8"));
|
[["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 555], ["-", 0, 52, 15, 23, 0, 16, 12, 16, 17, 47], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 17, 20]]
| 2
| 242
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static int max(int[] a) {
int ans = 0;
for (int i = 0; i < a.length; i++) {
if (ans < a[i]) {
ans = a[i];
}
}
return ans;
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
while (true) {
String stra = br.readLine();
if (stra == null) {
break;
}
String strb = br.readLine();
int n = stra.length();
int m = strb.length();
int[][] mapp = new int[n + 1][m + 1];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (stra.charAt(i) == strb.charAt(j)) {
mapp[i + 1][j + 1] = mapp[i][j] + 1;
}
}
}
int ans = 0;
for (int i = 0; i < n + 1; i++) {
ans = Math.max(ans, max(mapp[i]));
}
System.out.println(ans);
}
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static int max(int[] a) {
int ans = 0;
for (int i = 0; i < a.length; i++) {
if (ans < a[i]) {
ans = a[i];
}
}
return ans;
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
while (true) {
String stra = br.readLine();
if (stra == null) {
break;
}
String strb = br.readLine();
int n = stra.length();
int m = strb.length();
int[][] mapp = new int[n + 1][m + 1];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (stra.charAt(i) == strb.charAt(j)) {
mapp[i + 1][j + 1] = mapp[i][j] + 1;
}
}
}
int ans = 0;
for (int i = 0; i < n + 1; i++) {
ans = Math.max(ans, max(mapp[i]));
}
System.out.println(ans);
}
}
}
|
[["-", 0, 7, 8, 196, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 12, 22]]
| 3
| 304
|
char s[4002];
u[4002], m, j, c, d;
main(n) {
for (; m = d = ~scanf("%s ", s); printf("%d\n", m))
for (n = strlen(s); d - 10; d = getchar())
for (j = n; j; m < c ? m = c : 0)
u[j--] = c = s[j] - d ? 0 : u[j] + 1;
}
|
char s[4001];
u[4001], m, j, c, d;
main(n) {
for (; m = d = ~scanf("%s ", s); printf("%d\n", m))
for (n = strlen(s); d - 10; d = getchar())
for (j = n; j--; m < c ? m = c : 0)
u[j + 1] = c = s[j] - d ? 0 : u[j] + 1;
}
|
[["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13], ["+", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13], ["+", 0, 7, 8, 7, 8, 7, 15, 27, 17, 68], ["-", 8, 1, 0, 11, 31, 69, 71, 27, 17, 68], ["+", 8, 1, 0, 11, 31, 69, 71, 16, 17, 72], ["+", 8, 1, 0, 11, 31, 69, 71, 16, 12, 13]]
| 0
| 113
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#define mem(x, y) (x *)malloc(sizeof(x) * (y))
int maximum(int x, int y) {
if (x > y)
return x;
else
return y;
}
int minimum(int x, int y) {
if (x < y)
return x;
else
return y;
}
int main() {
int len[2];
char **str = mem(char *, 2);
int max;
int i, j;
str[0] = mem(char, 4001);
str[1] = mem(char, 4001);
while (scanf("%s", str[0]) != EOF) {
max = 0;
scanf("%s", str[1]);
len[0] = strlen(str[0]);
len[1] = strlen(str[1]);
if (len[0] > len[1])
;
{
char *tmp = str[0];
str[0] = str[1];
str[1] = tmp;
len[0] ^= len[1];
len[1] ^= len[0];
len[0] ^= len[1];
}
int match = 0;
for (i = -len[0] + 1; i < len[1]; i++) {
for (j = maximum(0, i); j < minimum(len[1], i + len[0]); j += 1) {
if (str[0][j - i] == str[1][j]) {
match++;
if (match > max) {
max = match;
}
} else {
match = 0;
}
}
}
printf("%d\n", max);
}
return 0;
}
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#define mem(x, y) (x *)malloc(sizeof(x) * (y))
int maximum(int x, int y) {
if (x > y)
return x;
else
return y;
}
int minimum(int x, int y) {
if (x < y)
return x;
else
return y;
}
int main() {
int len[2];
char **str = mem(char *, 2);
int max;
int i, j;
str[0] = mem(char, 4001);
str[1] = mem(char, 4001);
while (scanf("%s", str[0]) != EOF) {
max = 0;
scanf("%s", str[1]);
len[0] = strlen(str[0]);
len[1] = strlen(str[1]);
if (len[0] > len[1])
;
{
char *tmp = str[0];
str[0] = str[1];
str[1] = tmp;
len[0] ^= len[1];
len[1] ^= len[0];
len[0] ^= len[1];
}
int match = 0;
for (i = -len[0] + 1; i < len[1]; i++) {
for (j = maximum(0, i); j < minimum(len[1], i + len[0]); j += 1) {
if (str[0][j - i] == str[1][j]) {
match++;
if (match > max) {
max = match;
}
} else {
match = 0;
}
}
match = 0;
}
printf("%d\n", max);
}
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]]
| 0
| 370
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string a, b;
int dp[4005][4005] = {0};
int main() {
while (cin >> a >> b) {
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < b.size(); j++) {
if (a[i] == b[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
} else
dp[i + 1][j + 1] = 0;
}
}
int res = 0;
for (int i = 1; i < a.size(); i++) {
for (int j = 1; j < b.size(); j++) {
res = max(res, dp[i][j]);
}
}
cout << res << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string a, b;
int dp[4005][4005] = {0};
int main() {
while (cin >> a >> b) {
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < b.size(); j++) {
if (a[i] == b[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
} else
dp[i + 1][j + 1] = 0;
}
}
int res = 0;
for (int i = 1; i <= a.size(); i++) {
for (int j = 1; j <= b.size(); j++) {
res = max(res, dp[i][j]);
}
}
cout << res << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 204
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll) INF *INF
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, a, n) for (int i = a; i < (n); i++)
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vp;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
class RollingHash {
private:
int M = 1e9 + 7;
int base = 1213;
string str;
int n;
vector<int> pow, sum;
void build() {
n = str.size();
sum = pow = vector<int>(n + 1);
sum[0] = 0;
pow[0] = 1;
for (int i = 0; i < n; i++) {
sum[i + 1] = (str[i] + sum[i] * base) % M;
pow[i + 1] = pow[i] * base % M;
}
}
public:
RollingHash() {}
RollingHash(string in) {
str = in;
build();
}
RollingHash(string in, int p, int mod) {
M = mod;
base = p;
str = in;
build();
}
int calc(int l, int r) { //[l,r)のハッシュ値を計算
int len = r - l;
int ret = sum[r] + M;
ret -= sum[l] * pow[len] % M;
return ret % M;
}
};
signed main(void) {
string s, t;
while (cin >> s) {
cin >> t;
RollingHash rs(s);
RollingHash rt(t);
int n = s.size();
int m = t.size();
int ok = 0, ng = min(n, m) + 1;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
set<int> st;
rep(i, n - mid) { st.insert(rs.calc(i, i + mid)); }
bool c = false;
rep(i, m - mid) {
if (st.count(rt.calc(i, i + mid)))
c = true;
}
if (c)
ok = mid;
else
ng = mid;
}
cout << ok << endl;
}
}
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll) INF *INF
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, a, n) for (int i = a; i < (n); i++)
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vp;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
class RollingHash {
private:
int M = 1e9 + 7;
int base = 1213;
string str;
int n;
vector<int> pow, sum;
void build() {
n = str.size();
sum = pow = vector<int>(n + 1);
sum[0] = 0;
pow[0] = 1;
for (int i = 0; i < n; i++) {
sum[i + 1] = (str[i] + sum[i] * base) % M;
pow[i + 1] = pow[i] * base % M;
}
}
public:
RollingHash() {}
RollingHash(string in) {
str = in;
build();
}
RollingHash(string in, int p, int mod) {
M = mod;
base = p;
str = in;
build();
}
int calc(int l, int r) { //[l,r)のハッシュ値を計算
int len = r - l;
int ret = sum[r] + M;
ret -= sum[l] * pow[len] % M;
return ret % M;
}
};
signed main(void) {
string s, t;
while (cin >> s) {
cin >> t;
RollingHash rs(s);
RollingHash rt(t);
int n = s.size();
int m = t.size();
int ok = 0, ng = min(n, m) + 1;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
set<int> st;
rep(i, n - mid + 1) { st.insert(rs.calc(i, i + mid)); }
bool c = false;
rep(i, m - mid + 1) {
if (st.count(rt.calc(i, i + mid)))
c = true;
}
if (c)
ok = mid;
else
ng = mid;
}
cout << ok << endl;
}
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 580
|
#include <cstring>
#include <iostream>
#include <map>
using namespace std;
map<string, int> m;
int main() {
string s, t;
while (cin >> s >> t) {
int x, a = 0, b, S = s.size(), T = t.size(), i, j;
b = min(S, T) + 1;
while (true) {
x = 0;
j = (a + b) / 2;
if (b - a == 1)
break;
for (i = 0; i < S - j; i++)
m[s.substr(i, j)]++;
for (i = 0; i < T - j; i++)
if (m[t.substr(i, j)] >= 1)
x++;
m.clear();
if (!x)
b = j;
else
a = j;
}
cout << a << endl;
}
}
|
#include <cstring>
#include <iostream>
#include <map>
using namespace std;
map<string, int> m;
int main() {
string s, t;
while (cin >> s >> t) {
int x, a = 0, b, S = s.size(), T = t.size(), i, j;
b = min(S, T) + 1;
while (true) {
x = 0;
j = (a + b) / 2;
if (b - a == 1)
break;
for (i = 0; i <= S - j; i++)
m[s.substr(i, j)]++;
for (i = 0; i <= T - j; i++)
if (m[t.substr(i, j)] >= 1)
x++;
m.clear();
if (!x)
b = j;
else
a = j;
}
cout << a << endl;
}
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 197
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int dp[2][4444];
string s, t;
int main(int argc, char *argv[]) {
while (cin >> s >> t) {
int ls = s.length();
int lt = t.length();
rep(j, lt) dp[0][j] = dp[1][j] = 0;
int res = 0;
rep(i, ls) rep(j, lt) {
if (j == 0)
dp[i & 1][0] = 0;
if (s[i] == t[j])
dp[(i + 1) & 1][j + 1] = dp[i & 1][j] + 1;
else
dp[(i + 1) & 1][j + 1] = 0;
res = max(res, dp[(i + 1) & 1][j]);
}
cout << res << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int dp[2][4444];
string s, t;
int main(int argc, char *argv[]) {
while (cin >> s >> t) {
int ls = s.length();
int lt = t.length();
rep(j, lt) dp[0][j] = dp[1][j] = 0;
int res = 0;
rep(i, ls) rep(j, lt) {
if (j == 0)
dp[i & 1][0] = 0;
if (s[i] == t[j])
dp[(i + 1) & 1][j + 1] = dp[i & 1][j] + 1;
else
dp[(i + 1) & 1][j + 1] = 0;
res = max(res, dp[(i + 1) & 1][j + 1]);
}
cout << res << endl;
}
return 0;
}
|
[["+", 3, 4, 0, 69, 341, 342, 0, 16, 17, 72], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 221
|
#include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int dp[4010][4010], maxn;
string S, T;
int main() {
while (cin >> S >> T) {
memset(dp, 0, sizeof(dp));
for (int i = 0; i < S.size(); i++) {
for (int j = 0; j < T.size(); j++) {
if (S[i] == T[j]) {
dp[i + 1][j + 1] = max(dp[i][j] + 1, dp[i + 1][j + 1]);
}
}
}
maxn = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = 0; j < T.size(); j++) {
maxn = max(maxn, dp[i][j]);
}
}
cout << maxn << endl;
}
}
|
#include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int dp[4010][4010], maxn;
string S, T;
int main() {
while (cin >> S >> T) {
memset(dp, 0, sizeof(dp));
for (int i = 0; i < S.size(); i++) {
for (int j = 0; j < T.size(); j++) {
if (S[i] == T[j]) {
dp[i + 1][j + 1] = max(dp[i][j] + 1, dp[i + 1][j + 1]);
}
}
}
maxn = 0;
for (int i = 0; i <= S.size(); i++) {
for (int j = 0; j <= T.size(); j++) {
maxn = max(maxn, dp[i][j]);
}
}
cout << maxn << endl;
}
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 212
|
#include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
string s, t;
int dp[4001][4001];
int main() {
while (cin >> s >> t) {
rep(i, s.size() + 1) { dp[i][0] = 0; }
rep(i, t.size() + 1) { dp[0][i] = 0; }
for (int i = 1; i <= s.size(); ++i) {
for (int j = 1; j <= t.size(); ++j) {
dp[i][j] = s[i - 1] == t[j - 1] ? dp[i - 1][j - 1] + 1 : 0;
}
}
int ans = 0;
rep(i, s.size()) {
ans = max(*max_element(dp[i], dp[i] + t.size() + 1), ans);
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
string s, t;
int dp[4001][4001];
int main() {
while (cin >> s >> t) {
rep(i, s.size() + 1) { dp[i][0] = 0; }
rep(i, t.size() + 1) { dp[0][i] = 0; }
for (int i = 1; i <= s.size(); ++i) {
for (int j = 1; j <= t.size(); ++j) {
dp[i][j] = s[i - 1] == t[j - 1] ? dp[i - 1][j - 1] + 1 : 0;
}
}
int ans = 0;
rep(i, s.size() + 1) {
ans = max(*max_element(dp[i], dp[i] + t.size() + 1), ans);
}
cout << ans << endl;
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 230
|
#include <algorithm>
#include <cstdio>
#include <string>
using namespace std;
string s, t;
char a[4001];
char b[4001];
int dp[4001][4001];
int main() {
while (scanf("%s%s", a, b) != EOF) {
s = a;
t = b;
for (int i = 0; i < 4001; i++)
for (int j = 0; j < 4001; j++)
dp[i][j] = 0;
int ans = 0;
for (int i = 1; i < s.size(); i++) {
for (int j = 1; j < t.size(); j++) {
if (s[i - 1] == t[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = 0;
}
ans = max(ans, dp[i][j]);
}
}
printf("%d\n", ans);
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <string>
using namespace std;
string s, t;
char a[4001];
char b[4001];
int dp[4001][4001];
int main() {
while (scanf("%s%s", a, b) != EOF) {
s = a;
t = b;
for (int i = 0; i < 4001; i++)
for (int j = 0; j < 4001; j++)
dp[i][j] = 0;
int ans = 0;
for (int i = 1; i < s.size() + 1; i++) {
for (int j = 1; j < t.size() + 1; j++) {
if (s[i - 1] == t[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = 0;
}
ans = max(ans, dp[i][j]);
}
}
printf("%d\n", ans);
}
return 0;
}
|
[["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]]
| 1
| 231
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<double, int> pdbi;
typedef pair<int, pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n); i > 0; i--)
#define rrep2(i, a, b) for (int i = (a); i > b; i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const ll INF = 1 << 30;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
#define addm(X, Y) ((X) = ((X) + (Y) % mod) % mod)
string s, t;
struct SuffixArray {
int n, k;
string text;
vector<int> sa;
vector<int> rank;
vector<int> lcp;
SuffixArray(const string &s)
: text(s), n(s.size()), sa(n + 1), rank(n + 1), lcp(n) {}
bool comp(int i, int j) {
if (rank[i] != rank[j])
return rank[i] < rank[j];
int ri = i + k <= n ? rank[i + k] : -1;
int rj = j + k <= n ? rank[j + k] : -1;
return ri < rj;
}
void construct_sa() {
for (int i = 0; i <= n; i++) {
sa[i] = i;
rank[i] = i < n ? text[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa.begin(), sa.end(),
[&](const int &i, const int &j) { return comp(i, j); });
vector<int> tmp(n + 1);
tmp[sa[0]] = 0;
for (int i = 1; i <= n; i++) {
tmp[sa[i]] = tmp[sa[i - 1]] + (comp(sa[i - 1], sa[i]) ? 1 : 0);
}
for (int i = 0; i <= n; i++) {
rank[i] = tmp[i];
}
}
}
void construct_lcp() {
int h = 0;
lcp[0] = 0;
for (int i = 0; i < n; i++) {
int j = sa[rank[i] - 1];
if (h > 0)
h--;
for (; j + h < n && i + h < n; h++) {
if (text[j + h] != text[i + h])
break;
}
lcp[rank[i] - 1] = h;
}
}
int low_bd(const string &pt) {
int l = 0, r = n + 1;
while (r - l > 1) {
int m = (r + l) / 2;
int val = text.compare(sa[m], pt.length(), pt);
if (val < 0)
l = m;
else
r = m;
}
return r;
}
int up_bd(const string &pt) {
int l = 1, r = n + 1;
while (r - l > 1) {
int m = (r + l) / 2;
int val = text.compare(sa[m], pt.length(), pt);
if (val <= 0)
l = m;
else
r = m;
}
return r;
}
bool match(const string &pt) {
int idx = low_bd(pt);
if (idx == sa.size())
return false;
return text.compare(sa[idx], pt.length(), pt) == 0 ? true : false;
}
int count(const string &pt) {
int l_idx = low_bd(pt);
if (l_idx == sa.size())
return 0;
if (text.compare(sa[l_idx], pt.length(), pt) != 0)
return 0;
int r_idx = up_bd(pt);
return r_idx - l_idx;
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (cin >> s >> t) {
int n = s.size();
int m = t.size();
string st = s + '$' + t;
SuffixArray suf(st);
suf.construct_sa();
suf.construct_lcp();
int ans = 0;
rep(i, n + m - 1) {
int mn = min(suf.sa[i], suf.sa[i + 1]);
int mx = max(suf.sa[i], suf.sa[i + 1]);
if (mn < n && n < mx)
ans = max(ans, suf.lcp[i]);
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<double, int> pdbi;
typedef pair<int, pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n); i > 0; i--)
#define rrep2(i, a, b) for (int i = (a); i > b; i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const ll INF = 1 << 30;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
#define addm(X, Y) ((X) = ((X) + (Y) % mod) % mod)
string s, t;
struct SuffixArray {
int n, k;
string text;
vector<int> sa;
vector<int> rank;
vector<int> lcp;
SuffixArray(const string &s)
: text(s), n(s.size()), sa(n + 1), rank(n + 1), lcp(n) {}
bool comp(int i, int j) {
if (rank[i] != rank[j])
return rank[i] < rank[j];
int ri = i + k <= n ? rank[i + k] : -1;
int rj = j + k <= n ? rank[j + k] : -1;
return ri < rj;
}
void construct_sa() {
for (int i = 0; i <= n; i++) {
sa[i] = i;
rank[i] = i < n ? text[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa.begin(), sa.end(),
[&](const int &i, const int &j) { return comp(i, j); });
vector<int> tmp(n + 1);
tmp[sa[0]] = 0;
for (int i = 1; i <= n; i++) {
tmp[sa[i]] = tmp[sa[i - 1]] + (comp(sa[i - 1], sa[i]) ? 1 : 0);
}
for (int i = 0; i <= n; i++) {
rank[i] = tmp[i];
}
}
}
void construct_lcp() {
int h = 0;
lcp[0] = 0;
for (int i = 0; i < n; i++) {
int j = sa[rank[i] - 1];
if (h > 0)
h--;
for (; j + h < n && i + h < n; h++) {
if (text[j + h] != text[i + h])
break;
}
lcp[rank[i] - 1] = h;
}
}
int low_bd(const string &pt) {
int l = 0, r = n + 1;
while (r - l > 1) {
int m = (r + l) / 2;
int val = text.compare(sa[m], pt.length(), pt);
if (val < 0)
l = m;
else
r = m;
}
return r;
}
int up_bd(const string &pt) {
int l = 1, r = n + 1;
while (r - l > 1) {
int m = (r + l) / 2;
int val = text.compare(sa[m], pt.length(), pt);
if (val <= 0)
l = m;
else
r = m;
}
return r;
}
bool match(const string &pt) {
int idx = low_bd(pt);
if (idx == sa.size())
return false;
return text.compare(sa[idx], pt.length(), pt) == 0 ? true : false;
}
int count(const string &pt) {
int l_idx = low_bd(pt);
if (l_idx == sa.size())
return 0;
if (text.compare(sa[l_idx], pt.length(), pt) != 0)
return 0;
int r_idx = up_bd(pt);
return r_idx - l_idx;
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (cin >> s >> t) {
int n = s.size();
int m = t.size();
string st = s + '$' + t;
SuffixArray suf(st);
suf.construct_sa();
suf.construct_lcp();
int ans = 0;
rep(i, n + m) {
int mn = min(suf.sa[i], suf.sa[i + 1]);
int mx = max(suf.sa[i], suf.sa[i + 1]);
if (mn < n && n < mx)
ans = max(ans, suf.lcp[i]);
}
cout << ans << endl;
}
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 1,221
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
string s, t;
cin >> s >> t;
// s??????
int ans = 0;
int cnt = 0;
FOR(i, 0, t.length()) {
cnt = 0;
for (int j = 0; j < s.length() && i + j < t.length(); j++) {
if (s[j] == t[i + j])
cnt++;
else {
ans = max(ans, cnt);
cnt = 0;
}
}
ans = max(ans, cnt);
}
// t??????
FOR(i, 0, s.length()) {
cnt = 0;
for (int j = 0; j < t.length() && i + j < s.length(); j++) {
if (s[i + j] == t[j])
cnt++;
else {
ans = max(ans, cnt);
cnt = 0;
}
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
string s, t;
while (cin >> s) {
cin >> t;
// s??????
int ans = 0;
int cnt = 0;
FOR(i, 0, t.length()) {
cnt = 0;
for (int j = 0; j < s.length() && i + j < t.length(); j++) {
if (s[j] == t[i + j])
cnt++;
else {
ans = max(ans, cnt);
cnt = 0;
}
}
ans = max(ans, cnt);
}
// t??????
FOR(i, 0, s.length()) {
cnt = 0;
for (int j = 0; j < t.length() && i + j < s.length(); j++) {
if (s[i + j] == t[j])
cnt++;
else {
ans = max(ans, cnt);
cnt = 0;
}
}
ans = max(ans, cnt);
}
cout << ans << endl;
}
return 0;
}
|
[["+", 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, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 275
|
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
// const int INF = 1e8;
using namespace std;
const int MAX_N = 4005;
int dp[MAX_N + 1][MAX_N + 1];
string s, t;
int solve() {
int n = s.size(), m = t.size(); //????????°?????±?????¨?????????????????????
rep(i, MAX_N) rep(j, MAX_N) dp[i][j] = 0;
rep(i, n) {
rep(j, m) {
if (s[i] == t[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
}
// jelse{
// j dp[i + 1][j + 1] = min(dp[i][j + 1], dp[i + 1][j]);
// j}
}
}
int sum = 0;
rep(i, n) {
rep(j, m) { sum = max(sum, dp[i][j]); }
}
return sum;
}
int main() {
while (cin >> s >> t) {
cout << solve() << endl;
}
}
|
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
// const int INF = 1e8;
using namespace std;
const int MAX_N = 4005;
int dp[MAX_N + 1][MAX_N + 1];
string s, t;
int solve() {
int n = s.size(), m = t.size(); //????????°?????±?????¨?????????????????????
rep(i, MAX_N) rep(j, MAX_N) dp[i][j] = 0;
rep(i, n) {
rep(j, m) {
if (s[i] == t[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
}
// jelse{
// j dp[i + 1][j + 1] = min(dp[i][j + 1], dp[i + 1][j]);
// j}
}
}
int sum = 0;
rep(i, n + 1) {
rep(j, m + 1) { sum = max(sum, dp[i][j]); }
}
return sum;
}
int main() {
while (cin >> s >> t) {
cout << solve() << endl;
}
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]]
| 1
| 226
|
#include <iostream>
using namespace std;
int solve(const string &s1, const string &s2, int sp1, int sp2) {
int tmp = 0;
int res = 0;
int len = min(s2.length() - sp2, s1.length() - sp1);
for (int i = 0; i < len; i++) {
if (s1[sp1 + i] != s2[sp2 + i]) {
res = max(res, tmp);
tmp = 0;
} else {
tmp++;
}
}
return max(tmp, res);
}
int main() {
string s1, s2;
while (getline(cin, s1) && getline(cin, s2)) {
int p1 = s1.length();
int p2 = 0;
int ans = 0;
while (p1 != 0 && p2 <= (int)s2.length()) {
if (p1 != 0)
p1--;
else
p2++;
ans = max(ans, solve(s1, s2, p1, p2));
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int solve(const string &s1, const string &s2, int sp1, int sp2) {
int tmp = 0;
int res = 0;
int len = min(s2.length() - sp2, s1.length() - sp1);
for (int i = 0; i < len; i++) {
if (s1[sp1 + i] != s2[sp2 + i]) {
res = max(res, tmp);
tmp = 0;
} else {
tmp++;
}
}
return max(tmp, res);
}
int main() {
string s1, s2;
while (getline(cin, s1) && getline(cin, s2)) {
int p1 = s1.length();
int p2 = 0;
int ans = 0;
while (p1 != 0 || p2 <= (int)s2.length()) {
if (p1 != 0)
p1--;
else
p2++;
ans = max(ans, solve(s1, s2, p1, p2));
}
cout << ans << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 106]]
| 1
| 227
|
#define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
static const double EPS = 1e-8;
short dp[4001][4001];
int main() {
string str1;
while (cin >> str1) {
memset(dp, 0, sizeof(dp));
string str2;
cin >> str2;
for (int i = 0; i < str1.size(); i++) {
for (int j = 0; j < str2.size(); j++) {
if (str1[i] == str2[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
} else {
dp[i + 1][j + 1] = 0;
}
}
}
short res = 0;
for (int i = 0; i < str1.size(); i++) {
for (int j = 0; j < str2.size(); j++) {
res = max(res, dp[i][j]);
}
}
printf("%d\n", res);
}
}
|
#define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
static const double EPS = 1e-8;
short dp[4001][4001];
int main() {
string str1;
while (cin >> str1) {
memset(dp, 0, sizeof(dp));
string str2;
cin >> str2;
for (int i = 0; i < str1.size(); i++) {
for (int j = 0; j < str2.size(); j++) {
if (str1[i] == str2[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
} else {
dp[i + 1][j + 1] = 0;
}
}
}
short res = 0;
for (int i = 0; i <= str1.size(); i++) {
for (int j = 0; j <= str2.size(); j++) {
res = max(res, dp[i][j]);
}
}
printf("%d\n", res);
}
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 268
|
#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 EQ(a, b) (abs((a) - (b)) < EPS)
int ans = 0;
int main() {
string s1, s2;
while (cin >> s1 >> s2) {
ans = 0;
for (int i = 0; i < s1.size(); i++) {
int cnt = 0;
for (int j = 0; j < min(s1.size() - i, s2.size()); j++) {
if (s2[j] == s1[j + i]) {
cnt++;
ans = max(ans, cnt);
} else {
cnt = 0;
}
}
}
for (int i = 0; i < s2.size(); i++) {
int cnt;
for (int j = 0; j < min(s2.size() - i, s1.size()); j++) {
if (s1[j] == s2[j + i]) {
cnt++;
ans = max(ans, cnt);
} else {
cnt = 0;
}
}
}
cout << ans << endl;
s1.clear();
s2.clear();
}
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 EQ(a, b) (abs((a) - (b)) < EPS)
int ans = 0;
int main() {
string s1, s2;
while (cin >> s1 >> s2) {
ans = 0;
for (int i = 0; i < s1.size(); i++) {
int cnt = 0;
for (int j = 0; j < min(s1.size() - i, s2.size()); j++) {
if (s2[j] == s1[j + i]) {
cnt++;
ans = max(ans, cnt);
} else {
cnt = 0;
}
}
}
for (int i = 0; i < s2.size(); i++) {
int cnt = 0;
for (int j = 0; j < min(s2.size() - i, s1.size()); j++) {
if (s1[j] == s2[j + i]) {
cnt++;
ans = max(ans, cnt);
} else {
cnt = 0;
}
}
}
cout << ans << endl;
s1.clear();
s2.clear();
}
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13]]
| 1
| 328
|
#include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int dp[4001][4001];
int main() {
string a, b;
while (cin >> a >> b) {
memset(dp, 0, sizeof(dp));
int mx = 0;
for (int i = 0; i < a.size() - 1; i++) {
for (int j = 0; j < b.size() - 1; j++) {
if (a[i] == b[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
if (mx < dp[i + 1][j + 1])
mx = max(mx, dp[i + 1][j + 1]);
} else {
dp[i + 1][j + 1] = 0;
}
}
}
cout << mx << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int dp[4001][4001];
int main() {
string a, b;
while (cin >> a >> b) {
memset(dp, 0, sizeof(dp));
int mx = 0;
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < b.size(); j++) {
if (a[i] == b[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
if (mx < dp[i + 1][j + 1])
mx = max(mx, dp[i + 1][j + 1]);
} else {
dp[i + 1][j + 1] = 0;
}
}
}
cout << mx << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]]
| 1
| 198
|
#include <algorithm>
#include <iostream>
#include <string>
#define MAX 4000
using namespace std;
int dp[MAX + 2][MAX + 2];
int main(void) {
string s, t;
while (getline(cin, s)) {
getline(cin, t);
fill(dp[0], dp[MAX + 1] + MAX + 2, 0);
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < t.size(); j++) {
if (s[i] == t[j])
dp[i + 1][j + 1] = dp[i][j] + 1;
else
dp[i + 1][j + 1] = 0;
}
}
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < t.size(); j++) {
ans = max(dp[i][j], ans);
}
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#define MAX 4000
using namespace std;
int dp[MAX + 2][MAX + 2];
int main(void) {
string s, t;
while (getline(cin, s)) {
getline(cin, t);
fill(dp[0], dp[MAX + 1] + MAX + 2, 0);
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < t.size(); j++) {
if (s[i] == t[j])
dp[i + 1][j + 1] = dp[i][j] + 1;
else
dp[i + 1][j + 1] = 0;
}
}
int ans = 0;
for (int i = 0; i <= s.size() + 1; i++) {
for (int j = 0; j <= t.size() + 1; j++) {
ans = max(dp[i][j], ans);
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 235
|
#include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long int lli;
using namespace std;
/*
int main(){
int n,k;
while(cin>>n>>k&&n!=0&&k!=0){
vector<int> card(n+1);
vector<int> flag(n+1);
flag[0]=-1;
card[0]=-1;
for(int i=0;i<k; ++i){
int tmp;
cin >> tmp;
card[tmp]=tmp;
flag[tmp]=1;
}
int ans=0;
if(flag[0]!=0){
int cnt=0;
int s;
int n;
for(int i=1;i<=n; ++i){
if()
}
}
}
return 0;
}*/
int main() {
string A, B;
while (cin >> A >> B) {
int ans = 0;
for (int i = 0; i < A.size(); ++i) {
string A_dash = A.substr(i);
vector<int> flag(A_dash.size() > B.size() ? B.size() : A_dash.size());
for (int j = 0; j < flag.size(); ++j) {
if (A_dash[j] == B[j])
flag[j] = 1;
}
int cnt = 0;
for (int j = 0; j < flag.size(); ++j) {
if (flag[j] == 1) {
++cnt;
ans = max(ans, cnt);
} else if (flag[j] == 0)
cnt = 0;
}
}
for (int i = 0; i < B.size(); ++i) {
string B_dash = B.substr(i);
vector<int> flag(B_dash.size() > A.size() ? A.size() : B_dash.size());
for (int j = 0; j < flag.size(); ++j) {
if (B_dash[j] == A[i])
flag[j] = 1;
}
int cnt = 0;
for (int j = 0; j < flag.size(); ++j) {
if (flag[j] == 1) {
++cnt;
ans = max(ans, cnt);
} else if (flag[j] == 0)
cnt = 0;
}
}
cout << ans << "\n";
}
return 0;
}
/*
int main(){
string A;
while(cin>>A){
int ans=0;
int cnt=0;
int tmp;
for(int j=0; j<A.size();++j){
//cout << cnt << "\n";
if(A[j]=='1') {
++cnt;
ans=max(ans,cnt);
}else if(A[j]=='0') cnt=0;
tmp=A[j];
}
cout << ans << "\n";
}
return 0;
}*/
|
#include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long int lli;
using namespace std;
/*
int main(){
int n,k;
while(cin>>n>>k&&n!=0&&k!=0){
vector<int> card(n+1);
vector<int> flag(n+1);
flag[0]=-1;
card[0]=-1;
for(int i=0;i<k; ++i){
int tmp;
cin >> tmp;
card[tmp]=tmp;
flag[tmp]=1;
}
int ans=0;
if(flag[0]!=0){
int cnt=0;
int s;
int n;
for(int i=1;i<=n; ++i){
if()
}
}
}
return 0;
}*/
int main() {
string A, B;
while (cin >> A >> B) {
int ans = 0;
for (int i = 0; i < A.size(); ++i) {
string A_dash = A.substr(i);
vector<int> flag(A_dash.size() > B.size() ? B.size() : A_dash.size());
for (int j = 0; j < flag.size(); ++j) {
if (A_dash[j] == B[j])
flag[j] = 1;
}
int cnt = 0;
for (int j = 0; j < flag.size(); ++j) {
if (flag[j] == 1) {
++cnt;
ans = max(ans, cnt);
} else if (flag[j] == 0)
cnt = 0;
}
}
for (int i = 0; i < B.size(); ++i) {
string B_dash = B.substr(i);
vector<int> flag(B_dash.size() > A.size() ? A.size() : B_dash.size());
for (int j = 0; j < flag.size(); ++j) {
if (B_dash[j] == A[j])
flag[j] = 1;
}
int cnt = 0;
for (int j = 0; j < flag.size(); ++j) {
if (flag[j] == 1) {
++cnt;
ans = max(ans, cnt);
} else if (flag[j] == 0)
cnt = 0;
}
}
cout << ans << "\n";
}
return 0;
}
/*
int main(){
string A;
while(cin>>A){
int ans=0;
int cnt=0;
int tmp;
for(int j=0; j<A.size();++j){
//cout << cnt << "\n";
if(A[j]=='1') {
++cnt;
ans=max(ans,cnt);
}else if(A[j]=='0') cnt=0;
tmp=A[j];
}
cout << ans << "\n";
}
return 0;
}*/
|
[["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22]]
| 1
| 393
|
#include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int dp[4001][4001];
int main() {
string a, b;
while (cin >> a >> b) {
int ans = 0;
for (int i = 0; i < a.length(); i++) {
for (int j = 0; j < b.length(); j++) {
if (a[i + 1] == b[j + 1])
ans = max(dp[i + 1][j + 1] = dp[i][j] + 1, ans);
else
dp[i + 1][j + 1] = 0;
}
}
cout << ans << endl;
}
}
|
#include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int dp[4001][4001];
int main() {
string a, b;
while (cin >> a >> b) {
int ans = 0;
for (int i = 0; i < a.length(); i++) {
for (int j = 0; j < b.length(); j++) {
if (a[i] == b[j])
ans = max(dp[i + 1][j + 1] = dp[i][j] + 1, ans);
else
dp[i + 1][j + 1] = 0;
}
}
cout << ans << endl;
}
}
|
[["-", 51, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["-", 51, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["-", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 153
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define vi vector<int>
#define VS vector<string>
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
using namespace std;
int main() {
string n, m;
while (cin >> n >> m) {
int ans = 0;
if (n.size() > m.size())
swap(n, m);
for (int i = 0; i < n.size(); i++) {
for (int j = i + 1; j < n.size(); j++) {
if (j - i <= ans)
continue;
string s = n.substr(i, j - i);
if (m.find(s) != string::npos) {
ans = max(ans, (int)s.size());
}
}
}
cout << ans << endl;
}
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define vi vector<int>
#define VS vector<string>
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
using namespace std;
int main() {
string n, m;
while (cin >> n >> m) {
int ans = 0;
if (n.size() > m.size())
swap(n, m);
for (int i = 0; i < n.size(); i++) {
for (int j = i + 1; j <= n.size(); j++) {
if (j - i <= ans)
continue;
string s = n.substr(i, j - i);
if (m.find(s) != string::npos) {
ans = max(ans, (int)s.size());
} else
j = 40000;
}
}
cout << ans << endl;
}
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 75, 76, 0, 1, 0, 35]]
| 1
| 219
|
loop do
s, t = gets.chomp, gets.chomp rescue break
s, t = t, s if s.length > t.length
max_l = (s.chars & t.chars).map do |a|
[s.count(a), t.count(a)].min
end.inject(:+).to_i
answer = 0
0.upto(t.length).each do |i|
break if t.length - i <= answer
max = [max_l+1, t.length - i + 1].min
(answer + 1).upto(max) do |j|
if s.include?(t[i...i+j])
answer = j
else
break
end
end
end
puts answer
end
|
loop do
s, t = gets.chomp, gets.chomp rescue break
s, t = t, s if s.length > t.length
max_l = (s.chars & t.chars).map do |a|
[s.count(a), t.count(a)].min
end.inject(:+).to_i
answer = 0
0.upto(t.length).each do |i|
break if t.length - i <= answer
max = [max_l+1, t.length - i + 1].min - 1
(answer + 1).upto(max) do |j|
if s.include?(t[i...i+j])
answer = j
else
break
end
end
end
puts answer
end
|
[["+", 196, 737, 8, 736, 0, 662, 12, 738, 17, 33], ["+", 196, 737, 8, 736, 0, 662, 12, 738, 12, 612]]
| 4
| 154
|
while True:
try:
s,t = input(),input()
if len(s) < len(t): s,t = t,s
ans = 0
for sp in range(len(t)):
if len(t) - sp <= ans:
break
for L in range(ans,len(t)-sp):
if t[sp:sp+L] in s:
ans = L
else:
break
print(ans)
except:
break
|
while True:
try:
s,t = input(),input()
if len(s) < len(t): s,t = t,s
ans = 0
for sp in range(len(t)):
if len(t) - sp <= ans:
break
for L in range(ans+1,len(t)-sp+1):
if t[sp:sp+L] in s:
ans = L
else:
break
print(ans)
except:
break
|
[["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]]
| 5
| 99
|
#include <cstdio>
int n;
int ans;
int a[1010];
void solve() {
ans = n;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
int s = i, e = i, cnt = 1, tmp = n, color = j;
if (a[i] == j)
continue;
while (true) {
while (true) {
if (s - 1 >= 0 && a[s - 1] == color) {
cnt++;
s--;
} else
break;
}
while (true) {
if (e + 1 >= 0 && a[e + 1] == color) {
cnt++;
e++;
} else
break;
}
if (cnt >= 4) {
tmp -= cnt;
if (tmp <= 3)
break;
if (s - 1 >= 0)
color = a[s - 1];
else if (e + 1 < n)
color = a[s - 1];
cnt = 0;
} else
break;
}
if (ans > tmp)
ans = tmp;
}
}
printf("%d\n", ans);
}
int main() {
while (scanf("%d", &n), n)
solve();
}
|
#include <cstdio>
int n;
int ans;
int a[10010];
void solve() {
ans = n;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
int s = i, e = i, cnt = 1, tmp = n, color = j;
if (a[i] == j)
continue;
while (true) {
while (true) {
if (s - 1 >= 0 && a[s - 1] == color) {
cnt++;
s--;
} else
break;
}
while (true) {
if (e + 1 < n && a[e + 1] == color) {
cnt++;
e++;
} else
break;
}
if (cnt >= 4) {
tmp -= cnt;
if (tmp <= 3)
break;
if (s - 1 >= 0)
color = a[s - 1];
else if (e + 1 < n)
color = a[e + 1];
cnt = 0;
} else
break;
}
if (ans > tmp)
ans = tmp;
}
}
printf("%d\n", ans);
}
int main() {
while (scanf("%d", &n), n)
solve();
}
|
[["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 20], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 0, 11, 12, 69, 341, 342, 0, 16, 31, 22], ["-", 0, 11, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 17, 72]]
| 1
| 295
|
#include <algorithm>
#include <iostream>
using namespace std;
int N;
int ary[10010];
// a???c???????????¨
int puyo(int a, int c) {
int motoc = ary[a];
int C = c;
ary[a] = C;
int l, r, ml, mr, tmp, cnt;
ml = mr = l = r = a;
cnt = 0;
while (ary[l] == C) {
l--;
if (l < 0)
break;
}
while (ary[r] == C) {
r++;
if (r >= N)
break;
}
tmp = abs(ml - l) + abs(mr - r) - 1;
if (tmp < 4) {
ary[a] = motoc;
return N;
}
if (l < 0) {
ary[a] = motoc;
return N - r + 1;
}
if (r >= N) {
ary[a] = motoc;
return l + 1;
}
cnt = tmp;
if (ary[l] != ary[r]) {
ary[a] = motoc;
return N - cnt;
}
while (1) {
C = ary[l];
ml = l;
mr = r;
while (ary[l] == C) {
l--;
if (l < 0)
break;
}
while (ary[r] == C) {
r++;
if (r >= N)
break;
}
tmp = abs(ml - l) + abs(mr - r);
if (tmp < 4) {
ary[a] = motoc;
return N - cnt;
}
if (l < 0) {
ary[a] = motoc;
return N - r + 1;
}
if (r >= N) {
ary[a] = motoc;
return l + 1;
}
cnt += tmp;
if (ary[l] != ary[r]) {
ary[a] = motoc;
return N - cnt;
}
}
}
int main() {
int cnt;
while (1) {
cin >> N;
if (N == 0)
break;
for (int i = 0; i < N; i++) {
cin >> ary[i];
}
cnt = N;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= 3; j++) {
// cout<<i<<"???"<<j<<"?????????????????¨"<<puyo(i,j)<<"????????????"<<endl;
cnt = min(cnt, puyo(i, j));
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int N;
int ary[10010];
// a???c???????????¨
int puyo(int a, int c) {
int motoc = ary[a];
int C = c;
ary[a] = C;
int l, r, ml, mr, tmp, cnt;
ml = mr = l = r = a;
cnt = 0;
while (ary[l] == C) {
l--;
if (l < 0)
break;
}
while (ary[r] == C) {
r++;
if (r >= N)
break;
}
tmp = abs(ml - l) + abs(mr - r) - 1;
if (tmp < 4) {
ary[a] = motoc;
return N;
}
if (l < 0) {
ary[a] = motoc;
return N - r;
}
if (r >= N) {
ary[a] = motoc;
return l + 1;
}
cnt = tmp;
if (ary[l] != ary[r]) {
ary[a] = motoc;
return N - cnt;
}
while (1) {
C = ary[l];
ml = l;
mr = r;
while (ary[l] == C) {
l--;
if (l < 0)
break;
}
while (ary[r] == C) {
r++;
if (r >= N)
break;
}
tmp = abs(ml - l) + abs(mr - r);
if (tmp < 4) {
ary[a] = motoc;
return N - cnt;
}
if (l < 0) {
ary[a] = motoc;
return N - r;
}
if (r >= N) {
ary[a] = motoc;
return l + 1;
}
cnt += tmp;
if (ary[l] != ary[r]) {
ary[a] = motoc;
return N - cnt;
}
}
}
int main() {
int cnt;
while (1) {
cin >> N;
if (N == 0)
break;
for (int i = 0; i < N; i++) {
cin >> ary[i];
}
cnt = N;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= 3; j++) {
// cout<<i<<"???"<<j<<"?????????????????¨"<<puyo(i,j)<<"????????????"<<endl;
cnt = min(cnt, puyo(i, j));
}
}
cout << cnt << endl;
}
return 0;
}
|
[["-", 0, 57, 64, 9, 0, 37, 0, 16, 17, 72], ["-", 0, 57, 64, 9, 0, 37, 0, 16, 12, 13]]
| 1
| 511
|
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D_Download\Visual
///Studio 2015\Projects\programing_contest_c++\Debug\b.answer"
int getans(vector<int> &l, deque<int> &r) {
if (l.empty() || r.empty())
return 0;
int lt = l.back();
int rt = r[0];
int a = l.size() - 1;
while (a >= 0) {
if (lt == l[a]) {
a--;
} else {
break;
}
}
int b = 0;
while (b <= r.size() - 1) {
if (rt == r[b]) {
b++;
} else {
break;
}
}
if (lt == rt) {
int num = (l.size() - 1) - a + b;
if (num >= 3) {
int ls = l.size();
for (int i = a + 1; i < ls; ++i) {
l.pop_back();
}
for (int i = 0; i < b; ++i) {
r.pop_front();
}
return num + 1 + getans(l, r);
} else {
return 0;
}
} else {
return 0;
}
}
int getans(const vector<int> &as, int a) {
int f = a;
int t = a;
int color = as[a];
while (f >= 0) {
if (color == as[f])
f--;
else
break;
}
f++;
while (t <= as.size() - 1) {
if (color == as[t])
t++;
else
break;
}
t--;
if (t - f >= 3) {
vector<int> l(as.begin(), as.begin() + f);
deque<int> r;
for (int i = t + 1; i < as.size(); ++i) {
r.push_back(as[i]);
}
return (t - f + 1) + getans(l, r);
} else {
return 0;
}
}
int main() {
while (1) {
int N;
cin >> N;
if (!N)
break;
vector<int> as(N);
for (int i = 0; i < N; ++i) {
cin >> as[i];
as[i]--;
}
int ans = 0;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < 3; ++j) {
int a = as[i];
as[i] = j;
ans = max(ans, getans(as, i));
as[i] = a;
}
}
cout << N - 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;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D_Download\Visual
///Studio 2015\Projects\programing_contest_c++\Debug\b.answer"
int getans(vector<int> &l, deque<int> &r) {
if (l.empty() || r.empty())
return 0;
int lt = l.back();
int rt = r[0];
int a = l.size() - 1;
while (a >= 0) {
if (lt == l[a]) {
a--;
} else {
break;
}
}
int b = 0;
while (b <= r.size() - 1) {
if (rt == r[b]) {
b++;
} else {
break;
}
}
if (lt == rt) {
int num = (l.size() - 1) - a + b;
if (num >= 4) {
int ls = l.size();
for (int i = a + 1; i < ls; ++i) {
l.pop_back();
}
for (int i = 0; i < b; ++i) {
r.pop_front();
}
return num + getans(l, r);
} else {
return 0;
}
} else {
return 0;
}
}
int getans(const vector<int> &as, int a) {
int f = a;
int t = a;
int color = as[a];
while (f >= 0) {
if (color == as[f])
f--;
else
break;
}
f++;
while (t <= as.size() - 1) {
if (color == as[t])
t++;
else
break;
}
t--;
if (t - f >= 3) {
vector<int> l(as.begin(), as.begin() + f);
deque<int> r;
for (int i = t + 1; i < as.size(); ++i) {
r.push_back(as[i]);
}
return (t - f + 1) + getans(l, r);
} else {
return 0;
}
}
int main() {
while (1) {
int N;
cin >> N;
if (!N)
break;
vector<int> as(N);
for (int i = 0; i < N; ++i) {
cin >> as[i];
as[i]--;
}
int ans = 0;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < 3; ++j) {
int a = as[i];
as[i] = j;
ans = max(ans, getans(as, i));
as[i] = a;
}
}
cout << N - ans << endl;
}
return 0;
}
|
[["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 64, 9, 0, 37, 0, 16, 31, 16, 17, 72], ["-", 64, 9, 0, 37, 0, 16, 31, 16, 12, 13]]
| 1
| 617
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n); i > 0; i--)
#define rrep2(i, a, b) for (int i = (a); i > b; i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
const ll mod = 1e9 + 7;
const ll INF = 1 << 30;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
int n;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (true) {
cin >> n;
if (n == 0)
break;
int ch[n] = {};
rep(i, n) cin >> ch[i];
int ans = 1e12;
rep(i, n) rep2(j, 1, 4) {
int nokori = n;
int l = i - 1;
int r = i + 1;
int cnt = 1;
int color = j;
while (true) {
while (r < n) {
if (ch[r] == color)
cnt++;
else
break;
r++;
}
while (l > 0) {
if (ch[l] == color)
cnt++;
else
break;
l--;
}
if (cnt < 4)
break;
nokori -= cnt;
if (nokori < 4)
break;
cnt = 0;
if (r < n)
color = ch[r];
else if (l > 0)
color = ch[l];
else
break;
}
ans = min(ans, nokori);
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n); i > 0; i--)
#define rrep2(i, a, b) for (int i = (a); i > b; i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
const ll mod = 1e9 + 7;
const ll INF = 1 << 30;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
int n;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (true) {
cin >> n;
if (n == 0)
break;
int ch[n] = {};
rep(i, n) cin >> ch[i];
int ans = 1e12;
rep(i, n) rep2(j, 1, 4) {
int nokori = n;
int l = i - 1;
int r = i + 1;
int cnt = 1;
int color = j;
while (true) {
while (r < n) {
if (ch[r] == color)
cnt++;
else
break;
r++;
}
while (l >= 0) {
if (ch[l] == color)
cnt++;
else
break;
l--;
}
if (cnt < 4)
break;
nokori -= cnt;
if (nokori < 4)
break;
cnt = 0;
if (r < n)
color = ch[r];
else if (l >= 0)
color = ch[l];
else
break;
}
ans = min(ans, nokori);
}
cout << ans << endl;
}
}
|
[["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 20]]
| 1
| 476
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
int N;
while (cin >> N) {
vector<int> c(N + 1);
FOR(i, 0, N) scanf("%d", &c[i]);
c[N] = 10;
// i??????????????´??????
int ans = 1e9;
FOR(i, 0, N) {
// 2?????????
FOR(j, 1, 4) {
vector<int> chain = c;
if (chain[i] == j)
continue;
chain[i] = j;
FOR(k, 0, 10000) {
bool del = false;
int cnt = 0;
FOR(l, 0, (int)chain.size() - 1) {
if (chain[l] == chain[l + 1])
cnt++;
else {
if (cnt >= 3) {
chain.erase(chain.begin() + l - cnt, chain.begin() + l + 1);
del = true;
break;
}
cnt = 0;
}
}
if (!del) {
ans = min(ans, (int)chain.size() - 1);
break;
}
}
}
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
int N;
while (cin >> N, N) {
vector<int> c(N + 1);
FOR(i, 0, N) scanf("%d", &c[i]);
c[N] = 10;
// i??????????????´??????
int ans = 1e9;
FOR(i, 0, N) {
// 2?????????
FOR(j, 1, 4) {
vector<int> chain = c;
if (chain[i] == j)
continue;
chain[i] = j;
FOR(k, 0, 10000) {
bool del = false;
int cnt = 0;
FOR(l, 0, (int)chain.size() - 1) {
if (chain[l] == chain[l + 1])
cnt++;
else {
if (cnt >= 3) {
chain.erase(chain.begin() + l - cnt, chain.begin() + l + 1);
del = true;
break;
}
cnt = 0;
}
}
if (!del) {
ans = min(ans, (int)chain.size() - 1);
break;
}
}
}
}
cout << ans << endl;
}
return 0;
}
|
[["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]]
| 1
| 307
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr int INF = 2000000000;
constexpr int HINF = INF / 2;
constexpr double DINF = 100000000000000000.0;
constexpr long long LINF = 9223372036854775807;
constexpr long long HLINF = 4500000000000000000;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
#define ALL(x) (x).begin(), (x).end()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define mp make_pair
#define eb emplace_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
int ch[10101];
int main() {
int n;
while (cin >> n) {
for (int i = 1; i <= n; i++) {
cin >> ch[i];
}
ch[0] = ch[n + 1] = 5;
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 3; j++) {
int color = j;
int sum = 0, count = 1;
int left = i - 1, right = i + 1;
while (1) {
while (ch[left] == color)
left--, count++;
while (ch[right] == color)
right++, count++;
if (count < 4)
break;
sum += count;
count = 0;
if (ch[left] != ch[right])
break;
color = ch[left];
}
ans = max(ans, sum);
}
}
cout << n - ans << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr int INF = 2000000000;
constexpr int HINF = INF / 2;
constexpr double DINF = 100000000000000000.0;
constexpr long long LINF = 9223372036854775807;
constexpr long long HLINF = 4500000000000000000;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
#define ALL(x) (x).begin(), (x).end()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define mp make_pair
#define eb emplace_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
int ch[10101];
int main() {
int n;
while (cin >> n && n) {
for (int i = 1; i <= n; i++) {
cin >> ch[i];
}
ch[0] = ch[n + 1] = 5;
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 3; j++) {
int color = j;
int sum = 0, count = 1;
int left = i - 1, right = i + 1;
while (1) {
while (ch[left] == color)
left--, count++;
while (ch[right] == color)
right++, count++;
if (count < 4)
break;
sum += count;
count = 0;
if (ch[left] != ch[right])
break;
color = ch[left];
}
ans = max(ans, sum);
}
}
cout << n - ans << endl;
}
}
|
[["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]]
| 1
| 379
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int color[10010];
int N;
int ans;
int solve(int x, int cc) {
if (color[x] == cc)
return N;
int cnt = 1;
int back, forward;
for (back = x - 1; back >= 0; back--) {
if (cc == color[back])
cnt++;
else
break;
}
for (forward = x + 1; forward < N; forward++) {
if (cc == color[forward])
cnt++;
else
break;
}
int res = N - cnt;
if (cnt < 4)
return N;
else if (back < 0 || N <= forward)
return res;
else if (color[back] != color[forward])
return res;
while (1) {
int tmp = 0;
cc = color[back];
for (; back >= 0; back--) {
if (cc == color[back])
tmp++;
else
break;
}
for (; forward < N; forward++) {
if (cc == color[forward])
tmp++;
else
break;
}
if (cnt < 4)
return res;
else if (back < 0 || N <= forward)
return res - tmp;
else if (color[back] != color[forward])
return res - tmp;
res -= tmp;
}
return res;
}
int main() {
while (cin >> N, N) {
for (int i = 0; i < N; i++)
cin >> color[i];
int ans = 10010;
for (int i = 0; i < N; i++) {
for (int c = 1; c <= 3; c++) {
ans = min(ans, solve(i, c));
}
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int color[10010];
int N;
int solve(int x, int cc) {
if (color[x] == cc)
return N;
int cnt = 1;
int back, forward;
for (back = x - 1; back >= 0; back--) {
if (cc == color[back])
cnt++;
else
break;
}
for (forward = x + 1; forward < N; forward++) {
if (cc == color[forward])
cnt++;
else
break;
}
int res = N - cnt;
if (cnt < 4)
return N;
else if (back < 0 || N <= forward)
return res; // ツ端ツづーツ湘?つオツつスツ湘ェツ債?
else if (color[back] != color[forward])
return res; // ツ禿アツ連ツ債スツづ可づつづ按つェツづァツづ按つ「ツ湘ェツ債?
while (1) {
int tmp = 0;
cc = color[back];
for (; back >= 0; back--) {
if (cc == color[back])
tmp++;
else
break;
}
for (; forward < N; forward++) {
if (cc == color[forward])
tmp++;
else
break;
}
if (tmp < 4)
return res;
else if (back < 0 || N <= forward)
return res - tmp;
else if (color[back] != color[forward])
return res - tmp;
res -= tmp;
}
return res;
}
int main() {
while (cin >> N, N) {
for (int i = 0; i < N; i++)
cin >> color[i];
int ans = 10010;
for (int i = 0; i < N; i++) {
for (int c = 1; c <= 3; c++) {
ans = min(ans, solve(i, c));
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]]
| 1
| 388
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v;
int n;
while (cin >> n, n) {
v.resize(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
if (v[i] == j)
continue;
int prev = v[i];
v[i] = j;
int a = i, b = i + 1;
while (1) {
int c = 1;
while (0 < a && v[a] == v[a - 1])
a--, c++;
while (b < n && v[a] == v[b])
b++, c++;
if (c < 4) {
ans = min(ans, n - b + a + c);
break;
}
if (--a == -1) {
ans = min(ans, n - b + 1);
break;
}
if (b == n) {
ans = min(ans, a);
break;
}
}
v[i] = prev;
}
}
cout << ans << endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v;
int n;
while (cin >> n, n) {
v.resize(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
if (v[i] == j)
continue;
int prev = v[i];
v[i] = j;
int a = i, b = i + 1;
while (1) {
int c = 1;
while (0 < a && v[a] == v[a - 1])
a--, c++;
while (b < n && v[a] == v[b])
b++, c++;
if (c < 4) {
ans = min(ans, n - b + a + c);
break;
}
if (--a == -1) {
ans = min(ans, n - b);
break;
}
if (b == n) {
ans = min(ans, a + 1);
break;
}
}
v[i] = prev;
}
}
cout << ans << endl;
}
}
|
[["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 275
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int n, a[10000];
int main() {
for (;;) {
int x = 0;
cin >> n;
if (n == 0)
return 0;
int pro = n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
if (a[i] != j) {
int u = a[i];
a[i] = j;
int ans = 0;
int p = i;
int q = i;
int s = 1;
while (p > 0 || q < n - 1) {
while (p > 0 && a[p] == a[p - 1])
p--, s++;
while (q < n - 1 && a[q] == a[q + 1])
q++, s++;
if (s >= 4) {
ans += s;
if (a[p--] != a[q++])
break;
s = 2;
continue;
}
break;
}
pro = min(pro, n - ans);
a[i] = u;
}
}
}
printf("%d\n", pro);
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int n, a[10000];
int main() {
for (;;) {
int x = 0;
cin >> n;
if (n == 0)
return 0;
int pro = n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
if (a[i] != j) {
int u = a[i];
a[i] = j;
int ans = 0;
int p = i;
int q = i;
int s = 1;
while (p > 0 || q < n - 1) {
while (p > 0 && a[p] == a[p - 1])
p--, s++;
while (q < n - 1 && a[q] == a[q + 1])
q++, s++;
if (s >= 4) {
ans += s;
if (a[--p] != a[++q])
break;
s = 2;
continue;
}
break;
}
pro = min(pro, n - ans);
a[i] = u;
}
}
}
printf("%d\n", pro);
}
return 0;
}
|
[["-", 51, 16, 31, 69, 341, 342, 0, 27, 28, 22], ["+", 51, 16, 31, 69, 341, 342, 0, 27, 28, 22], ["-", 51, 16, 12, 69, 341, 342, 0, 27, 28, 22], ["+", 51, 16, 12, 69, 341, 342, 0, 27, 28, 22]]
| 1
| 294
|
#include <stdio.h>
#include <string.h>
#define N 90
#define MAX(D, S) \
{ \
int __temp = (S); \
(D) = ((D) > __temp ? (D) : __temp); \
}
static int d[N][N];
static int m, n;
int dfs(int x, int y) {
int res = 0;
#if 0
if ( x < 0 || x >= m
|| y < 0 || y >= n ) return ( 0 );
if ( !d[ x ][ y ] ) return ( 0 );
#endif
d[x][y] = 0;
if (x > 0 && d[x - 1][y])
MAX(res, dfs(x - 1, y));
if (x < m - 1 && d[x + 1][y])
MAX(res, dfs(x + 1, y));
if (y > 0 && d[x][y - 1])
MAX(res, dfs(x, y - 1));
if (y < n - 1 && d[x][y + 1])
(res, dfs(x, y + 1));
d[x][y] = 1;
return (res + 1);
}
/** Application main entry point. */
int main(int argc, char *argv[]) {
int x, y;
for (;;) {
int res = 0;
scanf("%d%d", &m, &n);
if (!(m | n))
break;
for (y = 0; y < n; ++y)
for (x = 0; x < m; ++x) {
scanf("%d", &d[x][y]);
}
for (y = 0; y < n; ++y)
for (x = 0; x < m; ++x) {
if (d[x][y])
MAX(res, dfs(x, y));
}
printf("%d\n", res);
}
return (0);
}
|
#include <stdio.h>
#include <string.h>
#define N 90
#define MAX(D, S) \
{ \
int __temp = (S); \
(D) = ((D) > __temp ? (D) : __temp); \
}
static int d[N][N];
static int m, n;
int dfs(int x, int y) {
int res = 0;
#if 0
if ( x < 0 || x >= m
|| y < 0 || y >= n ) return ( 0 );
if ( !d[ x ][ y ] ) return ( 0 );
#endif
d[x][y] = 0;
if (x > 0 && d[x - 1][y])
MAX(res, dfs(x - 1, y));
if (x < m - 1 && d[x + 1][y])
MAX(res, dfs(x + 1, y));
if (y > 0 && d[x][y - 1])
MAX(res, dfs(x, y - 1));
if (y < n - 1 && d[x][y + 1])
MAX(res, dfs(x, y + 1));
d[x][y] = 1;
return (res + 1);
}
/** Application main entry point. */
int main(int argc, char *argv[]) {
int x, y;
for (;;) {
int res = 0;
scanf("%d%d", &m, &n);
if (!(m | n))
break;
for (y = 0; y < n; ++y)
for (x = 0; x < m; ++x) {
scanf("%d", &d[x][y]);
}
for (y = 0; y < n; ++y)
for (x = 0; x < m; ++x) {
if (d[x][y])
MAX(res, dfs(x, y));
}
printf("%d\n", res);
}
return (0);
}
|
[["+", 8, 9, 0, 57, 64, 1, 0, 2, 63, 22]]
| 0
| 406
|
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
bool maps[100][100];
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int search(int y, int x) {
int maxim = 0;
maps[y][x] = false;
REP(i, 4)
if (y + dy[i] && x + dx[i] && maps[y + dy[i]][x + dx[i]])
maxim = max(maxim, search(y + dy[i], x + dx[i]));
maps[y][x] = true;
return maxim + 1;
}
int main() {
// your code goes here
int m, n;
while (cin >> m >> n && n) {
int maxim = 0;
REP(i, n)
REP(j, m)
cin >> maps[i][j];
REP(i, n)
REP(j, m)
if (maps[i][j])
maxim = max(maxim, search(i, j));
cout << maxim << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
bool maps[100][100];
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int search(int y, int x) {
int maxim = 0;
maps[y][x] = false;
REP(i, 4)
if (y + dy[i] >= 0 && x + dx[i] >= 0 && maps[y + dy[i]][x + dx[i]])
maxim = max(maxim, search(y + dy[i], x + dx[i]));
maps[y][x] = true;
return maxim + 1;
}
int main() {
// your code goes here
int m, n;
while (cin >> m >> n && n) {
int maxim = 0;
REP(i, n)
REP(j, m)
cin >> maps[i][j];
REP(i, n)
REP(j, m)
if (maps[i][j])
maxim = max(maxim, search(i, j));
cout << maxim << endl;
}
return 0;
}
|
[["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 20], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 12, 13], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 20], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 12, 13]]
| 1
| 272
|
#include <iostream>
using namespace std;
struct Data {
bool s[100][100];
};
int w, h;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int ans = 0;
void dfs(int x, int y, int t, Data D) {
D.s[y][x] = false;
bool flg = true;
for (int i = 0; i < 4; i++) {
int nx = x + dx[i];
int ny = y + dy[i];
if (0 <= nx && nx < w && 0 <= ny && ny < h) {
if (D.s[ny][nx]) {
dfs(nx, ny, t + 1, D);
flg = false;
}
}
}
if (flg)
ans = max(ans, t);
return;
}
int main() {
while (cin >> w >> h, w && h) {
Data D;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> D.s[i][j];
}
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (D.s[i][j]) {
dfs(j, i, 0, D);
}
}
}
cout << ans + 1 << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
struct Data {
bool s[100][100];
};
int w, h;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int ans = 0;
void dfs(int x, int y, int t, Data D) {
D.s[y][x] = false;
bool flg = true;
for (int i = 0; i < 4; i++) {
int nx = x + dx[i];
int ny = y + dy[i];
if (0 <= nx && nx < w && 0 <= ny && ny < h) {
if (D.s[ny][nx]) {
dfs(nx, ny, t + 1, D);
flg = false;
}
}
}
if (flg)
ans = max(ans, t);
return;
}
int main() {
while (cin >> w >> h, w && h) {
ans = 0;
Data D;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> D.s[i][j];
}
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (D.s[i][j]) {
dfs(j, i, 0, D);
}
}
}
cout << ans + 1 << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 331
|
#include <iostream>
using namespace std;
int m, n;
bool a[100][100] = {{0}};
bool b[100][100] = {{0}};
bool f[100][100] = {{0}};
int cnt = 0, ans = 0;
int p = 0, q = 0;
void check(int x, int y);
int main(void) {
for (;;) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
b[i][j] = 0;
a[i][j] = 0;
}
}
ans = 0;
cin >> m >> n;
if (m == 0 && n == 0)
break;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
b[i][j] = a[i][j];
}
}
// in
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cnt = 0;
if (b[i][j] == 1) {
// cout<<".."<<i<<"."<<j<<endl;
check(i, j);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
b[i][j] = a[i][j];
}
}
}
}
cout << ans << endl;
}
return 0;
}
void check(int x, int y) {
b[x][y] = 0;
// p++,cout<<p<<"+"<<x<<","<<y<<endl;
cnt++;
int flag = 0;
if (b[x + 1][y] == 1) {
flag = 1;
check(x + 1, y);
b[x + 1][y] = 1;
cnt--;
// p--,cout<<"-"<<x<<","<<y<<endl;
}
if (b[x][y + 1] == 1) {
flag = 1;
check(x, y + 1);
b[x][y + 1] = 1;
cnt--;
// p--,cout<<"-"<<x<<","<<y<<endl;
}
if (b[x - 1][y] == 1) {
flag = 1;
check(x - 1, y);
b[x - 1][y] = 1;
cnt--;
// p--,cout<<"-"<<x<<","<<y<<endl;
}
if (b[x][y - 1] == 1) {
flag = 1;
check(x, y - 1);
b[x][y - 1] = 1;
cnt--;
// p--,cout<<"-"<<x<<","<<y<<endl;
}
if (flag == 0) {
ans = max(ans, cnt);
// p--,cout<<"-"<<x<<","<<y<<endl;
cnt--;
return;
}
}
|
#include <iostream>
using namespace std;
int m, n;
bool a[100][100] = {{0}};
bool b[100][100] = {{0}};
bool f[100][100] = {{0}};
int cnt = 0, ans = 0;
int p = 0, q = 0;
void check(int x, int y);
int main(void) {
for (;;) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
b[i][j] = 0;
a[i][j] = 0;
}
}
ans = 0;
cin >> m >> n;
if (m == 0 && n == 0)
break;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
b[i][j] = a[i][j];
}
}
// in
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cnt = 0;
if (b[i][j] == 1) {
// cout<<".."<<i<<"."<<j<<endl;
check(i, j);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
b[i][j] = a[i][j];
}
}
}
}
cout << ans << endl;
}
return 0;
}
void check(int x, int y) {
b[x][y] = 0;
// p++,cout<<p<<"+"<<x<<","<<y<<endl;
cnt++;
int flag = 0;
if (b[x + 1][y] == 1) {
flag = 1;
check(x + 1, y);
b[x + 1][y] = 1;
cnt--;
// p--,cout<<"-"<<x<<","<<y<<endl;
}
if (b[x][y + 1] == 1) {
flag = 1;
check(x, y + 1);
b[x][y + 1] = 1;
cnt--;
// p--,cout<<"-"<<x<<","<<y<<endl;
}
if (b[x - 1][y] == 1) {
flag = 1;
check(x - 1, y);
b[x - 1][y] = 1;
cnt--;
// p--,cout<<"-"<<x<<","<<y<<endl;
}
if (b[x][y - 1] == 1) {
flag = 1;
check(x, y - 1);
b[x][y - 1] = 1;
cnt--;
// p--,cout<<"-"<<x<<","<<y<<endl;
}
if (flag == 0) {
ans = max(ans, cnt);
// p--,cout<<"-"<<x<<","<<y<<endl;
return;
}
}
|
[["-", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 27, 17, 68], ["-", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]]
| 1
| 579
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
bool kaku[90][90], kouri[90][90];
int dfs(int a, int b) {
int re = 0, me;
if (a >= 90 || a < 0 || b >= 90 || b < 0)
return 0;
if (kaku[a][b] || !kouri[a][b])
return 0;
kaku[a][b] = true;
me = dfs(a - 1, b);
re = max(re, me);
me = dfs(a, b - 1);
re = max(re, me);
me = dfs(a, b + 1);
re = max(re, me);
me = dfs(a + 1, b);
re = max(re, me);
kaku[a][b] = false;
return re + 1;
}
int main() {
int m, n, a, ans, me;
while (1) {
ans = 0;
scanf("%d%d", &m, &n);
if (m + n == 0)
break;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
scanf("%d", &a);
kouri[i][j] = (a == 1);
}
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
me = dfs(i, j);
ans = max(ans, me);
}
printf("%d\n", ans - 1);
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
bool kaku[90][90], kouri[90][90];
int dfs(int a, int b) {
int re = 0, me;
if (a >= 90 || a < 0 || b >= 90 || b < 0)
return 0;
if (kaku[a][b] || !kouri[a][b])
return 0;
kaku[a][b] = true;
me = dfs(a - 1, b);
re = max(re, me);
me = dfs(a, b - 1);
re = max(re, me);
me = dfs(a, b + 1);
re = max(re, me);
me = dfs(a + 1, b);
re = max(re, me);
kaku[a][b] = false;
return re + 1;
}
int main() {
int m, n, a, ans, me;
while (1) {
ans = 0;
scanf("%d%d", &m, &n);
if (m + n == 0)
break;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
scanf("%d", &a);
kouri[i][j] = (a == 1);
}
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
me = dfs(i, j);
ans = max(ans, me);
}
printf("%d\n", ans);
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 381
|
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define FOR(i, a) for (int i = 0; i < a; i++)
int ans;
int n, m;
int icedate[100][100];
int mapdate[100][100]; // shokika!
int search(int x, int y, int poyo) {
if (icedate[x][y] != 0 and mapdate[x][y] == 0) {
mapdate[x][y]++;
if (ans < poyo) {
ans = poyo;
}
if (x + 1 < m) {
poyo++;
search(x + 1, y, poyo);
poyo--;
}
if (x - 1 >= 0) {
poyo++;
search(x - 1, y, poyo);
poyo--;
}
if (y + 1 < n) {
poyo++;
search(x, y + 1, poyo);
poyo--;
}
if (y - 1 >= 0) {
poyo++;
search(x, y - 1, poyo);
poyo--;
}
mapdate[x][y]--;
}
}
int main() {
while (1) {
cin >> n >> m;
if (n == 0 and m == 0) {
break;
}
FOR(i, 100) {
FOR(j, 100) {
icedate[i][j] = 0;
mapdate[i][j] = 0;
}
}
FOR(i, m) {
FOR(j, n) { cin >> icedate[i][j]; }
}
FOR(i, m) {
FOR(j, n) { search(i, j, 1); }
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define FOR(i, a) for (int i = 0; i < a; i++)
int ans;
int n, m;
int icedate[100][100];
int mapdate[100][100]; // shokika!
int search(int x, int y, int poyo) {
if (icedate[x][y] != 0 and mapdate[x][y] == 0) {
mapdate[x][y]++;
if (ans < poyo) {
ans = poyo;
}
if (x + 1 < m) {
poyo++;
search(x + 1, y, poyo);
poyo--;
}
if (x - 1 >= 0) {
poyo++;
search(x - 1, y, poyo);
poyo--;
}
if (y + 1 < n) {
poyo++;
search(x, y + 1, poyo);
poyo--;
}
if (y - 1 >= 0) {
poyo++;
search(x, y - 1, poyo);
poyo--;
}
mapdate[x][y]--;
}
}
int main() {
while (1) {
ans = 0;
cin >> n >> m;
if (n == 0 and m == 0) {
break;
}
FOR(i, 100) {
FOR(j, 100) {
icedate[i][j] = 0;
mapdate[i][j] = 0;
}
}
FOR(i, m) {
FOR(j, n) { cin >> icedate[i][j]; }
}
FOR(i, m) {
FOR(j, n) { search(i, j, 1); }
}
cout << ans << endl;
}
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 346
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> Array;
typedef pair<int, int> P;
const LL LINF = 1LL << 60;
const LL MOD = 100000;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define all(c) (c).begin(), (c).end()
struct edge {
LL to, cost;
edge(int t, LL c) : to(t), cost(c) {}
};
int dxk[] = {1, 1, 1, 0, -1, 0};
int dxg[] = {0, 1, 0, -1, -1, -1};
int dy[] = {-1, 0, 1, 1, 0, -1};
int main() {
int n;
LL m;
while (cin >> n >> m && n) {
vector<LL> nums(n);
rep(i, n) cin >> nums[i];
vector<LL> arr(n * n + 2);
rep(i, n) rep(j, n) { arr[i * n + j] = nums[i] + nums[j]; }
rep(i, n) arr[n * n + 1] = nums[i];
sort(all(arr));
LL ans = 0;
for (auto x : arr) {
LL rem = m - x;
auto it = upper_bound(all(arr), rem);
if (it != arr.begin()) {
LL num = *(--it);
ans = max(ans, num + x);
}
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> Array;
typedef pair<int, int> P;
const LL LINF = 1LL << 60;
const LL MOD = 100000;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define all(c) (c).begin(), (c).end()
struct edge {
LL to, cost;
edge(int t, LL c) : to(t), cost(c) {}
};
int dxk[] = {1, 1, 1, 0, -1, 0};
int dxg[] = {0, 1, 0, -1, -1, -1};
int dy[] = {-1, 0, 1, 1, 0, -1};
int main() {
int n;
LL m;
while (cin >> n >> m && n) {
vector<LL> nums(n);
rep(i, n) cin >> nums[i];
vector<LL> arr(n * n + n);
rep(i, n) rep(j, n) { arr[i * n + j] = nums[i] + nums[j]; }
rep(i, n) arr[n * n + i] = nums[i];
sort(all(arr));
LL ans = 0;
for (auto x : arr) {
LL rem = m - x;
auto it = upper_bound(all(arr), rem);
if (it != arr.begin()) {
LL num = *(--it);
ans = max(ans, num + x);
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 22], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 22]]
| 1
| 371
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, m;
vector<int> p1, p2;
int main() {
while (true) {
scanf("%d%d", &n, &m);
if (!n && !m)
break;
p1.clear();
p2.clear();
// chap1
p1.push_back(0);
for (int i = 0; i < n; i++) {
int p;
scanf("%d", &p);
p1.push_back(p);
}
// chap2
for (int i = 0; i <= n; i++)
for (int j = i; j <= n; j++)
p2.push_back(p1[i] + p1[j]);
sort(p2.begin(), p2.begin() + p2.size());
// chap3
int ans = 0;
for (int i = 0; i < p2.size(); i++) {
vector<int>::iterator count2 =
upper_bound(p2.begin(), p2.end(), m - p2[i]);
if (count2 != p2.begin())
ans = max(ans, *(count2 - 1) + p2[i]);
}
printf("%d", ans);
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, m;
vector<int> p1, p2;
int main() {
while (true) {
scanf("%d%d", &n, &m);
if (!n && !m)
break;
p1.clear();
p2.clear();
// chap1
p1.push_back(0);
for (int i = 0; i < n; i++) {
int p;
scanf("%d", &p);
p1.push_back(p);
}
// chap2
for (int i = 0; i <= n; i++)
for (int j = i; j <= n; j++)
p2.push_back(p1[i] + p1[j]);
sort(p2.begin(), p2.begin() + p2.size());
// chap3
int ans = 0;
for (int i = 0; i < p2.size(); i++) {
vector<int>::iterator count2 =
upper_bound(p2.begin(), p2.end(), m - p2[i]);
if (count2 != p2.begin())
ans = max(ans, *(count2 - 1) + p2[i]);
}
printf("%d\n", ans);
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 278
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define pb(x) push_back(x)
#define SORT(x) sort((x).begin(), (x).end())
#define INF 999999999
using namespace std;
#define int long long
signed main() {
int n, m;
while (1) {
cin >> n >> m;
if (n == 0)
break;
vector<int> p(n);
REP(i, n) { cin >> p[i]; }
p.push_back(0);
sort(p.begin(), p.end());
n++;
vector<int> v;
REP(i, n) {
FOR(j, i, n) {
if (p[i] + p[j] <= m)
v.push_back(p[i] + p[j]);
}
}
sort(v.begin(), v.end());
int l = 0, r = v.size() - 1, ans = 0;
for (; l <= r; l++) {
if (v[l] + v[r] > m)
r--;
ans = max(ans, v[l] + v[r]);
}
cout << ans << endl;
}
}
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define pb(x) push_back(x)
#define SORT(x) sort((x).begin(), (x).end())
#define INF 999999999
using namespace std;
#define int long long
signed main() {
int n, m;
while (1) {
cin >> n >> m;
if (n == 0)
break;
vector<int> p(n);
REP(i, n) { cin >> p[i]; }
p.push_back(0);
sort(p.begin(), p.end());
n++;
vector<int> v;
REP(i, n) {
FOR(j, i, n) {
if (p[i] + p[j] <= m)
v.push_back(p[i] + p[j]);
}
}
sort(v.begin(), v.end());
int l = 0, r = v.size() - 1, ans = 0;
for (; l <= r; l++) {
while (v[l] + v[r] > m)
r--;
ans = max(ans, v[l] + v[r]);
}
cout << ans << endl;
}
}
|
[["-", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["+", 8, 9, 0, 7, 8, 9, 0, 52, 0, 89]]
| 1
| 303
|
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n, m;
vector<int> p;
int t;
vector<int> q;
vector<int> o;
int ans;
int b(int x) {
int l = 0;
int r = q.size();
while (r - l > 1) {
int i = (l + r) / 2;
// printf("l=%d, r=%d, i=%d, q[i]=%d, x=%d\n", l, r, i, q[i], x);
if (q[i] <= x) {
l = i;
} else {
r = i;
}
}
// printf("%d\n", q[l]);
return q[l];
}
int main() {
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
p = o;
p.push_back(0);
for (int i = 0; i < n; i++) {
scanf("%d", &t);
p.push_back(t);
}
q = o;
for (int i = 0; i < p.size(); i++) {
for (int j = 0; j < p.size(); j++) {
q.push_back(p[i] + p[j]);
}
}
sort(q.begin(), q.end());
/*
for(int i=0; i<q.size(); i++)
printf("%d\n", q[i]);
*/
for (int i = 0; i < q.size(); i++) {
int a = q[i];
if (m - a < 0)
continue;
ans = max(ans, b(m - a) + a);
// printf("%d\n", b(m - a));
}
printf("%d\n", ans);
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n, m;
vector<int> p;
int t;
vector<int> q;
vector<int> o;
int ans;
int b(int x) {
int l = 0;
int r = q.size();
while (r - l > 1) {
int i = (l + r) / 2;
// printf("l=%d, r=%d, i=%d, q[i]=%d, x=%d\n", l, r, i, q[i], x);
if (q[i] <= x) {
l = i;
} else {
r = i;
}
}
// printf("%d\n", q[l]);
return q[l];
}
int main() {
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
p = o;
p.push_back(0);
for (int i = 0; i < n; i++) {
scanf("%d", &t);
p.push_back(t);
}
q = o;
ans = 0;
for (int i = 0; i < p.size(); i++) {
for (int j = 0; j < p.size(); j++) {
q.push_back(p[i] + p[j]);
}
}
sort(q.begin(), q.end());
/*
for(int i=0; i<q.size(); i++)
printf("%d\n", q[i]);
*/
for (int i = 0; i < q.size(); i++) {
int a = q[i];
if (m - a < 0)
continue;
ans = max(ans, b(m - a) + a);
// printf("%d\n", b(m - a));
}
printf("%d\n", ans);
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 336
|
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, m, in, MAX;
vector<int> P;
vector<int>::iterator it;
while (scanf("%d%d", &n, &m) && (n != 0 || m != 0)) {
P.clear();
for (int i = 0; i < n; i++) {
scanf("%d", &in);
P.push_back(in);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
P.push_back(P[i] + P[j]);
}
}
P.push_back(0);
sort(P.begin(), P.end());
MAX = 0;
for (int i = 0; i < P.size(); i++) {
it = upper_bound(P.begin(), P.end(), m - P[i]);
it--;
if (P[i] + *it >= m) {
MAX = max(MAX, P[i] + *it);
}
}
printf("%d\n", MAX);
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, m, in, MAX;
vector<int> P;
vector<int>::iterator it;
while (scanf("%d%d", &n, &m) && (n != 0 || m != 0)) {
P.clear();
for (int i = 0; i < n; i++) {
scanf("%d", &in);
P.push_back(in);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
P.push_back(P[i] + P[j]);
}
}
P.push_back(0);
sort(P.begin(), P.end());
MAX = 0;
for (int i = 0; i < P.size(); i++) {
it = upper_bound(P.begin(), P.end(), m - P[i]);
it--;
if (P[i] + *it <= m) {
MAX = max(MAX, P[i] + *it);
}
}
printf("%d\n", MAX);
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]]
| 1
| 269
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
#define fi "darts.inp"
#define fo "darts.out"
using namespace std;
long long n, m, a[100011], ans;
vector<long long> vt;
int main() {
// freopen (fi , "r" ,stdin);
// freopen (fo , "w" ,stdout);
while (1) {
scanf("%lld%lld", &n, &m);
if (n == 0 && m == 0)
return 0;
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
n++;
a[n] = 0;
vt.clear();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
vt.push_back(a[i] + a[j]);
}
sort(vt.begin(), vt.end());
int c;
c = vt.size() - 1;
for (int i = 0; i < vt.size(); i++) {
while (c >= 0 && vt[c] + vt[i] > m)
c--;
if (vt[c] + vt[i] <= m)
ans = max(ans, vt[c] + vt[i]);
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
#define fi "darts.inp"
#define fo "darts.out"
using namespace std;
long long n, m, a[100011], ans;
vector<long long> vt;
int main() {
// freopen (fi , "r" ,stdin);
// freopen (fo , "w" ,stdout);
while (1) {
scanf("%lld%lld", &n, &m);
if (n == 0 && m == 0)
return 0;
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
ans = 0;
n++;
a[n] = 0;
vt.clear();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
vt.push_back(a[i] + a[j]);
}
sort(vt.begin(), vt.end());
int c;
c = vt.size() - 1;
for (int i = 0; i < vt.size(); i++) {
while (c >= 0 && vt[c] + vt[i] > m)
c--;
if (vt[c] + vt[i] <= m)
ans = max(ans, vt[c] + vt[i]);
}
cout << ans << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 281
|
#include <stdio.h>
#include <stdlib.h>
#define MAX_R (3000000)
#define min(x, y) ((x < y) ? x : y)
typedef struct stone {
int x, r;
} Stone;
Stone p[155][15];
int xn[155], dp[155][15][80];
int main() {
int i, j, k, h, n, m, x, y, z, ans;
while (1) {
scanf("%d%d", &n, &m);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &xn[i]);
for (j = 0; j < xn[i]; j++) {
scanf("%d%d", &p[i][j].x, &p[i][j].r);
for (k = 0; k <= m; k++)
dp[i][j][k] = MAX_R;
}
}
for (i = 0; i < xn[0]; i++)
dp[0][i][0] = 0;
for (i = 0; i < xn[1]; i++)
dp[1][i][1] = 0;
for (i = 0; i < n - 1; i++) {
for (h = 0; h <= m; h++) {
for (j = 0; j < xn[i]; j++) {
for (k = 0; k < xn[i + 1]; k++) {
y = (p[i][j].r + p[i + 1][k].r) * abs(p[i][j].x - p[i + 1][k].x);
dp[i + 1][k][h] = min(dp[i + 1][k][h], dp[i][j][h] + y);
}
for (k = 0; k < xn[i + 2]; k++) {
y = (p[i][j].r + p[i + 2][k].r) * abs(p[i][j].x - p[i + 2][k].x);
dp[i + 2][k][h + 1] = min(dp[i + 2][k][h], dp[i][j][h] + y);
}
}
}
}
ans = MAX_R;
for (i = 0; i <= m; i++)
for (j = 0; j < xn[n - 1]; j++)
ans = min(ans, dp[n - 1][j][i]);
for (i = 0; i < m; i++)
for (j = 0; j < xn[n - 2]; j++)
ans = min(ans, dp[n - 2][j][i]);
printf("%d\n", ans);
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#define MAX_R (300000000)
#define min(x, y) ((x < y) ? x : y)
typedef struct stone {
int x, r;
} Stone;
Stone p[155][15];
int xn[155], dp[155][15][80];
int main() {
int i, j, k, h, n, m, x, y, z, ans;
while (1) {
scanf("%d%d", &n, &m);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &xn[i]);
for (j = 0; j < xn[i]; j++) {
scanf("%d%d", &p[i][j].x, &p[i][j].r);
for (k = 0; k <= m; k++)
dp[i][j][k] = MAX_R;
}
}
for (i = 0; i < xn[0]; i++)
dp[0][i][0] = 0;
for (i = 0; i < xn[1]; i++)
dp[1][i][1] = 0;
for (i = 0; i < n - 1; i++) {
for (h = 0; h <= m; h++) {
for (j = 0; j < xn[i]; j++) {
for (k = 0; k < xn[i + 1]; k++) {
y = (p[i][j].r + p[i + 1][k].r) * abs(p[i][j].x - p[i + 1][k].x);
dp[i + 1][k][h] = min(dp[i + 1][k][h], dp[i][j][h] + y);
}
for (k = 0; k < xn[i + 2]; k++) {
y = (p[i][j].r + p[i + 2][k].r) * abs(p[i][j].x - p[i + 2][k].x);
dp[i + 2][k][h + 1] = min(dp[i + 2][k][h + 1], dp[i][j][h] + y);
}
}
}
}
ans = MAX_R;
for (i = 0; i <= m; i++)
for (j = 0; j < xn[n - 1]; j++)
ans = min(ans, dp[n - 1][j][i]);
for (i = 0; i < m; i++)
for (j = 0; j < xn[n - 2]; j++)
ans = min(ans, dp[n - 2][j][i]);
printf("%d\n", ans);
}
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 12, 2, 3, 4, 0, 69, 71, 16, 17, 72], ["+", 12, 2, 3, 4, 0, 69, 71, 16, 12, 13]]
| 0
| 663
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 50000000000;
int n, m;
int K[152], x[152][10], d[152][10];
long long dp[152][10];
void init() {
dp[0][0] = 0;
for (int i = 1; i <= 151; i++) {
for (int j = 0; j < 10; j++) {
dp[i][j] = INF;
}
}
memset(K, 0, sizeof(K));
K[0] = 1;
K[n + 1] = 1;
memset(x, 0, sizeof(x));
memset(d, 0, sizeof(d));
}
int main() {
while (scanf("%d %d", &n, &m), n + m) {
init();
for (int i = 1; i <= n; i++) {
scanf("%d", &K[i]);
for (int j = 0; j < K[i]; j++) {
scanf("%d %d", &x[i][j], &d[i][j]);
}
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j < K[i]; j++) {
for (int k = 0; k < K[i + 1]; k++) {
if (i == 0 || i == n)
dp[i + 1][k] = min(dp[i + 1][k], dp[i][j]);
else
dp[i + 1][k] =
min(dp[i + 1][k], dp[i][j] + (d[i][j] + d[i + 1][k]) *
abs(x[i][j] - x[i + 1][k]));
}
}
}
while (m--) {
for (int i = n - 1; i >= 0; i--) {
for (int j = 0; j < K[i]; j++) {
for (int k = 0; k < K[i + 2]; k++) {
if (i == 0 || i == n - 1)
dp[i + 2][k] = min(dp[i + 2][k], dp[i][j]);
else
dp[i + 2][k] =
min(dp[i + 2][k], dp[i][j] + (d[i][j] + d[i + 2][k]) *
abs(x[i][j] - x[i + 2][k]));
}
}
}
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j < K[i]; j++) {
for (int k = 0; k < K[i + 1]; k++) {
if (i == 0 || i == n)
dp[i + 1][k] = min(dp[i + 1][k], dp[i][j]);
else
dp[i + 1][k] =
min(dp[i + 1][k], dp[i][j] + (d[i][j] + d[i + 1][k]) *
abs(x[i][j] - x[i + 1][k]));
}
}
}
printf("%lld\n", dp[n + 1][0]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 50000000000;
int n, m;
int K[152], x[152][10], d[152][10];
long long dp[152][10];
void init() {
dp[0][0] = 0;
for (int i = 1; i <= 151; i++) {
for (int j = 0; j < 10; j++) {
dp[i][j] = INF;
}
}
memset(K, 0, sizeof(K));
K[0] = 1;
K[n + 1] = 1;
memset(x, 0, sizeof(x));
memset(d, 0, sizeof(d));
}
int main() {
while (scanf("%d %d", &n, &m), n + m) {
init();
for (int i = 1; i <= n; i++) {
scanf("%d", &K[i]);
for (int j = 0; j < K[i]; j++) {
scanf("%d %d", &x[i][j], &d[i][j]);
}
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j < K[i]; j++) {
for (int k = 0; k < K[i + 1]; k++) {
if (i == 0 || i == n)
dp[i + 1][k] = min(dp[i + 1][k], dp[i][j]);
else
dp[i + 1][k] =
min(dp[i + 1][k], dp[i][j] + (d[i][j] + d[i + 1][k]) *
abs(x[i][j] - x[i + 1][k]));
}
}
}
while (m--) {
for (int i = n - 1; i >= 0; i--) {
for (int j = 0; j < K[i]; j++) {
for (int k = 0; k < K[i + 2]; k++) {
if (i == 0 || i == n - 1)
dp[i + 2][k] = min(dp[i + 2][k], dp[i][j]);
else
dp[i + 2][k] =
min(dp[i + 2][k], dp[i][j] + (d[i][j] + d[i + 2][k]) *
abs(x[i][j] - x[i + 2][k]));
}
}
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j < K[i]; j++) {
for (int k = 0; k < K[i + 1]; k++) {
if (i == 0 || i == n)
dp[i + 1][k] = min(dp[i + 1][k], dp[i][j]);
else
dp[i + 1][k] =
min(dp[i + 1][k], dp[i][j] + (d[i][j] + d[i + 1][k]) *
abs(x[i][j] - x[i + 1][k]));
}
}
}
}
printf("%lld\n", dp[n + 1][0]);
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 806
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k); ++i)
#define BW(a, x, b) ((a) <= (x) && (x) <= (b))
#define ALL(v) (v).begin(), (v).end()
#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))
#define AFILL(a, b) fill((int *)a, (int *)(a + LENGTHOF(a)), b)
#define SQ(x) ((x) * (x))
#define Mod(x, mod) (((x)+(mod)%(mod))
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define INF 1LL << 60
#define EPS 1e-10
#define MOD 1000000007
typedef pair<int, int> P;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;
vector<P> St[256];
int N, M;
ll dp[256][16][128];
ll dfs(int n, int x, int m) {
if (n >= N - 1)
return 0;
if (n >= N - 2 && m)
return 0;
ll &res = dp[n][x][m];
if (res >= 0)
return res;
res = INF;
int pos = St[n][x].first, slip = St[n][x].second;
rep(i, St[n + 1].size()) {
P tar = St[n + 1][i];
res = min(res, dfs(n + 1, i, m) +
(ll)(slip + tar.second) * (ll)(abs(pos - tar.first)));
}
if (m && n < N - 1) {
rep(i, St[n + 2].size()) {
P tar = St[n + 2][i];
res = min(res, dfs(n + 2, i, m - 1) +
(ll)(slip + tar.second) * (ll)(abs(pos - tar.first)));
}
}
// cout << n << " " << x << " "<< m <<" " << res << endl;
return res;
}
int main() {
while (scanf("%d%d", &N, &M) && N) {
int k, x, d;
memset(dp, -1, sizeof(dp));
rep(i, N) St[i].clear();
rep(i, N) {
scanf("%d", &k);
rep(j, k) {
scanf("%d%d", &x, &d);
St[i].push_back(P(x, d));
}
}
ll res = INF;
rep(i, St[0].size()) res = min(res, dfs(0, i, M));
rep(i, St[1].size()) res = min(res, dfs(1, i, M - 1));
printf("%lld\n", res);
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k); ++i)
#define BW(a, x, b) ((a) <= (x) && (x) <= (b))
#define ALL(v) (v).begin(), (v).end()
#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))
#define AFILL(a, b) fill((int *)a, (int *)(a + LENGTHOF(a)), b)
#define SQ(x) ((x) * (x))
#define Mod(x, mod) (((x)+(mod)%(mod))
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define INF 1LL << 60
#define EPS 1e-10
#define MOD 1000000007
typedef pair<int, int> P;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;
vector<P> St[256];
int N, M;
ll dp[256][16][128];
ll dfs(int n, int x, int m) {
if (n >= N - 1)
return 0;
if (n >= N - 2 && m)
return 0;
ll &res = dp[n][x][m];
if (res >= 0)
return res;
res = INF;
int pos = St[n][x].first, slip = St[n][x].second;
rep(i, St[n + 1].size()) {
P tar = St[n + 1][i];
res = min(res, dfs(n + 1, i, m) +
(ll)(slip + tar.second) * (ll)(abs(pos - tar.first)));
}
if (m && n < N - 2) {
rep(i, St[n + 2].size()) {
P tar = St[n + 2][i];
res = min(res, dfs(n + 2, i, m - 1) +
(ll)(slip + tar.second) * (ll)(abs(pos - tar.first)));
}
}
// cout << n << " " << x << " "<< m <<" " << res << endl;
return res;
}
int main() {
while (scanf("%d%d", &N, &M) && N) {
int k, x, d;
memset(dp, -1, sizeof(dp));
rep(i, N) St[i].clear();
rep(i, N) {
scanf("%d", &k);
rep(j, k) {
scanf("%d%d", &x, &d);
St[i].push_back(P(x, d));
}
}
ll res = INF;
rep(i, St[0].size()) res = min(res, dfs(0, i, M));
if (M)
rep(i, St[1].size()) res = min(res, dfs(1, i, M - 1));
printf("%lld\n", res);
}
return 0;
}
|
[["-", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 51, 22], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 0, 25]]
| 1
| 614
|
// y09-6 ビンゴ(2回目)
#include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define LL long long
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#define INT_MAX 2147483647
#define LL_MIN -9223372036854775808
#define LL_MAX 9223372036854775807
#define segment_size 65536
#define ROOP() while (true)
int main() {
ROOP() {
int N, M, S;
cin >> N >> M >> S;
if (N == 0)
return 0;
int dp[50][3001];
for (int i = 0; i < 50; i++) {
for (int j = 0; j < 3001; j++) {
dp[i][j] = 0;
}
}
dp[0][0] = 1;
for (int i = 1; i <= M; i++) {
for (int j = N * N; j >= 1; j--) {
for (int k = i; k <= S; k++) {
dp[j][k] += dp[j - 1][k - i];
dp[i][k] %= 100000;
}
}
}
cout << dp[N * N][S] << endl;
}
return 0;
}
|
// y09-6 ビンゴ(2回目)
#include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define LL long long
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#define INT_MAX 2147483647
#define LL_MIN -9223372036854775808
#define LL_MAX 9223372036854775807
#define segment_size 65536
#define ROOP() while (true)
int main() {
ROOP() {
int N, M, S;
cin >> N >> M >> S;
if (N == 0)
return 0;
int dp[50][3001];
for (int i = 0; i < 50; i++) {
for (int j = 0; j < 3001; j++) {
dp[i][j] = 0;
}
}
dp[0][0] = 1;
for (int i = 1; i <= M; i++) {
for (int j = N * N; j >= 1; j--) {
for (int k = i; k <= S; k++) {
dp[j][k] += dp[j - 1][k - i];
dp[j][k] %= 100000;
}
}
}
cout << dp[N * N][S] << endl;
}
return 0;
}
|
[["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22]]
| 1
| 257
|
#include <stdio.h>
#define WIDTH 3001
#define HEIGHT 51
char dp[HEIGHT * WIDTH];
int main(void) {
int i, j, k;
int n, m, s;
while (scanf("%d%d%d", &n, &m, &s), n) {
n *= n;
dp[0] = 1;
for (i = 1; i < WIDTH * HEIGHT; ++i)
dp[i] = 0;
for (i = 1; i <= m; ++i) {
for (j = n; j >= 0; --j) {
for (k = s; k >= 0; --k) {
if (j && i <= k) {
dp[j * WIDTH + k] =
(dp[j * WIDTH + k] + dp[(j - 1) * WIDTH + k - i]) % 100000;
}
}
}
}
printf("%d\n", dp[n * WIDTH + s]);
}
return 0;
}
|
#include <stdio.h>
#define WIDTH 3001
#define HEIGHT 51
int dp[HEIGHT * WIDTH];
int main(void) {
int i, j, k;
int n, m, s;
while (scanf("%d%d%d", &n, &m, &s), n) {
n *= n;
dp[0] = 1;
for (i = 1; i < WIDTH * HEIGHT; ++i)
dp[i] = 0;
for (i = 1; i <= m; ++i) {
for (j = n; j >= 0; --j) {
for (k = s; k >= 0; --k) {
if (j && i <= k) {
dp[j * WIDTH + k] =
(dp[j * WIDTH + k] + dp[(j - 1) * WIDTH + k - i]) % 100000;
}
}
}
}
printf("%d\n", dp[n * WIDTH + s]);
}
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40]]
| 1
| 204
|
#include <cstdio>
#include <cstring>
int dp[50][3001];
int main() {
int n, m, s;
while (scanf("%d %d %d", &n, &m, &s), n) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= m; i++)
for (int j = n * n; j >= 1; j--)
for (int k = 1; k <= s; k++) {
dp[j][k] += dp[j - 1][k - i];
if (dp[j][k] >= 100000)
dp[j][k] -= 100000;
}
printf("%d\n", dp[n * n][s]);
}
}
|
#include <cstdio>
#include <cstring>
int dp[50][3001];
int main() {
int n, m, s;
while (scanf("%d %d %d", &n, &m, &s), n) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= m; i++)
for (int j = n * n; j >= 1; j--)
for (int k = i; k <= s; k++) {
dp[j][k] += dp[j - 1][k - i];
if (dp[j][k] >= 100000)
dp[j][k] -= 100000;
}
printf("%d\n", dp[n * n][s]);
}
}
|
[["-", 8, 7, 8, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 7, 8, 7, 10, 43, 49, 50, 51, 22]]
| 1
| 176
|
#include <stdio.h>
int main(void) {
int i, n, m, count[1000001], res;
char s[1000001];
while (scanf("%d", &n) && n) {
scanf("%d%s", &m, s);
for (i = 0; i < n; count[i] = 0, i++)
;
for (i = m - 1; i > 1; i--)
if (s[i] == 'I' && s[i - 1] == 'O' && s[i - 2] == 'I')
count[i - 2] = count[i] + 1;
for (i = 0, res = 0; i < m; i++)
if (count[i] >= n)
res++;
printf("%d\n", res);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, n, m, count[1000001], res;
char s[1000001];
while (scanf("%d", &n), n) {
scanf("%d %s", &m, s);
for (i = 0; i < 1000001; count[i] = 0, i++)
;
for (i = m - 1; i > 1; i--)
if (s[i] == 'I' && s[i - 1] == 'O' && s[i - 2] == 'I')
count[i - 2] = count[i] + 1;
for (i = 0, res = 0; i < m; i++)
if (count[i] >= n)
res++;
printf("%d\n", res);
}
return 0;
}
|
[["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 23, 0, 34, 0, 21], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 182
|
main(n, s, c, d) {
for (; scanf("%d%d ", &n) * n; printf("%d\n", s))
for (s = c = 0; d = getchar() - 10; s += c % 2 & c / 2 >= n)
c = d - 63 ? c % 2 ? c + 1 : 0 : c % 2 ?: c + 1;
}
|
main(n, s, c, d) {
for (; scanf("%d%*d ", &n) * n; printf("%d\n", s))
for (s = c = 0; d = getchar() - 10; s += c % 2 & c / 2 >= n)
c = d - 63 ? c % 2 ? c + 1 : 0 : c % 2 ?: c + 1;
}
|
[["-", 15, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 15, 16, 31, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 91
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k); ++i)
#define BW(a, x, b) ((a) <= (x) && (x) <= (b))
#define ALL(v) (v).begin(), (v).end()
#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))
#define AFILL(a, b) fill((int *)a, (int *)(a + LENGTHOF(a)), b)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define INF 1 << 30
#define EPS 1e-10
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;
int N, M, I[1000000], O[1000000];
string P;
int main() {
while (scanf("%d", &N) && N) {
scanf("%d", &M);
cin >> P;
memset(I, 0, sizeof(I));
memset(O, 0, sizeof(O));
P[0] == 'I' ? I[0] : O[0] = 1;
P[1] == 'I' ? I[1] : O[1] = 1;
REP(i, 2, M) {
if (P[i] == 'I')
I[i] = I[i - 2] + 1;
else
O[i] = O[i - 2] + 1;
}
int res = 0;
rep(i, M - 1) {
if (O[i] >= N && I[i + 1] >= N + 1)
res++;
}
// rep(i, M) printf("%d ", I[i]); puts("");
// rep(i, M) printf("%d ", O[i]); puts("");
printf("%d\n", res);
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k); ++i)
#define BW(a, x, b) ((a) <= (x) && (x) <= (b))
#define ALL(v) (v).begin(), (v).end()
#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))
#define AFILL(a, b) fill((int *)a, (int *)(a + LENGTHOF(a)), b)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define INF 1 << 30
#define EPS 1e-10
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;
int N, M, I[1000000], O[1000000];
string P;
int main() {
while (scanf("%d", &N) && N) {
scanf("%d", &M);
cin >> P;
memset(I, 0, sizeof(I));
memset(O, 0, sizeof(O));
(P[0] == 'I' ? I[0] : O[0]) = 1;
(P[1] == 'I' ? I[1] : O[1]) = 1;
REP(i, 2, M) {
if (P[i] == 'I')
I[i] = I[i - 2] + 1;
else
O[i] = O[i - 2] + 1;
}
int res = 0;
rep(i, M - 1) {
if (O[i] >= N && I[i + 1] >= N + 1)
res++;
}
// rep(i, M) printf("%d ", I[i]); puts("");
// rep(i, M) printf("%d ", O[i]); puts("");
printf("%d\n", res);
}
return 0;
}
|
[["+", 8, 9, 0, 1, 0, 11, 31, 23, 0, 24], ["+", 8, 9, 0, 1, 0, 11, 31, 23, 0, 25]]
| 1
| 356
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
long n, m;
string s;
scanf(" %ld", &n);
if (n == 0)
break;
scanf(" %ld", &m);
cin >> s;
long a = 0;
long ans = 0;
long lim = m - 2 * n - 1;
while (a < m) {
long ct = 0;
if (s[a] == 'I') {
while (a < m && s[a + 1] == 'O' && s[a + 2] == 'I') {
a += 2;
ct++;
}
ct = ct - n + 1;
ans += ct;
}
++a;
// printf("%ld\n", a);
}
printf("%ld\n", ans);
}
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
long n, m;
string s;
scanf(" %ld", &n);
if (n == 0)
break;
scanf(" %ld", &m);
cin >> s;
long a = 0;
long ans = 0;
long lim = m - 2 * n - 1;
while (a < m) {
long ct = 0;
if (s[a] == 'I') {
while (a < m && s[a + 1] == 'O' && s[a + 2] == 'I') {
a += 2;
ct++;
}
ct = ct - n + 1;
if (ct > 0)
ans += ct;
}
++a;
// printf("%ld\n", a);
}
printf("%ld\n", ans);
}
}
|
[["+", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25]]
| 1
| 170
|
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, m, ans;
string str;
vector<int> v;
while (1) {
cin >> n;
if (n == 0)
break;
cin >> m;
cin >> str;
v.push_back(0);
v.push_back(0);
for (i = 2; i < m; i++) {
if (str[i] == 'I' && str[i - 1] == 'O' && str[i - 2] == 'I')
v.push_back(v[i - 2] + 1);
else
v.push_back(0);
}
ans = 0;
for (i = 2; i < m; i++) {
if (v[i] >= n)
ans++;
}
cout << ans << endl;
}
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, m, ans;
string str;
vector<int> v;
while (1) {
cin >> n;
if (n == 0)
break;
cin >> m;
cin >> str;
v.push_back(0);
v.push_back(0);
for (i = 2; i < m; i++) {
if (str[i] == 'I' && str[i - 1] == 'O' && str[i - 2] == 'I')
v.push_back(v[i - 2] + 1);
else
v.push_back(0);
}
ans = 0;
for (i = 2; i < m; i++) {
if (v[i] >= n)
ans++;
}
cout << ans << endl;
v.clear();
}
return 0;
}
|
[["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 188
|
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
while (true) {
int n, m;
static char str[1200000];
vector<int> c;
scanf("%d", &n);
if (n == 0)
break;
scanf("%d", &m);
scanf("%s", str);
c.reserve(m);
for (int i = 0; i < m; ++i) {
if (str[i] != 'I')
continue;
int it = i + 1;
int ioi = 0;
while (it < m - 1) {
if (str[i] == 'O' && str[i + 1] == 'I')
ioi += 1, it += 2;
else
break;
}
i = it - 1;
c.push_back(ioi);
}
int ans = 0;
for (int i = 0; i < c.size(); ++i) {
if (c[i] >= n)
ans += c[i] - n + 1;
}
printf("%d\n", ans);
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
while (true) {
int n, m;
static char str[1200000];
vector<int> c;
scanf("%d", &n);
if (n == 0)
break;
scanf("%d", &m);
scanf("%s", str);
c.reserve(m);
for (int i = 0; i < m; ++i) {
if (str[i] != 'I')
continue;
int it = i + 1;
int ioi = 0;
while (it < m - 1) {
if (str[it] == 'O' && str[it + 1] == 'I')
ioi += 1, it += 2;
else
break;
}
i = it - 1;
c.push_back(ioi);
}
int ans = 0;
for (int i = 0; i < c.size(); ++i) {
if (c[i] >= n)
ans += c[i] - n + 1;
}
printf("%d\n", ans);
}
return 0;
}
|
[["-", 51, 16, 31, 16, 31, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 16, 31, 69, 341, 342, 0, 22], ["-", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22]]
| 1
| 239
|
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
int main() {
ll d;
while (scanf("%lld", &d)) {
if (!d)
break;
int n, m;
scanf("%d%d", &n, &m);
ll store[n + 1], k;
store[0] = 0;
for (int i = 1; i < n; i++)
scanf("%lld", &store[i]);
sort(store, store + n);
store[n] = d;
ll res = 0;
for (int i = 0; i < m; i++) {
scanf("%lld", &k);
int pos = lower_bound(store, store + n, k) - store;
res += min(store[pos] - k, k - store[pos - 1]);
}
printf("%lld\n", res);
}
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
int main() {
ll d;
while (scanf("%lld", &d)) {
if (!d)
break;
int n, m;
scanf("%d%d", &n, &m);
ll store[n + 1], k;
store[0] = 0;
for (int i = 1; i < n; i++)
scanf("%lld", &store[i]);
sort(store, store + n);
store[n] = d;
ll res = 0;
for (int i = 0; i < m; i++) {
scanf("%lld", &k);
int pos = upper_bound(store, store + n, k) - store;
res += min(store[pos] - k, k - store[pos - 1]);
}
printf("%lld\n", res);
}
}
|
[["-", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22]]
| 1
| 199
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
inline int to_int(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string to_str(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
int main() {
// Flength:環状線の円周 store:店の数 order:注文の数 ans:answer
ll Flength, store, order, ans;
vector<ll> locate;
while (cin >> Flength) {
if (Flength == 0)
break;
cin >> store >> order;
ans = 0;
locate.clear();
ll wk;
for (int i = 0; i < store - 1; i++) {
cin >> wk;
locate.push_back(wk);
}
locate.push_back(0);
locate.push_back(Flength);
sort(locate.begin(), locate.end());
for (int i = 0; i < order; i++) {
cin >> wk;
ans += min(*(lower_bound(locate.begin(), locate.end(), wk)) - wk,
wk - *(lower_bound(locate.begin(), locate.end(), wk) - 1));
}
cout << ans << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
inline int to_int(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string to_str(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
int main() {
// Flength:環状線の円周 store:店の数 order:注文の数 ans:answer
ll Flength, store, order, ans;
vector<ll> locate;
while (cin >> Flength) {
if (Flength == 0)
break;
cin >> store >> order;
ans = 0;
locate.clear();
ll wk;
for (int i = 0; i < store - 1; i++) {
cin >> wk;
locate.push_back(wk);
}
locate.push_back(0);
locate.push_back(Flength);
sort(locate.begin(), locate.end());
for (int i = 0; i < order; i++) {
cin >> wk;
ans +=
min(abs(*(lower_bound(locate.begin(), locate.end(), wk)) - wk),
abs(wk - *(lower_bound(locate.begin(), locate.end(), wk) - 1)));
}
cout << ans << endl;
}
}
|
[["+", 0, 11, 12, 2, 3, 4, 0, 2, 63, 22], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 25], ["+", 3, 4, 0, 16, 12, 66, 28, 23, 0, 25]]
| 1
| 290
|
from bisect import bisect_left
while True:
d = int(input())
if not d:
break
n = int(input())
m = int(input())
stores = {0, d}
for i in range(2, n + 1):
stores.add(int(input()))
sorted_stores = sorted(stores)
total_dist = 0
while m:
k = int(input())
i = bisect_left(sorted_stores, k)
l, r = sorted_stores[i - 1:i + 1]
total_dist += min(k - l, r - k)
m -= 1
print(total_dist)
|
from bisect import bisect_left
while True:
d = int(input())
if not d:
break
n = int(input())
m = int(input())
stores = {0, d}
for i in range(2, n + 1):
stores.add(int(input()))
sorted_stores = sorted(stores)
total_dist = 0
while m:
k = int(input())
i = bisect_left(sorted_stores, k)
if i:
l, r = sorted_stores[i - 1:i + 1]
total_dist += min(k - l, r - k)
m -= 1
print(total_dist)
|
[["+", 8, 196, 0, 52, 8, 196, 0, 57, 0, 121], ["+", 8, 196, 0, 52, 8, 196, 0, 57, 15, 22], ["+", 8, 196, 0, 52, 8, 196, 0, 57, 0, 102]]
| 5
| 127
|
# AOJ 0539: Pizza
# Python3 2018.7.1 bal4u
import bisect
while True:
d = int(input())
if d == 0: break
n, m = int(input()), int(input())
p = [0] + [int(input()) for i in range(n-1)] + [d]
p.sort()
ans = 0
for i in range(m):
k = int(input())
t = bisect.bisect_left(p, k)
ans += min(k-p[t-1], p[t]-k)
print(ans)
|
# AOJ 0539: Pizza
# Python3 2018.7.1 bal4u
import bisect
while True:
d = int(input())
if d == 0: break
n, m = int(input()), int(input())
p = [0] + [int(input()) for i in range(n-1)] + [d]
p.sort()
ans = 0
for i in range(m):
k = int(input())
if k > 0:
t = bisect.bisect_left(p, k)
ans += min(k-p[t-1], p[t]-k)
print(ans)
|
[["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 102]]
| 5
| 123
|
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
struct Line {
int h, s, ur, ul, lr, ll;
Line() {}
Line(int h, int s, int ur = 0, int ul = 0, int lr = 0, int ll = 0)
: h(h), s(s), ur(ur), ul(ul), lr(lr), ll(ll) {}
bool operator<(const Line &r) const { return h < r.h; }
};
int N, M, H, K;
int s[1024], p[1024], st[1024];
Line L[100005];
int main() {
while (scanf("%d%d%d%d", &N, &M, &H, &K) && N || M || H || K) {
for (int i = 0; i < N; i++)
scanf("%d", &s[i]);
for (int i = 0; i < N; i++)
st[i] = i;
for (int i = 0; i < M; i++) {
int a, b;
scanf("%d%d", &a, &b);
a--;
L[i] = Line(b, a);
}
sort(L, L + M);
for (int i = 0; i < M; i++) {
Line &li = L[i];
li.ul = st[li.s];
li.ur = st[li.s + 1];
swap(st[li.s], st[li.s + 1]);
li.ll = st[li.s];
li.lr = st[li.s + 1];
}
for (int i = 0; i < N; i++)
p[st[i]] = i; // s[p[i]] := get point from p[i]
int sum = 0;
for (int i = 0; i < K; i++)
sum += s[p[i]];
int res = sum;
for (int i = 0; i < M; i++) {
Line li = L[i];
if (0 <= li.ul && li.ul <= K && 0 <= li.ur && li.ur <= K)
continue;
if (K < li.ur && K < li.ul)
continue;
if (0 <= li.ul && li.ul <= K) {
res = min(res, sum - s[p[li.ul]] + s[p[li.ur]]);
} else {
res = min(res, sum - s[p[li.ur]] + s[p[li.ul]]);
}
}
printf("%d\n", res);
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
struct Line {
int h, s, ur, ul, lr, ll;
Line() {}
Line(int h, int s, int ur = 0, int ul = 0, int lr = 0, int ll = 0)
: h(h), s(s), ur(ur), ul(ul), lr(lr), ll(ll) {}
bool operator<(const Line &r) const { return h < r.h; }
};
int N, M, H, K;
int s[1024], p[1024], st[1024];
Line L[100005];
int main() {
while (scanf("%d%d%d%d", &N, &M, &H, &K) && N || M || H || K) {
for (int i = 0; i < N; i++)
scanf("%d", &s[i]);
for (int i = 0; i < N; i++)
st[i] = i;
for (int i = 0; i < M; i++) {
int a, b;
scanf("%d%d", &a, &b);
a--;
L[i] = Line(b, a);
}
sort(L, L + M);
for (int i = 0; i < M; i++) {
Line &li = L[i];
li.ul = st[li.s];
li.ur = st[li.s + 1];
swap(st[li.s], st[li.s + 1]);
li.ll = st[li.s];
li.lr = st[li.s + 1];
}
for (int i = 0; i < N; i++)
p[st[i]] = i; // s[p[i]] := get point from p[i]
int sum = 0;
for (int i = 0; i < K; i++)
sum += s[p[i]];
int res = sum;
for (int i = 0; i < M; i++) {
Line li = L[i];
if (0 <= li.ul && li.ul < K && 0 <= li.ur && li.ur < K)
continue;
if (K <= li.ur && K <= li.ul)
continue;
if (0 <= li.ul && li.ul < K) {
res = min(res, sum - s[p[li.ul]] + s[p[li.ur]]);
} else {
res = min(res, sum - s[p[li.ur]] + s[p[li.ul]]);
}
}
printf("%d\n", res);
}
return 0;
}
|
[["-", 51, 16, 31, 16, 31, 16, 12, 16, 17, 19], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19]]
| 1
| 595
|
#include <stdio.h>
#define SIZE 1000
int main(void) {
int n, m, x, way, goal;
int i;
int grid[SIZE], dice[SIZE];
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
way = 0;
for (i = 0; i < SIZE; i++) {
grid[i] = 0;
dice[i] = 0;
}
for (i = 0; i < n; i++)
scanf("%d", &grid[i]);
for (i = 0; i < m; i++)
scanf("%d", &dice[i]);
for (i = 0; i < m; i++) {
way += dice[i];
way += grid[way];
if (way > n - 1) {
goal = i + 1;
break;
}
}
printf("%d\n", goal);
}
return 0;
}
|
#include <stdio.h>
#define SIZE 1000
int main(void) {
int n, m, x, way, goal;
int i;
int grid[SIZE], dice[SIZE];
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
way = 0;
for (i = 0; i < SIZE; i++) {
grid[i] = 0;
dice[i] = 0;
}
for (i = 0; i < n; i++)
scanf("%d", &grid[i]);
for (i = 0; i < m; i++)
scanf("%d", &dice[i]);
for (i = 0; i < m; i++) {
way += dice[i];
way += grid[way];
if (way >= n - 1) {
goal = i + 1;
break;
}
}
printf("%d\n", goal);
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20]]
| 0
| 213
|
main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
;
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n)
if (t += s[t += s[i]], t >= n & f == 1)
printf("%d\n", i - n, f = 0);
}
}
|
int main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n)
if (t += s[t += s[i]], t >= n & f == 1)
printf("%d\n", i - n, f = 0);
}
}
|
[["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["-", 0, 30, 0, 9, 0, 52, 8, 1, 0, 35]]
| 0
| 117
|
main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
;
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n)
if (t += s[t += s[i]], t >= n & f == 1)
printf("%d\n", i - n, f = 0);
}
}
|
main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n)
if (t += s[t += s[i]], t >= n & f == 1)
printf("%d\n", i - n, f = 0);
}
}
|
[["-", 0, 30, 0, 9, 0, 52, 8, 1, 0, 35]]
| 0
| 117
|
t[9999];
n, p, a;
main(x) {
for (; scanf("%d%d", &n, t) * n; printf("%d\n", a)) {
for (p = n; a = p;)
scanf("%d", t + p--);
for (; p++<*t; n -= x + t[n - x], a = a | n> 1 ? a : p)
scanf("%d", &x);
}
}
|
t[9999];
n, p, a;
main(x) {
for (; scanf("%d%d", &n, t) * n; printf("%d\n", a)) {
for (p = n; a = p;)
scanf("%d", t + p--);
for (; p++<*t; n> 1 ? n -= x + t[n - x] : 0, a = a | n > 1 ? a : p)
scanf("%d", &x);
}
}
|
[["+", 0, 7, 26, 34, 31, 41, 15, 16, 17, 47], ["+", 0, 7, 26, 34, 31, 41, 15, 16, 12, 13], ["+", 8, 9, 0, 7, 26, 34, 31, 41, 0, 101], ["+", 0, 7, 26, 34, 31, 41, 64, 11, 31, 22], ["+", 8, 9, 0, 7, 26, 34, 31, 41, 0, 102], ["+", 8, 9, 0, 7, 26, 34, 31, 41, 75, 13]]
| 0
| 111
|
t[];
main(x, n, p, a) {
for (; scanf("%d%d", &n, t) * n; printf("%d\n", a)) {
for (p = n; a = p;)
scanf("%d", t + p--);
for (; p++<*t; n> 1 ? n -= x + t[n - x] : 0, a = a | n > 1 ? a : p)
scanf("%d", &x);
}
}
|
t[999];
main(x, n, p, a) {
for (; scanf("%d%d", &n, t) * n; printf("%d\n", a)) {
for (p = n; a = p;)
scanf("%d", t + p--);
for (; p++<*t; n> 1 ? n -= x + t[n - x] : 0, a = a | n > 1 ? a : p)
scanf("%d", &x);
}
}
|
[["-", 0, 30, 0, 1, 0, 69, 0, 70, 0, 22], ["+", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13]]
| 0
| 118
|
#include <stdio.h>
int main() {
while (1) {
int n, m, i;
scanf("%d &d", &n, &m);
if (n == 0 && m == 0) {
break;
}
int masu[1001], me[1001];
for (i = 0; i < n; i++) {
scanf("%d", &masu[i + 1]);
}
for (i = 0; i < m; i++) {
scanf("%d", &me[i + 1]);
}
int masux = 1;
for (i = 0; i < m; i++) {
masux += me[i + 1];
int k = masux;
masux += masu[k];
if (masux >= n) {
printf("%d\n", i + 1);
}
}
}
return 0;
}
|
#include <stdio.h>
int main() {
while (1) {
int n, m, i;
scanf("%d %d", &n, &m);
if (n == 0 && m == 0) {
break;
}
int masu[1001], me[1001];
for (i = 0; i < n; i++) {
scanf("%d", &masu[i + 1]);
}
for (i = 0; i < m; i++) {
scanf("%d", &me[i + 1]);
}
int masux = 1;
for (i = 0; i < m; i++) {
masux += me[i + 1];
int k = masux;
masux += masu[k];
if (masux >= n) {
printf("%d\n", i + 1);
break;
}
}
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]]
| 0
| 183
|
#include <stdio.h>
int main(void) {
int sum;
int n;
int map[1000];
int i;
int m;
int ans;
int dice[1000];
int num;
while (1) {
scanf("%d %d", &n, &m);
if (!n && !m) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d", &map[i]);
}
sum = 1;
for (i = 0; i < m; i++) {
scanf("%d", &dice[i]);
}
for (i = 0; i < m; i++) {
sum += dice[i];
if (sum >= n) {
ans = i + 1;
break;
}
sum += map[sum - 1];
if (sum >= n) {
ans = i + 1;
}
}
printf("%d\n", ans);
}
return (0);
}
|
#include <stdio.h>
int main(void) {
int sum;
int n;
int map[1000];
int i;
int m;
int ans;
int dice[1000];
int num;
while (1) {
scanf("%d %d", &n, &m);
if (!n && !m) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d", &map[i]);
}
sum = 1;
for (i = 0; i < m; i++) {
scanf("%d", &dice[i]);
}
for (i = 0; i < m; i++) {
sum += dice[i];
if (sum >= n) {
ans = i + 1;
break;
}
sum += map[sum - 1];
if (sum >= n) {
ans = i + 1;
break;
}
}
printf("%d\n", ans);
}
return (0);
}
|
[["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]]
| 0
| 206
|
#include <stdio.h>
int main(void) {
int sum;
int n, m;
int map[1000];
int i;
int dice[1000];
while (1) {
scanf("%d %d", &n, &m);
if (!n && !m) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d", &map[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &dice[i]);
}
for (i = 0; i < m; i++) {
sum += dice[i];
if (sum >= n) {
printf("%d\n", i + 1);
break;
}
sum += map[sum - 1];
if (sum >= n) {
printf("%d\n", i + 1);
break;
}
}
}
return (0);
}
|
#include <stdio.h>
int main(void) {
int sum;
int n, m;
int map[1000];
int i;
int dice[1000];
while (1) {
scanf("%d %d", &n, &m);
if (!n && !m) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d", &map[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &dice[i]);
}
for (i = 0, sum = 1; i < m; i++) {
sum += dice[i];
if (sum >= n) {
printf("%d\n", i + 1);
break;
}
sum += map[sum - 1];
if (sum >= n) {
printf("%d\n", i + 1);
break;
}
}
}
return (0);
}
|
[["+", 0, 52, 8, 9, 0, 7, 10, 34, 0, 21], ["+", 8, 9, 0, 7, 10, 34, 12, 11, 31, 22], ["+", 8, 9, 0, 7, 10, 34, 12, 11, 17, 32], ["+", 8, 9, 0, 7, 10, 34, 12, 11, 12, 13]]
| 0
| 199
|
#include <stdio.h>
int main(void) {
int N, M;
int i, j;
int now;
int count;
int map[1000];
int X[1000];
while (1) {
scanf("%d %d", &N, &M);
if (N == 0 && M == 0) {
break;
}
for (i = 0; i < N; i++) {
scanf("%d", &map[i]);
}
for (j = 0; j < M; j++) {
scanf("%d", &X[j]);
}
now = 1;
j = 0;
count = 0;
while (now < N) {
now += X[j];
now += map[now - 1];
j++;
count++;
}
}
printf("%d\n", count);
return (0);
}
|
#include <stdio.h>
int main(void) {
int N, M;
int i, j;
int now;
int count;
int map[1000];
int X[1000];
while (1) {
scanf("%d %d", &N, &M);
if (N == 0 && M == 0) {
break;
}
for (i = 0; i < N; i++) {
scanf("%d", &map[i]);
}
for (j = 0; j < M; j++) {
scanf("%d", &X[j]);
}
now = 1;
j = 0;
count = 0;
while (now < N) {
now += X[j];
now += map[now - 1];
j++;
count++;
}
printf("%d\n", count);
}
return (0);
}
|
[["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 0
| 183
|
#include <stdio.h>
int main() {
int n, m, i, c, count, a[1000], b[1000], start;
while (1) {
start = 1;
count = 0;
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (i = 0; start >= 10; i++) {
c = start + b[i];
start += b[i] + a[c - 1];
count++;
if (start >= 10)
break;
}
printf("%d\n", count);
}
return 0;
}
|
#include <stdio.h>
int main() {
int n, m, i, c, count, a[1000], b[1000], start;
while (1) {
start = 1;
count = 0;
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < m; i++) {
c = start + b[i];
start += b[i] + a[c - 1];
count++;
if (start >= n)
break;
}
printf("%d\n", count);
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 20], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22]]
| 0
| 188
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int M, N;
int board[1001];
int dice[1001];
int pos;
int times;
while (cin >> N >> M, N || M) {
pos = 1;
times = 0;
for (int i = 1; i <= N; i++)
cin >> board[i];
for (int i = 1; i <= M; i++)
cin >> dice[i];
while (pos < N) {
times++;
pos += dice[times];
if (N <= pos)
break;
pos += board[pos];
}
cout << times;
}
}
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int M, N;
int board[1001];
int dice[1001];
int pos;
int times;
while (cin >> N >> M, N || M) {
pos = 1;
times = 0;
for (int i = 1; i <= N; i++)
cin >> board[i];
for (int i = 1; i <= M; i++)
cin >> dice[i];
while (pos < N) {
times++;
pos += dice[times];
if (N <= pos)
break;
pos += board[pos];
}
cout << times << endl;
}
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 153
|
#include <stdio.h>
int main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m) & n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n) {
t += s[t += s[i]];
if (t >= n & f == 1)
printf("%d\n", i, f = 0);
}
}
}
|
#include <stdio.h>
int main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n) {
t += s[t += s[i]];
if (t >= n & f == 1) {
printf("%d\n", i - n, f = 0);
;
}
}
}
}
|
[["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 67], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 64, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 119
|
#include <stdio.h>
int main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m) & n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n) {
t += s[t += s[i]];
if (t >= n & f == 1)
printf("%d\n", i, f = 0);
}
}
}
|
#include <stdio.h>
int main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n) {
t += s[t += s[i]];
if (t >= n & f == 1)
printf("%d\n", i - n, f = 0);
}
}
}
|
[["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 67], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 12, 22]]
| 1
| 119
|
#include <stdio.h>
main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), i = t = f = 1, n) {
while (i <= n + m) {
if (scanf("%d", &s[i]), i > n & (t += s[t += s[i]], t >= n & f == 1))
printf("%d\n", i - n, f = 0);
i++;
}
}
}
|
#include <stdio.h>
main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), i = t = f = 1, n) {
while (i <= n + m) {
if (scanf("%d", &s[i]), i > n && (t += s[t += s[i]], t >= n & f == 1))
printf("%d\n", i - n, f = 0);
i++;
}
}
}
|
[["-", 0, 57, 15, 339, 51, 34, 12, 16, 17, 67], ["+", 0, 57, 15, 339, 51, 34, 12, 16, 17, 98]]
| 1
| 120
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int N, M;
int d[1111];
int in[1111];
int main(int argc, char *argv[]) {
while (cin >> N >> M, N) {
rep(i, N) cin >> d[i];
rep(i, M) cin >> in[i];
int cur = 0;
rep(i, M) {
cur += in[i] + d[cur];
if (cur >= N - 1) {
cout << i + 1 << endl;
break;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int N, M;
int d[1111];
int in[1111];
int main(int argc, char *argv[]) {
while (cin >> N >> M, N) {
rep(i, N) cin >> d[i];
rep(i, M) cin >> in[i];
int cur = 0;
rep(i, M) {
cur += in[i] + d[cur + in[i]];
if (cur >= N - 1) {
cout << i + 1 << endl;
break;
}
}
}
return 0;
}
|
[["+", 12, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 12, 69, 341, 342, 0, 16, 12, 69, 28, 22], ["+", 341, 342, 0, 16, 12, 69, 341, 342, 0, 70], ["+", 341, 342, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 341, 342, 0, 16, 12, 69, 341, 342, 0, 73]]
| 1
| 131
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int turn;
int stepn = 0;
int sain = 0;
vector<int> outp;
for (turn = 0;; turn++) {
cin >> stepn;
cin >> sain;
if (stepn == 0 && sain == 0) {
break;
}
int pos = 0;
int g = 0;
vector<int> step(stepn, 0);
vector<int> sai(sain, 0);
sai.resize(sain, 0);
for (int n = 0; n < stepn; n++) {
cin >> step[n];
}
for (int n = 0; n < sain; n++) {
cin >> sai[n];
}
for (int t = 0; t < sain; t++) {
g += 1;
pos += sai[t];
pos += step[pos];
if (stepn - 1 <= pos) {
break;
}
}
outp.push_back(g);
}
for (int x = 0; x < turn; x++) {
cout << outp[x] << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int turn;
int stepn = 0;
int sain = 0;
vector<int> outp;
for (turn = 0;; turn++) {
cin >> stepn;
cin >> sain;
if (stepn == 0 && sain == 0) {
break;
}
int pos = 0;
int g = 0;
vector<int> step(stepn + 6, 0);
vector<int> sai(sain, 0);
sai.resize(sain, 0);
for (int n = 0; n < stepn; n++) {
cin >> step[n];
}
for (int n = 0; n < sain; n++) {
cin >> sai[n];
}
for (int t = 0; t < sain; t++) {
g += 1;
pos += sai[t];
pos += step[pos];
if (stepn <= pos + 1) {
break;
}
}
outp.push_back(g);
}
for (int x = 0; x < turn; x++) {
cout << outp[x] << endl;
}
return 0;
}
|
[["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]]
| 1
| 235
|
#include <cstdio>
using namespace std;
int main() {
int n, m;
while (1) {
int ban[1000] = {0};
int sai[1000] = {0};
int sum = 1;
int pt;
scanf("%d %d", &n, &m);
if (n == 0 && m == 0) {
break;
}
for (int i = 0; i < n; i++) {
scanf("%d", &ban[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &sai[i]);
}
for (int i = 0; i < m; i++) {
sum += sai[i] + ban[sum - 1];
// printf("sum = %d\n", sum);
if (sum >= n) {
pt = i + 1;
break;
}
}
printf("%d\n", pt);
}
return (0);
}
|
#include <cstdio>
using namespace std;
int main() {
int n, m;
while (1) {
int ban[1000] = {0};
int sai[1000] = {0};
int sum = 1;
int pt;
scanf("%d %d", &n, &m);
if (n == 0 && m == 0) {
break;
}
for (int i = 0; i < n; i++) {
scanf("%d", &ban[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &sai[i]);
}
for (int i = 0; i < m; i++) {
sum += sai[i];
sum += ban[sum - 1];
// printf("sum = %d\n", sum);
if (sum >= n) {
pt = i + 1;
break;
}
}
printf("%d\n", pt);
}
return (0);
}
|
[["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107]]
| 1
| 198
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define INF 100000000
using namespace std;
typedef pair<int, int> P;
int S[1001];
int main() {
int n, m, ans;
while (cin >> n >> m && (n != 0 || m != 0)) {
for (int i = 0; i < n; i++)
cin >> S[i];
int pos = 1;
for (ans = 1; ans <= m; ans++) {
int d;
cin >> d;
pos += d;
if (pos >= n)
break;
pos += S[pos];
if (pos >= n)
break;
}
for (int i = ans; i < m; i++)
cin >> n;
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define INF 100000000
using namespace std;
typedef pair<int, int> P;
int S[1001];
int main() {
int n, m, ans;
while (cin >> n >> m && (n != 0 || m != 0)) {
for (int i = 1; i <= n; i++)
cin >> S[i];
int pos = 1;
for (ans = 1; ans <= m; ans++) {
int d;
cin >> d;
pos += d;
if (pos >= n)
break;
pos += S[pos];
if (pos >= n)
break;
}
for (int i = ans; i < m; i++)
cin >> n;
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, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 179
|
#include <bits/stdc++.h>
#define LL long long
using namespace std;
static const LL INF = 1LL << 60LL;
typedef pair<int, int> pii;
int n, m;
int C[2016], D[2016];
int res;
int place = 1;
int main() {
while (1) {
cin >> n >> m;
if (n == 0 && m == 0)
break;
memset(C, 0, sizeof(C));
memset(D, 0, sizeof(D));
for (int i = 1; i <= n; ++i) {
cin >> C[i];
}
for (int i = 1; i <= m; ++i) {
cin >> D[i];
}
for (int i = 1; i <= m; ++i) {
place += D[i];
place += C[place];
res++;
if (place >= n)
break;
}
cout << res << endl;
res = 0;
place = 0;
}
}
|
#include <bits/stdc++.h>
#define LL long long
using namespace std;
static const LL INF = 1LL << 60LL;
typedef pair<int, int> pii;
int n, m;
int C[2016], D[2016];
int res;
int place = 1;
int main() {
while (1) {
cin >> n >> m;
if (n == 0 && m == 0)
break;
memset(C, 0, sizeof(C));
memset(D, 0, sizeof(D));
for (int i = 1; i <= n; ++i) {
cin >> C[i];
}
for (int i = 1; i <= m; ++i) {
cin >> D[i];
}
for (int i = 1; i <= m; ++i) {
place += D[i];
place += C[place];
res++;
if (place >= n)
break;
}
cout << res << endl;
res = 0;
place = 1;
}
}
|
[["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13]]
| 1
| 206
|
#include <iostream>
using namespace std;
#define loop(i, n) for (int i = 1; i <= n; i++)
int n, m;
int order[1002];
int dice[1002];
int solve() {
int pos = 1;
loop(i, n) cin >> order[i];
loop(j, m) cin >> dice[j];
for (int t = 1; t <= m; t++) {
pos += dice[t];
if (pos >= n)
return t;
pos += order[pos];
if (pos >= n)
return t;
}
}
int main() {
cin >> n >> m;
while (n || m) {
solve();
cin >> n >> m;
}
return 0;
}
|
#include <iostream>
using namespace std;
#define loop(i, n) for (int i = 1; i <= n; i++)
int n, m;
int order[1002];
int dice[1002];
int solve() {
int pos = 1;
loop(i, n) cin >> order[i];
loop(j, m) cin >> dice[j];
for (int t = 1; t <= m; t++) {
pos += dice[t];
if (pos >= n)
return t;
pos += order[pos];
if (pos >= n)
return t;
}
}
int main() {
cin >> n >> m;
while (n || m) {
cout << solve() << endl;
cin >> n >> m;
}
return 0;
}
|
[["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 151
|
#include <stdio.h>
int main(void) {
int i, mas, book;
while (scanf("%d", &mas) != EOF) {
for (i = 0; i < 9; i++) {
scanf("%d", &book);
mas -= book;
}
printf("%d\n", mas);
}
return (0);
}
|
#include <stdio.h>
int main(void) {
int i, mas, book;
while (scanf("%d", &mas) && mas != 0) {
for (i = 0; i < 9; i++) {
scanf("%d", &book);
mas -= book;
}
printf("%d\n", mas);
}
return (0);
}
|
[["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 98], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 31, 22], ["-", 8, 9, 0, 52, 15, 23, 0, 16, 12, 22], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 12, 13]]
| 0
| 76
|
#include <stdio.h>
int main(void) {
int i;
int sum;
int price;
int amount;
while (1) {
scanf("%d", &amount);
if (amount == 0) {
break;
}
sum = 0;
for (i = 0; i < 9; i++) {
scanf("%d", &price);
sum += price;
}
}
printf("%d\n", amount - sum);
return (0);
}
|
#include <stdio.h>
int main(void) {
int i;
int sum;
int price;
int amount;
while (1) {
scanf("%d", &amount);
if (amount == 0) {
break;
}
sum = 0;
for (i = 0; i < 9; i++) {
scanf("%d", &price);
sum += price;
}
printf("%d\n", amount - sum);
}
return (0);
}
|
[["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 0
| 97
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.