# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
897744 | Mr_Husanboy | Two Currencies (JOI23_currencies) | C++17 | 5085 ms | 19100 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;
using ll = long long;
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
template<typename T>
int len(T &a){
return a.size();
}
void solve(){
int n, m, q; cin >> n >> m >> q;
vector<vector<pair<int,int>>> g(n);
for(int i = 0; i < n - 1; i ++){
int u, v; cin >> u >> v;
u --; v --;
g[u].push_back({v, i});
g[v].push_back({u, i});
}
vector<vector<int>> way(n - 1);
for(int i = 0; i < m; i ++){
int id, sil; cin >> id >> sil;
id --; way[id].push_back(sil);
# | 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... |