oj.uz

답안 #1075984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075984 2024-08-26T10:16:54 Z MarwenElarbi 봉쇄 시간 (IOI23_closing) C++17
0 / 100
 1000 ms 25028 KB 
#include <bits/stdc++.h>
#include "closing.h"
using namespace std;
#define pb push_back
#define fi first
#define se second
const int nax = 2e5+5;
const int MOD = 1e9+7;
int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    vector<pair<int,int>> adj[N];
    long long a[N],b[N];
    if(X>Y) swap(X,Y);
    for (int i = 0; i < N-1; ++i)
    {
        adj[U[i]].pb({V[i],W[i]});
        adj[V[i]].pb({U[i],W[i]});
    }
    for (int i = 0; i < N; ++i)
    {
        if(adj[i].size()==1) continue;
        if(adj[i][0].fi>adj[i][1].fi) swap(adj[i][0],adj[i][1]);
    }
    a[X]=0;
    b[Y]=0;
    for (int i = X+1; i < N; ++i) a[i]=a[i-1]+adj[i][0].se;
    for (int i = X-1; i >=0; --i) a[i]=a[i+1]+(i ? adj[i][1].se : adj[i][0].se);
    for (int i = Y+1; i < N; ++i) b[i]=b[i-1]+adj[i][0].se;
    for (int i = Y-1; i >=0; --i) b[i]=b[i+1]+(i ? adj[i][1].se : adj[i][0].se);
    long long pre[N];
    memset(pre,0,sizeof pre);
    pre[Y]=0;
    for (int i = Y+1; i < N; ++i) pre[i]=pre[i-1]+b[i];
    long long cnt=K;
    long long ans=0;
    int res=0;
    for (int i = X; i >= 0; i--)
    {
        ans++;
        cnt-=a[i];
        if(cnt<0) break;
        long long cntj=cnt;
        int ansj=ans;
        for (int j = X; j < N; ++j)
        {
            if(j>X) ansj++;
            cntj-=a[j];
            if(cntj<0) break;
            long long cntk=cntj;
            int ansk=ansj;
            for (int k = Y; k >= 0; k--)
            {
                ansk++;
                if(k>j) cntk-=b[k];
                else if(b[k]>a[k]) cntk-=(b[k]-a[k]);
                if(cntk<0) break;
                int left=max(j,Y);
                int l=left;
                int r=N;
                while(r-l>1){
                    int mid=(r+l)/2;
                    if(pre[mid]-pre[left-1]>cntk) r=mid;
                    else l=mid;
                }
                res=max(res,ansk+(l-Y));
            }
        }
    }
    return res;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 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 1080 ms 25028 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

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

Subtask #3
0.0 / 12.0

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

Subtask #4
0.0 / 14.0

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

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 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 344 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 344 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 344 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 344 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -