# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161744 | son2008 | Valley (BOI19_valley) | C++20 | 170 ms | 51120 KiB |
#include<bits/stdc++.h>
using namespace std;
#define task "comseq"
#define ii pair<ll,ll>
#define fi first
#define se second
#define int long long
#define ll long long
#define ld double
#define mp make_pair
#define lg2 20
#define iii pair<int,ii>
#define iiii pair<ii,ii>
#define fii fi.fi
#define fis fi.se3
#define sfi se.fi
#define see se.se
#define base 29
int dx[]={0LL,0LL,1,-1,1,1,-1,-1};
int dy[]={1,-1,0LL,0LL,1,-1,1,-1};
const int maxn=1e5+1;
const int mod=1e9+7;
int d[maxn],n,S,q,e,P_min[maxn][lg2+1],dp[maxn],P[maxn][lg2+1],h[maxn],dist[maxn];
ii b[maxn];
vector<ii>a[maxn];
void dfs(int u,int cha)
{
if(d[u])dp[u]=dist[u];
else dp[u]=1e18;
for(ii v:a[u])
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |