oj.uz

답안 #1111221

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1111221 2024-11-11T19:05:25 Z nikolashami 꿈 (IOI13_dreaming) C++17
0 / 100
 55 ms 16328 KB 
#include "dreaming.h"
 
#include <bits/stdc++.h>
using namespace std;
 
const int N=1e5+4;
vector<array<int,2>>adj[N];
int d[N][2],vis[N],sigmaxorhash[N],par[N];
 
vector<int>passed;
 
void dfs(int u,bool x){
    passed.push_back(u);
    vis[u]=1;
    for(auto&[v,w]:adj[u]){
        if(vis[v])
            continue;
        d[v][x]=d[u][x]+w;
        dfs(v,x);
    }
}
 
void findpath(int u){
    vis[u]=1;
    for(auto&[v,w]:adj[u]){
        if(vis[v])
            continue;
        par[v]=u;
        sigmaxorhash[u]^=sigmaxorhash[v];
        findpath(v);
    }
}
 
void unq(vector<int>&v){
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}
 
int findmxlen(int node){
    d[node][0]=0;
    dfs(node,0);
    unq(passed);
    int mx=-1,kraj1,kraj2;
    for(int u:passed){
        if(d[u][0]>mx){
            mx=d[u][0];
            kraj1=u;
        }
        vis[u]=0;
    }
    passed.clear();
    d[kraj1][0]=0;
    dfs(kraj1,0);
    unq(passed);
    mx=-1;
    for(int u:passed){
        if(d[u][0]>mx){
            mx=d[u][0];
            kraj2=u;
        }
        vis[u]=0;
    }
    passed.clear();
    d[kraj2][1]=0;
    dfs(kraj2,1);
    unq(passed);
    for(int u:passed){
        sigmaxorhash[u]=0;
        vis[u]=0;
        par[u]=0;
    }
    sigmaxorhash[kraj1]=1;
    sigmaxorhash[kraj2]=1;
    findpath(kraj1);
    unq(passed);
    set<int>path;
    for(int u:passed){
        if(sigmaxorhash[u]){
            path.insert(u);
            if(par[u])path.insert(par[u]);
        }
        vis[u]=1;
    }
    int mnmxlen=2e9;
    for(int v:path)
        mnmxlen=min(mnmxlen,max(d[v][0],d[v][1]));
    path.clear();
    passed.clear();
    return mnmxlen;
}
 
int jednostablo(int node=1){
    d[node][0]=0;
    dfs(node,0);
    int mx=-1,kraj1;
    for(auto&u:passed){
        if(d[u][0]>mx){
            mx=d[u][0];
            kraj1=u;
        }
        vis[u]=0;
    }
    passed.clear();
    d[kraj1][0]=0;
    dfs(kraj1,0);
    mx=-1;
    for(auto&u:passed){
        if(d[u][0]>mx)
            mx=d[u][0];
        vis[u]=0;
    }
    return mx;
}
 
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    int n=N,m=M,l=L;
 
    for(int i=0,u,v,w;i<m;++i){
        u=A[i];
        v=B[i];
        w=T[i];
        ++u,++v;
        adj[u].push_back({v,w});
        adj[v].push_back({u,w});
    }
 
    if(m==n-1)
        return jednostablo();
 
    vector<int>poludijametri;
 
    for(int i=1;i<=n;++i){
        if(vis[i])
            continue;
        poludijametri.push_back(findmxlen(i));
    }
 
    sort(poludijametri.rbegin(),poludijametri.rend());
 
    return poludijametri[0]+poludijametri[1]+l;
}

Compilation message

dreaming.cpp: In function 'int jednostablo(int)':
dreaming.cpp:105:8: warning: 'kraj1' may be used uninitialized in this function [-Wmaybe-uninitialized]
  105 |     dfs(kraj1,0);
      |     ~~~^~~~~~~~~
dreaming.cpp: In function 'int findmxlen(int)':
dreaming.cpp:73:24: warning: 'kraj2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   73 |     sigmaxorhash[kraj2]=1;
      |     ~~~~~~~~~~~~~~~~~~~^~
dreaming.cpp:74:13: warning: 'kraj1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   74 |     findpath(kraj1);
      |     ~~~~~~~~^~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 55 ms 16328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 5712 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 55 ms 16328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 8140 KB Output is correct
2 Incorrect 19 ms 8144 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 5712 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 55 ms 16328 KB Output isn't correct
2 Halted 0 ms 0 KB -