oj.uz

Submission #840979

# Submission time Handle Problem Language Result Execution time Memory
840979 2023-09-01T03:00:46 Z Cookie Closing Time (IOI23_closing) C++17
43 / 100
 989 ms 63440 KB 
#include<bits/stdc++.h>
#include<fstream>
#include<closing.h>
using namespace std;
//ifstream fin("FEEDING.INP");
//ofstream fout("FEEDING.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const int mxn = 2e5 + 5, inf = 1e9;
int n, x, y;
ll k;
ll costx[mxn + 1], costy[mxn + 1], u[mxn + 1], v[mxn + 1], w[mxn + 1];
ll prefx[mxn + 1], prefy[mxn + 1], prefmx[mxn + 1];
map<pair<int, int>, ll>mp;
vt<ll>comp;
int find(int x){
    return(lower_bound(comp.begin(), comp.end(), x) - comp.begin() + 1);
}
struct ST{
    ll st[4 * mxn + 1];
    void init(){
        for(int i = 1; i <= 8 * n; i++)st[i] = 0;
    }
    void upd(int nd, int l, int r, int id, ll v){
        if(id < l || id > r)return;
        if(l == r){
            assert(l == id);
            st[nd] += v;
            return;
        }
        int mid = (l + r) >> 1;
        upd(nd << 1, l, mid, id, v); upd(nd << 1 | 1, mid + 1, r, id, v);
        st[nd] = st[nd << 1] + st[nd << 1 | 1];
    }
    ll get(int nd, int l, int r, int ql, int qr){
        if(ql > r || qr < l)return(0);
        if(ql <= l && qr >= r){
            //cout << nd << "    " << st[nd] << " ";
            return(st[nd]);
        }
        int mid = (l + r) >> 1;
        return(get(nd << 1, l, mid, ql, qr) + get(nd << 1 | 1, mid + 1, r, ql, qr));
    }
    int kth(int nd, int l, int r, ll k){
        if(l == r)return(l - 1);
        int mid = (l + r) >> 1;
        if(st[nd << 1] >= k){
            return(kth(nd << 1, l, mid, k));
        }else{
            return(kth(nd << 1 | 1, mid + 1, r, k - st[nd << 1]));
        }
    }
};
ST sm, cnt;
int get(ll m){


        int last = sm.kth(1, 1, sz(comp) + 1, m), res = cnt.get(1, 1, sz(comp) + 1, 1, last);
    ll tot = sm.get(1, 1, sz(comp) + 1, 1, last);


    if(last == sz(comp))return(res);
    res += (m - tot) / comp[last];

    return(res);

}
int solve(){
    //cout << n << " " << x << " " << y << " ";
    comp.clear();
    ll pref = 0;
    costx[x] = costy[y] = 0;
    for(int i = x - 1; i >= 1; i--){
        pref += mp[{i, i + 1}];
        costx[i] = pref;
        comp.pb(costx[i]);
    }
    pref = 0;
    for(int i = x; i < n; i++){
        pref += mp[{i, i + 1}];
        costx[i + 1] = pref;
    }
    pref = 0;
    for(int i = y - 1; i >= 1; i--){
        pref += mp[{i, i + 1}];
        costy[i] = pref;
    }
    pref = 0;
    for(int i = y; i < n; i++){
        pref += mp[{i, i + 1}];
        costy[i + 1] = pref;
        comp.pb(costy[i + 1]);

    }
    sort(comp.begin(), comp.end());
    for(int i = 1; i <= n; i++){
        prefmx[i] = prefmx[i - 1] + max(costx[i], costy[i]);
        prefx[i] = prefx[i - 1] + costx[i];
        prefy[i] = prefy[i - 1] + costy[i];
    }
    vt<ll>comp2;
    for(int i = 1; i <= n; i++)comp2.pb(costx[i]);
    for(int i = 1; i <= n; i++)comp2.pb(costy[i]);
    sort(comp2.begin(), comp2.end());
    int ans = 0;
    ll curr = 0;
    for(int i = 0; i < sz(comp2); i++){
        if(curr + comp2[i] <= k){
            curr += comp2[i]; ans++;
        }
    }
    // iteralte by intersection?
    for(int l = 1; l <= y; l++){
        sm.init(); cnt.init();
        for(int i = min(l, x) - 1; i >= 1; i--){
            cnt.upd(1, 1, sz(comp) + 1, find(costx[i]), 1);
            sm.upd(1, 1, sz(comp) + 1, find(costx[i]), costx[i]);
        }
        for(int r = n; r >= max(l, x); r--){
            ll cost = 0;
            cost += prefmx[r] - prefmx[l - 1];
            //for(int i = x; i < l; i++)cost += costx[i];
            //for(int i = y; i > r; i--)cost += costy[i];
            if(x < l){
                cost += prefx[l - 1] - prefx[x - 1];
            }
            if(y > r){
                cost += prefy[y] - prefy[r];
            }

            /*
            vt<ll>comp;
            for(int i = min(x, l) - 1; i >= 1; i--)comp.pb(costx[i]);
            for(int i = max(y, r) + 1; i <= n; i++)comp.pb(costy[i]);
            sort(comp.begin(), comp.end());
            */
            if(cost <= k){
            int cand = r - min(l, x) + 1 + max(r, y) - l + 1;
            cand += get(k - cost);

            //k -= cost;
            //cand += get(min(x, l) - 1, max(y, r) + 1);


            //if(cand == 7)cout << min(x, l) - 1 << " " << max(y, r) + 1 << " ";
            ans = max(ans, cand);
            }
            if(r > y){
                cnt.upd(1, 1, sz(comp) + 1, find(costy[r]), 1);
                sm.upd(1, 1, sz(comp) + 1, find(costy[r]), costy[r]);
            }
        }
    }
    return(ans);
}
int mxres = 0;
vt<pll>adj[mxn + 1];
vt<ll>compdep;
void dfs(int s, int pre, ll dep){
    compdep.pb(dep);
    for(auto [v, w]: adj[s]){
        if(v != pre){
            dfs(v, s, dep + w);
        }
    }
}

int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    mp.clear();
    n = N; x = ++X; y = ++Y; k = K;
    for(int i = 1; i <= n; i++)adj[i].clear();
    bool ok = 1;
    for(int i = 0; i < n - 1; i++){

        u[i] = ++U[i]; v[i] = ++V[i]; w[i] = W[i];
        if(u[i] != i + 1 || v[i] != i + 2)ok = 0;
        mp[{u[i], v[i]}] = mp[{v[i], u[i]}] = w[i];
        adj[u[i]].pb(make_pair(v[i], w[i])); adj[v[i]].pb(make_pair(u[i], w[i]));
    }
    if(ok)return solve();
    else{
        compdep.clear();
        dfs(x, -1, 0);
        dfs(y, -1, 0);
        sort(compdep.begin(), compdep.end());
        int res = 0;
        ll curr = 0;
        for(int i = 0; i < sz(compdep); i++){
            if(curr + compdep[i] <= k){
                curr += compdep[i]; res++;
            }
        }
        return(res);
    }
}
/*
int main()
{

    int Q;
    assert(1 == scanf("%d", &Q));

    std::vector<int> N(Q), X(Q), Y(Q);
    std::vector<long long> K(Q);
    std::vector<std::vector<int>> U(Q), V(Q), W(Q);

    for (int q = 0; q < Q; q++)
    {
        assert(4 == scanf("%d %d %d %lld", &N[q], &X[q], &Y[q], &K[q]));

        U[q].resize(N[q] - 1);
        V[q].resize(N[q] - 1);
        W[q].resize(N[q] - 1);
        for (int i = 0; i < N[q] - 1; ++i)
        {
            assert(3 == scanf("%d %d %d", &U[q][i], &V[q][i], &W[q][i]));
        }
    }
    fclose(stdin);

    std::vector<int> result(Q);
    for (int q = 0; q < Q; q++)
    {
        result[q] = max_score(N[q], X[q], Y[q], K[q], U[q], V[q], W[q]);
    }

    for (int q = 0; q < Q; q++)
    {
        printf("%d\n", result[q]);
    }
    fclose(stdout);

    return 0;
}
*/
/*
1
5 0 3 6
0 1 1
1 2 1
2 3 1
3 4 100
*/

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 390 ms 58672 KB Output is correct
2 Correct 409 ms 63440 KB Output is correct
3 Correct 110 ms 7704 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 2 ms 5068 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 2 ms 5076 KB Output is correct
7 Correct 2 ms 5076 KB Output is correct
8 Correct 2 ms 5076 KB Output is correct
9 Correct 2 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 2 ms 5076 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 2 ms 5068 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 2 ms 5076 KB Output is correct
7 Correct 2 ms 5076 KB Output is correct
8 Correct 2 ms 5076 KB Output is correct
9 Correct 2 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 2 ms 5076 KB Output is correct
12 Correct 3 ms 5108 KB Output is correct
13 Correct 2 ms 5076 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 2 ms 5076 KB Output is correct
16 Correct 2 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 19 ms 5204 KB Output is correct
20 Correct 5 ms 5204 KB Output is correct
21 Correct 16 ms 5264 KB Output is correct
22 Correct 9 ms 5204 KB Output is correct
23 Correct 3 ms 5204 KB Output is correct
24 Correct 3 ms 5204 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 2 ms 5068 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 2 ms 5076 KB Output is correct
7 Correct 2 ms 5076 KB Output is correct
8 Correct 2 ms 5076 KB Output is correct
9 Correct 2 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 2 ms 5076 KB Output is correct
12 Correct 3 ms 5108 KB Output is correct
13 Correct 2 ms 5076 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 2 ms 5076 KB Output is correct
16 Correct 2 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 19 ms 5204 KB Output is correct
20 Correct 5 ms 5204 KB Output is correct
21 Correct 16 ms 5264 KB Output is correct
22 Correct 9 ms 5204 KB Output is correct
23 Correct 3 ms 5204 KB Output is correct
24 Correct 3 ms 5204 KB Output is correct
25 Correct 11 ms 5076 KB Output is correct
26 Correct 989 ms 6328 KB Output is correct
27 Correct 700 ms 6280 KB Output is correct
28 Correct 79 ms 6268 KB Output is correct
29 Correct 815 ms 6328 KB Output is correct
30 Correct 685 ms 6272 KB Output is correct
31 Correct 26 ms 6308 KB Output is correct
32 Correct 26 ms 6356 KB Output is correct

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -