# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1171664 | paulxaxa | Valley (BOI19_valley) | C++20 | 257 ms | 46488 KiB |
#include <bits/stdc++.h>
#define NMAX 100000
#define LOG 20
#define ll long long int
#define BASE 1024
#define MOD 1000000009
using namespace std;
ifstream fin("cod.in");
ofstream fout("cod.out");
ll minDist[NMAX+1],dist[NMAX+1];
int isShop[NMAX+1];
vector<pair<int,int>> adj[NMAX+1];
pair<int,int> edges[NMAX+1];
int d[NMAX+1];
pair<int,ll> p[NMAX+1][LOG+1];
int n,s,q,e;
void dfs(int x,int t)
{
minDist[x] = isShop[x] ? 0 : 1e17;
p[x][0].first = t;
# | 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... |