제출 #77241

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
77241		farukkastamonuda	무제 (POI11_dyn)	C++14	0 / 100	426 ms	35916 KiB

Main

#include <bits/stdc++.h>
#define li 300005
#define fi first
#define se second
#define mp make_pair
using namespace std;
int n,m,ok[li],x,y,t,vis[li];
vector<int> v[li];
pair<int,int> say[li],temp;
queue< pair<int,int> > q;
void bfs(){
    while(!q.empty()){
        temp=q.front();
        q.pop();
        int seh=temp.se;
        int cost=temp.fi;
        if(vis[seh]==1) continue;
        vis[seh]=1;
        t-=ok[seh];
        //cout<<seh<<' '<<cost<<endl;
        if(t==0){
            printf("%d\n",cost);
            exit(0);
        }
        for(int i=0;i<(int)v[seh].size();i++){
           // printf("*");
            int go=v[seh][i];
            //cout<<"GO:"<<go<<endl;
            if(vis[go]==1) continue;
            q.push(mp(cost+1,go));
        }
    }
}
int main(){
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;i++) {scanf("%d",&ok[i]);t+=ok[i];}
    for(int i=1;i<n;i++){
        scanf("%d %d",&x,&y);
        v[x].push_back(y);
        v[y].push_back(x);
        say[x].fi++;
        say[y].fi++;
        say[x].se=x;
        say[y].se=y;
    }
    sort(say+1,say+n+1);
    reverse(say+1,say+n+1);
    for(int i=1;i<=m;i++){
        cout<<say[i].se<<endl;
        q.push(mp(0,say[i].se));
    }
    bfs();
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

dyn.cpp: In function 'int main()':
dyn.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~
dyn.cpp:36:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;i++) {scanf("%d",&ok[i]);t+=ok[i];}
                            ~~~~~^~~~~~~~~~~~~
dyn.cpp:38:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&x,&y);
         ~~~~~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10