# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1045844 | phoenix0423 | Chase (CEOI17_chase) | C++17 | 231 ms | 345936 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
// #pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define int long long
#define lowbit(x) x&-x
const int maxn = 1e5 + 5;
const int INF = 4e18;
const int N = 998244353;
int dp[maxn][105][2][2];
vector<int> adj[maxn];
int p[maxn], deg[maxn];
int n, v, ans = 0;
void dfs(int pos, int prev){
dp[pos][1][0][1] = deg[pos];
dp[pos][1][1][1] = deg[pos] - p[pos];
for(int i = 2; i <= v; i++) dp[pos][i][1][1] = dp[pos][i - 1][1][1];
ans = max(ans, dp[pos][1][1][1]);
for(auto x : adj[pos]){
if(x == prev) continue;
dfs(x, pos);
for(int i = 1; i < v; i++){
for(int j = 0; j < 2; j++){
# | 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... |