CSES - Aalto Competitive Programming 2024 - wk9 - Wed - Results
Submission details
Task:Broken backspace
Sender:aalto2024j_004
Submission time:2024-11-06 16:52:43 +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.38 sdetails
#51ACCEPTED0.01 sdetails
#52ACCEPTED0.37 sdetails
#53ACCEPTED0.27 sdetails
#54ACCEPTED0.22 sdetails
#55ACCEPTED0.01 sdetails
#56ACCEPTED0.01 sdetails
#57ACCEPTED0.96 sdetails
#58ACCEPTED0.64 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++)
      |                         ~~^~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:224:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  224 |     if (s_len == t_vec.size())
      |         ~~~~~~^~~~~~~~~~~~~~~

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()
{
    string s, t;
    cin >> s >> t;

    vector<char> t_vec(t.begin(), t.end());

    int s_len = s.size();
    int t_size = t.size();

    for (int i = 0; i < s_len; i++)
    {
        if (i >= t_size)
        {
            t_vec.push_back(s[i]);
            t_size++;
        }
        else if (s[i] != t_vec[i])
        {

            t_vec.insert(t_vec.begin() + i, s[i]);
            t_size++;
        }
    }
    if (s_len == t_vec.size())
    {
        cout << "Yes" << endl;
    }
    else
    {
        cout << "No" << endl;
    }
}

Test details

Test 1

Verdict: ACCEPTED

input
y
a

correct output
No

user output
No

Test 2

Verdict: ACCEPTED

input
y
o

correct output
No

user output
No

Test 3

Verdict: ACCEPTED

input
bs
bs

correct output
Yes

user output
Yes

Test 4

Verdict: ACCEPTED

input
vfj
xz

correct output
No

user output
No

Test 5

Verdict: ACCEPTED

input
yif
yi

correct output
Yes

user output
Yes

Test 6

Verdict: ACCEPTED

input
ilzsl
zio

correct output
No

user output
No

Test 7

Verdict: ACCEPTED

input
azg
a

correct output
Yes

user output
Yes

Test 8

Verdict: ACCEPTED

input
mmad
ida

correct output
No

user output
No

Test 9

Verdict: ACCEPTED

input
rmfs
ykcm

correct output
No

user output
No

Test 10

Verdict: ACCEPTED

input
skqwu
ewix

correct output
No

user output
No

Test 11

Verdict: ACCEPTED

input
rkxgc
wtep

correct output
No

user output
No

Test 12

Verdict: ACCEPTED

input
lcat
lce

correct output
No

user output
No

Test 13

Verdict: ACCEPTED

input
zmggznshn
wibfc

correct output
No

user output
No

Test 14

Verdict: ACCEPTED

input
hjgri
fxgxt

correct output
No

user output
No

Test 15

Verdict: ACCEPTED

input
aqjtb
ci

correct output
No

user output
No

Test 16

Verdict: ACCEPTED

input
pnxnq
pnxnq

correct output
Yes

user output
Yes

Test 17

Verdict: ACCEPTED

input
smvvt
s

correct output
Yes

user output
Yes

Test 18

Verdict: ACCEPTED

input
dehlwu
de

correct output
Yes

user output
Yes

Test 19

Verdict: ACCEPTED

input
frovxqt
f

correct output
Yes

user output
Yes

Test 20

Verdict: ACCEPTED

input
isnaiipj
isnai

correct output
Yes

user output
Yes

Test 21

Verdict: ACCEPTED

input
tvfqorxbf
hsiaf

correct output
No

user output
No

Test 22

Verdict: ACCEPTED

input
hbeyzrmpxd
hbeyzrm

correct output
Yes

user output
Yes

Test 23

Verdict: ACCEPTED

input
cvfrdstyia
cvf

correct output
Yes

user output
Yes

Test 24

Verdict: ACCEPTED

input
fbqlgvoypsttw
gkqjckcnpk

correct output
No

user output
No

Test 25

Verdict: ACCEPTED

input
qetmuxclwb
grkdwns

correct output
No

user output
No

Test 26

Verdict: ACCEPTED

input
dnzdfqccei
toeqt

correct output
No

user output
No

Test 27

Verdict: ACCEPTED

input
gigitadgqgktnmlucdrpjmfgzlugaj...

correct output
No

user output
No

Test 28

Verdict: ACCEPTED

input
xhhwpsrfrqywdwqzzgdamkmrgutkys...

correct output
No

user output
No

Test 29

Verdict: ACCEPTED

input
kczmpmbrcgapydtsdjmnhgdqjlmfiw...

correct output
Yes

user output
Yes

Test 30

Verdict: ACCEPTED

input
kdolwqxnrxoguefenlghfehedsiypn...

correct output
No

user output
No

Test 31

Verdict: ACCEPTED

input
eonoxjbddvetnyzwrscrakqugzyzut...

correct output
No

user output
No

Test 32

Verdict: ACCEPTED

input
noytqcblxxegczpwfbcfazouiidlvi...

correct output
Yes

user output
Yes

Test 33

Verdict: ACCEPTED

input
fsnlwzwzhhnnxopbmalxpghzqqhdsg...

correct output
No

user output
No

Test 34

Verdict: ACCEPTED

input
vsylfagbpuzphnpddomopbxpjvhzyc...

correct output
No

user output
No

Test 35

Verdict: ACCEPTED

input
uftadotelejkwprmhqvxquphskiibj...

correct output
No

user output
No

Test 36

Verdict: ACCEPTED

input
wmykhkomvlbaxmocfcdvkcnaqsuyeu...

correct output
No

user output
No

Test 37

Verdict: ACCEPTED

input
bfvdgidzpdbtkomnsdssudrgesexai...

correct output
No

user output
No

Test 38

Verdict: ACCEPTED

input
epehugfuqusovmdehqiyoefztwalqj...

correct output
Yes

user output
Yes

Test 39

Verdict: ACCEPTED

input
xtsdkcvujwifgijwhrxjyiepwhbmpd...

correct output
Yes

user output
Yes

Test 40

Verdict: ACCEPTED

input
suawolvogvzwqdpxqxjttthrtbhnqg...

correct output
No

user output
No

Test 41

Verdict: ACCEPTED

input
vupolhhxbovznwfxdpftypuarxylzk...

correct output
No

user output
No

Test 42

Verdict: ACCEPTED

input
pnrxvijvmrczriritjrreqdtlmvtsj...

correct output
No

user output
No

Test 43

Verdict: ACCEPTED

input
nquhecwwloskilrbxfiqlzxyhggmim...

correct output
Yes

user output
Yes

Test 44

Verdict: ACCEPTED

input
yvzchujqnoihsrlbogoecilotaepru...

correct output
No

user output
No

Test 45

Verdict: ACCEPTED

input
bkbntccvyxeaqspsxlnqgybjhvkyno...

correct output
Yes

user output
Yes

Test 46

Verdict: ACCEPTED

input
pycbqedrafcfqifliujkykggxrusll...

correct output
Yes

user output
Yes

Test 47

Verdict: ACCEPTED

input
ntuyzptgfhnqgsicdshcwhcravwemj...

correct output
Yes

user output
Yes

Test 48

Verdict: ACCEPTED

input
mwdrtpocarqfmmrhlnrmaqlqkmwcwb...

correct output
No

user output
No

Test 49

Verdict: ACCEPTED

input
ylqvocuyflcqydkppyrmygbopzaciy...

correct output
No

user output
No

Test 50

Verdict: ACCEPTED

input
bcfrdxcxwypdknwsnsheysairkjruu...

correct output
No

user output
No

Test 51

Verdict: ACCEPTED

input
luqybuerbcnshnudgittqrpncjmhjk...

correct output
Yes

user output
Yes

Test 52

Verdict: ACCEPTED

input
izamctfueldbjhauzhxhdvbaiedkxc...

correct output
No

user output
No

Test 53

Verdict: ACCEPTED

input
xxuxrrtdpvefxgxikyxvzvjjlnrnzv...

correct output
No

user output
No

Test 54

Verdict: ACCEPTED

input
vzckilqzoxmcrupzvrkqtjjokjcyeo...

correct output
No

user output
No

Test 55

Verdict: ACCEPTED

input
elesagcjlrhfflaqxsmukgbjiiyyyd...

correct output
Yes

user output
Yes

Test 56

Verdict: ACCEPTED

input
ydbfkccnflhkevsfnhrsgfisocskfs...

correct output
Yes

user output
Yes

Test 57

Verdict: ACCEPTED

input
implxialwixramglvesaxoulttxcij...

correct output
No

user output
No

Test 58

Verdict: ACCEPTED

input
uarjxljelkshogcskndxmcouwesvrt...

correct output
No

user output
No