Submission #384910

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
3849102021-04-02 15:57:11izhang05Crocodile's Underground City (IOI11_crocodile)C++17
46 / 100
177 ms262148 KiB
#include "crocodile.h"
#ifdef LOCAL
#include "crocodile_grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
//#define DEBUG
const int maxn = 1e3 + 5, inf = 1e9;
int sol[maxn];
bool ex[maxn];
vector<pair<int, int>> adj[maxn];
void dfs(int c, int p) {
vector<int> pos;
for (auto i : adj[c]) {
if (i.first != p) {
dfs(i.first, c);
pos.push_back(sol[i.first] + i.second);
}
}
sort(pos.begin(), pos.end());
if (pos.size() <= 1) {
sol[c] = -inf;
} else {
sol[c] = pos[1];
}
if (ex[c]) {
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...