Submission #1009506

#	Time	Username	Problem	Language	Result	Execution time	Memory
1009506		Muaath_5	Cyberland (APIO23_cyberland)	C++17	97 / 100	1182 ms	66484 KiB

cyberland

    #include <bits/stdc++.h>
    //#pragma GCC optimize("Ofast,O3,unroll-loops")
    //#pragma GCC target("avx2,avx,sse3,sse4")
    #define all(v) ((v).begin(), (v).end())
    #define F first
    #define S second
    typedef long long ll;
    #define pii pair<int, double>
    using namespace std;
    const ll mod = 1e9 + 7;
    const ll mxN = 100000;
    const double inf = 1e18;
    struct path
    {
      int i, k;
      double val;
    };
    bool operator<(path a, path b)
    {
      return a.val < b.val;
    }
    bool operator>(path a, path b)
    {
      return a.val > b.val;
    }
    double dp[mxN][71]; 
    vector<vector<pii>> v;
    double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr)
    {
      v.clear();
      v.resize(N + 3);
      K = min(K,65);
      for (int i = 0; i < M; i++)
      {
        v[x[i]].push_back({y[i], (double)c[i]});
        v[y[i]].push_back({x[i], (double)c[i]});
      }
      for(int i = 0;i < N;i++)
        for(int j = 0;j <= K;j++)
          dp[i][j] = inf;
      priority_queue<path,vector<path>,greater<path>>q;
      q.push({0,0,0});
      dp[0][0] = 0;
      while(q.size()){
        const auto u = q.top();
        q.pop();
        if(u.val < dp[u.i][u.k] || u.i == H) continue;
        for(const auto &x : v[u.i]){
          if (arr[x.F] == 0 && dp[x.F][u.k] != (double)0)
          {
            dp[x.F][u.k] = (double)0;
            q.push({x.F, u.k, (double)0});
          }
          if(dp[x.F][u.k] > dp[u.i][u.k] + x.S){
            dp[x.F][u.k] = dp[u.i][u.k] + x.S;
            q.push({x.F,u.k,dp[x.F][u.k]});
          }
          if(u.k != K && arr[u.i] == 2 && dp[x.F][u.k + 1] > dp[u.i][u.k] / 2 + x.S){
            dp[x.F][u.k + 1] = dp[u.i][u.k] / 2 + x.S;
            q.push({x.F,u.k + 1,dp[x.F][u.k + 1]});
          }
        }
      }
      double ans = inf;
      for(int i = 0;i <= K;i++){
        ans = min(ans,dp[H][i]);
      }
      return ans == inf ? -1 : ans;
    }

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 19 / 19
• Subtask 5: 7 / 7
• Subtask 6: 16 / 16
• Subtask 7: 29 / 29
• Subtask 8: 0 / 3