oj.uz

Submission #61410

# Submission time Handle Problem Language Result Execution time Memory
61410 2018-07-25T20:28:36 Z Benq Construction of Highway (JOI18_construction) C++11
7 / 100
 2000 ms 2000 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int N, p[MX],A[MX];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N;
    FOR(i,1,N+1) cin >> A[i];
    F0R(i,N-1) {
        int x,y; cin >> x >> y;
        p[y] = x;
        Tree<pi> T;
        ll ans = 0;
        while (x) {
            ans += T.order_of_key({A[x],-MOD});
            T.insert({A[x],x});
            A[x] = A[y];
            x = p[x];
        }
        cout << ans << "\n";
    }
    
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 496 KB Output is correct
4 Correct 3 ms 496 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 4 ms 680 KB Output is correct
7 Correct 3 ms 680 KB Output is correct
8 Correct 26 ms 708 KB Output is correct
9 Correct 28 ms 740 KB Output is correct
10 Correct 26 ms 816 KB Output is correct
11 Correct 14 ms 816 KB Output is correct
12 Correct 15 ms 816 KB Output is correct
13 Correct 13 ms 896 KB Output is correct
14 Correct 16 ms 896 KB Output is correct
15 Correct 4 ms 896 KB Output is correct
16 Correct 4 ms 896 KB Output is correct
17 Correct 3 ms 936 KB Output is correct
18 Correct 4 ms 936 KB Output is correct
19 Correct 16 ms 964 KB Output is correct
20 Correct 15 ms 992 KB Output is correct
21 Correct 15 ms 992 KB Output is correct
22 Correct 3 ms 1000 KB Output is correct
23 Correct 3 ms 1012 KB Output is correct
24 Correct 5 ms 1020 KB Output is correct
25 Correct 4 ms 1028 KB Output is correct
26 Correct 28 ms 1164 KB Output is correct
27 Correct 14 ms 1164 KB Output is correct
28 Correct 14 ms 1164 KB Output is correct
29 Correct 13 ms 1164 KB Output is correct
30 Correct 3 ms 1164 KB Output is correct
31 Correct 4 ms 1164 KB Output is correct
32 Correct 16 ms 1164 KB Output is correct
33 Correct 9 ms 1164 KB Output is correct
34 Correct 7 ms 1164 KB Output is correct
35 Correct 5 ms 1164 KB Output is correct
36 Correct 8 ms 1164 KB Output is correct
37 Correct 6 ms 1164 KB Output is correct
38 Correct 5 ms 1164 KB Output is correct
39 Correct 8 ms 1164 KB Output is correct
40 Correct 6 ms 1164 KB Output is correct
41 Correct 6 ms 1164 KB Output is correct
42 Correct 8 ms 1180 KB Output is correct
43 Correct 6 ms 1280 KB Output is correct
44 Correct 5 ms 1280 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 496 KB Output is correct
4 Correct 3 ms 496 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 4 ms 680 KB Output is correct
7 Correct 3 ms 680 KB Output is correct
8 Correct 26 ms 708 KB Output is correct
9 Correct 28 ms 740 KB Output is correct
10 Correct 26 ms 816 KB Output is correct
11 Correct 14 ms 816 KB Output is correct
12 Correct 15 ms 816 KB Output is correct
13 Correct 13 ms 896 KB Output is correct
14 Correct 16 ms 896 KB Output is correct
15 Correct 4 ms 896 KB Output is correct
16 Correct 4 ms 896 KB Output is correct
17 Correct 3 ms 936 KB Output is correct
18 Correct 4 ms 936 KB Output is correct
19 Correct 16 ms 964 KB Output is correct
20 Correct 15 ms 992 KB Output is correct
21 Correct 15 ms 992 KB Output is correct
22 Correct 3 ms 1000 KB Output is correct
23 Correct 3 ms 1012 KB Output is correct
24 Correct 5 ms 1020 KB Output is correct
25 Correct 4 ms 1028 KB Output is correct
26 Correct 28 ms 1164 KB Output is correct
27 Correct 14 ms 1164 KB Output is correct
28 Correct 14 ms 1164 KB Output is correct
29 Correct 13 ms 1164 KB Output is correct
30 Correct 3 ms 1164 KB Output is correct
31 Correct 4 ms 1164 KB Output is correct
32 Correct 16 ms 1164 KB Output is correct
33 Correct 9 ms 1164 KB Output is correct
34 Correct 7 ms 1164 KB Output is correct
35 Correct 5 ms 1164 KB Output is correct
36 Correct 8 ms 1164 KB Output is correct
37 Correct 6 ms 1164 KB Output is correct
38 Correct 5 ms 1164 KB Output is correct
39 Correct 8 ms 1164 KB Output is correct
40 Correct 6 ms 1164 KB Output is correct
41 Correct 6 ms 1164 KB Output is correct
42 Correct 8 ms 1180 KB Output is correct
43 Correct 6 ms 1280 KB Output is correct
44 Correct 5 ms 1280 KB Output is correct
45 Correct 4 ms 1280 KB Output is correct
46 Correct 8 ms 1352 KB Output is correct
47 Correct 10 ms 1428 KB Output is correct
48 Correct 9 ms 1620 KB Output is correct
49 Execution timed out 2045 ms 2000 KB Time limit exceeded
50 Halted 0 ms 0 KB -

Subtask #3
0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 496 KB Output is correct
4 Correct 3 ms 496 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 4 ms 680 KB Output is correct
7 Correct 3 ms 680 KB Output is correct
8 Correct 26 ms 708 KB Output is correct
9 Correct 28 ms 740 KB Output is correct
10 Correct 26 ms 816 KB Output is correct
11 Correct 14 ms 816 KB Output is correct
12 Correct 15 ms 816 KB Output is correct
13 Correct 13 ms 896 KB Output is correct
14 Correct 16 ms 896 KB Output is correct
15 Correct 4 ms 896 KB Output is correct
16 Correct 4 ms 896 KB Output is correct
17 Correct 3 ms 936 KB Output is correct
18 Correct 4 ms 936 KB Output is correct
19 Correct 16 ms 964 KB Output is correct
20 Correct 15 ms 992 KB Output is correct
21 Correct 15 ms 992 KB Output is correct
22 Correct 3 ms 1000 KB Output is correct
23 Correct 3 ms 1012 KB Output is correct
24 Correct 5 ms 1020 KB Output is correct
25 Correct 4 ms 1028 KB Output is correct
26 Correct 28 ms 1164 KB Output is correct
27 Correct 14 ms 1164 KB Output is correct
28 Correct 14 ms 1164 KB Output is correct
29 Correct 13 ms 1164 KB Output is correct
30 Correct 3 ms 1164 KB Output is correct
31 Correct 4 ms 1164 KB Output is correct
32 Correct 16 ms 1164 KB Output is correct
33 Correct 9 ms 1164 KB Output is correct
34 Correct 7 ms 1164 KB Output is correct
35 Correct 5 ms 1164 KB Output is correct
36 Correct 8 ms 1164 KB Output is correct
37 Correct 6 ms 1164 KB Output is correct
38 Correct 5 ms 1164 KB Output is correct
39 Correct 8 ms 1164 KB Output is correct
40 Correct 6 ms 1164 KB Output is correct
41 Correct 6 ms 1164 KB Output is correct
42 Correct 8 ms 1180 KB Output is correct
43 Correct 6 ms 1280 KB Output is correct
44 Correct 5 ms 1280 KB Output is correct
45 Correct 4 ms 1280 KB Output is correct
46 Correct 8 ms 1352 KB Output is correct
47 Correct 10 ms 1428 KB Output is correct
48 Correct 9 ms 1620 KB Output is correct
49 Execution timed out 2045 ms 2000 KB Time limit exceeded
50 Halted 0 ms 0 KB -