Submission #66750699

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
struct Xorbasis
{
    static constexpr int B = 10;
    int a[B] = {};
    void add(int x){
        for(int i = B - 1; i >= 0; i--){
            if(x & (1 << i))
            {
                if(!a[i])
                {
                    a[i] = x;
                    return;
                }
            }
        }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
struct Xorbasis
{
    static constexpr int B = 10;
    int a[B] = {};
    void add(int x){
        for(int i = B - 1; i >= 0; i--){
            if(x & (1 << i))
            {
                if(!a[i])
                {
                    a[i] = x;
                    return;
                }
            }
        }
    }

    int minimize(int x) const {
        for(int i = B - 1; i>=0; --i){
            if(a[i] && (x ^ a[i]) < x)
            {
                x ^= a[i];
            }
        }
        return x;
    }
};


int main(){
    int n,m;
    cin >> n >> m;
    struct Edge{int u,v,w;};
    vector<Edge> edges(m);
    vector<vector<pair<int,int>>> g(n+1);
    for(int i =0;i<m;i++){
        int a,b,w;
        cin >> a >> b >> w;
        edges[i] = {a, b, w};
        g[a].push_back({b, w});
    }

    vector<int> dist(n+1,-1);
    queue<int> q;
    dist[1] = 0; q.push(1);
    while(!q.empty())
    {
        int u = q.front(); q.pop();
        for(auto [v,w]:g[u])
        {
            if(dist[v] == -1)
            {
                dist[v] = dist[u]^w;
                q.push(v);
            }
        }
    }

    if(dist[n] == -1)
    {
        cout << -1 << endl;
        return 0;
    }

    Xorbasis basis;
    for(auto [u,v,w]:edges)
    {
        if(!dist[u]!= -1 && dist[v] != -1)
        {
            basis.add(dist[u] ^ dist[v] ^ w);
        }
    }

    cout << basis.minimize(dist[n]) << endl;


    

}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:73:20: warning: logical not is only applied to the left hand side of comparison [-Wlogical-not-parentheses]
   73 |         if(!dist[u]!= -1 && dist[v] != -1)
      |                    ^~
Main.cpp:73:12: note: add parentheses around left hand side expression to silence this warning
   73 |         if(!dist[u]!= -1 && dist[v] != -1)
Main.cpp:73:20: warning: comparison of constant ‘-1’ with boolean expression is always true [-Wbool-compare]
   73 |         if(!dist[u]!= -1 && dist[v] != -1)
      |            ~~~~~~~~^~~~~

Judge Result