# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1082511 | vjudge1 | Construction of Highway (JOI18_construction) | C++17 | 2041 ms | 604 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 INF 1e18
#define fi first
#define se second
#define FOR(i, k, n) for(ll i = k; i <= n; i++)
#define FOR1(i, k, n) for(ll i = k; i >= n; i--)
#define pb push_back
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define ll long long
#define vll vector<ll>
#define pll pair<ll, ll>
#define re return 0
#define mii map<int, int>
#define input "BAI1.inp"
#define output "BAI1.out"
#define rf freopen(input, "r", stdin); freopen(output, "w", stdout)
using namespace std;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const int base = 29;
void add(int &a, int b)
{
a += b;
if(a >= mod) a -= mod;
if(a < 0) a += mod;
}
int par[maxn];
int a[maxn];
int main()
{
fastio;
int n;
cin >> n;
FOR(i, 1, n)
cin >> a[i];
FOR(i, 1, n - 1)
{
int u, v;
cin >> u >> v;
vi vv;
par[v] = u;
while(u != 1)
{
vv.pb(u);
u = par[u];
}
vv.pb(1);
reverse(vv.begin(), vv.end());
if(vv.size() == 1)
cout << "0\n";
else
{
int cnt = 0;
FOR(i, 0, vv.size() - 2)
FOR(j, i + 1, vv.size() - 1)
if(a[vv[j]] < a[vv[i]])
cnt++;
cout << cnt << "\n";
}
for(auto x : vv)
a[x] = a[v];
}
re;
}
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... |