CSES - Aalto Competitive Programming 2024 - wk9 - Mon - Results
Submission details
Task:Matter++
Sender:fabiank
Submission time:2024-11-04 17:24:11 +0200
Language:C++ (C++17)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#30ACCEPTED0.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#33ACCEPTED0.00 sdetails
#34ACCEPTED0.00 sdetails
#35ACCEPTED0.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#38ACCEPTED0.00 sdetails
#39ACCEPTED0.00 sdetails
#40ACCEPTED0.00 sdetails
#41ACCEPTED0.00 sdetails
#42ACCEPTED0.00 sdetails
#43ACCEPTED0.00 sdetails
#44ACCEPTED0.00 sdetails
#45ACCEPTED0.00 sdetails
#46ACCEPTED0.00 sdetails
#47ACCEPTED0.00 sdetails
#48ACCEPTED0.00 sdetails
#49ACCEPTED0.00 sdetails
#50ACCEPTED0.00 sdetails
#51ACCEPTED0.00 sdetails
#52ACCEPTED0.00 sdetails
#53ACCEPTED0.00 sdetails
#54ACCEPTED0.00 sdetails
#55ACCEPTED0.00 sdetails
#56ACCEPTED0.00 sdetails
#57ACCEPTED0.00 sdetails
#58ACCEPTED0.00 sdetails
#59ACCEPTED0.00 sdetails
#60ACCEPTED0.00 sdetails
#61ACCEPTED0.00 sdetails
#62ACCEPTED0.01 sdetails
#63ACCEPTED0.01 sdetails
#64ACCEPTED0.01 sdetails
#65ACCEPTED0.01 sdetails
#66ACCEPTED0.01 sdetails
#67ACCEPTED0.01 sdetails
#68ACCEPTED0.01 sdetails
#69ACCEPTED0.01 sdetails
#70ACCEPTED0.01 sdetails
#71ACCEPTED0.01 sdetails

Compiler report

input/code.cpp: In function 'long long int ford_fulkerson(std::vector<std::vector<long long int> >&, int, int)':
input/code.cpp:137:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  137 |         for (int i = 1; i < path_reversed.size(); i++)
      |                         ~~^~~~~~~~~~~~~~~~~~~~~~

Code

#include <bits/stdc++.h>
#define REP(i, a, b) for (int i = a; i < b; i++)
// Type Aliases for 1D and 2D vectors with initialization
#define vll(n, val) vector<long long>(n, val) // 1D vector of long longs with size n, initialized to val
#define ll long long
#define vvi(n, m, val) vector<vector<int>>(n, vector<int>(m, val)) // 2D vector of ints (n x m), initialized to val
#define vvll(n, m, val) vector<vector<long long>>(n, vector<long long>(m, val)) // 2D vector of long longs (n x m), initialized to val
using namespace std;
void print_vector(vector<int> &x)
{
for (int v : x)
{
cout << v << " ";
}
cout << "\n";
}
void print_matrix(vector<vector<int>> &matrix)
{
cout << "\n"
<< "----------------" << "\n";
for (vector<int> row : matrix)
{
print_vector(row);
}
cout << "\n"
<< "----------------" << "\n";
}
int calc_max_digit(int n)
{
int max_digit = 0;
while (n > 0 && max_digit < 9)
{
int digit = n % 10;
if (digit > max_digit)
{
max_digit = digit;
}
n /= 10;
}
return max_digit;
}
// edges as edge list for outgoing node as pairs (end, cost)
vector<ll> dijkstras(int start_point, vector<vector<pair<int, int>>> edges)
{
int n = edges.size();
vector<bool> processed(n, false);
vector<ll> distances(n, LLONG_MAX);
distances[start_point] = 0;
priority_queue<pair<ll, int>> pq;
pq.push({0, start_point});
while (!pq.empty())
{
int curr = pq.top().second;
pq.pop();
if (processed[curr])
{
continue;
}
processed[curr] = true;
ll distance = distances[curr];
for (pair<int, int> edge : edges[curr])
{
if (distance + edge.second < distances[edge.first])
{
distances[edge.first] = distance + edge.second;
pq.push({-distances[edge.first], edge.first});
}
}
}
return distances;
}
int bfs_edmondson_karp(const vector<vector<ll>> &connections,
const int source, const int target, vector<int> &path_reversed)
{
int n = connections.size();
queue<pair<int, ll>> queue;
queue.push({source, LLONG_MAX});
vector<int> predecessor(n, -2);
predecessor[source] = -1;
while (!queue.empty())
{
int current = queue.front().first;
ll current_bottleneck = queue.front().second;
queue.pop();
if (current == target)
{
while (current != -1)
{
path_reversed.push_back(current);
current = predecessor[current];
}
return current_bottleneck;
}
for (int edge_end = 0; edge_end < n; edge_end++)
{
ll edge_cap = connections[current][edge_end];
if (edge_cap > 0 && predecessor[edge_end] == -2)
{
predecessor[edge_end] = current;
queue.push({edge_end, min(current_bottleneck, edge_cap)});
}
}
}
return -1;
}
ll ford_fulkerson(vector<vector<ll>> &residual_graph, const int source, const int target)
{
ll flow = 0;
while (true)
{
vector<int> path_reversed;
int path_capacity = bfs_edmondson_karp(residual_graph, source, target, path_reversed);
if (path_capacity < 0)
{
break;
}
flow += path_capacity;
for (int i = 1; i < path_reversed.size(); i++)
{
int edge_end = path_reversed[i - 1];
int edge_start = path_reversed[i];
// reduce forwards edge
residual_graph[edge_start][edge_end] -= path_capacity;
assert(residual_graph[edge_start][edge_end] >= 0);
// add to backwards edge
residual_graph[edge_end][edge_start] += path_capacity;
assert(residual_graph[edge_end][edge_start] >= 0);
}
}
return flow;
}
bool dfs(int n, const vector<vector<int>> snakes, vector<bool> &visited, vector<int> path, int start, int target)
{
if (start == target)
{
path.push_back(target);
return true;
}
for (int i = n; n >= 1; n--)
{
if (!visited[i] && !snakes[start][i])
{
if (dfs(n, snakes, visited, path, i, target))
{
path.push_back(start);
return true;
}
}
}
return false;
}
vector<int> z(const string &s)
{
int n = s.size();
vector<int> z(n);
int x = 0, y = 0;
for (int k = 1; k < n; k++)
{
z[k] = max(0, min(z[k - x], y - k + 1));
while (k + z[k] < n && s[z[k]] == s[k + z[k]])
{
// while there is a potential longer match and characters coincide
x = k;
y = k + z[k];
z[k]++;
}
}
return z;
}
void print_letter_x_times(char letter, int count)
{
for (int i = 0; i < count; i++)
{
cout << letter;
}
}
int main()
{
int W;
string s;
cin >> W;
cin >> s;
int n = s.size();
int l = 0;
int r = 0;
vector<int> cnts(26, 0);
long long potential = 0;
int shortest_distance = INT_MAX;
int shortest_start = -1;
while (l < n)
{
while (potential < W && r < n)
{
r += 1;
int character = s[r - 1] - 'a';
potential += 2 * cnts[character] + 1;
cnts[character]++;
// cout << l << " - " << r << ": " << potential << endl;
}
// cout << l << " - " << r << ": " << potential << endl;
if (r - l < shortest_distance && potential >= W)
{
shortest_distance = r - l;
shortest_start = l;
}
int char_l = s[l] - 'a';
potential -= 2 * cnts[char_l] - 1;
cnts[char_l]--;
l++;
}
for (int i = 0; i < shortest_distance; i++)
{
cout << s[shortest_start + i];
}
}

Test details

Test 1

Verdict: ACCEPTED

input
1
e

correct output
e

user output
e

Test 2

Verdict: ACCEPTED

input
1
be

correct output
b

user output
b

Test 3

Verdict: ACCEPTED

input
1
za

correct output
z

user output
z

Test 4

Verdict: ACCEPTED

input
1
po

correct output
p

user output
p

Test 5

Verdict: ACCEPTED

input
1
acc

correct output
a

user output
a

Test 6

Verdict: ACCEPTED

input
2
caa

correct output
ca

user output
ca

Test 7

Verdict: ACCEPTED

input
2
caa

correct output
ca

user output
ca

Test 8

Verdict: ACCEPTED

input
2
cced

correct output
cc

user output
cc

Test 9

Verdict: ACCEPTED

input
2
ceea

correct output
ce

user output
ce

Test 10

Verdict: ACCEPTED

input
1
ccad

correct output
c

user output
c

Test 11

Verdict: ACCEPTED

input
4
ccda

correct output
cc

user output
cc

Test 12

Verdict: ACCEPTED

input
1
defdf

correct output
d

user output
d

Test 13

Verdict: ACCEPTED

input
1
fefaa

correct output
f

user output
f

Test 14

Verdict: ACCEPTED

input
7
bafdf

correct output
bafdf

user output
bafdf

Test 15

Verdict: ACCEPTED

input
1
aefba

correct output
a

user output
a

Test 16

Verdict: ACCEPTED

input
3
cbacc

correct output
cc

user output
cc

Test 17

Verdict: ACCEPTED

input
1
bwvfj

correct output
b

user output
b

Test 18

Verdict: ACCEPTED

input
11
caaca

correct output
caaca

user output
caaca

Test 19

Verdict: ACCEPTED

input
4
fuilz

correct output
fuil

user output
fuil

Test 20

Verdict: ACCEPTED

input
5
acacb

correct output
aca

user output
aca

Test 21

Verdict: ACCEPTED

input
4
jnmma

correct output
mm

user output
mm

Test 22

Verdict: ACCEPTED

input
6
defdfdfcdd

correct output
defd

user output
defd

Test 23

Verdict: ACCEPTED

input
5
fefaabfaba

correct output
fef

user output
fef

Test 24

Verdict: ACCEPTED

input
22
bafdfcccbb

correct output
bafdfcccbb

user output
bafdfcccbb

Test 25

Verdict: ACCEPTED

input
12
aefbaddfcf

correct output
aefbaddf

user output
aefbaddf

Test 26

Verdict: ACCEPTED

input
14
cbacccbcba

correct output
cccbc

user output
cccbc

Test 27

Verdict: ACCEPTED

input
1
bwvfjxzmcp

correct output
b

user output
b

Test 28

Verdict: ACCEPTED

input
17
caacaabacb

correct output
aacaa

user output
aacaa

Test 29

Verdict: ACCEPTED

input
13
fuilzslzio

correct output
ilzslzi

user output
ilzslzi

Test 30

Verdict: ACCEPTED

input
16
acacbbcaba

correct output
acacbbc

user output
acacbbc

Test 31

Verdict: ACCEPTED

input
5
jnmmadidaf

correct output
nmm

user output
nmm

Test 32

Verdict: ACCEPTED

input
278
defdfdfcddccbfafbcceedcdcffaca...

correct output
fdfcddccbfafbcceedcdcffacadace...

user output
fdfcddccbfafbcceedcdcffacadace...

Test 33

Verdict: ACCEPTED

input
32
fefaabfabacbccecfdfcbedbcfbade...

correct output
cbccecfdfc

user output
cbccecfdfc

Test 34

Verdict: ACCEPTED

input
1387
bafdfcccbbabedabcbddedeacddbee...

correct output
dfcccbbabedabcbddedeacddbeebfd...

user output
dfcccbbabedabcbddedeacddbeebfd...

Test 35

Verdict: ACCEPTED

input
190
aefbaddfcfaaabbaaceaaccdbbcecd...

correct output
aaabbaaceaaccdbbcecdfaedfbccdb...

user output
aaabbaaceaaccdbbcecdfaedfbccdb...

Test 36

Verdict: ACCEPTED

input
1205
cbacccbcbaacaacacbbcaabcbcbabb...

correct output
abbaabccbacacccbabaabaacccbcbc...

user output
abbaabccbacacccbabaabaacccbcbc...

Test 37

Verdict: ACCEPTED

input
299
bwvfjxzmcpktjnmhzevcqtvlgetwch...

correct output
vfjxzmcpktjnmhzevcqtvlgetwchfk...

user output
vfjxzmcpktjnmhzevcqtvlgetwchfk...

Test 38

Verdict: ACCEPTED

input
2796
caacaabacbabbbbbbbcbccbbababcc...

correct output
bacbabbbbbbbcbccbbababccccbbcc...

user output
bacbabbbbbbbcbccbbababccccbbcc...

Test 39

Verdict: ACCEPTED

input
345
fuilzslziogncbkgamnrwuijkbrhrx...

correct output
lziogncbkgamnrwuijkbrhrxsfilyy...

user output
lziogncbkgamnrwuijkbrhrxsfilyy...

Test 40

Verdict: ACCEPTED

input
1517
acacbbcababbcbbbcbcbabccbccbab...

correct output
baaaaaccaaaaababbccbbccaaababb...

user output
baaaaaccaaaaababbccbbccaaababb...

Test 41

Verdict: ACCEPTED

input
123
jnmmadidafwkdgdckimeiwjytbzsso...

correct output
mmadidafwkdgdckimeiwjytbzssodx...

user output
mmadidafwkdgdckimeiwjytbzssodx...

Test 42

Verdict: ACCEPTED

input
1079
defdfdfcddccbfafbcceedcdcffaca...

correct output
fdfdfcddccbfafbcceedcdcffacada...

user output
fdfdfcddccbfafbcceedcdcffacada...

Test 43

Verdict: ACCEPTED

input
56
fefaabfabacbccecfdfcbedbcfbade...

correct output
fbeeefebaedfff

user output
fbeeefebaedfff

Test 44

Verdict: ACCEPTED

input
5337
bafdfcccbbabedabcbddedeacddbee...

correct output
bafdfcccbbabedabcbddedeacddbee...

user output
bafdfcccbbabedabcbddedeacddbee...
Truncated

Test 45

Verdict: ACCEPTED

input
744
aefbaddfcfaaabbaaceaaccdbbcecd...

correct output
cccacdedecabbcdcebdbbcdfddfbeb...

user output
cccacdedecabbcdcebdbbcdfddfbeb...

Test 46

Verdict: ACCEPTED

input
10488
cbacccbcbaacaacacbbcaabcbcbabb...

correct output
bcbcbabbcabbaabccbacacccbabaab...

user output
bcbcbabbcabbaabccbacacccbabaab...
Truncated

Test 47

Verdict: ACCEPTED

input
11
bwvfjxzmcpktjnmhzevcqtvlgetwch...

correct output
pxyyy

user output
pxyyy

Test 48

Verdict: ACCEPTED

input
5929
caacaabacbabbbbbbbcbccbbababcc...

correct output
bbbbbbbcbccbbababccccbbccccbac...

user output
bbbbbbbcbccbbababccccbbccccbac...
Truncated

Test 49

Verdict: ACCEPTED

input
1398
fuilzslziogncbkgamnrwuijkbrhrx...

correct output
gncbkgamnrwuijkbrhrxsfilyygatp...

user output
gncbkgamnrwuijkbrhrxsfilyygatp...
Truncated

Test 50

Verdict: ACCEPTED

input
5219
acacbbcababbcbbbcbcbabccbccbab...

correct output
acbbcababbcbbbcbcbabccbccbabba...

user output
acbbcababbcbbbcbcbabccbccbabba...
Truncated

Test 51

Verdict: ACCEPTED

input
450
jnmmadidafwkdgdckimeiwjytbzsso...

correct output
qmtyjuvzcecnbymqfwyzzergpwuxbt...

user output
qmtyjuvzcecnbymqfwyzzergpwuxbt...
Truncated

Test 52

Verdict: ACCEPTED

input
26679
defdfdfcddccbfafbcceedcdcffaca...

correct output
bcbfacacffbedecaafcecffaffaadd...

user output
bcbfacacffbedecaafcecffaffaadd...
Truncated

Test 53

Verdict: ACCEPTED

input
22417
fefaabfabacbccecfdfcbedbcfbade...

correct output
adefccdcafbeeefebaedfffeaeabba...

user output
adefccdcafbeeefebaedfffeaeabba...
Truncated

Test 54

Verdict: ACCEPTED

input
128464
bafdfcccbbabedabcbddedeacddbee...

correct output
bafdfcccbbabedabcbddedeacddbee...

user output
bafdfcccbbabedabcbddedeacddbee...
Truncated

Test 55

Verdict: ACCEPTED

input
10769
aefbaddfcfaaabbaaceaaccdbbcecd...

correct output
ebefdceecdabceccdeaebdeebdcdfa...

user output
ebefdceecdabceccdeaebdeebdcdfa...
Truncated

Test 56

Verdict: ACCEPTED

input
70653
cbacccbcbaacaacacbbcaabcbcbabb...

correct output
acaaaaaabaaabbccbabbbbcacbccbc...

user output
acaaaaaabaaabbccbabbbbcacbccbc...
Truncated

Test 57

Verdict: ACCEPTED

input
233
bwvfjxzmcpktjnmhzevcqtvlgetwch...

correct output
qfvyojqjvhyfxtvycrjlaoofuebvev...

user output
qfvyojqjvhyfxtvycrjlaoofuebvev...

Test 58

Verdict: ACCEPTED

input
116525
caacaabacbabbbbbbbcbccbbababcc...

correct output
caaabbacabbbabcccbacaaacaaccac...

user output
caaabbacabbbabcccbacaaacaaccac...
Truncated

Test 59

Verdict: ACCEPTED

input
27985
fuilzslziogncbkgamnrwuijkbrhrx...

correct output
uilzslziogncbkgamnrwuijkbrhrxs...

user output
uilzslziogncbkgamnrwuijkbrhrxs...
Truncated

Test 60

Verdict: ACCEPTED

input
161959
acacbbcababbcbbbcbcbabccbccbab...

correct output
acacbbcababbcbbbcbcbabccbccbab...

user output
acacbbcababbcbbbcbcbabccbccbab...
Truncated

Test 61

Verdict: ACCEPTED

input
8903
jnmmadidafwkdgdckimeiwjytbzsso...

correct output
uaguxmabjxfuialfmskifofagvsnkn...

user output
uaguxmabjxfuialfmskifofagvsnkn...
Truncated

Test 62

Verdict: ACCEPTED

input
264240357
defdfdfcddccbfafbcceedcdcffaca...

correct output
badeaccfbabfcceaabffecbffcdcfe...

user output
badeaccfbabfcceaabffecbffcdcfe...
Truncated

Test 63

Verdict: ACCEPTED

input
30437082
fefaabfabacbccecfdfcbedbcfbade...

correct output
acdbbfafacdebdefccfbcfcdeecdfd...

user output
acdbbfafacdebdefccfbcfcdeecdfd...
Truncated

Test 64

Verdict: ACCEPTED

input
1280505429
bafdfcccbbabedabcbddedeacddbee...

correct output
eaceacebbcdfacddcecfceccddfcac...

user output
eaceacebbcdfacddcecfceccddfcac...
Truncated

Test 65

Verdict: ACCEPTED

input
107609709
aefbaddfcfaaabbaaceaaccdbbcecd...

correct output
bffcffbddbfedcccfcdcdfecbbefbe...

user output
bffcffbddbfedcccfcdcdfecbbefbe...
Truncated

Test 66

Verdict: ACCEPTED

input
706196896
cbacccbcbaacaacacbbcaabcbcbabb...

correct output
bccbccccacabcacaaabcccbacbcaba...

user output
bccbccccacabcacaaabcccbacbcaba...
Truncated

Test 67

Verdict: ACCEPTED

input
9966992
bwvfjxzmcpktjnmhzevcqtvlgetwch...

correct output
hljwtcgatnetpvfxeiipnhaarsejbf...

user output
hljwtcgatnetpvfxeiipnhaarsejbf...
Truncated

Test 68

Verdict: ACCEPTED

input
1449002782
caacaabacbabbbbbbbcbccbbababcc...

correct output
acbaabcaababcabcccabcbbaacccca...

user output
acbaabcaababcabcccabcbbaacccca...
Truncated

Test 69

Verdict: ACCEPTED

input
275504573
fuilzslziogncbkgamnrwuijkbrhrx...

correct output
lziogncbkgamnrwuijkbrhrxsfilyy...

user output
lziogncbkgamnrwuijkbrhrxsfilyy...
Truncated

Test 70

Verdict: ACCEPTED

input
1480920774
acacbbcababbcbbbcbcbabccbccbab...

correct output
bcccaccabcaabccaaabcbbacbbbbba...

user output
bcccaccabcaabccaaabcbbacbbbbba...
Truncated

Test 71

Verdict: ACCEPTED

input
199518168
jnmmadidafwkdgdckimeiwjytbzsso...

correct output
mzdiyihtesgshxbshryvzqghavzgrs...

user output
mzdiyihtesgshxbshryvzqghavzgrs...
Truncated