Submission #251158

#	Time	Username	Problem	Language	Result	Execution time	Memory
251158		AaronNaidu	Dreaming (IOI13_dreaming)	C++14	0 / 100	31 ms	4472 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[]) {
    int maxDist = 0;
    int secondMaxDist = 0;
    for (int i = 0; i < m; i++)
    {
        if (t[i] > maxDist)
        {
            secondMaxDist = maxDist;
            maxDist = t[i];
        }
        else if (t[i] > secondMaxDist)
        {
            secondMaxDist = t[i];
        }
    }
    return max(maxDist, secondMaxDist + l);
}

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