oj.uz

Submission #699813

# Submission time Handle Problem Language Result Execution time Memory
699813 2023-02-18T04:40:22 Z vjudge1 Construction of Highway (JOI18_construction) C++17
7 / 100
 2000 ms 664 KB 
#include<bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define ppb pop_back
#define ft first
#define sd second
#define ll long long
#define pll pair<ll,ll>
const int N = 1e6 + 5;
const int M = 1e7 + 5;
const int B = 316;
const ll mod = 998244353;
const ll inf = 3e18;

struct Mat { vector<vector<ll>> mt = vector<vector<ll>> (15, vector<ll>(15, 0)); Mat operator *(const Mat& other) { Mat c; for (int i = 0; i <= 10; ++ i) { for (int j = 0; j <= 10; ++ j) { for (int k = 0; k <= 10; ++ k) { (c.mt[i][k] += mt[i][j] * other.mt[j][k]) %= mod; } } } return c; } };
ll binmul(ll x, ll ti, ll m) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= m; res %= m;} return res;}
ll binpow(ll x, ll ti, ll m) { ll res = 1;while (ti){if(ti & 1)res=binmul(res,x,m);x=binmul(x,x,m);ti >>= 1; x %= m; res %= m;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }

ll n, a[N], dp[N], used[N], pr[N];

const void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++ i) cin >> a[i];
    used[1] = 1;
    for (int i = 1; i < n; ++ i) {
        ll u, v;
        cin >> u >> v;
        if (used[v]) swap(u, v);

        ll ans = 0;
        ll cur = u;
        vector <ll> vs;
        while (cur != 1) {
            vs.pb(cur);
            cur = pr[cur];
        }
        vs.pb(1);
        reverse(all(vs));
        // for (auto x : vs) cout << a[x] << " ";

        for (int i = 0; i < vs.size(); ++ i) {
            for (int j = i + 1; j < vs.size(); ++ j) {
                if (a[vs[i]] > a[vs[j]]) {
                    ++ ans;
                }
            }
        }
        cout << ans << "\n";
        for (auto x : vs) a[x] = a[v];
        pr[v] = u;
        used[v] = 1;
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    srand(time(NULL));
    // file("cowsignal");

    int tt = 1;
    // cin >> tt;

    for (int i = 1; i <= tt; ++ i) {
        // cout << "Case " << i << ": ";
        solve();
    }

    return 0;
}

Compilation message

construction.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization("O3")
      | 
construction.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization("unroll-loops")
      | 
construction.cpp:6: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    6 | #pragma comment(linker, "/stack:200000000")
      | 
construction.cpp: In function 'const void solve()':
construction.cpp:57:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         for (int i = 0; i < vs.size(); ++ i) {
      |                         ~~^~~~~~~~~~~
construction.cpp:58:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |             for (int j = i + 1; j < vs.size(); ++ j) {
      |                                 ~~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 30 ms 356 KB Output is correct
9 Correct 17 ms 376 KB Output is correct
10 Correct 20 ms 376 KB Output is correct
11 Correct 8 ms 340 KB Output is correct
12 Correct 6 ms 340 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 380 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 5 ms 340 KB Output is correct
20 Correct 7 ms 340 KB Output is correct
21 Correct 8 ms 372 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 17 ms 340 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 6 ms 340 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 6 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 4 ms 340 KB Output is correct
37 Correct 3 ms 332 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 3 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 344 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 30 ms 356 KB Output is correct
9 Correct 17 ms 376 KB Output is correct
10 Correct 20 ms 376 KB Output is correct
11 Correct 8 ms 340 KB Output is correct
12 Correct 6 ms 340 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 380 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 5 ms 340 KB Output is correct
20 Correct 7 ms 340 KB Output is correct
21 Correct 8 ms 372 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 17 ms 340 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 6 ms 340 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 6 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 4 ms 340 KB Output is correct
37 Correct 3 ms 332 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 3 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 344 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 3 ms 472 KB Output is correct
47 Correct 5 ms 468 KB Output is correct
48 Correct 3 ms 456 KB Output is correct
49 Execution timed out 2071 ms 664 KB Time limit exceeded
50 Halted 0 ms 0 KB -

Subtask #3
0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 30 ms 356 KB Output is correct
9 Correct 17 ms 376 KB Output is correct
10 Correct 20 ms 376 KB Output is correct
11 Correct 8 ms 340 KB Output is correct
12 Correct 6 ms 340 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 380 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 5 ms 340 KB Output is correct
20 Correct 7 ms 340 KB Output is correct
21 Correct 8 ms 372 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 17 ms 340 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 6 ms 340 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 6 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 4 ms 340 KB Output is correct
37 Correct 3 ms 332 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 3 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 344 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 3 ms 472 KB Output is correct
47 Correct 5 ms 468 KB Output is correct
48 Correct 3 ms 456 KB Output is correct
49 Execution timed out 2071 ms 664 KB Time limit exceeded
50 Halted 0 ms 0 KB -