oj.uz

답안 #1079542

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079542 2024-08-28T16:33:28 Z mindiyak 꿈 (IOI13_dreaming) C++14
14 / 100
 1000 ms 15500 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<ull> vull;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vpi> vvpi;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
 
vi visited,visited2;
vvpi paths;
int maxdist = 0;
int node = 0;
 
void dfs(int pos,int prev,int dist,int can){
    if(visited[pos])return;
    visited[pos] = 1;
    if(can)visited2[pos] = 1;
 
    if(dist > maxdist){
        node = pos;
        maxdist = dist;
    }
 
    for(auto edge:paths[pos]){
        if(edge.F == prev)continue;
        dfs(edge.F,pos,dist+edge.S,can);
    }
}
 
void dfs2(int pos,int prev,int dist,int to_go){
    if(visited[pos])return;
    visited[pos] = 1;

    if(maxdist > max(to_go,dist)){
        maxdist = max(to_go,dist);
        node = pos;
    }
 
    for(auto edge:paths[pos]){
        if(edge.F == prev)continue;
        dfs2(edge.F,pos,dist+edge.S,to_go-edge.S);
    }
}
 
int travelTime(int n, int m, int L, int A[], int B[], int T[]) {
    if(n==1)return 0;
    paths = vvpi(n);
    visited2 = vi(n,0);
    vi distances(n,0),distancesT(n,0);
 
    FOR(i,0,m){
        paths[A[i]].pb({B[i],T[i]});
        paths[B[i]].pb({A[i],T[i]});
    }
 
    for(int i=0;i<n;i++){
        if(visited2[i])continue;
 
        visited = vi(n,0);
        maxdist = 0;
        node = i;
        dfs(i,-1,0,0);
 
        cerr << i << " " << node << " " << maxdist << endl;
 
        visited = vi(n,0);
        int head = node;
        node = i;
        maxdist = 0;
        dfs(head,-1,0,1);
        distancesT[i] = maxdist;
 
        cerr << "found other corner " << " " << node << " " << maxdist << endl;
 
        head = node;
        visited = vi(n,0);
        dfs2(head,-1,0,maxdist);
 
        cerr << "mid point " << " " << node << " " << maxdist << endl;
 
        visited = vi(n,0);
        head = node;
        maxdist = 0;
        dfs(head,-1,0,0);
 
        cerr << "verifying " << " " << node << " " << maxdist << endl;
 
        distances[i] = maxdist;
 
        FOR(i,0,n)cerr << visited[i] << " ";
        cerr << endl << endl;
    }
 
    sort(distances.rbegin(),distances.rend());
    sort(distancesT.rbegin(),distancesT.rend());
 
    if(m == n-1)return distances[0];
 
    return max(distances[0] + distances[1] + L,distancesT[0]);
    
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 441 ms 14204 KB Output is correct
2 Correct 386 ms 15500 KB Output is correct
3 Correct 260 ms 10332 KB Output is correct
4 Correct 55 ms 2648 KB Output is correct
5 Correct 48 ms 1628 KB Output is correct
6 Correct 85 ms 3736 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 177 ms 5940 KB Output is correct
9 Correct 213 ms 7964 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 304 ms 10672 KB Output is correct
12 Correct 346 ms 13016 KB Output is correct
13 Correct 4 ms 348 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 441 ms 14204 KB Output is correct
2 Correct 386 ms 15500 KB Output is correct
3 Correct 260 ms 10332 KB Output is correct
4 Correct 55 ms 2648 KB Output is correct
5 Correct 48 ms 1628 KB Output is correct
6 Correct 85 ms 3736 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 177 ms 5940 KB Output is correct
9 Correct 213 ms 7964 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 304 ms 10672 KB Output is correct
12 Correct 346 ms 13016 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1025 ms 7612 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 441 ms 14204 KB Output is correct
2 Correct 386 ms 15500 KB Output is correct
3 Correct 260 ms 10332 KB Output is correct
4 Correct 55 ms 2648 KB Output is correct
5 Correct 48 ms 1628 KB Output is correct
6 Correct 85 ms 3736 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 177 ms 5940 KB Output is correct
9 Correct 213 ms 7964 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 304 ms 10672 KB Output is correct
12 Correct 346 ms 13016 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -