# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201444 | ami | Putovanje (COCI20_putovanje) | C++17 | 338 ms | 35928 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>
#define sz(c) int(c.size())
#define rep(i,a,b) for (int i=a; i<(b); ++i)
#define per(i,a,b) for (int i=(b)-1; i>=(a); --i)
#define fore(c,...) for (auto __VA_ARGS__:(c))
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout<<fixed<<setprecision(10);
int N;
cin>>N;
vector<vector<pair<int,int>>> adj(N);
vector<pair<int,int>> cost(N-1);
rep(i,0,N-1) {
int a,b,c1,c2;
cin>>a>>b>>c1>>c2;
a--,b--;
adj[a].emplace_back(b,i);
adj[b].emplace_back(a,i);
cost[i]={c1,c2};
}
vector<ll> cnt(N-1);
vector<set<pair<int,bool>>> s(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... |