# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145288 | Bodo171 | Sky Walking (IOI19_walk) | C++14 | 67 ms | 10144 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 "walk.h"
#include <queue>
#include <vector>
#include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
const int nmax=10005;
queue<int> q;
vector< pair<int,long long > >v[nmax];
vector<int> rel,newrel;
int norm[105][105];
int bune[nmax];
long long d[nmax];
int n,nr,i,j;
void add(int x,int y,int z)
{
v[x].push_back({y,z});
v[y].push_back({x,z});
}
long long min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int s, int g) {
n=x.size();
rel.push_back(0);
for(i=0;i<y.size();i++)
rel.push_back(y[i]);
for(i=0;i<h.size();i++)
rel.push_back(h[i]);
sort(rel.begin(),rel.end());
for(i=0;i<rel.size();i++)
if(i==0||rel[i]!=rel[i-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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |