# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
764862 | vjudge1 | Roadside Advertisements (NOI17_roadsideadverts) | C++17 | 25 ms | 25328 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 int long long
#define Kuanyshh ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
#define F first
#define S second
#pragma GCC optimize( "Ofast", "O3" , "unroll-loops")
#pragma GCC target ("sse,sse2")
using namespace std;
const int N = 1e6+77;
const int inf = 1e18+77;
const double eps = 1e-11;
vector<pair<int, int>> g[N];
void solve(){
int n;
cin >> n;
int sum = 0;
for(int i = 1; i <= n - 1; i++){
int a, b, w;
cin >> a >> b >> w;
sum += w;
g[a].push_back({b,w});
}
int q;
cin >> q;
while(q--){
# | 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... |