oj.uz

답안 #842922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
842922 2023-09-03T13:28:48 Z 12345678 꿈 (IOI13_dreaming) C++17
0 / 100
 18 ms 1884 KB 
#include "dreaming.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5;
vector<int> nt(nx);

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    for (int i=0; i<M; i++) nt[i]=T[i];
    sort(nt.begin(), nt.end());
    reverse(nt.begin(), nt.end());
    return max(nt[0]+L+nt[1], nt[1]+2*L+nt[2]);
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

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

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1116 KB Output is correct
2 Correct 7 ms 1484 KB Output is correct
3 Correct 7 ms 1484 KB Output is correct
4 Correct 8 ms 1628 KB Output is correct
5 Correct 8 ms 1388 KB Output is correct
6 Correct 8 ms 1628 KB Output is correct
7 Correct 10 ms 1664 KB Output is correct
8 Correct 8 ms 1628 KB Output is correct
9 Correct 9 ms 1372 KB Output is correct
10 Correct 8 ms 1444 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 1112 KB Output is correct
13 Correct 2 ms 868 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 856 KB Output is correct
18 Correct 2 ms 860 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Incorrect 2 ms 604 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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