Submission #35610311

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<bits/stdc++.h>
using namespace std;
const int mxn=1e5+10;
int n,m,k,a1,a2;
vector<int>ver[mxn];
int f[mxn],a[mxn],b[mxn];
struct node{
    int p,w;
    friend bool operator < (const node a,const node b) {return a.w>b.w;}
}; priority_queue<node>q; bool vis[mxn];
int main()
{
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&a1,&a2);
        ver[a1].push_back(a2); ver[a2].push_back(a1);
    }
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    for(int i=1;i<=k;i++) scanf("%d",&b[i]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
using namespace std;
const int mxn=1e5+10;

int n,m,k,a1,a2;
vector<int>ver[mxn];
int f[mxn],a[mxn],b[mxn];
struct node{
    int p,w;
    friend bool operator < (const node a,const node b) {return a.w>b.w;}
}; priority_queue<node>q; bool vis[mxn];
int main()
{
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&a1,&a2);
        ver[a1].push_back(a2); ver[a2].push_back(a1);
    }
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    for(int i=1;i<=k;i++) scanf("%d",&b[i]);
    memset(f,0x3f,sizeof(f));
    f[1]=(b[1]==a[1]); q.push(node{1,f[1]});
    while(!q.empty())
    {
        node ff=q.top(); q.pop(); int u=ff.p;
        if(vis[u]) continue; 
        vis[u]=1;
        for(int to:ver[u])
        {
            int w=(f[u]==k?k:f[u]+(b[f[u]+1]==a[to]));
            if(f[to]>w)
            {
                f[to]=w;
                q.push(node{to,f[to]});
            }
        }
    }
    if(f[n]==k) puts("Yes");
    else puts("No");
}   

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:10: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   14 |     scanf("%d%d%d",&n,&m,&k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
./Main.cpp:17:14: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   17 |         scanf("%d%d",&a1,&a2);
      |         ~~~~~^~~~~~~~~~~~~~~~
./Main.cpp:20:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   20 |     for(int i=1;i<=n;i++) scanf("%d",&a[i]);
      |                           ~~~~~^~~~~~~~~~~~
./Main.cpp:21:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   21 |     for(int i=1;i<=k;i++) scanf("%d",&b[i]);
      |                           ~~~~~^~~~~~~~~~~~

Judge Result