oj.uz

답안 #980035

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
980035 2024-05-11T19:31:44 Z vjudge1 봉쇄 시간 (IOI23_closing) C++17
21 / 100
 1000 ms 2062064 KB 
#include "closing.h"
using namespace std;
#include <bits/stdc++.h>
#define pb push_back

using lli=long long;
#define deb(x) cout<<#x<<": "<<x<<endl;
int  max_score(int N, int X, int Y, long long K,
              vector<int> U, vector<int> V, vector<int> W)
{
      lli ans=0;
    vector<vector<pair<lli,lli>>> adj (N);
   lli mat [N][N];
    for(lli i=0; i<N-1; ++i){
        adj[U[i]].pb({V[i], W[i]});
        adj[V[i]].pb({U[i], W[i]});
        mat[U[i]][V[i]]=W[i];
        mat[V[i]][U[i]]=W[i];
    }
   
    lli init=0;
    lli last=0;
    lli ant=0;
    while(adj[init].size()==2){
        if(adj[init][0].first!=ant){
            ant=init;
            init=adj[init][0].first;
        }
        else{
            ant=init;
            init=adj[init][1].first;
        }
    }
    ant=init;
    last=adj[init][0].first;
    while(adj[last].size()==2){
        if(adj[last][0].first!=ant){
            ant=last;
            last=adj[last][0].first;
        }
        else{
            ant=last;
            last=adj[last][1].first;
        }
    }
    
    vector<lli> ord;
    lli rec=init;
    ant=init;
    while(rec!=last){
    //    cout<<"rec: "<<rec<<endl;
        ord.pb(rec);
        if(adj[rec][0].first!=ant){
            ant=rec;
            rec=adj[rec][0].first;
        }
        else{
            ant=rec;
            rec=adj[rec][1].first;
        }
    }
    ord.pb(rec);
    vector<lli> numb(N);
    for(lli i=0; i<N; ++i){
        numb[ord[i]]=i;
    }
    if(numb[X]>numb[Y]){
        swap(X,Y);
    }
  

    for(lli i=numb[X]; i>=0; --i){
        vector<lli> values (N, 0);
        lli cont=K;
       
        for(lli a=numb[X]-1; a>=i; --a){
            values[a]=values[a+1]+mat[ord[a+1]][ord[a]];
            cont-=values[a];
         
            
        }
        if(cont<0) break;
        lli ayuda=cont;
        for(lli j=numb[X]; j<N; ++j){
          
            cont=ayuda;
            
            if(j>numb[X]){
                values[j]=values[j-1]+mat[ord[j-1]][ord[j]];
                ayuda-=values[j];
                cont=ayuda;
            }
  
            if(cont<0) break;
            lli aux=j-i+1;
            priority_queue<pair<pair<lli,lli>,lli>, vector<pair<pair<lli,lli>,lli>>, greater<pair<pair<lli,lli>,lli>>> pq;
            vector<bool> visited (N, false);
            pq.push({{0,0}, numb[Y]});
        
            while(!pq.empty()){
                lli a=pq.top().first.first;
                lli c=pq.top().first.second;
                lli b=pq.top().second;

                pq.pop();
                if(visited[b]) continue;
                visited[b]=true;
                if(cont>=a){
                    cont-=a;
                    aux++;
                    if(b+1<N && !visited[b+1]){
                        pq.push({{max(c+mat[ord[b]][ord[b+1]]-values[b+1],0ll),c+mat[ord[b]][ord[b+1]]}, b+1});
                    }
                    if(b-1>=0 && !visited[b-1]){
                        pq.push({{max(c+mat[ord[b]][ord[b-1]]-values[b-1],0ll),c+mat[ord[b]][ord[b-1]]}, b-1});
                    }
                }
                else{
                    break;
                }
            }
          
            ans=max(ans, aux);
          
        }
     
    }
   return ans;


}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #1
0.0 / 8.0

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

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 756 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 1 ms 348 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 756 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 1 ms 432 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 270 ms 2428 KB Output is correct
20 Correct 2 ms 1884 KB Output is correct
21 Correct 314 ms 2284 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 3 ms 2396 KB Output is correct
24 Correct 3 ms 2392 KB Output is correct

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 756 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 1 ms 432 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 270 ms 2428 KB Output is correct
20 Correct 2 ms 1884 KB Output is correct
21 Correct 314 ms 2284 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 3 ms 2396 KB Output is correct
24 Correct 3 ms 2392 KB Output is correct
25 Correct 25 ms 344 KB Output is correct
26 Execution timed out 1036 ms 71128 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

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

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 756 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 2 ms 632 KB Output is correct
14 Correct 1 ms 432 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
20 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 756 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 2 ms 632 KB Output is correct
14 Correct 1 ms 432 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 270 ms 2428 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 314 ms 2284 KB Output is correct
23 Correct 2 ms 2392 KB Output is correct
24 Correct 3 ms 2396 KB Output is correct
25 Correct 3 ms 2392 KB Output is correct
26 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
27 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 756 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 2 ms 632 KB Output is correct
14 Correct 1 ms 432 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 270 ms 2428 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 314 ms 2284 KB Output is correct
23 Correct 2 ms 2392 KB Output is correct
24 Correct 3 ms 2396 KB Output is correct
25 Correct 3 ms 2392 KB Output is correct
26 Correct 25 ms 344 KB Output is correct
27 Execution timed out 1036 ms 71128 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 756 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 2 ms 632 KB Output is correct
14 Correct 1 ms 432 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 270 ms 2428 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 314 ms 2284 KB Output is correct
23 Correct 2 ms 2392 KB Output is correct
24 Correct 3 ms 2396 KB Output is correct
25 Correct 3 ms 2392 KB Output is correct
26 Correct 25 ms 344 KB Output is correct
27 Execution timed out 1036 ms 71128 KB Time limit exceeded
28 Halted 0 ms 0 KB -