# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
767115 | DJeniUp | Highway Tolls (IOI18_highway) | C++17 | 14 ms | 3668 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 long long ll;
typedef pair<ll,ll>pairll;
#define pb push_back
#define fr first
#define sc second
#define INF 10000000000000007
ll n,m,k,d[90007],fl[90007],d1[90007];
vector<pairll>v[90007],g;
priority_queue<pairll, vector<pairll>, greater<pairll> >q;
vector<int>f;
ll S(ll x){
for(int i=0;i<m;i++){
f[i]=0;
}
for(int i=0;i<=x;i++){
for(int j=0;j<v[g[i].sc].size();j++){
f[v[g[i].sc][j].fr]=1;
}
}
ll k1=ask(f);
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... |