oj.uz

Submission #251158

# Submission time Handle Problem Language Result Execution time Memory
251158 2020-07-20T12:31:17 Z AaronNaidu Dreaming (IOI13_dreaming) C++14
0 / 100
 31 ms 4472 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 4472 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 4472 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 4472 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 3456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 4472 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 4472 KB Output isn't correct
2 Halted 0 ms 0 KB -