# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
115105 | oolimry | Race (IOI11_race) | C++14 | 3035 ms | 255824 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 "race.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
static vector<ii> adj[200005];
static bool vis[200005];
static unordered_map<int,int> dp[200005];
int k;
int ans = 102345678;
void dfs(int u){
vis[u] = true;
for(int i = 0;i < adj[u].size();i++){
int v = adj[u][i].first;
int w = adj[u][i].second;
if(vis[v]) continue;
dfs(v);
vector<ii> updates;
for(ii x : dp[v]){
int value = w + x.first;
if(value <= k){
if(dp[u].find(k-value) != dp[u].end()){
ans = min(ans, dp[u][k-value] + x.second + 1);
}
updates.push_back({value,x.second+1});
}
}
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... |