Submission #756956

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
756956	2023-06-12 11:42:24	Valters07	Cyberland (APIO23_cyberland)	C++17	100 / 100	1751 ms	79140 KiB

cyberland

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "cyberland.h"
#define ll long long
#define pb push_back
#define fi first
#define se second
using namespace std;
const int N = 1e5+5;
const int K = 70+2;
vector<pair<int,int> > g[N];
double dist[N][K];
bool vis[N][K], vis2[N];
vector<int> starts, arr2;
void dfs(int u, int h)
{
    vis2[u]=1;
    if(arr2[u]==0)
        starts.pb(u);
    for(auto v:g[u])
        if(!vis2[v.fi]&&v.fi!=h)
            dfs(v.fi,h);
}
double solve(int n, int m, int k, int h, vector<int> x,
             vector<int> y, vector<int> c, vector<int> arr)
{
    k=min(k,70);
    arr2=arr;
    for(int i = 0;i<m;i++)
        g[x[i]].pb({y[i],c[i]}),
        g[y[i]].pb({x[i],c[i]});
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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: 3 / 3