oj.uz

답안 #291429

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
291429 2020-09-05T10:31:34 Z cig32 꿈 (IOI13_dreaming) C++14
0 / 100
 197 ms 22264 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int> >adjlist[100000];
bool visited[100000];
pair<int,int> maxi={0,INT_MAX};
void dfs(int node,int dist_so_far){
    if(visited[node]==false){
        visited[node]=true;
        if(maxi.first<dist_so_far || (maxi.first==dist_so_far && maxi.second>node)){
            maxi={dist_so_far,node};
        }
        for(int i=0;i<adjlist[node].size();i++){
            if(visited[adjlist[node][i].first]==false){
                dfs(adjlist[node][i].first,adjlist[node][i].second+dist_so_far);
            }
        }
    }
}
vector<int>yes;
stack<int>hmph;
void dfs2(int node,int dist_so_far){
    if(visited[node]==false){
        visited[node]=true;
        hmph.push(node);
        if(maxi.first==dist_so_far && maxi.second==node){
            while(hmph.size()){
                yes.push_back(hmph.top());
                hmph.pop();
            }
            reverse(yes.begin(),yes.end());
        }
        for(int i=0;i<adjlist[node].size();i++){
            if(visited[adjlist[node][i].first]==false){
                dfs(adjlist[node][i].first,adjlist[node][i].second+dist_so_far);
            }
        }
        hmph.pop();
    }
}
int travelTime(int N,int M,int L,int A[],int B[],int T[]){
    map<pair<int,int>,int>mp;
    for(int i=0;i<M;i++){
        adjlist[A[i]].push_back({B[i],T[i]});
        adjlist[B[i]].push_back({A[i],T[i]});
        mp[{A[i],B[i]}]=T[i];
        mp[{B[i],A[i]}]=T[i];
    }
    for(int i=0;i<N;i++) visited[i]=false;
    vector<int>starting;
    for(int i=0;i<N;i++){
        if(visited[i]==false){
            dfs(i,0);
            starting.push_back(maxi.second);
            maxi={0,INT_MAX};
        }
    }
    for(int i=0;i<N;i++){
        visited[i]=false;
    }
    vector<pair<int,int> > diameters;
    vector<vector<int> > paths;
    vector<pair<int,int> > maxrecord;
    for(int i=0;i<starting.size();i++){
        dfs(starting[i],0);
        diameters.push_back({starting[i],maxi.second});
        maxrecord.push_back(maxi);
        maxi={0,INT_MAX};
    }
    for(int i=0;i<N;i++){
        visited[i]=false;
    }
    for(int i=0;i<starting.size();i++){
        maxi=maxrecord[i];
        dfs2(starting[i],0);
        paths.push_back(yes);
        yes.clear();
    }
    int ans=0;
    vector<int>segments;
    for(int i=0;i<paths.size();i++){
        ans=max(ans,maxrecord[i].first);
        int good=INT_MAX;
        int sofar=0;
        for(int j=0;j<paths[i].size();j++){
            if(max(maxrecord[i].first-sofar,sofar)<good){
                good=max(maxrecord[i].first-sofar,sofar);
                sofar+=mp[{paths[i][j],paths[i][j+1]}];
            }
            else break;
        }
        segments.push_back(good);
    }
    int d=segments.size();
    sort(segments.begin(),segments.end());
    ans=max(ans,segments[d-1]+segments[d-2]+L);
    ans=max(ans,segments[d-2]+segments[d-3]+2*L);
    return ans;
}

Compilation message

dreaming.cpp: In function 'void dfs(int, int)':
dreaming.cpp:13:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |         for(int i=0;i<adjlist[node].size();i++){
      |                     ~^~~~~~~~~~~~~~~~~~~~~
dreaming.cpp: In function 'void dfs2(int, int)':
dreaming.cpp:33:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for(int i=0;i<adjlist[node].size();i++){
      |                     ~^~~~~~~~~~~~~~~~~~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:64:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int i=0;i<starting.size();i++){
      |                 ~^~~~~~~~~~~~~~~~
dreaming.cpp:73:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for(int i=0;i<starting.size();i++){
      |                 ~^~~~~~~~~~~~~~~~
dreaming.cpp:81:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for(int i=0;i<paths.size();i++){
      |                 ~^~~~~~~~~~~~~
dreaming.cpp:85:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |         for(int j=0;j<paths[i].size();j++){
      |                     ~^~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 22264 KB Output is correct
2 Correct 194 ms 22264 KB Output is correct
3 Correct 114 ms 15608 KB Output is correct
4 Correct 18 ms 5504 KB Output is correct
5 Correct 16 ms 4736 KB Output is correct
6 Correct 33 ms 7032 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 22264 KB Output is correct
2 Correct 194 ms 22264 KB Output is correct
3 Correct 114 ms 15608 KB Output is correct
4 Correct 18 ms 5504 KB Output is correct
5 Correct 16 ms 4736 KB Output is correct
6 Correct 33 ms 7032 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 22264 KB Output is correct
2 Correct 194 ms 22264 KB Output is correct
3 Correct 114 ms 15608 KB Output is correct
4 Correct 18 ms 5504 KB Output is correct
5 Correct 16 ms 4736 KB Output is correct
6 Correct 33 ms 7032 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 74 ms 21396 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 22264 KB Output is correct
2 Correct 194 ms 22264 KB Output is correct
3 Correct 114 ms 15608 KB Output is correct
4 Correct 18 ms 5504 KB Output is correct
5 Correct 16 ms 4736 KB Output is correct
6 Correct 33 ms 7032 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 22264 KB Output is correct
2 Correct 194 ms 22264 KB Output is correct
3 Correct 114 ms 15608 KB Output is correct
4 Correct 18 ms 5504 KB Output is correct
5 Correct 16 ms 4736 KB Output is correct
6 Correct 33 ms 7032 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -