oj.uz

Submission #600904

# Submission time Handle Problem Language Result Execution time Memory
600904 2022-07-21T09:00:31 Z narvalo Ferries (NOI13_ferries) C++17
17 / 40
 113 ms 21200 KB 
#include <bits/stdc++.h>

using namespace std;

int ferries(int n , int m , vector<int> a , vector<int> b , vector<int> c) {
  vector<vector<pair<int , int>>> adj(n);
  for (int i = 0 ; i < m ; i++) {
    a[i] -= 1 , b[i] -= 1;
    adj[a[i]].emplace_back(b[i] , c[i]);
  }
  vector<int> s , d;

  if ((int)s.size() == (int)d.size() && (int)s.size() == n - 2) {
    for (int i = 0 ; i < (int)adj[0].size() ; i += 1) {
      s.push_back(adj[0][i].second);
    }
    sort(s.begin() , s.end());
    for (int i = 1 ; i < n - 1 ; i += 1) {
      d.push_back(adj[i][0].second);
    }
    sort(d.begin() , d.end());
  }
  else {
    vector<int> vis(n);
    vis[0] = 1;
    vector<int> dp(n , -1);
    function<int(int)> Dfs = [&](int node) {
      if (node == n - 1) {
        return dp[node] = 0;
      }
      if (vis[node] == 1) {
        return -1;
      }
      else if (vis[node] == 2) {
        return dp[node];
      }
      vis[node] = 1;
      int val = 0;
      for (auto x : adj[node]) {
        val = Dfs(x.first);
        if (val != -1) {
          val += x.second;
        }
      }
      vis[node] = 2;
      return dp[node] = val;
    };
    // maximize the minimum
    for (int i = 0 ; i < (int)adj[0].size() ; i++) {
      int cur = Dfs(adj[0][i].first);
      if (cur > -1) {
        s.push_back(cur);
      }
      d.push_back(adj[0][i].second);
    }
    sort(s.begin() , s.end());
    sort(d.begin() , d.end());
  }
  auto Get = [&]() {
    int val = (int)1e9;
    for (int i = 0 ; i < (int)s.size() ; i += 1) {
      val = min(val , s[i] + d[(int)s.size() - 1 - i]);
    }
    return val;
  };
  int res = Get();
  reverse(s.begin() , s.end());
  reverse(d.begin() , d.end());
  res = max(res , Get());
  return res;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n , m;
  cin >> n >> m;
  vector<int> a(m) , b(m) , c(m);
  for (int i = 0 ; i < m ; i += 1) {
    cin >> a[i] >> b[i] >> c[i];
  }
  cout << ferries(n , m , a , b , c) << '\n';
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 7 ms 1876 KB Output is correct
4 Correct 72 ms 15324 KB Output is correct
5 Correct 72 ms 15292 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 6 ms 1792 KB Output is correct
4 Correct 42 ms 8348 KB Output is correct
5 Correct 43 ms 11388 KB Output is correct

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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