solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long int n;
cin >> n;
getline(cin, s);
getline(cin, s);
long long int l = s.length();
long long int a = 0, ii = 0, f = 0;
for (long long int i = 0; i < l; i++) {
if (s[i] == 'A') {
a++;
} else {
if (s[i] == 'I') {
ii++;
} else {
f++;
}
}
}
if (ii == 0) {
cout << a << endl;
} else {
if (ii == 1) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
long long LLMAX = 9223372036854775807LL;
const int maxn = 1000 + 10;
char str[200000 + 100];
int main() {
int ans = 0, n;
int cnt[3] = {0};
scanf("%d\n", &n);
gets(str);
for (int i = 0; i < n; ++i) {
if (str[i] == 'A')
cnt[0]++;
else if (str[i] == 'F')
cnt[1]++;
else
cnt[2]++;
}
if (cnt[2] > 0) {
if (cnt[2] == 1)
puts("1");
else
puts("0");
} else
printf("%d\n", cnt[0]);
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, i, c = 0, x, y, z;
cin >> a;
char s[200001];
cin >> s;
x = count(s, s + a, 'A');
y = count(s, s + a, 'I');
z = count(s, s + a, 'F');
if (y == 1) {
cout << "1";
} else if (y == 0) {
cout << x;
} else {
cout << "0";
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5;
int a[N];
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ii = 0, aa = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'I') ii++;
if (s[i] == 'A') aa++;
}
if (ii > 1) cout << 0 << endl;
if (ii == 1) cout << 1 << endl;
if (ii == 0) cout << aa << endl;
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
string str, str2;
long long n, m, t, k, j, p;
void printVec(string desc, vector<unsigned long long> vec) {
cout << desc << ":" << endl;
for (unsigned long long x = 0; x < vec.size(); x++) {
cout << vec[x] << " ";
}
cout << endl;
}
int main() {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
cin >> n;
cin >> str;
int data[3];
memset(data, 0, sizeof(data));
for (int x = 0; x < n; x++) {
if (str[x] == 'A') {
data[0]++;
} else if (str[x] == 'F') {
data[1]++;
} else {
data[2]++;
}
}
int total = 0;
if (data[2] == 0) {
total += data[0];
}
if (data[2] == 1) {
total += 1;
}
cout << total << endl;
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
char niz[200100];
int b[256];
int main() {
int n, i, j;
scanf("%d\n", &n);
scanf("%s", niz);
for (i = 0; i < n; i++) {
b[niz[i]]++;
}
if (b['I']) {
if (b['I'] > 1) {
printf("0\n");
} else {
printf("1\n");
}
} else {
printf("%d\n", b['A']);
}
return 0;
}
| 8 |
CPP
|
i=input;i();p=i();print([[1,0],[p.count("A")]][p.count("I")==0][p.count("I")>1])
| 8 |
PYTHON3
|
import sys
import math
n = int(sys.stdin.readline())
an = sys.stdin.readline()
d = [0] * 3
for i in range(n):
if(an[i] == 'A'):
d[0] += 1
elif(an[i] == 'F'):
d[1] += 1
elif(an[i] == 'I'):
d[2] += 1
if(d[2] == 1):
if(d[1] != 0 or d[0] != 0):
print(d[2])
else:
print(0)
elif(d[0] != 0 and d[2] == 0):
print(d[0])
else:
print(0)
| 8 |
PYTHON3
|
n = int(input())
s = input()
print([s.count('A'),1,0][min(s.count('I'),2)])
| 8 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int na, nf, ni;
int main() {
string s;
na = nf = ni = 0;
int n;
cin >> n;
cin >> s;
for (int i = 0; i < s.size(); ++i) {
na += (s[i] == 'A');
nf += (s[i] == 'F');
ni += (s[i] == 'I');
}
if (ni == 0)
cout << na << endl;
else if (ni == 1)
cout << 1 << endl;
else
cout << 0 << endl;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
using namespace std;
char str[300008];
int main() {
int t;
cin >> t;
cin >> str;
int i, ci = 0, ca = 0, cf = 0;
for (i = 0; i <= t - 1; i++) {
if (str[i] == 'I') ci++;
if (str[i] == 'A') ca++;
if (str[i] == 'F') cf++;
}
if (ci == 0) cout << ca;
if (ci == 1) cout << ci;
if (ci > 1) cout << "0";
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a[1000];
int main() {
cin >> n;
for (int i = 0; i < int(n); ++i) {
char c;
cin >> c;
a[c]++;
}
if (a['I'] > 1) {
cout << 0;
} else if (a['I'] == 1) {
cout << 1;
} else {
cout << a['A'];
}
return 0;
}
| 8 |
CPP
|
n=int(input())
s=input()
i=s.count("I")
a=s.count("A")
if i==1:
print(1)
elif i>1:
print(0)
else:
print(s.count("A"))
| 8 |
PYTHON3
|
#include <bits/stdc++.h>
char S[200001];
int a, i, j, n, w;
int main() {
scanf("%d %s", &n, S);
for (j = 0; S[j]; j++) {
if (S[j] == 'I')
i++;
else if (S[j] == 'A')
a++;
}
if (i == 1)
w = 1;
else if (i > 1)
w = 0;
else
w = a;
printf("%d\n", w);
return 0;
}
| 8 |
CPP
|
from collections import Counter, defaultdict
BS="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
def to_base(s, b):
res = ""
while s:
res+=BS[s%b]
s//= b
return res[::-1] or "0"
alpha = "abcdefghijklmnopqrstuvwxyz"
from math import floor, ceil,pi
tot = 0
n = int(input())
s = list(input())
c = Counter(s)
for i in s:
if i=="F":
continue
else:
c[i] -= 1
if c["I"]==0:
tot += 1
c[i] += 1
print(tot)
| 8 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int a = count(s.begin(), s.end(), 'A');
int i = count(s.begin(), s.end(), 'I');
if (i == 0) {
cout << a;
} else if (i == 1) {
cout << 1;
} else {
cout << 0;
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char s[200005];
int main() {
int n;
cin >> n;
scanf("%s", s);
int res1 = 0, res2 = 0;
for (int i = 0; i <= n; i++) {
if (s[i] == 'A') res1++;
if (s[i] == 'I') res2++;
}
if (res2 == 0) {
printf("%d", res1);
} else if (res2 == 1) {
printf("%d", res2);
} else
printf("0");
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k;
string s;
cin >> n;
cin >> s;
int flag = 0;
j = 0;
for (i = 0; i < n; i++)
if (s[i] == 'A')
j++;
else if (s[i] == 'I' && flag == 0)
flag = 1;
else if (s[i] == 'I' && flag == 1)
flag = 2;
if (!flag)
cout << j << endl;
else if (flag == 1)
cout << "1" << endl;
else
cout << "0" << endl;
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, b = 0, k = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'I') k++;
if (s[i] == 'A') b++;
}
if (k == 0)
cout << b;
else if (k == 1)
cout << 1;
else
cout << 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char s;
int a = 0, i = 0;
for (int j = 0; j < n; j++) {
cin >> s;
if (s == 'A') {
a++;
} else if (s == 'I') {
i++;
}
}
if (i == 1) {
cout << 1 << endl;
} else if (i == 0) {
cout << a << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| 8 |
CPP
|
n = int(input())
table = input()
if table.count("I") > 1 :
print(0)
elif table.count("I") == 1 :
print(1)
else:
print(table.count("A"))
| 8 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
template <class stl>
void DBGSTL(stl a) {
for (__typeof((a).begin()) i = (a).begin(); i != (a).end(); i++) {
cerr << *i << " ";
}
cerr << "\n";
return;
}
int main() {
string s;
int n;
cin >> n;
cin >> s;
int a = 0, in = 0, f = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A') a++;
if (s[i] == 'I') in++;
if (s[i] == 'F') f++;
}
if (in == 0) {
cout << a << "\n";
} else if (in == 1) {
cout << 1 << "\n";
} else {
cout << 0 << endl;
}
return 0;
}
| 8 |
CPP
|
n = int(input())
s = input()
count = {}
for x in s:
count[x] = count.get(x, 0) + 1
ans = 0
for x in s:
if x in 'AI':
count[x] -= 1
if count.get('I', 0) == 0:
ans += 1
count[x] += 1
print(ans)
| 8 |
PYTHON3
|
n=int(input())
s=input()
a,f,i=s.count('A'),s.count('F'),s.count('I')
if a+f==n:
print(a)
elif a==n:
print(a)
elif f==n or i==n:
print(0)
elif i==1:
print(i)
elif i>1:
print(0)
| 8 |
PYTHON3
|
#!/usr/bin/env python
import os
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from io import BytesIO, IOBase
from itertools import (
accumulate, combinations, combinations_with_replacement, groupby,
permutations, product)
from math import (
acos, asin, atan, ceil, cos, degrees, factorial, hypot, log2, pi, radians,
sin, sqrt, tan)
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits
def inp():
return(int(input()))
def inlist():
return(list(map(int, input().split())))
def instr():
s = input()
return(list(s[:len(s)]))
def invr():
return(map(int, input().split()))
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input(): return sys.stdin.readline().rstrip("\r\n")
# endregion
n = inp()
a = input()
count = defaultdict(lambda: 0)
for i in a:
count[i] += 1
res = 0
for i in a:
if i == "A":
if count["A"] + count["F"] == n:
res += 1
elif i == "I":
if count["A"] + count["F"] == n-1:
res += 1
print(res)
| 8 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
constexpr int N = 1e5 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
string s;
cin >> s;
int cnt1 = 0;
for (char c : s)
if (c == 'I') cnt1++;
if (cnt1 > 1)
cout << 0;
else if (cnt1 == 1)
cout << 1;
else {
int res = 0;
for (char c : s)
if (c == 'A') res++;
cout << res << endl;
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 29;
const double dinf = 1e30;
const long long linf = 1LL << 55;
int n;
string str;
int main() {
while (cin >> n >> str) {
int cntI = 0;
int cntA = 0;
for (int i = 0; i < str.length(); i++) {
cntI += str[i] == 'I';
cntA += str[i] == 'A';
}
if (cntI >= 2) {
cout << 0 << endl;
} else if (cntI == 1) {
cout << 1 << endl;
} else
cout << cntA << endl;
}
return 0;
}
| 8 |
CPP
|
n=int(input())
s=input()
a=s.count("I")
if(a==1):
print(a)
elif(a>1):
print("0")
else:
print(s.count("A"))
| 8 |
PYTHON3
|
S = int(input())
A = input()
As = A.count('A')
Fs = A.count('F')
Is = A.count('I')
ans = 0
if Is > 1:
print(ans)
else:
ans += Is
if Is == 0:
ans += As
print(ans)
| 8 |
PYTHON3
|
from collections import defaultdict
MyDict = defaultdict(int)
input()
for i in input():
MyDict[i] += 1
print((0 if "A" not in MyDict.keys() else MyDict["A"]) if "I" not in MyDict.keys() else (0 if MyDict["I"] != 1 else 1))
# UB_CodeForces
# Advice: Falling down is an accident, staying down is a choice
# Location: Here in Bojnurd
# Caption: So Close man!! Take it easy!!!!
# CodeNumber: 650
| 8 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count1 = 0, count2 = 0;
cin >> n;
char a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 'I') {
count1++;
}
if (a[i] == 'A') {
count2++;
}
}
if (count1 == 0) {
cout << count2 << "\n";
} else if (count1 == 1)
cout << "1"
<< "\n";
else
cout << "0\n";
return 0;
}
| 8 |
CPP
|
n = int(input())
c = input()
f = c.count("F")
a = c.count("A")
i = c.count("I")
if i > 1:
print(0)
elif i == 1:
print(1)
else:
print(a)
| 8 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int n, k, k1, h, t, i, j, a, b, c, l, sum, num;
char s;
int main() {
ios::sync_with_stdio(false);
cin >> n;
k = 0;
a = 0;
while (n--) {
cin >> s;
if (s == 'I')
k++;
else if (s == 'A')
a++;
}
if (k == 0)
cout << a << endl;
else if (k == 1)
cout << '1' << endl;
else
cout << '0' << endl;
}
| 8 |
CPP
|
z=int(input());a=i=0
for k in input():
if k=='A':
a+=1
elif k== 'I':
i+=1
if i>1 or a+i==0:
print(0)
else:
print(['%d'%i,'%d'%a][i==0])
| 8 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
char b[a];
cin >> b;
int c = 0, d = 0;
for (int i = 0; i < a; i++) {
if (b[i] == 'A') {
c++;
}
if (b[i] == 'I') {
d++;
}
}
if (d != 0) {
if (d > 1) {
cout << "0" << endl;
} else {
cout << "1" << endl;
}
} else {
cout << c << endl;
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int all = 0, in = 0;
for (int x = 0; x < n; x++) {
if (s[x] == 'A') all += 1;
if (s[x] == 'I') in += 1;
}
if (in > 1)
cout << 0;
else if (in < 1)
cout << all;
else if (in == 1)
cout << 1;
return 0;
}
| 8 |
CPP
|
n = int(input())
adict = {}
adict['A'] = 0
adict['F'] = 0
adict['I'] = 0
s = input()
for a in s:
if a=='A':
adict['A'] += 1
elif a=='F':
adict['F'] += 1
elif a=='I':
adict['I'] += 1
count = 0
if adict['I']==0:
count += adict['A']
if adict['I']==1:
count += adict['I']
print(count)
| 8 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T a) {
return a * a;
}
template <class T>
T abs(T x) {
if (x < 0) return -x;
return x;
}
const double eps = 1e-8;
const double pi = acos(-1.0);
char str[200010];
int main() {
int n, i, f, a, b;
while (1 == scanf("%d", &n)) {
f = a = b = 0;
scanf("%s", str);
for (i = 0; i < n; i++) {
if (str[i] == 'F')
f++;
else if (str[i] == 'A')
a++;
else
b++;
}
if (b == 1)
printf("%d\n", b);
else if (b)
printf("%d\n", 0);
else
printf("%d\n", a);
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
using namespace std;
int main() {
int n;
cin >> n;
string second;
cin >> second;
int cnta = 0, cnti = 0, cntf = 0;
for (int i = 0; i < n; i++) {
if (second[i] == 'A') {
cnta++;
} else if (second[i] == 'I') {
cnti++;
} else
cntf++;
}
if (cnti == 0 && cnta >= 1)
cout << cnta;
else if (cnti == 1)
cout << cnti;
else
cout << 0;
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
int main() {
int n, c = 0, f = 0, in = 0, al = 0, i;
char a[200005];
scanf("%d", &n);
getchar();
for (i = 0; i < n; i++) {
scanf("%c", &a[i]);
if (a[i] == 'A')
al++;
else if (a[i] == 'I')
in++;
else
f++;
}
for (i = 0; i < n; i++) {
if (a[i] == 'A') {
if (in == 0) c++;
} else if (a[i] == 'I') {
if (in == 1) c++;
}
}
printf("%d\n", c);
return (0);
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char s[200001];
int ii, ia;
int main() {
int n;
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; s[i] != '\0'; i++)
if (s[i] == 'I')
ii++;
else if (s[i] == 'A')
ia++;
if (ii > 1)
printf("%d\n", 0);
else if (ii == 1)
printf("%d\n", 1);
else
printf("%d\n", ia);
return 0;
}
| 8 |
CPP
|
n=int(input())
a=input()
allin=0
in1=0
fold=0
for z in a:
if z=='A':
allin+=1
elif z=='F':
fold+=1
else:
in1+=1
if in1>=2:
print(0)
elif in1==1:
print(1)
else:
print(allin)
| 8 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int players;
cin >> players;
int probably = 0;
int prob_not = 0;
vector<char> choices;
for (int i = 0; i < players; i++) {
char status;
cin >> status;
if (status == 'I') prob_not++;
if (status != 'F') probably++;
choices.push_back(status);
}
if (prob_not == 1 && probably > 1)
cout << 1 << endl;
else if (prob_not > 1)
cout << 0 << endl;
else
cout << probably << endl;
cout << endl;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cont = 0;
cin >> n;
char a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 'I') cont++;
}
if (cont == 1) cout << "1";
if (cont > 1) cout << "0";
if (cont == 0) {
for (int i = 0; i < n; i++) {
if (a[i] == 'A') cont++;
}
cout << cont;
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
int main() {
int i;
int j;
int n;
scanf("%d", &n);
char a[n];
scanf("%s", a);
int toplam = 0;
int Isayisi = 0;
int Fsayisi = 0;
int Asayisi = 0;
for (i = 0; i < n; i++) {
switch (a[i]) {
case 'A':
Asayisi++;
break;
case 'F':
Fsayisi++;
break;
case 'I':
Isayisi++;
break;
}
}
if (Isayisi == 1)
printf("1");
else if (Isayisi > 1)
printf("0");
else
printf("%d", Asayisi);
}
| 8 |
CPP
|
n = int(input())
s = str(input())
s = s.replace('F','')
if s.count('I')>=2:
print(0)
elif s.count('I')==1:
print(1)
elif s.count('I')==0:
print(s.count('A'))
| 8 |
PYTHON3
|
n=int(input())
s=input()
if(s.count('I')==0):
print(s.count('A'))
elif(s.count('I')>1):
print('0')
else:
print('1')
| 8 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000100, L = 5000500, BufL = 220;
char ch[N + L] = {}, buf[BufL] = {};
int n, r, c, l, a[N] = {}, p[N] = {}, f[N] = {}, g[N] = {};
int main() {
gets(buf + 1);
sscanf(buf + 1, "%d%d%d", &n, &r, &c);
gets(ch + 1);
l = strlen(ch + 1);
for (int i = 1, tot = 0; i <= l; ++i)
if (isalpha(ch[i])) {
p[++tot] = i;
while (i <= l && isalpha(ch[i])) ++a[tot], ++i;
}
for (int i = 1; i <= n + 1; ++i) g[i] = i;
for (int i = 1, t = 0, s = -1; i <= n; s -= a[i++] + 1) {
while (t <= n && s <= c) s += a[++t] + 1;
f[i] = t;
}
f[n + 1] = n + 1;
for (; r; r >>= 1) {
if (r & 1)
for (int i = 1; i <= n; ++i) g[i] = f[g[i]];
for (int i = 1; i <= n; ++i) f[i] = f[f[i]];
}
int ans = 0;
for (int i = 1; i <= n; ++i)
if (g[i] - i > g[ans] - ans) ans = i;
for (int i = ans, s = c; i < g[ans]; ++i) {
if (s + a[i] + 1 <= c) {
s += a[i] + 1;
putchar(' ');
} else {
if (i > ans) puts("");
s = a[i];
}
for (int j = p[i]; j < p[i] + a[i]; ++j) putchar(ch[j]);
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int N, L, R, C, s[1000005], l[1000005], f[1000005], d[1000005], p[1000005],
q[1000005];
string S = "", a[1000005];
vector<int> e[1000005];
void init() {
scanf("%d%d%d", &N, &R, &C), L = log(N) / log(2);
for (int i = 1; i <= N; i++)
cin >> a[i], S += a[i] + " ", l[i] = a[i].size() + 1;
for (int i = 1; i <= N; i++) s[i] = s[i - 1] + l[i];
}
void dfs(int u, int k) {
p[u] = k;
for (int v : e[u]) q[u] = v, dfs(v, d[u] - d[k] < R ? k : q[k]);
}
void doit() {
int ans = 0, o;
for (int i = 1, j = 0; i <= N; i++) {
for (; j < N && s[j + 1] - s[i - 1] - 1 <= C; j++)
;
if (j >= i) f[i] = j + 1, e[j + 1].push_back(i);
}
for (int i = N; i; i--) d[i] = d[f[i]] + 1;
for (int i = 1; i <= N + 1; i++)
if (!f[i]) dfs(i, i);
for (int i = 1; i <= N; i++)
if (p[i] - i > ans) ans = p[i] - i, o = i;
for (int i = o; i < o + ans; i = f[i])
for (int j = i; j < f[i]; j++)
printf("%s%c", a[j].c_str(), j == f[i] - 1 ? '\n' : ' ');
}
int main() {
init();
doit();
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = int(1e6) + 10;
const int MAX_M = 21;
int n, r, c;
int a[MAX_N], b[MAX_N];
int f[MAX_N][MAX_M];
char buffer[MAX_N * 6];
int main() {
scanf("%d%d%d\n", &n, &r, &c);
c++;
gets(buffer);
int m = strlen(buffer);
buffer[m++] = ' ';
for (int i = 0, j = 0; i < n; i++, j++) {
b[i] = j;
for (a[i] = 0; j < m && buffer[j] != ' '; j++, a[i]++)
;
}
b[n] = m;
for (int i = 0, j = 0, sum = 0; i < n; i++) {
for (; j < n && sum + a[j] + 1 <= c; sum += a[j++] + 1)
;
f[i][0] = j - i;
if (i < j) {
sum -= a[i] + 1;
} else {
j++;
}
}
for (int j = 1; 1 << j <= r; j++) {
for (int i = 0; i < n; i++) {
f[i][j] = f[i][j - 1] + f[i + f[i][j - 1]][j - 1];
}
}
int result = 0, start = 0, l = 0;
for (; 1 << l <= r; l++)
;
for (int i = 0; i < n; i++) {
int sum = 0, tmp = r;
for (int k = l; k >= 0; k--) {
if (tmp - (1 << k) >= 0) {
sum += f[i + sum][k];
tmp -= 1 << k;
}
}
if (sum > result) {
result = sum;
start = i;
}
}
for (int i = 0, p = start; i < r; i++) {
int sum = 0;
for (; p < n && (sum + a[p] + 1) <= c; sum += a[p++] + 1) {
if (sum > 0) {
putchar(' ');
}
for (int j = b[p]; j < b[p + 1] - 1; j++) {
putchar(buffer[j]);
}
}
if (sum > 0) {
puts("");
}
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void gmin(T &a, T b) {
if (a > b) a = b;
}
template <class T>
inline void gmax(T &a, T b) {
if (a < b) a = b;
}
inline int sign(const double &a) { return a > 1e-9 ? 1 : (a < -1e-9 ? -1 : 0); }
struct Initializer {
Initializer() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
~Initializer() {}
} initializer;
char st[10001000];
int col[10001000];
vector<int> a;
vector<vector<int> > to;
vector<int> sum(1), opt(1);
vector<int> u(1), v;
int ans = -1, n, c, r, l, p, q;
void dfs(int first) {
sum.push_back(sum.back() + a[first]);
int tmp = sum.back() - sum[max(0, int(sum.size()) - 1 - r)];
if (ans < tmp && tmp > 0) {
ans = tmp;
p = max(0, int(sum.size()) - 1 - r) + 1;
q = int(sum.size()) - 1;
}
for (int i = 0; i <= int(to[first].size()) - 1; i++) {
dfs(to[first][i]);
}
sum.pop_back();
}
void prt(int first, int second) {
string ss;
for (int i = first; i <= l - 1; i++) {
if (st[i] == ' ') continue;
if (i > first) putchar(' ');
int j = i;
for (; j + 1 < l && st[j + 1] != ' '; j++)
;
for (int k = i; k <= j; k++) putchar(st[k]);
second--;
if (second == 0) return;
i = j;
}
}
void dfs2(int first) {
sum.push_back(sum.back() + a[first]);
opt.push_back(first);
int tmp = sum.back() - sum[max(0, int(sum.size()) - 1 - r)];
if (ans == tmp) {
for (int i = q; i >= p; i--) {
prt(u[opt[i]], a[opt[i]]);
putchar(10);
}
exit(0);
}
for (int i = 0; i <= int(to[first].size()) - 1; i++) {
dfs2(to[first][i]);
}
sum.pop_back();
opt.pop_back();
}
int main() {
scanf("%d%d%d\n", &n, &r, &c);
gets(st);
l = strlen(st);
st[l] = ' ';
st[l + 1] = 0;
l++;
for (int i = 0; i <= l - 1; i++) {
col[i] = int(u.size());
if (st[i + 1] == ' ') {
v.push_back(i);
u.push_back(i + 2);
}
}
if (int(u.size()) > int(v.size())) u.pop_back();
for (int i = 0; i <= n - 1; i++) {
if (u[i] + c <= l - 1)
a.push_back(col[u[i] + c] - col[u[i]]);
else
a.push_back(n + 1 - col[u[i]]);
}
vector<int> din(n + 1);
to.resize(n + 1);
for (int i = 0; i <= n - 1; i++) {
if (i + a[i] <= n - 1) {
if (a[i] == 0 || a[i + a[i]] == 0) continue;
to[i + a[i]].push_back(i);
din[i]++;
}
}
for (int i = 0; i <= n - 1; i++)
if (din[i] == 0) dfs(i);
for (int i = 0; i <= n - 1; i++)
if (din[i] == 0) dfs2(i);
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e6 + 10;
const int LOG = 22;
string str[N];
int len[N];
int sumPref[N];
int dp[N][LOG];
int getCntSumbol(int a, int b) {
if (b == a) return len[a];
return (b - a + sumPref[b] - (a == 0 ? 0 : sumPref[a - 1]));
}
int getDp(int val, int t) {
if (val == -1) return val;
return dp[val][t];
}
void printAns(int v, int r, int c, int n) {
int curC = c;
bool wasEnd = true;
while (r > 0 && v < n) {
if (curC >= len[v] && wasEnd) {
wasEnd = false;
cout << str[v];
if (curC != len[v]) cout << ' ';
curC -= len[v];
v++;
} else if (curC >= len[v] + 1 && !wasEnd) {
wasEnd = false;
cout << str[v];
if (curC != len[v] + 1) cout << ' ';
curC -= len[v] + 1;
v++;
} else {
if (!wasEnd) cout << endl;
wasEnd = true;
r--;
curC = c;
}
}
}
int main() {
int n, r, c;
scanf("%d%d%d", &n, &r, &c);
for (int i = 0; i < n; i++) {
cin >> str[i];
len[i] = str[i].length();
}
sumPref[0] = len[0];
for (int i = 1; i < n; i++) sumPref[i] = sumPref[i - 1] + len[i];
for (int i = 0; i < n; i++) {
int l = -1, r = i + 1;
while (r - l > 1) {
int m = (l + r) / 2;
if (getCntSumbol(m, i) <= c)
r = m;
else
l = m;
}
dp[i][0] = r - 1;
for (int s = 1; s < LOG; s++) dp[i][s] = getDp(dp[i][s - 1], s - 1);
}
int stV = -1;
int bestR = -1;
for (int i = 0; i < n; i++) {
int curR = r;
int curV = i;
for (int s = LOG - 1; s >= 0; s--) {
if ((1 << s) <= curR) {
curV = getDp(curV, s);
curR -= (1 << s);
}
}
if (i - curV > bestR) {
bestR = i - curV;
stV = curV;
}
}
printAns(stV + 1, r, c, n);
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
if (a < b) a = b;
}
char s[5 * 1000100];
int a[1000100], sum[1000100], nxt[1000100][20], dp[1000100];
int main() {
int n, r, c;
cin >> n >> r >> c;
int cur = 0;
for (int i = 1; i <= n; i++) {
scanf("%s", s + cur);
a[i] = strlen(s + cur);
cur += a[i];
sum[i] = sum[i - 1] + a[i];
}
for (int i = 1; i <= n; i++) {
int p = max(i, nxt[i - 1][0]);
while (p <= n && sum[p] - sum[i - 1] + p - i <= c) p++;
nxt[i][0] = p;
}
for (int j = 0; j < 20; j++) nxt[n + 1][j] = n + 1;
for (int j = 1; j < 20; j++) {
for (int i = 1; i <= n; i++) {
nxt[i][j] = nxt[nxt[i][j - 1]][j - 1];
}
}
int ans = 0, id;
for (int i = 1; i <= n; i++) {
int p = i;
for (int j = 20; j--;) {
if (r & (1 << j)) p = nxt[p][j];
}
dp[i] = p - i;
if (ans < dp[i]) ans = dp[i], id = i;
}
if (!ans) return 0;
cur = 0;
int pos = -1;
for (int i = id; i <= n && cur < r; i++) {
if (pos + a[i] >= c) {
cur++;
puts("");
if (cur == r) return 0;
pos = -1;
}
if (pos + a[i] >= c) return 0;
if (pos >= 0) putchar(' ');
for (int j = sum[i - 1]; j < sum[i]; j++) putchar(s[j]);
pos += a[i] + 1;
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000000 + 100;
const int LEN = 5000000 + 100;
int n, r, c, ans, pos, cnt, a[N], p[N], L[N], fa[N][20];
char str[LEN + N * 2], *st[N];
inline void solve(int now) {
int t = now;
for (int i = 19, k = r - 1; ~i && k; --i)
if ((1 << i) <= k && ~fa[t][i]) t = fa[t][i], k -= 1 << i;
t = now - L[t] + 1;
if (t > ans) ans = t, pos = now;
}
int main(int argc, char **argv) {
scanf("%d%d%d", &n, &r, &c);
++c;
for (int i = 1; i <= n; ++i) {
st[i] = str + a[i - 1] + i;
scanf("%s", st[i]);
a[i] = strlen(st[i]) + 1 + a[i - 1];
}
for (int i = 1, j = 1; i <= n; ++i) {
while (a[i] - a[j - 1] > c) ++j;
L[i] = j;
}
for (int i = 1; i <= n; ++i) {
if (L[i] > i) continue;
if (L[i] == 1 || L[L[i] - 1] > L[i] - 1)
fa[i][0] = -1;
else
fa[i][0] = L[i] - 1;
for (int j = 0; j < 19; ++j)
fa[i][j + 1] = ~fa[i][j] ? fa[fa[i][j]][j] : -1;
solve(i);
}
if (ans) {
for (p[cnt = 1] = pos; cnt < r && L[p[cnt]] > 1 && L[p[cnt]] <= p[cnt];
++cnt)
p[cnt + 1] = L[p[cnt]] - 1;
for (int i = cnt; i; --i)
for (int j = L[p[i]]; j <= p[i]; ++j)
printf("%s%c", st[j], " \n"[j == p[i]]);
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000100;
char s[8 * N];
int nd[N];
int be[N];
int dp[N][21];
int mx[N];
int main() {
int n, r, c, L;
scanf("%d%d%d\n", &n, &r, &c);
gets(s);
int cnt = 0;
queue<int> q;
q.push(0);
be[0] = 0;
for (L = 0; s[L]; L++) {
if (s[L] == ' ') {
++cnt;
q.push(cnt);
be[cnt] = L + 1;
} else {
if (q.size() && L - c >= be[q.front()]) {
nd[q.front()] = cnt;
q.pop();
}
}
}
++cnt;
be[cnt] = L + 1;
while (q.size()) {
nd[q.front()] = cnt;
q.pop();
}
nd[cnt] = cnt;
for (int i = 0; i < n; i++) {
dp[i][0] = nd[i];
}
dp[n][0] = n;
for (int j = 1; j < 21; j++) {
for (int i = 0; i < n; i++) {
dp[i][j] = dp[dp[i][j - 1]][j - 1];
}
dp[n][j] = n;
}
int ans = -1, pos = 0;
for (int i = 0; i < n; i++) {
mx[i] = i;
for (int j = 20; j >= 0; j--) {
if ((r >> j) & 1) {
mx[i] = dp[mx[i]][j];
}
}
if (ans < mx[i] - i) {
pos = i;
ans = mx[i] - i;
}
}
for (int x = 0; x < r; x++) {
for (int j = be[pos]; j < be[nd[pos]]; j++) {
printf("%c", j == be[nd[pos]] - 1 ? '\n' : s[j]);
}
pos = nd[pos];
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
string word[1000000];
int words, rows, columns;
int nextRow[30][1000000];
int length[1000001];
int nextRowOf(int pos) {
int high = words, low = 0;
while (high > low) {
int mid = (high + low) / 2;
int size = length[mid] - length[pos] - 1;
if (size > columns) {
high = mid;
} else {
low = mid + 1;
}
}
if (length[high] - length[pos] - 1 > columns) high--;
return high;
}
int endOfBanner(int pos) {
int toGo = rows;
for (int i = 22; i >= 0; i--) {
if (toGo >= (1 << i)) {
toGo -= (1 << i);
pos = nextRow[i][pos];
}
}
return pos;
}
int main() {
cin >> words >> rows >> columns;
for (int i = 0; i < words; i++) {
cin >> word[i];
}
for (int i = 1; i <= words; i++) {
length[i] = length[i - 1] + word[i - 1].size() + 1;
}
for (int j = 0; j < words; j++) {
nextRow[0][j] = nextRowOf(j);
}
nextRow[0][words] = words;
for (int i = 1; i < 22; i++) {
for (int j = 0; j < words; j++) {
nextRow[i][j] = nextRow[i - 1][nextRow[i - 1][j]];
}
nextRow[i][words] = words;
}
int bestScore = -1, bestPos = -1;
for (int i = 0; i < words; i++) {
int score = endOfBanner(i) - i;
if (score > bestScore) {
bestPos = i;
bestScore = score;
}
}
for (int i = 0; i < rows; i++) {
int next = nextRowOf(bestPos);
if (i != 0 && bestPos != next) cout << "\n";
for (int j = bestPos; j < next; j++) {
if (j != bestPos) cout << " ";
cout << word[j];
}
bestPos = next;
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
const int mod = 1e9 + 7;
int n, a, b, p[maxn], sum[maxn], nex[maxn][21], ans, l;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return x * f;
}
string s[maxn];
int main() {
n = read(), a = read(), b = read() + 1;
for (int i = 1; i <= n; i++) cin >> s[i], p[i] = s[i].size() + 1;
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + p[i];
for (int i = 1; i <= n; i++)
nex[i][0] = upper_bound(sum + 1, sum + n + 1, sum[i - 1] + b) - sum;
nex[n + 1][0] = n + 1;
for (int i = 1; i <= 20; i++)
for (int j = 1; j <= n + 1; j++) nex[j][i] = nex[nex[j][i - 1]][i - 1];
for (int i = 1; i <= n; i++) {
int r = i;
for (int j = 0; j <= 20; j++)
if (a >> j & 1) r = nex[r][j];
if (ans < r - i) ans = r - i, l = i;
}
while (ans) {
for (int i = l; i < nex[l][0]; i++)
cout << s[i] << (i == nex[l][0] - 1 ? '\n' : ' ');
ans -= nex[l][0] - l;
l = nex[l][0];
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int in[1000010];
int lc[1000010][21];
int vl[1000010][21];
int n;
string sss[1000010];
int main() {
int lin, cc;
cin >> n >> lin >> cc;
for (int i = (0); i < int(n); i += 1) {
cin >> sss[i];
in[i] = sss[i].size();
if (i) in[i] += in[i - 1];
}
for (int i = (n - 1); i > int(0 - 1); i -= 1) {
int s = i, e = n - 1, last = i - 1, mid;
while (s <= e) {
mid = (s + e) >> 1;
int val = in[mid];
if (i) val -= in[i - 1];
val += mid - i;
if (val > cc)
e = mid - 1;
else
s = mid + 1, last = mid;
}
e = last;
lc[i][0] = e + 1;
if (e < i) lc[i][0] = -1;
vl[i][0] = e - i + 1;
}
for (int i = (n - 1); i > int(0 - 1); i -= 1)
for (int j = (1); j < int(21); j += 1) {
if (lc[i][j - 1] < n && lc[i][j - 1] != -1)
lc[i][j] = lc[lc[i][j - 1]][j - 1],
vl[i][j] = vl[i][j - 1] + vl[lc[i][j - 1]][j - 1];
else
lc[i][j] = -1;
}
pair<int, int> ans = make_pair(-1, 0);
for (int i = (0); i < int(n); i += 1) {
int on = i;
int to = lin;
int jam = 0;
for (int j = (20); j > int(0 - 1); j -= 1) {
if (lc[on][j] == -1) continue;
if ((1 << j) > to) continue;
to -= 1 << j;
jam += vl[on][j];
on = lc[on][j];
}
ans = max(ans, make_pair(jam, i));
}
if (ans.first > 0) {
int su = -1;
for (int i = (ans.second); i < int(ans.first + ans.second); i += 1) {
if (su + sss[i].size() + 1 > cc) putchar('\n'), su = -1;
if (su != -1) putchar(' ');
su += sss[i].size() + 1;
printf("%s", sss[i].c_str());
}
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int H = 20;
const int N = 2500000 + 10;
string str[N];
char ss[2 * N];
int a[N], par[H][N], second[N];
int get(int h, int v) {
if (par[h][v] != -1) return par[h][v];
return par[h][v] = get(h - 1, get(h - 1, v));
}
int main() {
memset(par, -1, sizeof par);
int n, r, c;
cin >> n >> r >> c;
for (int i = 0; i < n; ++i) {
int x;
scanf("%s", ss);
str[i] = string(ss);
a[i] = str[i].size();
}
second[0] = a[0];
for (int i = 1; i < n; ++i) second[i] = second[i - 1] + a[i];
for (int i = 0; i < H; ++i) par[i][n] = n;
for (int i = 0; i < n; ++i) {
if (a[i] > c) {
par[0][i] = i;
continue;
}
int l = i, r = n, m;
while (l + 1 < r) {
m = (l + r) / 2;
int sm = second[m] - (i == 0 ? 0 : second[i - 1]) + m - i;
if (sm > c)
r = m;
else
l = m;
}
par[0][i] = l + 1;
}
int ans = 0, idans = -1;
for (int i = 0; i < n; ++i) {
int v = i, lev = r;
for (int j = 0; lev; ++j, lev >>= 1)
if (lev & 1) v = get(j, v);
if (v - i > ans) {
ans = v - i;
idans = i;
}
}
if (idans == -1) return 0;
for (int i = idans, j = 0; j < r; ++j, i = get(0, i)) {
if (i > idans + ans - 1) break;
int end = get(0, i);
for (int e = i; e + 1 < end; ++e) printf("%s ", str[e].c_str());
printf("%s\n", str[end - 1].c_str());
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
void Get(int &T) {
char C;
bool F = 0;
for (; C = getchar(), C < '0' || C > '9';)
if (C == '-') F = 1;
for (T = C - '0'; C = getchar(), C >= '0' && C <= '9'; T = T * 10 + C - '0')
;
F && (T = -T);
}
int Len[1000005];
char S[5000005];
int Begin[5000005];
int N, R, C;
int End[1000005];
int REnd[1000005];
void Init() {
Get(N);
Get(R);
Get(C);
C++;
for (int i = 1; i <= N; i++) {
scanf("%s", S + Begin[i]);
Len[i] = strlen(S + Begin[i]);
Begin[i + 1] = Begin[i] + Len[i];
}
}
int Ans = 1;
void Work() {
Len[N + 1] = -1;
for (int j = N, i = N + 1, k = 0; i >= 1; i--) {
k += Len[i] + 1;
for (; k > C; j--) k -= Len[j] + 1;
End[i] = j;
}
for (int k = 1; k <= N + 1; k++) REnd[k] = k - 1;
for (int X = R; X; X >>= 1) {
if (X & 1) {
for (int i = 1; i <= N + 1; i++) REnd[i] = End[REnd[i] + 1];
}
for (int i = 1; i <= N + 1; i++) End[i] = End[End[i] + 1];
}
Ans = 1;
for (int k = 1; k <= N; k++)
if (REnd[Ans] - Ans < REnd[k] - k) Ans = k;
}
void Output() {
for (int i = Ans, k = 0, first = 1; i <= REnd[Ans]; i++) {
k += Len[i] + 1;
if (k > C) {
k = Len[i] + 1;
puts("");
first = 1;
}
if (first)
first = 0;
else
printf(" ");
for (int k = Begin[i]; k < Begin[i + 1]; k++) printf("%c", S[k]);
}
puts("");
}
int main() {
Init();
Work();
Output();
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int n, r, c;
int a[1000010], ans[1000010], nxt[1000010];
string s;
void work(int x) {
if (x == 1) {
for (int i = 1; i <= n; ++i) ans[i] = nxt[i];
return;
}
work(x / 2);
for (int i = 1; i <= n; ++i) {
ans[i] = ans[ans[i]];
if (x & 1) ans[i] = nxt[ans[i]];
}
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> r >> c;
a[1] = 0;
for (int i = 1; i <= n; ++i) {
string ss;
cin >> ss;
s += ss;
a[i + 1] = a[i] + ss.length() + 1;
s += ' ';
}
for (int i = n + 1, j = n + 1; i >= 0; --i) {
while (a[j] - a[i] - 1 > c) --j;
ans[i] = i;
nxt[i] = j;
}
work(r);
int p = 1;
for (int i = 2; i <= n; ++i)
if (ans[i] - i > ans[p] - p) p = i;
for (int i = 1; i <= r; ++i) {
for (int j = a[p]; j <= a[nxt[p]] - 2; ++j) cout << s[j];
p = nxt[p];
cout << endl;
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline int size(const T& c) {
return c.size();
}
using namespace std;
const int maxn = 1000000 + 10;
int a[maxn], s[maxn];
int n, r, c;
int l;
string st[maxn];
int nt[maxn];
int res;
int bk[maxn][22];
int bd, kt;
int main() {
cin >> n >> r >> c;
for (int i = (1), _b = (n); i <= _b; i++) {
cin >> st[i];
a[i] = st[i].length();
s[i] = s[i - 1] + a[i];
}
l = 1;
for (int i = (1), _b = (n); i <= _b; i++) {
while (l <= i && s[i] - s[l - 1] + i - l > c) l++;
bk[i][0] = l - 1;
if (bk[i][0] == i) bk[i][0] = -1;
}
for (int j = (1), _b = (20); j <= _b; j++)
for (int i = (1), _b = (n); i <= _b; i++) {
if (bk[i][j - 1] != -1)
bk[i][j] = bk[bk[i][j - 1]][j - 1];
else
bk[i][j] = -1;
}
for (int i = (1), _b = (n); i <= _b; i++) {
int sr = r;
int p = i;
for (int j = (20), _a = (0); j >= _a; j--) {
if ((sr >= (1 << j)) && (bk[p][j] != -1)) {
sr -= 1 << j;
p = bk[p][j];
}
}
if (res < i - p) {
res = i - p;
bd = p + 1;
kt = i;
}
}
int sum = 1000000000;
for (int i = (bd), _b = (kt); i <= _b; i++) {
sum = sum + 1 + a[i];
if (sum > c) {
if (sum < 1000000000) cout << endl;
cout << st[i];
sum = a[i];
} else
cout << ' ' << st[i];
}
fclose(stdin);
fclose(stdout);
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
template <class T>
typename T::value_type arr_sum(const T &v, int n) {
typename T::value_type sum = 0;
for (int i = (0); i < (n); ++i) sum += v[i];
return sum;
}
struct Sync_stdio {
Sync_stdio() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
}
} _sync_stdio;
vector<vector<int>> up;
vector<vector<int>> g;
vector<int> used;
void dfs(int t, int p = 0) {
used[t] = 1;
up[t][0] = p;
for (int i = (1); i < (up[t].size()); ++i) {
up[t][i] = up[up[t][i - 1]][i - 1];
}
for (auto i : g[t]) {
if (used[i]) {
continue;
}
dfs(i, t);
}
}
void up_init(vector<int> &pre) {
int n = pre.size() + 1;
g.resize(n);
used.resize(n);
up.resize(n);
int l = 1;
while ((1 << l) <= n) {
++l;
}
for (auto &i : up) {
i.resize(l + 1);
}
for (int i = (0); i < (n - 1); ++i) {
g[pre[i] + 1].push_back(i + 1);
}
for (int i = (0); i < (n); ++i) {
if (!used[i]) {
dfs(i, i);
}
}
}
int get_parent(int a, int x) {
for (int i = (up[a].size() - 1); i > (-1); --i) {
if (x & (1 << i)) {
a = up[a][i];
}
}
return a;
}
int main() {
int n, r, c;
cin >> n >> r >> c;
vector<string> v(n);
for (int __i = 0; __i < (n); ++__i) cin >> v[__i];
;
vector<int> pre(n);
int j = n - 1;
int tsum = 0;
for (int i = (n - 1); i > (-1); --i) {
while (j >= 0 && tsum <= c) {
tsum += (i != j) + v[j].size();
--j;
}
if (j >= 0 || tsum > c) {
++j;
}
pre[i] = j;
if (j >= 0 || tsum > c) {
--j;
}
if (tsum == v[i].size()) {
tsum = 0;
} else {
tsum -= 1 + v[i].size();
}
}
up_init(pre);
int maxi = 0;
int maxc = 0;
for (int i = (0); i < (n + 1); ++i) {
int x = get_parent(i, r);
if (i - x > maxc) {
maxc = i - x;
maxi = i;
}
}
vector<string> ans(r);
j = 0;
for (int i = (maxi - maxc); i < (maxi); ++i) {
if (ans[j].size() + v[i].size() + (ans[j].size() != 0) > c) {
++j;
}
if (ans[j].size() != 0) {
ans[j] += ' ';
}
ans[j] += v[i];
}
for (auto i : ans) {
cout << i << "\n";
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000001;
const int MAXBIT = 21;
const int MAXL = 7000000;
int n, r, c, nxt[MAXBIT][MAXN], length[MAXN], realEnd[MAXN];
vector<string> words;
char word[MAXL];
void print(int pos) {
for (int i = (0); i < (r); i++) {
bool space = false;
for (int j = (pos); j < (nxt[0][pos]); j++) {
if (space) putchar(' ');
space = true;
printf("%s", words[j].c_str());
}
pos = nxt[0][pos];
putchar('\n');
}
}
int main() {
scanf("%d%d%d", &n, &r, &c);
words = vector<string>(n);
for (int i = (0); i < (n); i++) {
scanf("%s", word);
length[i] = strlen(word);
words[i] = word;
}
int last = n, sumlength = 0;
nxt[0][n] = n;
for (int i = n - 1; i >= 0; i--) {
sumlength += length[i];
while (i < last && sumlength + last - i - 1 > c) {
sumlength -= length[--last];
}
nxt[0][i] = last;
}
for (int bit = 0; 1 << bit < n; bit++) {
for (int i = (0); i < (n + 1); i++) {
nxt[bit + 1][i] = nxt[bit][nxt[bit][i]];
}
}
for (int i = (0); i < (n); i++) {
int p = i;
for (int mask = r; mask; mask &= mask - 1) {
int bit = __builtin_ctz(mask);
p = nxt[bit][p];
}
realEnd[i] = p;
}
int resPos = n - 1;
for (int i = (0); i < (n); i++) {
if (realEnd[i] - i > realEnd[resPos] - resPos) {
resPos = i;
}
}
print(resPos);
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char buf[5 << 20];
vector<int> len;
vector<string> vs;
int skip[20][1 << 20];
int skipn(int n, int k) {
for (int i = 0; i < 20; ++i) {
if (((n >> i) & 1) != 0) {
k = skip[i][k];
}
}
return k;
}
int main() {
int n, r, c;
int from, to;
scanf("%d%d%d", &n, &r, &c);
for (int i = 0; i < n; ++i) {
scanf("%s", buf);
vs.push_back(buf);
len.push_back(vs.back().size());
}
for (int i = 0, j = 0, k = 0; i < n; ++i) {
if (j <= i) {
j = i;
k = 0;
} else {
k -= len[i - 1];
}
while (j < n && (k + len[j] + j - i) <= c) {
k += len[j];
++j;
}
skip[0][i] = j;
}
skip[0][n] = n;
for (int i = 1; i < 20; ++i) {
for (int j = 0; j <= n; ++j) {
skip[i][j] = skip[i - 1][skip[i - 1][j]];
}
}
from = to = 0;
for (int i = 0; i < n; ++i) {
int j = skipn(r, i);
if (j - i > to - from) {
from = i;
to = j;
}
}
while (from < to) {
for (int i = from; i < skip[0][from]; ++i) {
printf("%s%s", i == from ? "" : " ", vs[i].c_str());
}
puts("");
from = skip[0][from];
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
const int N = 1000010;
const int P = 20;
int n, r, c, st[N];
char s[N * 6];
int f[N][P], sum[N];
int len, a[N];
bool ok(int l, int r) { return sum[r] - sum[l] + r - l - 1 <= c; }
int get(int x, int len) {
for (int i = P - 1; i >= 0; i--) {
if (len & (1 << i)) x = f[x][i];
}
return x;
}
int main() {
scanf("%d%d%d", &n, &r, &c);
for (int i = 1, len = 0; i <= n; i++) {
scanf("%s", s + len);
st[i] = len;
a[i] = strlen(s + len);
len = len + a[i] + 1;
}
sum[0] = 0;
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
for (int i = 0, j = 0; i <= n; i++) {
while (j <= n && ok(i, j)) j++;
f[i][0] = j - 1;
}
for (int i = n; i >= 0; i--) {
for (int j = 1; j < P; j++) {
f[i][j] = f[f[i][j - 1]][j - 1];
}
}
int beg = -1, mx = -1;
for (int i = 0; i <= n; i++) {
int j = get(i, r);
if (j - i > mx) mx = j - i, beg = i;
}
for (int i = 0; i < r; i++) {
int xx = beg + 1;
for (; xx <= n && ok(beg, xx);) {
if (xx != beg + 1) putchar(' ');
printf("%s", s + st[xx]);
xx++;
}
puts("");
if (xx == beg + 1) break;
beg = xx - 1;
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
const int N = 1000005, M = 5000005;
int n, r, c, p[N], nxt[N], f[N], ret[N];
char s[N + M];
int main() {
scanf("%d%d%d", &n, &r, &c);
for (int i = 1, j = 0; i <= n; i++) {
scanf("%s", s + j);
j += strlen(s + j);
s[j++] = ' ';
p[i] = j;
}
for (int i = 1, j = 0; i <= n; i++) {
while (j <= n && p[j] - p[i - 1] - 1 <= c) j++;
nxt[i] = j;
}
nxt[n + 1] = n + 1;
for (int i = 1; i <= n + 1; i++) ret[i] = i, f[i] = nxt[i];
for (int b = r; b; b >>= 1) {
if (b & 1)
for (int i = 1; i <= n; i++) ret[i] = f[ret[i]];
for (int i = 1; i <= n; i++) f[i] = f[f[i]];
}
int q = 1;
for (int i = 2; i <= n; i++)
if (ret[i] - i > ret[q] - q) q = i;
for (int i = 0; i < r; i++) {
for (int j = p[q - 1]; j < p[nxt[q] - 1] - 1; j++) putchar(s[j]);
q = nxt[q];
puts("");
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
const int lg = 20;
int n, R, c;
vector<string> li;
int par[N + 5][lg + 2];
void make_sparse() {
for (int i = 1; i < lg; i++) {
for (int j = 0; j <= n; j++) {
par[j][i] = par[par[j][i - 1]][i - 1];
}
}
}
int get_uj(int x) {
for (int i = 0; i < lg; i++) {
if ((1 << i) & R) {
x = par[x][i];
}
}
return x;
}
int main() {
cin >> n >> R >> c;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
li.push_back(s);
}
c++;
int r = -1;
int cur = 0;
for (int i = 0; i < n; i++) {
while (cur <= c && r < n) {
r++;
if (r == n) break;
cur += li[r].size() + 1;
}
par[i][0] = r;
cur -= li[i].size() + 1;
}
par[n][0] = n;
make_sparse();
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, get_uj(i) - i);
}
for (int i = 0; i < n; i++) {
if (get_uj(i) - i == ans) {
int lol = get_uj(i);
bool spas = 0;
int cur = 0;
int bef = i;
for (int j = i; j < lol; j++) {
if (cur != 0) cout << " ";
cout << li[j];
cur += li[j].size() + 1;
if (par[bef][0] - 1 == j) {
cur = 0;
cout << endl;
bef = par[bef][0];
}
}
break;
}
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:100000000000000")
using namespace std;
int n, r, c, ansf = -1, anss = -1, ans = -1;
vector<int> good, sum, temp, used;
vector<vector<int> > g;
vector<string> op;
void dfs(int id, int now) {
temp[now] = id;
used[id] = 1;
int pre = temp[max(-1, now - r) + 1];
pre += good[pre] - 1;
if (ans < (pre - id + 1)) {
ans = pre - id + 1;
ansf = id;
anss = pre;
}
for (int i = 0; i < g[id].size(); i++) dfs(g[id][i], now + 1);
}
int main() {
cin >> n >> r >> c;
op.resize(n);
temp.resize(n + 1);
used.resize(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> op[i];
}
sum.resize(n, 0);
sum[0] = -1;
for (int i = 0; i < n; i++) {
sum[i] += op[i].size() + 1;
if (i < n - 1) sum[i + 1] = sum[i];
}
good.resize(n + 1, 0);
for (int i = 0; i < n; i++) {
int from = i ? sum[i - 1] + 2 : 1;
vector<int>::iterator it =
upper_bound(sum.begin(), sum.end(), from + c - 1);
if (it == sum.begin() || (--it) - sum.begin() < i) continue;
good[i] = it - sum.begin() - i + 1;
}
g.resize(n + 1);
for (int i = 0; i < n; i++) {
if (good[i] > 0) {
g[i + good[i]].push_back(i);
}
}
for (int i = n; i >= 0; i--) {
if (used[i]) continue;
dfs(i, 0);
}
if (ans != -1) {
while (ansf <= anss) {
for (int i = ansf; i < ansf + good[ansf]; i++) {
if (i != ansf) cout << " ";
cout << op[i];
}
ansf += good[ansf];
cout << endl;
}
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
template <class F, class T>
T convert(F a, int p = -1) {
stringstream ss;
if (p >= 0) ss << fixed << setprecision(p);
ss << a;
T r;
ss >> r;
return r;
}
template <class T>
T gcd(T a, T b) {
T r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
template <class T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template <class T>
T sqr(T x) {
return x * x;
}
template <class T>
T cube(T x) {
return x * x * x;
}
template <class T>
int getbit(T s, int i) {
return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
return s == 0 ? 0 : cntbit(s >> 1) + (s & 1);
}
const int bfsz = 1 << 16;
char bf[bfsz + 5];
int rsz = 0;
int ptr = 0;
char gc() {
if (rsz <= 0) {
ptr = 0;
rsz = (int)fread(bf, 1, bfsz, stdin);
if (rsz <= 0) return EOF;
}
--rsz;
return bf[ptr++];
}
void ga(char &c) {
c = EOF;
while (!isalpha(c)) c = gc();
}
int gs(char s[]) {
int l = 0;
char c = gc();
while (isspace(c)) c = gc();
while (c != EOF && !isspace(c)) {
s[l++] = c;
c = gc();
}
s[l] = '\0';
return l;
}
template <class T>
bool gi(T &v) {
v = 0;
char c = gc();
while (c != EOF && c != '-' && !isdigit(c)) c = gc();
if (c == EOF) return false;
bool neg = c == '-';
if (neg) c = gc();
while (isdigit(c)) {
v = v * 10 + c - '0';
c = gc();
}
if (neg) v = -v;
return true;
}
const double PI = acos(-1.0);
const double eps = 1e-9;
const int inf = (int)1e9 + 5;
const long long linf = (long long)1e17 + 5;
const long long mod = 10003;
int n, r, c, dad[1000005][22], d[1000005], len[1000005];
string s[1000005];
char str[1000005 * 5];
int cal(int x) {
for (int i = 20; i >= 0; i--)
if (getbit(r, i)) {
x = dad[x][i];
}
return x;
}
void print(int x, int l) {
int d = 0;
for (int i = (x); i <= (x + l - 1); ++i) {
str[len[i]] = '\0';
memcpy(str, s[i].c_str(), len[i]);
if (d + len[i] > c) {
printf("\n%s", str);
d = len[i] + 1;
} else {
printf("%s%s", d == 0 ? "" : " ", str);
d += 1 + len[i];
}
}
}
int main() {
gi(n);
gi(r);
gi(c);
d[0] = 0;
for (int i = 0; i < (n); ++i) {
gs(str);
s[i] = str;
len[i] = s[i].length();
d[i + 1] = d[i] + len[i] + 1;
}
dad[n][0] = n;
int run = 0;
for (int i = 0; i < (n); ++i) {
while (run < n && d[run + 1] - d[i] <= c + 1) run++;
dad[i][0] = run;
}
for (int j = (1); j <= (20); ++j)
for (int i = 0; i < (n + 1); ++i) dad[i][j] = dad[dad[i][j - 1]][j - 1];
int MAX = -1, vt = -1;
for (int i = 0; i < (n); ++i) {
int v = cal(i);
if (v - i > MAX) {
MAX = v - i;
vt = i;
}
}
print(vt, MAX);
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int s = 0;
bool f = 0;
char ch = ' ';
while (!isdigit(ch)) {
f |= (ch == '-');
ch = getchar();
}
while (isdigit(ch)) {
s = (s << 3) + (s << 1) + (ch ^ 48);
ch = getchar();
}
return (f) ? (-s) : (s);
}
inline void write(int x) {
if (x < 0) {
putchar('-');
x = -x;
}
if (x < 10) {
putchar(x + '0');
return;
}
write(x / 10);
putchar((x % 10) + '0');
}
const int N = 1000005;
int n, r, c, b[N], last[N][23];
int jyl, jzx;
string a[N];
inline int ask(int pos, int stp) {
int i;
for (i = 21; (~i) && (pos <= n); i--) {
if ((1 << i) <= stp) {
pos = last[pos][i] + 1;
stp -= (1 << i);
}
}
return pos - 1;
}
int main() {
int i, j, now, tmp;
n = read();
r = read();
c = read();
b[0] = 0;
for (i = 1; i <= n; i++) {
cin >> a[i];
b[i] = b[i - 1] + a[i].size() + 1;
}
for (i = 1; i <= n; i++) {
now = b[i - 1];
last[i][0] = upper_bound(b + 1, b + n + 1, now + c + 1) - b;
last[i][0]--;
}
for (i = 1; i <= 21; i++)
for (j = 1; j <= n; j++)
last[j][i] = last[min(n, last[j][i - 1] + 1)][i - 1];
jzx = 0;
for (i = 1; i <= n; i++) {
tmp = ask(i, r) - i + 1;
if (tmp > jzx) {
jzx = tmp;
jyl = i;
}
}
now = 1;
while (now <= r) {
tmp = 0;
bool flg = 0;
while (true) {
if (tmp + a[jyl].size() + 1 <= c + 1 && jyl <= n) {
if (flg)
putchar(' ');
else
flg = 1;
cout << a[jyl];
tmp += a[jyl].size() + 1;
jyl++;
} else
break;
}
now++;
putchar('\n');
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int _;
template <class P, class Q>
void smin(P &a, Q b) {
if (b < a) a = b;
}
template <class P, class Q>
void smax(P &a, Q b) {
if (b > a) a = b;
}
template <class P, class Q>
bool in(const P &a, const Q &b) {
return a.find(b) != a.end();
}
const int MAXN = 1001 * 1000;
string words[MAXN];
int n, r, c;
int nx[MAXN][20];
int main() {
ios::sync_with_stdio(false);
cin >> n >> r >> c;
for (int i = (0); i < int(n); ++i) cin >> words[i];
int tot = 0, pt = -1;
for (int i = (0); i < int(n); ++i) {
while (pt < n && tot - 1 <= c) {
++pt;
if (pt < n) tot += ((int)(words[pt]).size()) + 1;
}
nx[i][0] = pt;
tot -= ((int)(words[i]).size()) + 1;
}
nx[n][0] = n;
for (int j = (1); j < int(20); ++j)
for (int i = (0); i < int(n + 1); ++i) nx[i][j] = nx[nx[i][j - 1]][j - 1];
pair<int, int> best(-1, -1);
for (int i = (0); i < int(n); ++i) {
int pos = i;
for (int j = (0); j < int(20); ++j)
if (r & (1 << j)) pos = nx[pos][j];
smax(best, pair<int, int>(pos - i, i));
}
int len = 0;
for (int i = (best.second); i < int(best.second + best.first); ++i) {
len += ((int)(words[i]).size()) + (len ? 1 : 0);
bool nl = false;
if (len > c) {
nl = true;
len = ((int)(words[i]).size());
}
if (nl) putchar('\n');
if (len != ((int)(words[i]).size())) putchar(' ');
printf("%s", words[i].c_str());
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:64000000")
const int MAXN = 1000002;
int n, R, C;
int a[MAXN];
int s[MAXN];
int b[MAXN];
vector<string> words;
int d[MAXN][22];
inline int get_sum(int l, int r) {
int res = s[r];
if (l) res -= s[l - 1];
return res;
}
inline void init() {
cin >> n >> R >> C;
words.resize(n);
for (int i = 0; i < n; ++i) {
cin >> words[i];
a[i] = (int)words[i].length();
}
s[0] = a[0];
for (int i = 1; i < n; ++i) s[i] = s[i - 1] + a[i];
}
inline int find(int x) {
if (a[x] > C) return 0;
int res = x;
int l = x + 1, r = n - 1;
while (l <= r) {
int mid = (l + r) >> 1;
if (get_sum(x, mid) + mid - x <= C) {
res = mid;
l = mid + 1;
} else
r = mid - 1;
}
return res - x + 1;
}
inline int get(int x, int r) {
for (int z = 21; z >= 0; --z) {
if ((1 << z) <= r) {
r -= (1 << z);
x = d[x][z];
}
}
return x;
}
int main() {
init();
for (int i = 0; i < n; ++i) b[i] = find(i);
for (int i = 0; i < n; ++i) {
d[i][0] = i + b[i];
}
d[n][0] = n;
for (int z = 1; z < 22; ++z) {
for (int x = 0; x <= n; ++x) {
int y = d[x][z - 1];
d[x][z] = d[y][z - 1];
}
}
int best = -1;
int mx = -1;
for (int i = 0; i < n; ++i) {
int cur = get(i, R) - i;
if (cur > mx) {
mx = cur;
best = i;
}
}
if (best == -1) return 0;
int x = best;
int step = 0;
while (x < n) {
int last = d[x][0];
if (x == last) break;
++step;
cout << words[x];
for (int i = x + 1; i < last; ++i) {
cout << " " << words[i];
}
cout << endl;
x = last;
if (step == R) break;
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
void _fill_int(int* p, int val, int rep) {
int i;
for (i = 0; i < rep; i++) p[i] = val;
}
int GETi() {
int i;
scanf("%d", &i);
return i;
}
template <class T>
T sqr(T val) {
return val * val;
}
int N, R, C;
int I[1000010], W[1000010];
int MW[23][1000010];
char S[7000010];
void solve() {
int f, r, i, j, k, l, x, y, tx, ty, aa[5];
cin >> N >> R >> C;
C++;
j = 0;
for (i = 0; i < N; i++) {
string s;
cin >> s;
I[i] = j;
W[i] = 1 + s.size();
strcpy(S + j, s.c_str());
j += W[i];
}
int tl, tw = -1;
for (i = 0; i < N; i++) {
if (tw <= i) {
if (W[i] > C) {
MW[0][i] = i;
continue;
}
tw = i + 1;
tl = W[i];
}
while (tw < N && tl + W[tw] <= C) tl += W[tw++];
MW[0][i] = tw;
tl -= W[i];
}
MW[0][N] = N;
for (i = 0; i < 21; i++)
for (x = 0; x < N + 1; x++) MW[i + 1][x] = MW[i][MW[i][x]];
int ma = 0, id = -1;
for (x = 0; x < N + 1; x++) {
y = x;
for (i = 20; i >= 0; i--)
if (R & (1 << i)) y = MW[i][y];
if (y - x > ma) ma = y - x, id = x;
}
if (ma == 0) return;
for (x = id, r = 0; x < id + ma && r < R;) {
y = 0;
while (x < id + ma && y + W[x] <= C) {
if (y != 0) printf(" ");
printf("%s", S + I[x]);
y += W[x];
x++;
}
if (y == 0) break;
r++;
printf("\n");
}
return;
}
int main(int argc, char** argv) {
if (argc > 1) freopen(argv[1], "r", stdin);
solve();
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char buff[6000003];
int nwords, nrows, ncols;
int wordstart[1000000];
int wordlen[1000000];
int nxt[1000001];
int cur[1000001];
int res[1000000];
void input() {
gets(buff);
sscanf(buff, "%d%d%d", &nwords, &nrows, &ncols);
gets(buff);
int spos = 0, wpos = 0;
while (true) {
if (isalpha(buff[spos])) {
if (wordlen[wpos] == 0) wordstart[wpos] = spos;
++wordlen[wpos];
} else {
if (wordlen[wpos] != 0) ++wpos;
if (buff[spos] != ' ') break;
}
++spos;
}
}
void calcnxt() {
int linelen = 0, wpos = 0;
for (int i = (0); i < (nwords); ++i) {
while (wpos < nwords &&
linelen + wordlen[wpos] + (linelen == 0 ? 0 : 1) <= ncols) {
linelen += wordlen[wpos] + (linelen == 0 ? 0 : 1);
++wpos;
}
nxt[i] = wpos;
if (wpos == i)
++wpos;
else {
linelen -= wordlen[i];
if (wpos != i + 1) linelen--;
}
}
nxt[nwords] = nwords;
}
void calcres() {
for (int i = (0); i < (nwords); ++i) res[i] = i;
for (int i = (0); i <= (nwords); ++i) cur[i] = nxt[i];
for (int i = 0; (1 << i) <= nrows; ++i) {
if (nrows & (1 << i)) {
for (int j = (0); j < (nwords); ++j) res[j] = cur[res[j]];
}
for (int j = (0); j < (nwords); ++j) cur[j] = cur[cur[j]];
}
}
void output() {
int wpos = 0;
for (int i = (1); i < (nwords); ++i)
if (res[i] - i > res[wpos] - wpos) wpos = i;
for (int r = (0); r < (nrows); ++r) {
for (int i = (wpos); i < (nxt[wpos]); ++i) {
if (i != wpos) printf(" ");
for (int j = (0); j < (wordlen[i]); ++j)
printf("%c", buff[wordstart[i] + j]);
}
puts("");
wpos = nxt[wpos];
}
}
void run(int casenr) {
input();
calcnxt();
calcres();
output();
}
int main() {
run(1);
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,ssse3,sse3,sse4,popcnt,avx,mmx,abm,tune=native")
using namespace std;
namespace debug {
void __(short x) { cout << x; }
void __(unsigned x) { cout << x; }
void __(int x) { cout << x; }
void __(long long x) { cout << x; }
void __(unsigned long long x) { cout << x; }
void __(double x) { cout << x; }
void __(long double x) { cout << x; }
void __(char x) { cout << x; }
void __(const char* x) { cout << x; }
void __(const string& x) { cout << x; }
void __(bool x) { cout << (x ? "true" : "false"); }
template <class P1, class P2>
void __(const pair<P1, P2>& x) {
__("("), __(x.first), __(", "), __(x.second), __(")");
}
template <class T>
void __(const vector<T>& x) {
__("{");
bool _ffs = 0;
for (const auto& v : x) __(_ffs ? ", " : ""), __(v), _ffs = 1;
__("}");
}
template <class T>
void __(const set<T>& x) {
__("{");
bool _ffs = 0;
for (const auto& v : x) __(_ffs ? ", " : ""), __(v), _ffs = 1;
__("}");
}
template <class T, class T2>
void __(const map<T, T2>& x) {
__("{");
bool _ffs = 0;
for (const auto& v : x)
__(_ffs ? ", " : ""), __(make_pair(v.first, v.second)), _ffs = 1;
__("}");
}
void screm() { __("\n"); }
template <class T1, class... T2>
void screm(const T1& t1, const T2&... t2) {
__(t1);
if (sizeof...(t2))
__(" | "), screm(t2...);
else
__("\n");
}
void pr() { __("\n"); }
template <class T1, class... T2>
void pr(const T1& t1, const T2&... t2) {
__(t1);
if (sizeof...(t2))
__(" "), pr(t2...);
else
__("\n");
}
} // namespace debug
using namespace debug;
const int MN = 1e6 + 6, LG = 21;
int N, R, C, i, j, sp[MN][LG], len[MN], lo, hi, ans, sna;
string a[MN];
int main() {
scanf("%d%d%d", &N, &R, &C);
for (int i = (1); i <= (N); i++) {
cin >> a[i];
len[i] = len[i - 1] + a[i].size();
}
for (int i = (N); i >= (1); i--) {
lo = i, hi = N + 1;
while (lo < hi) {
int m = (lo + hi) / 2;
if (len[m] - len[i - 1] + m - i <= C)
lo = m + 1;
else
hi = m;
}
if (lo > i) {
sp[i][0] = lo - i;
for (int j = (1); j <= (LG - 1); j++)
sp[i][j] = sp[i][j - 1] + sp[i + sp[i][j - 1]][j - 1];
}
int r = R, p = i;
for (int j = (LG - 1); j >= (0); j--) {
if ((1 << j) <= r) {
r -= (1 << j);
p += sp[p][j];
}
}
if (p - i > ans) {
ans = p - i;
sna = i;
}
}
if (ans) {
int ln = a[sna].size();
printf("%s", a[sna].c_str());
for (int i = (sna + 1); i <= (sna + ans - 1); i++) {
if (ln + 1 + a[i].size() > C) {
printf("\n%s", a[i].c_str());
ln = a[i].size();
} else {
printf(" %s", a[i].c_str());
ln += a[i].size() + 1;
}
}
printf("\n");
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int mxn = 1e6 + 6;
int n, r, c, t = 1, fr[mxn], nxt[mxn], ans[mxn];
char s[6 * mxn];
inline void make(int x) {
if (!x) return;
make(x >> 1);
for (int i = 1; i <= n; ++i) {
ans[i] = ans[ans[i]];
if (x & 1) ans[i] = nxt[ans[i]];
}
}
int main() {
scanf("%d%d%d", &n, &r, &c);
for (int i = 1; i <= n; ++i) {
scanf("%s", s + fr[i]);
fr[i + 1] = fr[i] + strlen(s + fr[i]);
s[fr[i + 1]++] = ' ';
}
for (int i = n + 1, j = n + 1; i; i--) {
for (; fr[j] - fr[i] > c + 1; --j)
;
nxt[ans[i] = i] = j;
}
make(r);
for (int i = 2; i <= n; ++i)
if (ans[i] - i > ans[t] - t) t = i;
for (int i = 1; i <= r; ++i, t = nxt[t]) {
for (int j = fr[t]; j + 1 < fr[nxt[t]]; j++) putchar(s[j]);
putchar('\n');
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
string a[1000000];
int sz[1000000], w[1000000], rs[1000000] = {0};
vector<pair<int, int> > ch[1000001];
list<int> x;
int cs = 0;
void slither() {
rs[x.front()] = cs;
int lst = x.back();
x.pop_back();
cs -= w[x.back()];
int of = x.front();
for (pair<int, int>& y : ch[of]) {
cs += y.second;
x.push_front(y.first);
slither();
x.pop_front();
cs -= y.second;
}
cs += w[x.back()];
x.push_back(lst);
}
void build(int t, int lft) {
x.push_front(t);
if (lft == 0) {
slither();
x.pop_front();
return;
}
for (pair<int, int>& y : ch[t]) {
cs += y.second;
rs[y.first] = cs;
build(y.first, lft - 1);
cs -= y.second;
}
x.pop_front();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, rw, c;
cin >> n >> rw >> c;
for (int i = 0; i < n; i++) cin >> a[i], sz[i] = a[i].size();
int l = 0, r = 0, v = 0;
while (l < n) {
while (r < n && v + sz[r] + (v != 0) <= c) {
v += sz[r] + (v != 0);
r++;
}
w[l] = r - l;
v -= sz[l] + 1;
if (v < 0) v = 0;
if (l == r) r++;
l++;
}
for (int i = 0; i < n; i++) {
if (w[i]) ch[i + w[i]].push_back({i, w[i]});
}
for (int i = n; i >= 0; i--) {
if (i == n || w[i] == 0) build(i, rw);
}
int bst = 0, bi = -1;
for (int i = 0; i < n; i++) {
if (rs[i] > bst) {
bst = rs[i];
bi = i;
}
}
int i = bi, u = rw;
while (i < n && u) {
for (int j = 0; j < w[i]; j++)
cout << a[i + j] << (j == w[i] - 1 ? '\n' : ' ');
i += w[i];
u--;
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
inline int bit(int x, int i) { return (x >> i) & 1; }
int len[1000010], to[20][1000010];
string s[1000010];
char buf[5145140];
int main() {
int n, r, c;
scanf("%d%d%d", &n, &r, &c);
for (int i = 1; i <= n; i++) {
scanf("%s", buf);
s[i] = buf;
len[i] = s[i].size();
}
c++;
for (int i = 1; i <= n; i++) len[i]++;
int now = 0;
for (int i = n, j = n; i >= 1; i--) {
now += len[i];
while (now > c) now -= len[j--];
to[0][i] = j;
}
to[0][n + 1] = n;
for (int i = 1; i < 20; i++)
for (int j = 1; j <= n + 1; j++) to[i][j] = to[i - 1][to[i - 1][j] + 1];
int big = 0, pos = 1;
for (int i = 1; i <= n; i++) {
int p = i;
for (int j = 0; j < 20; j++)
if (bit(r, j)) p = to[j][p] + 1;
if (p - i > big) {
big = p - i;
pos = i;
}
}
for (int i = 0; i < r; i++) {
int npos = to[0][pos];
for (int j = pos; j <= npos; j++)
printf("%s%c", s[j].c_str(), j == npos ? '\n' : ' ');
pos = npos + 1;
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int a[N], sum[N], f[N], ans[N];
int n, r, c;
char ch[N * 6];
int main() {
scanf("%d%d%d", &n, &r, &c);
for (int i = 1; i <= n; i++) {
scanf("%s", ch + sum[i - 1] + 2);
a[i] = strlen(ch + sum[i - 1] + 2);
sum[i] = sum[i - 1] + 1 + a[i];
}
for (int i = 1; i <= n; i++)
for (f[i] = max(f[i - 1], i); f[i] <= n && sum[f[i]] - sum[i - 1] - 1 <= c;
f[i]++)
;
f[n + 1] = n + 1;
for (int i = 1; i <= n; i++) ans[i] = i;
for (; r; r >>= 1)
for (int i = 1; i <= n; i++) {
if (r & 1) ans[i] = f[ans[i]];
f[i] = f[f[i]];
}
int pos = 1;
for (int i = 2; i <= n; i++)
if (ans[i] - i > ans[pos] - pos) pos = i;
int last = 0;
for (int i = pos; i <= ans[pos] - 1; i++) {
if (last + a[i] > c) {
last = 0;
puts("");
}
if (last) putchar(' ');
last += a[i] + 1;
printf("%s", ch + sum[i - 1] + 2);
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
int N, R, C, a[MAXN], s[MAXN], nex[MAXN][20], ans, st;
string S[MAXN];
int main() {
cin >> N >> R >> C;
++C;
for (int i = 1; i <= N; ++i)
cin >> S[i], a[i] = S[i].size() + 1, s[i] = s[i - 1] + a[i];
for (int i = N, j = N; i >= 1; --i) {
for (; j >= i && s[j] - s[i - 1] > C; --j)
;
nex[i][0] = j + 1;
}
for (int i = 1; i < 20; ++i) {
for (int j = 1; j <= N; ++j) nex[j][i] = nex[nex[j][i - 1]][i - 1];
}
for (int i = 1; i <= N; ++i) {
int k = R, pos = i;
for (int j = 19; j >= 0; --j)
if ((1 << j) <= k) {
k -= 1 << j, pos = nex[pos][j];
if (!pos) break;
}
if (!pos) pos = N + 1;
if (pos - i > ans) ans = pos - i, st = i;
}
if (st) {
int sum = 0;
for (int i = st; i <= N; ++i) {
if (a[i] > C) break;
sum += a[i];
if (sum > C)
--R, sum = a[i], cout << endl;
else if (i != st)
cout << ' ';
if (!R) break;
cout << S[i];
}
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char buf[1 << 21], *p1 = buf, *p2 = buf;
template <class T>
void read(T &x) {
x = 0;
int c = getchar();
int flag = 0;
while (c < '0' || c > '9') flag |= (c == '-'), c = getchar();
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
if (flag) x = -x;
}
template <class T>
T _max(T a, T b) {
return b < a ? a : b;
}
template <class T>
T _min(T a, T b) {
return a < b ? a : b;
}
template <class T>
bool checkmax(T &a, T b) {
return a < b ? a = b, 1 : 0;
}
template <class T>
bool checkmin(T &a, T b) {
return b < a ? a = b, 1 : 0;
}
const int N = 1000005, LOG = 20;
int n, r, c;
string s[N];
int a[N], sum[N];
int nxt[LOG + 1][N];
bool check(int idx, int mid) {
int tot = sum[mid] - sum[idx - 1];
tot += mid - idx;
return tot <= c;
}
void init() {
cin >> n >> r >> c;
for (int i = 1; i <= n; ++i) {
cin >> s[i];
a[i] = (int)s[i].size();
sum[i] = sum[i - 1] + a[i];
}
for (int i = 1; i <= n; ++i) {
if (a[i] > c) {
nxt[0][i] = i;
continue;
}
int l = i, r = n, mid, best = i;
while (l <= r) {
mid = (l + r) >> 1;
if (check(i, mid))
best = mid, l = mid + 1;
else
r = mid - 1;
}
nxt[0][i] = best + 1;
}
for (int i = 0; i <= LOG; ++i) nxt[i][n + 1] = n + 1;
for (int i = 1; i <= LOG; ++i) {
for (int j = 1; j <= n; ++j) {
nxt[i][j] = nxt[i - 1][nxt[i - 1][j]];
}
}
}
void print(int l, int r) {
if (l > r) exit(0);
for (int i = l; i < r; ++i) cout << s[i] << " ";
cout << s[r] << endl;
}
void solve() {
int pos = 0, Max = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] > c) continue;
int now = i;
for (int j = LOG; j >= 0; --j)
if (r >> j & 1) {
if (nxt[j][now]) now = nxt[j][now];
if (now > n) break;
}
if (now > i) --now;
if (checkmax(Max, now - i + 1)) pos = i;
}
if (pos == 0) {
for (int i = 1; i <= r; ++i) printf("\n");
return;
}
int now = pos;
for (int i = 1; i <= r; ++i) {
print(now, nxt[0][now] - 1);
now = nxt[0][now];
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
init();
solve();
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
const int mxn = 1e6 + 6;
int n, r, c, t = 1, fr[mxn], nxt[mxn], ans[mxn];
char s[6 * mxn];
inline void dfs(int x) {
if (!x) return;
dfs(x >> 1);
for (int i = 1; i <= n; ++i) {
ans[i] = ans[ans[i]];
if (x & 1) ans[i] = nxt[ans[i]];
}
}
int main() {
scanf("%d%d%d", &n, &r, &c);
for (int i = 1; i <= n; ++i)
scanf("%s", s + fr[i]), fr[i + 1] = fr[i] + strlen(s + fr[i]),
s[fr[i + 1]++] = ' ';
for (int i = n + 1, j = n + 1; i; nxt[ans[i] = i] = j, --i)
for (; fr[j] - fr[i] > c + 1; --j)
;
dfs(r);
for (int i = 2; i <= n; ++i)
if (ans[i] - i > ans[t] - t) t = i;
for (int i = 1; i <= r; ++i, t = nxt[t], putchar('\n'))
for (int j = fr[t]; j + 1 < fr[nxt[t]]; j++) putchar(s[j]);
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
template <class T>
void _db(const char* dbStr, T e) {
cout << dbStr << " = " << e << endl;
}
template <class T, class... L>
void _db(const char* dbStr, T e, L... r) {
while (*dbStr != ',') cout << *dbStr++;
cout << " = " << e << ',';
_db(dbStr + 1, r...);
}
template <class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
o << "[";
int i = 0;
for (const pair<S, T>& pr : v)
o << (!i++ ? "" : ", ") << "{" << pr.first << " : " << pr.second << "}";
return o << "]";
}
template <template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
o << "[";
int i = 0;
for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
return o << "]";
}
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
return o << "(" << pr.first << ", " << pr.second << ")";
}
ostream& operator<<(ostream& o, const string& s) {
for (const char& c : s) o << c;
return o;
}
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;
int n, r, c;
V<string> s;
vi sum;
vvi adj;
vi path;
pii ans = make_pair(0, 0);
bool good(int i, int j) { return sum[j] - sum[i - 1] + (j - i) > c; }
void dfs(int u, int p) {
path.push_back(u);
int l = path[max(int(path.size()) - 1 - r, 0)] - u;
true;
if (l > ans.first) ans = make_pair(l, u);
for (auto& v : adj[u]) {
if (v != p) dfs(v, u);
}
path.pop_back();
}
int main() {
ios::sync_with_stdio(false);
cout.precision(10);
cin.tie(0);
cin >> n >> r >> c;
s.assign(n + 2, "");
sum.assign(n + 2, 0);
adj.assign(n + 2, vi());
for (int i = 1; i <= n; ++i) {
cin >> s[i];
sum[i] = sum[i - 1] + int(s[i].size());
}
sum.back() = OO;
vi next(n + 2, n + 1);
for (int i = 1; i <= n; ++i) {
int lo = i, hi = n + 1;
while (lo < hi) {
int mid = (lo + hi) / 2;
if (good(i, mid))
hi = mid;
else
lo = mid + 1;
}
true;
next[i] = lo;
adj[next[i]].push_back(i);
}
true;
for (int i = 1; i <= n + 1; ++i) {
if (next[i] == i) dfs(i, i);
}
true;
if (!ans.first)
cout << '\n';
else {
for (int l = ans.second, r = ans.second + ans.first, Sz = int(s[l].size());
l < r; ++l) {
cout << s[l];
if (l + 1 == r || (l + 1 < r && Sz + 1 + int(s[l + 1].size()) > c)) {
cout << '\n';
Sz = int(s[l + 1].size());
} else {
cout << ' ';
Sz += 1 + int(s[l + 1].size());
}
}
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000005;
int n, r, c;
string w[MAXN];
int l[MAXN];
int s[MAXN];
int t[MAXN];
int fa[MAXN][21];
int x[MAXN];
int main() {
cin >> n >> r >> c;
for (int i = 1; i <= n; i++) cin >> w[i];
for (int i = 1; i <= n; i++) l[i] = w[i].length() + 1;
c++;
for (int i = 1; i <= n; i++) s[i] = s[i - 1] + l[i];
for (int i = 1; i <= n; i++) {
int L = i - 1, R = n;
while (L < R) {
int mid = (L + R + 1) / 2;
if (s[mid] - s[i - 1] <= c)
L = mid;
else
R = mid - 1;
}
t[i] = L;
}
for (int i = 1; i <= n; i++) fa[i][0] = t[i] + 1;
fa[n + 1][0] = n + 1;
for (int j = 1; j <= 20; j++)
for (int i = 1; i <= n + 1; i++) fa[i][j] = fa[fa[i][j - 1]][j - 1];
for (int i = 1; i <= n; i++) {
int p = i;
for (int j = 0; j <= 20; j++)
if ((1 << j) & r) p = fa[p][j];
x[i] = p;
}
int ans = -10000, o = 1;
for (int i = 1; i <= n; i++)
if (x[i] - i > ans) ans = x[i] - i, o = i;
int now = 0;
bool flag = false;
for (int i = o; i < x[o]; i++) {
if (now + l[i] > c) {
cout << endl;
now = 0;
flag = false;
}
now += l[i];
if (flag) cout << ' ';
cout << w[i];
flag = true;
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 7;
const int N = 1e6 + 10;
vector<string> vs;
int nex[N][21];
int main() {
int n, r, c;
cin >> n >> r >> c;
vs.resize(n);
for (int i = 0; i < n; i++) {
cin >> vs[i];
}
int ptr = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
while (ptr < n && sum + max(0, ptr - i) + vs[ptr].length() <= c) {
sum += vs[ptr++].length();
}
nex[i][0] = ptr - 1;
sum -= vs[i].length();
ptr = max(ptr, i + 1);
sum = max(sum, 0);
}
nex[n][0] = n - 1;
for (int o = 1; o < 21; o++) {
for (int i = 0; i <= n; i++) {
nex[i][o] = nex[nex[i][o - 1] + 1][o - 1];
}
}
pair<int, int> ans;
for (int i = 0; i < n; i++) {
int cur = i;
for (int o = 0; (1 << o) <= r; o++) {
if (r >> o & 1) {
cur = nex[cur][o] + 1;
}
}
ans = max(ans, {cur - i, i});
}
int cur = ans.second;
while (r--) {
if (cur > nex[cur][0]) break;
int ed = nex[cur][0];
for (int i = cur; i <= ed; i++)
printf("%s%c", vs[i].c_str(), " \n"[i == ed]);
cur = nex[cur][0] + 1;
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int N, R, C, a[1000010][30], sum[1000010];
string str[1000010];
char s[5100000];
int id, mx, len[1000010];
int find_root(int k, int r) {
int u = k;
for (int i = 0; i < 30; i++) {
if (r & (1 << i)) u = a[u][i];
}
return u - k;
}
int main() {
scanf("%d%d%d", &N, &R, &C);
int cu = 0;
for (int i = 1; i <= N; i++) {
scanf("%s", s + cu);
len[i] = strlen(s + cu);
if (i > 1)
sum[i] = len[i] + sum[i - 1];
else
sum[i] = len[i];
cu += len[i];
}
for (int i = 1; i <= N; i++) {
int ed = max(i, a[i - 1][0]);
while (ed <= N && ed - i + sum[ed] - sum[i - 1] <= C) ed++;
a[i][0] = ed;
}
for (int j = 0; j < 30; j++) a[N + 1][j] = N + 1;
for (int j = 1; j < 30; j++)
for (int i = 1; i <= N; i++) a[i][j] = a[a[i][j - 1]][j - 1];
id = 1;
mx = 0;
for (int i = 1; i <= N; i++) {
int cnt = find_root(i, R);
if (mx < cnt) mx = cnt, id = i;
}
int cur = 0, pos = -1;
for (int i = id; i <= N && cur < R; i++) {
if (pos + len[i] >= C) {
cur++;
puts("");
if (cur == R) return 0;
pos = -1;
}
if (pos + len[i] >= C) return 0;
if (pos >= 0) putchar(' ');
for (int j = sum[i - 1]; j < sum[i]; j++) putchar(s[j]);
pos += len[i] + 1;
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char s[5000005];
int len[1000005];
int idx[1000005];
int sum[1000005];
int sz = 0;
int dp[1000005][20];
int p[1000005];
int main() {
int n, r, c;
scanf("%d%d%d", &n, &r, &c);
gets(s);
gets(s);
int cnt = 0, slen = 0;
for (int i = 0; s[i]; i++, slen++) {
if (s[i] == ' ' && cnt != 0) {
len[sz] = cnt;
idx[sz++] = i - cnt;
cnt = 0;
} else
cnt++;
}
if (cnt > 0) {
len[sz] = cnt;
idx[sz++] = slen - cnt;
cnt = 0;
}
sum[0] = len[0];
for (int i = 1; i < n; i++) sum[i] = sum[i - 1] + 1 + len[i];
for (int i = n - 1; i >= 0; i--) {
int id = upper_bound(sum, sum + n, (i > 0 ? sum[i - 1] + 1 : 0) + c) - sum;
if (id > n) id = n;
dp[i][0] = id - i;
}
for (int j = 2, t = 1; j <= r; j *= 2, t++) {
for (int i = n - 1; i >= 0; i--)
dp[i][t] = dp[i][t - 1] + dp[i + dp[i][t - 1]][t - 1];
}
int maid = -1, ma = 0;
for (int i = 0; i < n; i++) {
int idx = i, rr = r, cur = 0;
for (int j = 20; j >= 0; j--) {
if (rr >= (1 << j)) {
rr -= (1 << j);
cur += dp[idx][j];
idx += dp[idx][j];
}
}
if (cur > ma) maid = i, ma = cur;
}
int cn = 1, cs = dp[maid][0];
for (int i = maid; i < maid + ma; i++) {
s[idx[i] + len[i]] = 0;
if (cn < cs) {
printf("%s ", s + idx[i]);
cn++;
} else {
printf("%s\n", s + idx[i]);
cs = dp[i + 1][0];
cn = 1;
}
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int ans, o, N, R, C, s[1000005], l[1000005], f[1000005], d[1000005], p[1000005];
string a[1000005];
vector<int> e[1000005];
void init() {
scanf("%d%d%d", &N, &R, &C);
for (int i = 1; i <= N; i++) cin >> a[i], l[i] = a[i].size() + 1;
for (int i = 1; i <= N; i++) s[i] = s[i - 1] + l[i];
}
void dfs(int u, int k) {
if (k - u > ans) ans = k - u, o = u;
for (int v : e[u]) p[u] = v, dfs(v, d[u] - d[k] < R ? k : p[k]);
}
void doit() {
for (int i = 1, j = 0; i <= N; i++) {
for (; j < N && s[j + 1] - s[i - 1] - 1 <= C; j++)
;
if (j >= i) f[i] = j + 1, e[j + 1].push_back(i);
}
for (int i = N; i; i--) d[i] = d[f[i]] + 1;
for (int i = 1; i <= N + 1; i++)
if (!f[i]) dfs(i, i);
for (int i = o; i < o + ans; i = f[i])
for (int j = i; j < f[i]; j++)
printf("%s%c", a[j].c_str(), j == f[i] - 1 ? '\n' : ' ');
}
int main() {
init();
doit();
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char str[6000006];
char* words[1000006];
int lens[1000006], go[1000006][20];
int sum[1000006];
int get(int l, int r) {
if (l > r) return 0;
return sum[r] - (l > 0 ? sum[l - 1] + 1 : 0);
}
int main() {
int n, r, c;
scanf("%d%d%d\n", &n, &r, &c);
gets(str);
int cur = 0, clen = 0, len = strlen(str);
str[len++] = ' ';
words[0] = &str[0];
for (int i = 0; i < len; ++i) {
if (str[i] == ' ') {
lens[cur] = clen;
clen = 0;
words[cur + 1] = &str[i + 1];
++cur;
str[i] = '\0';
} else {
++clen;
}
}
sum[0] = lens[0];
for (int i = 1; i < n; ++i) sum[i] = 1 + sum[i - 1] + lens[i];
for (int i = 0; i < n; ++i) {
int l = i - 1, r = n;
while (r - l > 1) {
int m = (l + r) >> 1;
if (get(i, m) <= c)
l = m;
else
r = m;
}
go[i][0] = l;
}
for (int j = 0; j < 20; ++j) go[n][j] = n - 1;
for (int i = n - 1; i >= 0; --i) {
for (int j = 1; j < 20; ++j) go[i][j] = go[go[i][j - 1] + 1][j - 1];
}
int best = 0, pos = -1;
for (int i = 0; i < n; ++i) {
int cur = i, left = r;
for (int j = 19; j >= 0; --j)
if (left >= (1 << j)) {
left -= (1 << j);
cur = go[cur][j] + 1;
}
if (cur - i > best) {
best = cur - i;
pos = i;
}
}
if (pos != -1) {
for (int i = 0; i < r && pos < n; ++i) {
int nx = go[pos][0] + 1;
for (int j = pos; j < nx; ++j) {
if (j != pos) printf(" ");
printf("%s", words[j]);
}
printf("\n");
pos = nx;
}
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
const int maxn = 6000010;
using namespace std;
int n, r, c, bel[maxn], st[maxn], ed[maxn], fa[maxn / 5][21];
char s[maxn];
int main() {
scanf("%d%d%d\n", &n, &r, &c);
gets(s + 1);
int len = strlen(s + 1) + 1;
s[len] = ' ';
for (int i = 1, now = 1; i <= len; ++i) {
bel[i] = now;
if (s[i] == ' ') ++now;
}
for (int i = len; i; --i) st[bel[i]] = i;
for (int i = 1; i <= len; ++i) ed[bel[i]] = i;
for (int i = 1; i <= n; ++i)
if (st[i] + c - 1 <= len) {
if (ed[bel[st[i] + c - 1]] <= st[i] + c)
fa[i][0] = bel[st[i] + c - 1] + 1;
else
fa[i][0] = bel[st[i] + c - 1];
} else
fa[i][0] = n + 1;
for (int j = 0; (1 << j) <= r; ++j) fa[n + 1][j] = n + 1;
for (int j = 1; (1 << j) <= r; ++j)
for (int i = 1; i <= n; ++i) fa[i][j] = fa[fa[i][j - 1]][j - 1];
int ans = 0, _ans = 0;
for (int i = 1; i <= n; ++i) {
int tmp = r, x = i;
for (int j = 20; j >= 0; --j)
if ((tmp >> j) & 1) x = fa[x][j];
if (x - i > ans) ans = x - i, _ans = i;
}
for (int i = _ans; i <= _ans + ans - 1;) {
for (int j = st[i]; j < ed[fa[i][0] - 1]; ++j) printf("%c", s[j]);
i = fa[i][0], printf("\n");
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
int n, r, c, len[1000086], next[20][1000086];
char buf[6000086], *pos[1000086];
int main() {
gets(buf);
sscanf(buf, "%d%d%d", &n, &r, &c);
memset(buf, ' ', sizeof(buf));
gets(buf);
buf[strlen(buf)] = ' ';
char *cp = pos[1] = buf;
for (int i = (2), asdf = (n + 1); i <= asdf; ++i) {
while (*cp != ' ') ++cp;
pos[i] = ++cp;
}
int cr = n, cs = -1;
for (int i = (n); i >= (1); --i) {
cs += (len[i] = pos[i + 1] - pos[i]);
while (cs > c) cs -= len[cr--];
next[0][i] = cr + 1;
}
next[0][n + 1] = n + 1;
for (int j = (1); j <= (19); ++j)
for (int i = (1), asdf = (n + 1); i <= asdf; ++i)
next[j][i] = next[j - 1][next[j - 1][i]];
int bans = -1, bi, br;
for (int i = (1); i <= (n); ++i) {
int cr = i;
for (int j = (0); j <= (19); ++j)
if (r & (1 << j)) cr = next[j][cr];
if (cr - i > bans) {
bans = cr - i;
bi = i;
br = cr;
}
}
if (bi == br) return 0;
for (int c = bi; c != br; c = next[0][c]) *(pos[c] - 1) = '\n';
*(pos[br] - 1) = 0;
puts(pos[bi]);
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int wordct;
int nxtidx;
};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, r1, c;
cin >> n >> r1 >> c;
vector<string> words;
vector<int> len;
for (int q = 0; q < n; q++) {
string s;
cin >> s;
words.push_back(s);
len.push_back(s.size() + 1);
}
vector<node> blocks(n + 1);
blocks[n].wordct = 0;
blocks[n].nxtidx = n;
int l = 0, r = 0, curlen = 0, curwords = 0;
while (l < n) {
while (r < n && curlen + len[r] <= c + 1) {
curlen += len[r];
curwords++;
r++;
}
if (l == r) {
blocks[l].wordct = 0;
blocks[l].nxtidx = l;
l++;
r++;
curlen = 0;
curwords = 0;
} else {
blocks[l].wordct = curwords;
blocks[l].nxtidx = r;
curlen -= len[l];
curwords--;
l++;
}
}
vector<vector<pair<int, int>>> binlift(n + 1, vector<pair<int, int>>(21));
for (int q = 0; q < n + 1; q++) {
binlift[q][0].first = blocks[q].nxtidx;
binlift[q][0].second = blocks[q].wordct;
}
for (int q = 1; q < 21; q++) {
for (int w = 0; w < n + 1; w++) {
binlift[w][q].first = binlift[binlift[w][q - 1].first][q - 1].first;
binlift[w][q].second = binlift[w][q - 1].second +
binlift[binlift[w][q - 1].first][q - 1].second;
}
}
int best = -1;
int bestidx = -1;
for (int q = 0; q < n; q++) {
int cur = q;
int tot = 0;
for (int w = 20; w >= 0; w--) {
if ((r1 >> w) & 1) {
tot += binlift[cur][w].second;
cur = binlift[cur][w].first;
}
}
if (tot > best) {
bestidx = q;
best = tot;
}
}
for (int q = 0; q < r1; q++) {
for (int w = bestidx; w < blocks[bestidx].nxtidx; w++) {
cout << words[w];
if (w != blocks[bestidx].nxtidx - 1) {
cout << " ";
}
}
cout << "\n";
bestidx = blocks[bestidx].nxtidx;
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1100000;
char s[11000000];
int n, r, c;
int len[maxn], nex[maxn];
int rig[maxn], res[maxn], dep[maxn];
vector<int> g[maxn];
void dfs(int x) {
res[dep[x]] = x;
rig[x] = res[max(0, dep[x] - r)];
for (int i = 0; i < g[x].size(); ++i) {
dep[g[x][i]] = dep[x] + 1;
dfs(g[x][i]);
}
}
void gao() {
for (int i = 0, j = 1; i < n; ++i) {
while (j <= n && len[j] - len[i] <= c) ++j;
nex[i] = j - 1;
if (nex[i] != i) g[j - 1].push_back(i);
}
nex[n] = n;
}
int main() {
scanf("%d %d %d", &n, &r, &c);
c++;
getchar();
gets(s);
int lenn = strlen(s);
for (int i = 0, j = 0; i < n; ++i) {
while (j < lenn && (s[j] < 'a' || s[j] > 'z')) ++j;
len[i] = j;
while (j < lenn && ('a' <= s[j] && s[j] <= 'z')) ++j;
}
len[n] = lenn + 1;
gao();
for (int i = 0; i <= n; ++i)
if (nex[i] == i) {
dep[i] = 0;
dfs(i);
}
int x = 0, y = 0, z = 0;
for (int i = 0; i < n; ++i)
if (rig[i] - i > x) {
y = i;
z = rig[i];
x = rig[i] - i;
}
if (!x) return 0;
for (int i = y; i != z; i = nex[i]) {
for (int j = len[i]; j < len[nex[i]] - 1; ++j) putchar(s[j]);
puts("");
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int a[N], nex[N], ans[N], n, r, c, t = 1;
char s[6 * N];
void dfs(int x) {
if (!x) return;
dfs(x >> 1);
for (int i = 1; i <= n; i++) {
ans[i] = ans[ans[i]];
if (x & 1) ans[i] = nex[ans[i]];
}
}
int main() {
scanf("%d%d%d", &n, &r, &c);
for (int i = 1; i <= n; i++) {
scanf("%s", s + a[i]);
a[i + 1] = a[i] + strlen(s + a[i]);
s[a[i + 1]++] = ' ';
}
for (int i = n + 1, j = n + 1; i; i--) {
while (a[j] - a[i] > c + 1) j--;
nex[ans[i] = i] = j;
}
dfs(r);
for (int i = 2; i <= n; i++)
if (ans[i] - i > ans[t] - t) t = i;
for (int i = 1; i <= r; i++, t = nex[t], puts(""))
for (int j = a[t]; j + 1 < a[nex[t]]; j++) putchar(s[j]);
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int inf = ~0U >> 1;
const long long INF = ~0ULL >> 1;
template <class T>
inline void read(T &n) {
char c;
for (c = getchar(); !(c >= '0' && c <= '9'); c = getchar())
;
n = c - '0';
for (c = getchar(); c >= '0' && c <= '9'; c = getchar()) n = n * 10 + c - '0';
}
int Pow(int base, int n, int mo) {
if (n == 0) return 1;
if (n == 1) return base % mo;
int tmp = Pow(base, n >> 1, mo);
tmp = (long long)tmp * tmp % mo;
if (n & 1) tmp = (long long)tmp * base % mo;
return tmp;
}
int n, r, c, a[1200000], s[1200000], f[1200000][22];
int best, ansl, ansr;
string str[1200000];
int main() {
ios::sync_with_stdio(0);
cin >> n >> r >> c;
for (int i = (1); i <= (n); ++i) {
cin >> str[i];
a[i] = str[i].size();
}
for (int i = (1); i <= (n); ++i) s[i] = s[i - 1] + a[i];
s[n + 1] = s[n];
int cur = 0;
for (int i = (1); i <= (n); ++i) {
cur = max(cur, i - 1);
while (cur <= n && s[cur + 1] - s[i - 1] + cur + 1 - (i - 1) - 1 <= c)
cur++;
f[i][0] = cur;
}
f[n + 1][0] = n + 1;
for (int j = (1); j <= (20); ++j) {
for (int i = (1); i <= (n); ++i)
if (f[i][j - 1] >= i)
f[i][j] = f[min(n + 1, f[i][j - 1] + 1)][j - 1];
else
f[i][j] = i - 1;
f[n + 1][j] = n + 1;
}
for (int l = (1); l <= (n); ++l) {
if (a[l] > c) continue;
int cur = l - 1;
for (int j = (0); j <= (20); ++j)
if ((1 << j) & r)
if (cur <= n) cur = f[cur + 1][j];
cur = min(cur, n);
if (cur - l + 1 > best) {
best = cur - l + 1;
ansl = l;
ansr = cur;
}
}
for (int i = (ansl); i <= (ansr); ++i) {
int cur = 0;
int flag = 0;
while (cur + a[i] <= c && i <= n) {
cur += a[i] + 1;
if (flag) cout << ' ';
cout << str[i++];
flag = 1;
}
cout << endl;
i--;
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000000 + 10;
const int NUM = 20;
int n, r, c;
string s[MAX];
int sum[MAX];
int fa[MAX][NUM];
int getlen(int l, int r) { return sum[r] - sum[l - 1] + (r - (l - 1) - 1); }
int main() {
int i, j;
scanf("%d%d%d", &n, &r, &c);
for ((i) = (1); (i) <= (n); ++(i)) cin >> s[i];
for ((i) = (1); (i) <= (n); ++(i)) sum[i] = sum[i - 1] + s[i].size();
int ll = 1;
pair<int, int> ans;
for ((i) = (1); (i) <= (n); ++(i)) {
while (ll <= i && getlen(ll, i) > c) ++ll;
fa[i][0] = ll - 1;
for ((j) = (1); (j) != (NUM); ++(j)) fa[i][j] = fa[fa[i][j - 1]][j - 1];
int j = NUM - 1, u = i, s = r;
while (s) {
while (j && (1 << j) > s) --j;
u = fa[u][j];
s -= (1 << j);
}
pair<int, int> t = make_pair(u, i);
if (t.second - t.first > ans.second - ans.first || !ans.second) ans = t;
}
int now = ans.first + 1;
int last = c + 1;
int sum = 0;
for (; now <= ans.second; ++now) {
if (last + 1 + (int)s[now].size() > c) {
++sum;
if (now != ans.first + 1) cout << endl;
last = s[now].size();
} else {
last += 1 + s[now].size();
cout << " ";
}
cout << s[now];
}
for (; sum < r; ++sum) cout << endl;
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int N, R, C;
string W[1000010];
int L[1000010];
int dp[1000010][25];
char tmp[5000010];
int main() {
while (3 == scanf("%d%d%d", &N, &R, &C)) {
for (int i = 0; i < (int)(N); i++) {
scanf("%s", tmp);
W[i] = tmp;
L[i] = W[i].length();
}
int j = 0, s = 0;
for (int i = 0; i < (int)(N); i++) {
if (j < i) {
j = i;
s = 0;
}
while (j < N && (s + L[j]) <= C) {
s += L[j] + 1;
++j;
}
dp[i][0] = j;
if (j > i) s -= (L[i] + 1);
}
dp[N][0] = N;
for (int k = 1; (1 << k) <= R; ++k) {
for (int i = 0; i < (int)(N + 1); i++) dp[i][k] = dp[dp[i][k - 1]][k - 1];
}
int ans_i = 0, ans_k = 0;
for (int i = 0; i < (int)(N); i++) {
int j = i;
for (int k = 0; (1 << k) <= R; ++k)
if (R & (1 << k)) j = dp[j][k];
int k = j - i;
if (k > ans_k) {
ans_k = k;
ans_i = i;
}
}
int r = 0, c = 0;
for (int i = ans_i; i < N; ++i) {
if (c + L[i] > C) {
puts("");
if (L[i] > C) goto done;
++r;
if (r >= R) goto done;
printf("%s", W[i].c_str());
c = L[i] + 1;
} else {
if (c == 0) {
printf("%s", W[i].c_str());
c += L[i] + 1;
} else {
printf(" %s", W[i].c_str());
c += L[i] + 1;
}
}
}
puts("");
done:;
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char s[6000065];
int n, root, r, c, a[6000065], dp[1000005][21], pw[22], st[1000055], l;
int main() {
pw[0] = 1;
for (int i = 1; i <= 20; i++) pw[i] = pw[i - 1] * 2;
scanf("%d%d%d", &n, &r, &c);
for (int i = 1; i <= n; i++) {
scanf("%s", s + root);
st[i] = root;
l = strlen(s + root);
for (int j = root; j < root + l; j++) a[j] = i - 1;
a[root + l - 1] = i;
root += l + 1;
a[root - 1] = i;
}
dp[n + 1][0] = n + 1;
for (int i = 1; i <= n; i++) {
if (st[i] + c - 1 >= root)
dp[i][0] = n + 1;
else
dp[i][0] = a[st[i] + c - 1] + 1;
}
int tot = 0;
for (int i = 1; i <= 20; i++) {
bool isok = false;
for (int j = 1; j <= n + 1; j++) {
dp[j][i] = dp[dp[j][i - 1]][i - 1];
if (dp[j][i] != n + 1) isok = true;
}
tot++;
if (!isok) break;
}
int ans = 0, ans1 = 0;
for (int i = 1; i <= n; i++) {
int t = i, p = r;
for (int j = tot; j >= 0; j--)
if (p >= pw[j]) {
t = dp[t][j];
p -= pw[j];
}
if (ans < t - i || !ans1) {
ans = t - i;
ans1 = i;
}
}
for (int i = 1; i <= r; i++) {
if (ans1 > n) break;
int t = a[st[ans1] + c - 1];
if (st[ans1] + c - 1 >= root) t = n;
if (t < ans1) break;
for (int j = ans1; j < t; j++) printf("%s ", s + st[j]);
printf("%s\n", s + st[t]);
ans1 = t + 1;
}
return 0;
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
long long res = 1;
a %= mod;
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res;
}
const int N = 1010000;
int nxt[N], f[N], ret[N], len[N];
int n, r, c;
char s[N * 6];
int main() {
scanf("%d%d%d", &n, &r, &c);
++c;
int l = 0;
for (int i = 1; i < n + 1; i++) {
scanf("%s", s + l);
int pl = strlen(s + l);
len[i] = len[i - 1] + pl + 1;
l += pl + 1;
s[l - 1] = ' ';
}
int t = 0;
for (int i = 1; i < n + 1; i++) {
while (t <= n && len[t] - len[i - 1] <= c) t++;
nxt[i] = t;
}
nxt[n + 1] = n + 1;
for (int i = 1; i < n + 2; i++) ret[i] = i, f[i] = nxt[i];
for (int b = r; b; b >>= 1) {
if (b & 1)
for (int i = 1; i < n + 1; i++) ret[i] = f[ret[i]];
for (int i = 1; i < n + 1; i++) f[i] = f[f[i]];
}
int rp = 1, rc = ret[1] - 1;
for (int i = 2; i < n + 1; i++)
if (ret[i] - i > rc) rc = ret[i] - i, rp = i;
for (int i = 0; i < r; i++) {
for (int j = len[rp - 1]; j < len[nxt[rp] - 1] - 1; j++) putchar(s[j]);
rp = nxt[rp];
puts("");
}
}
| 8 |
CPP
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.