Submission #63562020
Source Code Expand
Copy
#include<bits/stdc++.h>using namespace std;#define int long long#define debug() cout<<"come on"<<'\n'#define mkp make_pair#define pb push_back#define ft first#define sd secondtypedef pair<int,int> pii;typedef pair<int,pii> piii;vector<vector<pii> > v(15);int n,m,d[15],vis[15];void bfs(){queue<int> q;q.push(1);d[1]=0,vis[1]=1;while(!q.empty()){int x=q.front();q.pop();for(int i=0;i<v[x].size();i++){int xx=v[x][i].ft;
#include<bits/stdc++.h> using namespace std; #define int long long #define debug() cout<<"come on"<<'\n' #define mkp make_pair #define pb push_back #define ft first #define sd second typedef pair<int,int> pii; typedef pair<int,pii> piii; vector<vector<pii> > v(15); int n,m,d[15],vis[15]; void bfs(){ queue<int> q; q.push(1); d[1]=0,vis[1]=1; while(!q.empty()){ int x=q.front(); q.pop(); for(int i=0;i<v[x].size();i++){ int xx=v[x][i].ft; // cout<<x<<" "<<xx<<" ",debug(); vis[xx]++; if(vis[xx]>=n+1)continue; int f=d[x]^v[x][i].sd; if(f<d[xx])d[xx]=d[x]^v[x][i].sd,q.push(xx); // cout<<x<<" "<<xx<<" "<<d[x]<<" "<<d[xx]<<" "<<f<<'\n'; } } } signed main(){ cin>>n>>m; memset(d,0x3f,sizeof d); for(int i=1,u,vv,w;i<=m;i++){ cin>>u>>vv>>w; v[u].pb(mkp(vv,w)); v[vv].pb(mkp(u,w)); } // cout<<v[3].size()<<" ",debug(); bfs(); cout<<d[n]; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Minimum XOR Path |
User | dulf2024 |
Language | C++ 20 (gcc 12.2) |
Score | 0 |
Code Size | 935 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 3672 KB |
Compile Error
Main.cpp: In function ‘void bfs()’: Main.cpp:20:30: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::vector<std::pair<long long int, long long int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 20 | for(int i=0;i<v[x].size();i++){ | ~^~~~~~~~~~~~
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_00.txt | AC | 1 ms | 3540 KB |
00_sample_01.txt | AC | 1 ms | 3540 KB |
00_sample_02.txt | WA | 1 ms | 3408 KB |
01_test_00.txt | AC | 1 ms | 3540 KB |
01_test_01.txt | WA | 1 ms | 3440 KB |
01_test_02.txt | AC | 1 ms | 3608 KB |
01_test_03.txt | WA | 1 ms | 3496 KB |
01_test_04.txt | AC | 1 ms | 3672 KB |
01_test_05.txt | AC | 1 ms | 3492 KB |
01_test_06.txt | WA | 1 ms | 3608 KB |
01_test_07.txt | WA | 1 ms | 3536 KB |
01_test_08.txt | WA | 1 ms | 3540 KB |
01_test_09.txt | WA | 1 ms | 3468 KB |
01_test_10.txt | WA | 1 ms | 3472 KB |
01_test_11.txt | WA | 1 ms | 3532 KB |
01_test_12.txt | WA | 1 ms | 3496 KB |
01_test_13.txt | WA | 1 ms | 3408 KB |
01_test_14.txt | WA | 1 ms | 3536 KB |
01_test_15.txt | WA | 1 ms | 3476 KB |
01_test_16.txt | AC | 1 ms | 3608 KB |
01_test_17.txt | WA | 1 ms | 3492 KB |
01_test_18.txt | WA | 1 ms | 3540 KB |
01_test_19.txt | WA | 1 ms | 3536 KB |
01_test_20.txt | WA | 1 ms | 3612 KB |
01_test_21.txt | WA | 1 ms | 3488 KB |
01_test_22.txt | WA | 1 ms | 3612 KB |
01_test_23.txt | WA | 1 ms | 3540 KB |
01_test_24.txt | AC | 1 ms | 3544 KB |
01_test_25.txt | AC | 1 ms | 3400 KB |
01_test_26.txt | AC | 1 ms | 3532 KB |
01_test_27.txt | AC | 1 ms | 3488 KB |
01_test_28.txt | AC | 1 ms | 3524 KB |