제출 #1337039

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1337039		aritro_	이주 (IOI25_migrations)	C++20	0 / 100	28 ms	1008 KiB

migrations

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()

const int N=10000;

vector<vector<int>> g(N);

pair<int,pair<int,int>> bfs(vector<vector<int>>& g){
    int n=g.size();
    vector<int> dist(n,-1);
    queue<int> q;
    q.push(1);
    dist[1]=0;
    while(!q.empty()){
        int v=q.front();q.pop();
        for(int u:g[v]){
            if(dist[u]==-1){
                dist[u]=dist[v]+1;
                q.push(u);
            }
        }
    }
    int start=1,mx=0;
    for(int i=1;i<n;i++){
        if(dist[i]>mx){
            mx=dist[i];
            start=i;
        }
    }
    fill(dist.begin(),dist.end(),-1);
    q.push(start);
    dist[start]=0;
    while(!q.empty()){
        int v=q.front();
        q.pop();
        for(int u:g[v]){
            if(dist[u]==-1){
                dist[u]=dist[v]+1;
                q.push(u);
            }
        }
    }
    int en=start;
    mx=0;
    for(int i=1;i<n;i++){
        if(dist[i]>mx){
            mx=dist[i];
            en=i;
        }
    }
    return make_pair(mx,make_pair(start,en));
}

int send_message(int N,int i,int P);

pair<int,int> longest_path(vector<int> S);

int st=0,finish=0;

int send_message(int N,int i,int P){
    g[i].pb(P);
    g[P].pb(i);
    if(!(9996<=i&&i<=9999)) return 0;
    if(i==9996){
        auto ans=bfs(g);
        return ans.ff;
    }if(i==9997){
        auto ans=bfs(g);
        st=ans.ss.ff;
        return ans.ss.ff;
    }if(i==9998){
        auto ans=bfs(g);
        finish=ans.ss.ss;
        return ans.ss.ss;
    }if(i==9999){
        auto ans=bfs(g);
        int add=0;
        if(st!=ans.ss.ff) add+=10;
        if(finish!=ans.ss.ss) add+=20;
        return ans.ff+add;
    }
}

pair<int,int> longest_path(vector<int> S){
    int a=S[0],b=S[1],c=S[2],d=S[3];
    if(d-a>=30) return {c,9999};
    if(d-a>=20) return {b,9999};
    if(d-a>=10) return {c,9999};
    if(d==a) return {b,c};
    if(d==a+1) return {b,c};
}

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

migrations.cpp: In function 'int send_message(int, int, int)':
migrations.cpp:89:1: warning: control reaches end of non-void function [-Wreturn-type]
   89 | }
      | ^
migrations.cpp: In function 'std::pair<int, int> longest_path(std::vector<int>)':
migrations.cpp:98:1: warning: control reaches end of non-void function [-Wreturn-type]
   98 | }
      | ^

• Subtask 0: 0 / 0
• Subtask 1: 0 / 30
• Subtask 2: 0 / 70