# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140869 | silxikys | Race (IOI11_race) | C++14 | 534 ms | 77804 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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
using namespace std;
typedef long long ll;
const int maxn = 200005;
const int INF = 999999999;
int n, k;
int ans = 0;
struct Edge {
int other, weight;
};
vector<Edge> adj[maxn];
struct Node
{
map<int,int>* mp;
int lAux, pathAux;
int curr;
inline int sz() {return mp->size();}
Node() {
mp = new map<int,int>;
pathAux = 0;
lAux = 0;
curr = INF;
}
# | 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... |