# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
841894 | vjudge1 | Roadside Advertisements (NOI17_roadsideadverts) | C++17 | 1075 ms | 4824 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.
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <iostream>
#include <vector>
using namespace std;
#define ll int
bool m[50001];
ll cnt,a1,a2,a3,a4,a5;
vector<pair<ll,ll>>g[50001];
void dfs(ll v,ll p,ll sum)
{
if(m[v])
{
cnt+=sum;sum=0;
}
for(pair<ll,ll> it:g[v])
{
if(it.first!=p)
{
dfs(it.first,v,sum+it.second);
}
}
}
int main()
{
ios_base::sync_with_stdio();
cin.tie(NULL);
cout.tie(NULL);
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... |