제출 #764779

#제출 시각아이디문제언어결과실행 시간메모리
764779vjudge1Roadside Advertisements (NOI17_roadsideadverts)C++17
7 / 100
42 ms49144 KiB
#include <bits/stdc++.h> // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") // #pragma GCC optimize("Ofast,unroll-loops,fast-math,O3") #define ent '\n' #define f first #define s second using namespace std; typedef long long ll; typedef pair < int, int> pii; typedef pair < ll, ll > pll; const int maxn = 2e6 + 100; const int mod = 1e9 + 7; const int INF = 1e9 + 1; const int LOG = 20; const int K = 400; const int P = 31; int n, m; vector < pii > g[maxn]; void solve(){ cin >> n; int sum = 0; for(int i = 1;i < n;i++){ int u, v, w; cin >> u >> v >> w; g[u].push_back({v, w}); g[v].push_back({u, w}); sum += w; } cin >> m; for(;m--;){ int a, b, c, d, e; cin >> a >> b >> c >> d >> e; cout << sum << ent; } } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int T = 1; // cin >> T; for(int i = 1;i <= T;i++){ solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...