# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
137792 | bensonlzl | Highway Tolls (IOI18_highway) | C++14 | 372 ms | 262148 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 "highway.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pi;
typedef long long ll;
vector<pi> AdjList[100005];
vector<int> Ax;
vector<pi> EdgeList;
ll bigA, bigB, bigN, bigM, dist, dsu, dtv, S, T;
void res_Ax(){
for (int i = 0; i < bigM; ++i) Ax[i] = 0;
}
int find_spath_edge(vector<int> ved0, vector<int> ved1){
vector<int> v0, v1;
if (ved0.size() == 1 && ved1.size() == 0){
return ved0[0];
}
else if (ved0.size() == 0 && ved1.size() == 1){
return ved1[0];
}
res_Ax();
for (int i = 0; i < ved1.size(); ++i){
Ax[ved1[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |