Submission #251160

#	Time	Username	Problem	Language	Result	Execution time	Memory
251160		AaronNaidu	Dreaming (IOI13_dreaming)	C++14	18 / 100	30 ms	3708 KiB

dreaming

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

vector<pair<int, int>> graph[100001];

int travelTime(int n, int m, int l, int a[], int b[], int t[]) {
    if (n == 1)
    {
        return 0;
    }
    if (n == 2)
    {
        if (m == 1)
        {
            return t[0];
        }
        return l;
    }
    
    int maxDist = 0;
    int secondMaxDist = 0;
    int thirdMaxDist = 0;
    for (int i = 0; i < m; i++)
    {
        if (t[i] > maxDist)
        {
            thirdMaxDist = secondMaxDist;
            secondMaxDist = maxDist;
            maxDist = t[i];
        }
        else if (t[i] > secondMaxDist)
        {
            thirdMaxDist = secondMaxDist;
            secondMaxDist = t[i];
        }
        else if (t[i] > thirdMaxDist)
        {
            thirdMaxDist = t[i];
        }
        
    }
    return max(maxDist + secondMaxDist + l, secondMaxDist + thirdMaxDist + l + l);
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 10
• Subtask 3: 0 / 23
• Subtask 4: 18 / 18
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23