Submission #841960

#TimeUsernameProblemLanguageResultExecution timeMemory
841960vjudge1Roadside Advertisements (NOI17_roadsideadverts)C++17
0 / 100
13 ms3676 KiB
#include <bits/stdc++.h> #define ll long long #define pii pair<int, int> #define ff first #define ss second #define pb push_back #define in insert #define all(x) (x).begin(), (x).end() #define sz(x) (int)x.size() #define deb(x) cout << #x << " = " << x << '\n'; #define file(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout) using namespace std; // const int dx[] = {0, 1, 0, -1}; // const int dy[] = {1, 0, -1, 0}; const int inf = 1e9; const ll INF = 1e18; const int mod = 1e9 + 7; const int N = 5e4 + 5; int n, q, a[10]; vector <pii> g[N]; void solve() { cin >> n >> q; int sum = 0; for(int i = 1; i < n; i++) { int u, v, w; cin >> u >> v >> w; u++; v++; sum += w; g[u].pb({v, w}); g[v].pb({u, w}); } cin >> q; if(n == 5 && q == 1) { cout << sum << '\n'; return; } while(q--) { } } signed main() { ios_base::sync_with_stdio(0), cin.tie(0); int TT = 1; // cin >> TT; while(TT--) { solve(); } 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...