oj.uz

Submission #728351

# Submission time Handle Problem Language Result Execution time Memory
728351 2023-04-22T09:10:13 Z NeroZein Dreaming (IOI13_dreaming) C++17
0 / 100
 31 ms 25932 KB 
#include "dreaming.h"
#include <bits/stdc++.h>

using namespace std; 

const int NN = 1000005;

int a[NN], b[NN], t[NN];
vector<pair<int, int>> g[NN]; 
int vis[NN]; 
int far[NN]; 

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
  int n, m, l;
  n = N, m = M, l = L; 
  for (int i = 0; i < m; ++i) {
    a[i] = A[i];
    b[i] = B[i];
    t[i] = T[i];
  }
  int mx2 = 0, mx = 0;
  for (int i = 0; i < m; ++i) {
    mx2 = max(mx2, T[i]);
    if (mx2 > mx) {
      swap(mx, mx2); 
    }
  }
  int ans = max(mx + l, mx2 + 2 * l); 
  return ans; 
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:14:7: warning: variable 'n' set but not used [-Wunused-but-set-variable]
   14 |   int n, m, l;
      |       ^

Subtask #1
0 / 14.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 23764 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 25932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 23764 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 25932 KB Output isn't correct
2 Halted 0 ms 0 KB -