Submission #985042

#	Time	Username	Problem	Language	Result	Execution time	Memory
985042		shjeong	Cyberland (APIO23_cyberland)	C++17	5 / 100	34 ms	11088 KiB

cyberland

#include <vector>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cstring>
#include <vector>
#include <string>
#include <climits>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
#include <cassert>
#include <list>
using namespace std;
#define all(x) x.begin(), x.end()
#define rll(x) x.rbegin(), x.rend()
#define comp(x) x.erase(unique(all(x)), x.end())
#define MOD 1000000007
#define MOD2 998244353
#define debug(x) cout << #x<<" is "<<x<<"\n";
#define X first
#define Y second
#define DEB cout<<"[DEBUG]"
#define PAIR(a,b) "("<<a<<", "<<b<<")"
#define PRINT1(V) DEB<<#V<<endl; for(auto i : V)DEB<<i<<"\n"
#define PRINT2(V) DEB<<#V<<endl; for(auto [a,b] : V)DEB<<PAIR(a,b)<<"\n";
typedef long long ll;
typedef __int128_t lll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
typedef pair<ld,ll> Pd;
vector<P> adj[202020];
ld dist[202020];
ll p[202020];
ll find(ll x){
    if(p[x]<0)return x;
    return p[x] = find(p[x]);
}
void merge(ll x, ll y){
    x = find(x), y = find(y);
    if(x==y)return;
    p[y]=x;
}
double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
    if(N==2)return (M==0 ? -1 : c[0]);
    map<P,ll> mp;
    for(int i = 0 ; i < M ; i++){
        mp[P(min(x[i],y[i]), max(x[i],y[i]))] = c[i];
    }
    ld ret = 1e15;
    if(mp.find({0,H}) != mp.end())ret = min<ld>(ret, mp[{0,H}]);
    if(mp.find({0,3-H}) != mp.end() and mp.find({min(H,3-H), max(H,3-H)}) != mp.end()){
        ret = min(ret, (ld)mp[{0,3-H}] / (arr[3-H]==2 ? 2.0 : 1.0) * (arr[3-H]==0 ? 0 : 1) + mp[{min(H,3-H), max(H,3-H)}]);
    }
    if(ret==1e15)ret = -1;
    return ret;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 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