제출 #556326

#제출 시각아이디문제언어결과실행 시간메모리
556326OlympiaMag (COCI16_mag)C++17
0 / 120
883 ms59708 KiB
#include <bits/stdc++.h> using namespace std; int main() { vector<vector<int> > adj; int n; cin >> n; adj.resize(n); for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; u--, v--; adj[u].push_back(v), adj[v].push_back(u); } vector<int> val(n); int myMin = INT_MAX; for (int i = 0; i < n; i++) { cin >> val[i]; myMin = min(myMin, val[i]); } if (myMin >= 2) { cout << myMin << "/" << 1; return 0; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...