# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233495 | eohomegrownapps | Toll (BOI17_toll) | C++14 | 3044 ms | 8312 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;
vector<vector<pair<int,int>>> adjlist;
int INF = 1e9;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
int k,n,m,o;
cin>>k>>n>>m>>o;
adjlist.resize((n/k)*k+k);
for (int i = 0; i<m; i++){
int a,b,t;
cin>>a>>b>>t;
adjlist[b].push_back({a,t});
}
unordered_set<int> from;
vector<vector<int>> addat(n/k+1);
//vector<vector<vector<int>>> distfrom(2,vector<vector<int>>(n,vector<int>(k,INF)));
int distfrom[2][6][50000];
for (int i = 0; i<2; i++){
for (int x = 0; x<k; x++){
for (int j = 0; j<n; j++){
distfrom[i][x][j]=INF;
}
}
}
vector<vector<pair<int,int>>> to(n);
# | 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... |