# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
764942 | vjudge1 | Roadside Advertisements (NOI17_roadsideadverts) | C++17 | 48 ms | 20360 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 ibase ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define ff first
#define int long long
#define ss second
using namespace std;
const int N = 5e5 + 3;
const int MOD = 1e9 + 7;
int a[N], ans[N], pos[N], cnt = 1, was[N], was1[N];
vector < pair < int, int > > g[N];
void dfs(int v){
cnt++;
for(auto to : g[v]){
a[cnt] = to.ss;
pos[to.ff] = cnt;
dfs(to.ff);
}
}
void solve(){
int n, sum = 0;
cin >> n;
set < int > s;
for(int i=1; i<n; i++){
int x, y, cost;
cin >> x >> y >> cost;
was[y] = 1;
was1[x] = 1;
s.insert(x);
s.insert(y);
Compilation message (stderr)
# | 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... |