Submission #486429

#TimeUsernameProblemLanguageResultExecution timeMemory
486429blueConstruction of Highway (JOI18_construction)C++17
7 / 100
2081 ms408 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int N;
    cin >> N;

    int C[1+N];
    for(int i = 1; i <= N; i++) cin >> C[i];

    int P[1+N];
    P[0] = P[1] = 0;

    for(int j = 1; j <= N-1; j++)
    {
        vector<int> lst;

        int A, B;
        cin >> A >> B;

        for(int q = A; q != 0; q = P[q])
            lst.push_back(C[q]);

        reverse(lst.begin(), lst.end());

        int ans = 0;

        for(int i = 0; i < int(lst.size()); i++)
            for(int j = i+1; j < int(lst.size()); j++)
                ans += lst[i] > lst[j];

        cout << ans << '\n';

        for(int k = A; k != 0; k = P[k])
            C[k] = C[B];

        P[B] = A;
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...