Submission #699815

#TimeUsernameProblemLanguageResultExecution timeMemory
699815vjudge1Construction of Highway (JOI18_construction)C++17
16 / 100
2068 ms7024 KiB
#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], t[N * 4]; void build(ll v = 1, ll tl = 1, ll tr = n) { t[v] = 0; if (tl == tr) return; ll tm = (tl + tr) / 2; build(v + v, tl, tm); build(v + v + 1, tm + 1, tr); } ll get(ll l, ll r, ll v = 1, ll tl = 1, ll tr = n) { if (r < tl || tr < l) return 0; if (l <= tl && tr <= r) return t[v]; ll tm = (tl + tr) / 2; return get(l, r, v + v, tl, tm) + get(l, r, v + v + 1, tm + 1, tr); } void upd(ll pos, ll v = 1, ll tl = 1, ll tr = n) { if (tl == tr) { ++ t[v]; return; } ll tm = (tl + tr) / 2; if (pos <= tm) upd(pos, v + v, tl, tm); else upd(pos, v + v + 1, tm + 1, tr); t[v] = t[v + v] + t[v + v + 1]; } const void solve() { cin >> n; vector <ll> comp; for (int i = 1; i <= n; ++ i) cin >> a[i], comp.pb(a[i]); sort(all(comp)); comp.erase(unique(all(comp)), comp.end()); for (int i = 1; i <= n; ++ i) { a[i] = lower_bound(all(comp), a[i]) - comp.begin() + 1; } 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)); build(); for (auto x : vs) { ans += get(a[x] + 1, n); upd(a[x]); } 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 (stderr)

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")
      |
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...