# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714734 | ajab_01 | Toll (BOI17_toll) | C++17 | 35 ms | 5964 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;
const int N = 1e5 + 5;
const int O = 3e3 + 3;
vector<pair<int , int> > g[N] , query;
int pre[N] , pr[N] , k , n , m , o;
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
memset(pr , -1 , sizeof(pr));
cin >> k >> n >> m >> o;
for(int i = 0 ; i < m ; i++){
int u , v , w;
cin >> u >> v >> w;
g[u].push_back({v , w});
g[v].push_back({u , w});
}
for(int i = 0 ; i < o ; i++){
int a , b;
cin >> a >> b;
query.push_back({a , b});
}
if(k == 1){
int bef = 0;
for(int i = 0 ; i < n ; i++){
if(i == bef)
pre[i] = 0;
# | 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... |