oj.uz

답안 #962363

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
962363 2024-04-13T11:17:38 Z Mohamed_Kachef06 자매 도시 (APIO20_swap) C++17
0 / 100
 2000 ms 7252 KB 
#include "swap.h"
//#include "grader.cpp"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

int n ,  m; 
vector<int> u , v , w; 
int mx ; 
void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
      n = N; m = M; u = U; v = V; w = W; 
      mx = *max_element(w.begin() , w.end());
}

int getMinimumFuelCapacity(int X, int Y) {
  int ans = 1e9;
  for (int i = 0 ; i < m ; i++){
    if (v[i] != Y && v[i] != X) ans = min(ans , w[i]); 
  }
  
  if (ans != 1e9){
    for (int i = 0 ; i < m ; i++){
       if (v[i] == Y || v[i] == X) ans = max(ans , w[i]); 
     }
  }
  return (ans == 1e9 ? -1 : ans);
}

Subtask #1
0 / 6.0

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

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 2033 ms 7252 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 27.0

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