oj.uz

Submission #971906

# Submission time Handle Problem Language Result Execution time Memory
971906 2024-04-29T13:09:38 Z Cookie Bad Codes (CCO19_day2problem3) C++14
25 / 100
 5 ms 14940 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#define sz(a) (int)a.size()
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mpp make_pair
const ld PI = 3.14159265359, prec = 1e-9;;
//using u128 = __uint128_t;
//const int x[4] = {1, 0, -1, 0};
//const int y[4] = {0, -1, 0, 1};
const ll mod =1e9 + 7, pr = 31;
const int mxn = 2500, mxq = 1e5 + 5, sq = 500, mxv = 5e4 + 1;
//const int base = (1 <<18);
const ll inf = 1e9 + 5, neg = -69420, inf2 = 1e14;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// have fun!
int n, m, id = 0;
int trie[mxn + 1][2];
bool safe[mxn + 1];
int dis[2505][2505];
vt<pii>events[51];
void solve(){
    cin >> n >> m;
    int ans = inf;
    for(int i = 1; i <= n; i++){
        string s; cin >> s;
        int nd = 0;
        for(int j = 0; j < sz(s); j++){
            int c = s[j] - '0';
            if(!trie[nd][c])trie[nd][c] = ++id;
            nd = trie[nd][c];
        }
        if(safe[nd])ans = min(ans, sz(s));
        safe[nd] = 1; 
        events[sz(s)].pb(mpp(0, nd));
    }
    //modified bfs to handle different starting weights
    for(int i = 0; i <= id; i++){
        for(int j = 0; j <= id; j++){
            dis[i][j] = inf;
        }
    }
    queue<pii>q;
    for(int i = 1; i <= m; i++){
        for(auto j: events[i]){
            if(dis[j.fi][j.se] == inf){
                dis[j.fi][j.se] = i; 
                q.push(j);
            }
        }
        while(sz(q)){
            auto [p1, p2] = q.front();
            if(dis[p1][p2] > i)break;
            q.pop();
            for(int bit = 0; bit < 2; bit++){
                if(trie[p1][bit] && trie[p2][bit]){
                    int n1 = trie[p1][bit], n2 = trie[p2][bit];
                    if(dis[n1][n2] == inf){
                        dis[n1][n2] = dis[p1][p2] + 1;
                        q.push({n1, n2});
                    }if(safe[n1]){
                        //
                        if(dis[0][n2] == inf){
                            dis[0][n2] = dis[p1][p2] + 1;
                            q.push({0, n2});
                        }
                    }if(safe[n2]){
                        if(dis[n1][0] == inf){
                            dis[n1][0] = dis[p1][p2] + 1;
                            q.push({n1, 0});
                        }
                    }
                }
            }
        }
    }
    while(sz(q)){
        auto [p1, p2] = q.front();
        q.pop();
        for(int bit = 0; bit < 2; bit++){
            if(trie[p1][bit] && trie[p2][bit]){
                int n1 = trie[p1][bit], n2 = trie[p2][bit];
                if(dis[n1][n2] == inf){
                    dis[n1][n2] = dis[p1][p2] + 1;
                    q.push({n1, n2});
                }if(safe[n1]){
                        //
                    if(dis[0][n2] == inf){
                        dis[0][n2] = dis[p1][p2] + 1;
                        q.push({0, n2});
                    }
                }if(safe[n2]){
                    if(dis[n1][0] == inf){
                        dis[n1][0] = dis[p1][p2] + 1;
                        q.push({n1, 0});
                    }
                }
            }
        }
    }

    for(int i = 0; i <= id; i++){
        for(int j = 0; j <= id; j++){
            if(safe[i] && safe[j])ans = min(ans, dis[i][j]);
        }
    }
    cout << ((ans == inf) ? -1: ans) << "\n";
}



signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("THREE.inp", "r", stdin);
    //freopen("THREE.out", "w", stdout);
    int tt; tt = 1;
    while(tt--){
        solve();

    }
    return(0);
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:64:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |             auto [p1, p2] = q.front();
      |                  ^
Main.cpp:90:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   90 |         auto [p1, p2] = q.front();
      |              ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 476 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 4516 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 4 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2400 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 476 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 5 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 4516 KB Output is correct
36 Correct 2 ms 6748 KB Output is correct
37 Correct 4 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 1 ms 2400 KB Output is correct
42 Correct 5 ms 12896 KB Output is correct
43 Correct 1 ms 6620 KB Output is correct
44 Correct 1 ms 4448 KB Output is correct
45 Correct 4 ms 12896 KB Output is correct
46 Correct 3 ms 8808 KB Output is correct
47 Correct 4 ms 10848 KB Output is correct
48 Correct 1 ms 4708 KB Output is correct
49 Correct 3 ms 10856 KB Output is correct
50 Correct 2 ms 6504 KB Output is correct
51 Correct 2 ms 8984 KB Output is correct
52 Correct 3 ms 10844 KB Output is correct
53 Correct 3 ms 10844 KB Output is correct
54 Correct 4 ms 14940 KB Output is correct
55 Correct 2 ms 6492 KB Output is correct
56 Correct 1 ms 2396 KB Output is correct
57 Correct 1 ms 4444 KB Output is correct
58 Correct 1 ms 4480 KB Output is correct
59 Correct 2 ms 8796 KB Output is correct
60 Correct 3 ms 10844 KB Output is correct
61 Correct 2 ms 6492 KB Output is correct
62 Correct 2 ms 6492 KB Output is correct
63 Correct 2 ms 8796 KB Output is correct
64 Correct 2 ms 8796 KB Output is correct
65 Correct 2 ms 8792 KB Output is correct
66 Correct 4 ms 12892 KB Output is correct
67 Correct 2 ms 10844 KB Output is correct
68 Correct 4 ms 12892 KB Output is correct