oj.uz

Submission #1028000

# Submission time Handle Problem Language Result Execution time Memory
1028000 2024-07-19T12:19:00 Z Mr_Husanboy Closing Time (IOI23_closing) C++17
21 / 100
 1000 ms 24668 KB 
#include "closing.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
const long long infl = 2e18 + 10;

template<typename T>
int len(T &a){return a.size();}



int max_score(int n, int x, int y, long long k,
              vector<int> U, vector<int> V, vector<int> W)
{
    vector<vector<pair<int,int>>> g(n);
    for(int i = 0; i < n - 1; i ++){
        g[U[i]].push_back({V[i], W[i]});
        g[V[i]].push_back({U[i], W[i]});
    }

    vector<ll> dx(n), dy(n);
    auto dfs = [&](auto &dfs, int i, int p = -1)->void{
        for(auto [u, w] : g[i]){
            if(u == p) continue;
            dx[u] = dx[i] + w;
            dfs(dfs, u, i);
        }
    };
    dfs(dfs, x);
    swap(dx, dy);
    dfs(dfs, y);
    swap(dx, dy); 
    int ans = 0;

    for(int l = x; l < n; l ++){
        for(int r = y; r >= 0; r --){
            ll tot = 0;
            for(int j = r; j <= l; j ++){
                tot += max(dx[j], dy[j]);
            }
            for(int j = x; j < min(l + 1, r); j ++) tot += dx[j];
            for(int j = y; j > max(r - 1, l); j --) tot += dy[j];
            // cout << tot << endl;
            if(tot > k){
                break;
            }
            vector<ll> one;
            for(int j = 0; j < min(r, x); j ++){
                one.push_back(dx[j]);
            }
            for(int j = max(l, y) + 1; j < n; j ++){
                one.push_back(dy[j]);
            }
            sort(all(one));
            int i = 0;
            while(i < len(one)){
                tot += one[i];
                if(tot > k) break;
                i ++;
            }
            //cout << l << ' ' << r << ' ' << l - x + 1 + y - r + 1 + i + max(0, x - r) + max(0, l - y) << endl;
            ans = max(ans, l - x + 1 + y - r + 1 + i + max(0, x - r) + max(0, l - y));
        }
    }
    return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1029 ms 24668 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 436 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 436 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 130 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 244 ms 476 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 10 ms 348 KB Output is correct
24 Correct 12 ms 348 KB Output is correct

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 436 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 130 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 244 ms 476 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 10 ms 348 KB Output is correct
24 Correct 12 ms 348 KB Output is correct
25 Correct 14 ms 348 KB Output is correct
26 Execution timed out 1055 ms 860 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 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 0 ms 348 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 0 ms 348 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 0 ms 348 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 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -