# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
765214 | vjudge1 | Roadside Advertisements (NOI17_roadsideadverts) | C++17 | 1060 ms | 524288 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 = 2e6+77;
const int INF = 1e18+77;
const double eps = 1e-11;
vector<pair<int, int>> g[50009];
vector<int> ist[50009];
int dist[50009], p[50009];
bool used[50009];
void solve(){
int n;
cin >> n;
set<pair<int, int>> q;
for(int i = 1; i <= n - 1; i++){
int x, y, v;
cin >> x >> y >> v;
x++;y++;
g[x].push_back({v, y});
ist[y].push_back(x);
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... |