Submission #253026

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
2530262020-07-26 16:30:20KubinRace (IOI11_race)C++17
0 / 100
1 ms384 KiB
#include <bits/stdc++.h>
using namespace std;
vector<vector<size_t>> adj;
vector<vector<pair<size_t, int>>> graph;
const int oo = INT_MAX / 3;
int& rd(unordered_map<int, int>& m, int key)
{
auto it = m.find(key);
if(it == m.end()) it = m.emplace_hint(it, key, +oo);
return it->second;
}
void mini(unordered_map<int, int>& m, int key, int value)
{
rd(m, key) = min(rd(m, key), value);
}
size_t gl_vertices;
vector<size_t> gl_parent, gl_subsize;
vector<bool> gl_lock;
void dfs_map_paths(size_t u, int s, int d, unordered_map<int, int>& m,
size_t lock = SIZE_MAX)
{
if(d > +oo) return;
mini(m, s, d);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...