# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164949 | DangKhoizzzz | Roadside Advertisements (NOI17_roadsideadverts) | C++20 | 100 ms | 17852 KiB |
// giao phai CBVD chill buoi toi
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pii pair <int , int>
#define arr3 array <int , 3>
/*
+ array limit ???
+ special case ??? n = 1?
+ time limit ???
*/
using namespace std;
const int INF = 1e18 + 7;
const int maxn = 2e5 + 7;
int n , q , jump[maxn][20] , depth[maxn] , dp[maxn];
vector <pii> g[maxn];
void dfs_build(int u , int p)
{
for(pii e: g[u])
{
int v = e.fi , w = e.se;
if(v == p) continue;
depth[v] = depth[u] + 1;
# | 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... |