# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
241887 | osaaateiasavtnl | Construction of Highway (JOI18_construction) | C++17 | 2084 ms | 736 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>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 1e5+7;
int n, a[N], par[N];
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int t = 0; t < n - 1; ++t) {
int u, v;
cin >> u >> v;
par[v] = u;
vector <int> path;
while (u) {
path.app(a[u]);
a[u] = a[v];
u = par[u];
}
int ans = 0;
for (int i = 0; i < path.size(); ++i)
for (int j = i + 1; j < path.size(); ++j)
ans += path[i] < path[j];
cout << ans << endl;
}
}
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... |