oj.uz

답안 #1027966

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027966 2024-07-19T12:03:11 Z Mr_Husanboy 봉쇄 시간 (IOI23_closing) C++17
0 / 100
 1000 ms 24772 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); 
    // for(int i = 0; i < n;i ++){
    //     cout << dx[i] << ' ' << dy[i] << endl;
    // } 
    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 << ' ' << i << endl;
            ans = max(ans, l - x + 1 + y - r + 1 + i);
        }
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1100 ms 24772 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '30', found: '19'
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '30', found: '19'
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '30', found: '19'
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 -