# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
228354 | AaronNaidu | Shortcut (IOI16_shortcut) | C++14 | 2100 ms | 198520 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;
vector<pair<int, int> > graph[100000];
ll dist1s[100000];
bool visited[100000];
ll distMatrix[5000][5000];
int n, c;
void DFS(int node) {
visited[node] = true;
for (auto i : graph[node])
{
if (!visited[i.first])
{
dist1s[i.first] = i.second + dist1s[node];
DFS(i.first);
}
}
}
ll bridgeBetween(int fir, int sec) {
ll toRet = 0;
for (int i = 0; i < 2 * n; i++)
{
for (int j = i + 1; j < 2 * n; j++)
{
if (distMatrix[i][j] < 1000000000000000000)
{
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... |
# | 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... |