Submission #1061160

#	Time	Username	Problem	Language	Result	Execution time	Memory
1061160		KasymK	Cyberland (APIO23_cyberland)	C++17	8 / 100	23 ms	7256 KiB

cyberland

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second   
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e5+5;
const ll INF = 1e15; // 1e5*1e9=1e14
vector<pii> adj[N];
double d[N];
bool vis[N];

double solve(int n, int m, int k, int h, vector<int> u, vector<int> v, vector<int> w, vector<int> arr){
    for(int i = 0; i < m; ++i){
        adj[u[i]].pb({v[i], w[i]});
        adj[v[i]].pb({u[i], w[i]});
    }
    memset(vis, false, sizeof vis);
    for(int i = 0; i <= n; ++i)
        d[i] = INF;
    queue<int> q;
    q.push(0);
    d[0] = 0;
    vis[0] = true;
    while(!q.empty()){
        int x = q.front();
        q.pop();
        for(auto [i, val] : adj[x])
            if(!vis[i]){
                vis[i] = true;
                umin(d[i], d[x]+val);
                if(arr[i] == 0)
                    d[i] = 0;
                q.push(i);
            }
    }
    for(int i = 0; i <= n; ++i)
        adj[i].clear();
    double answer = 0;
    if(d[h] == INF)
        d[h] = -1;
    answer += d[h];
    return answer;
}

// int main(){
//     double kk = solve(5, 4, 10, 4, {0, 0, 2, 2}, {1, 2, 3, 4}, {6, 5, 7, 8}, {1, 1, 0, 1, 0});
//     printf("%f\n", kk);
//     return 0;
// }

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