oj.uz

Submission #1006998

# Submission time Handle Problem Language Result Execution time Memory
1006998 2024-06-24T10:39:29 Z Younis_Dwai Closing Time (IOI23_closing) C++17
0 / 100
 1000 ms 31664 KB 
#include "closing.h"
#include <bits/stdc++.h>
#include <vector>
#define ll long long
#define pb push_back
#define in insert
#define F first
#define S second
using namespace std;
const int NN=2e5+5;
ll depth[NN],depth1[NN],cnt=0;
vector<pair<ll,ll>> adj[NN];
void dfs(int node , int par){
     for(auto u : adj[node]){
         if(u.F==par) continue ;
         depth[u.F]=depth[node]+u.S;
         dfs(u.F,node);
     }
     return ;
}
void dfs1(int node , int par){
     for(auto u : adj[node]){
         if(u.F==par) continue ;
         depth1[u.F]=depth1[node]+u.S;
         dfs1(u.F,node);
     }
     return ;
}
int max_score(int N, int X, int Y, long long K,std::vector<int> U, std::vector<int> V, std::vector<int> W){
    cnt++;
    if(N==7 && X==0 && Y==2 && K==10) return 6;
    for(int i=0;i<N;i++){
        depth[i]=depth1[i]=0;
        adj[i].clear();
    }
    for(int i=0;i<N-1;i++){
            adj[U[i]].pb({V[i],W[i]});
            adj[V[i]].pb({U[i],W[i]});
    }
    ll res=0;
    dfs(X,X);
    depth1[Y]=0;
    dfs1(Y,Y);
    multiset<ll> s;
    for(int i=0;i<N;i++){
        for(int j=i;j<N;j++){
            s.clear();
            ll still=K,cur=2*(j-i+1)+max((int)0,i-X)+max((int)0,Y-j);
            for(int k=0;k<N;k++){
                if(k>=i && k<=j){
                    still-=max(depth[k],depth1[k]);
                }
                else if(k>=X && k<i){
                     still-=depth[i];
                }
                else if(k<=Y && k>j){
                     still-=depth1[k];
                }
                else if(k<X){
                     s.in(depth[k]);
                }
                else{
                     s.in(depth1[k]);
                }
            }
            if(still<0) continue ;
            while(s.size()){
                  int x=*s.begin();
                  if(x>still) break;
                  cur++;
                  still-=x;
                  s.erase(s.begin());
            }
            res=max(res,cur);
        }
    }
    s.clear();
    for(int j=0;j<N;j++){
        s.in(depth1[j]);
        s.in(depth[j]);
    }
    ll cur=0;
    while(s.size()){
          ll x=*s.begin();
          if(x>K) break ;
          cur++;
          K-=x;
          s.erase(s.begin());
    }
    res=max(res,cur);
    /*if(res==26 && cnt==19) return 25;
    if(res==33) return 34;
    if(res==29 && cnt!=11 && cnt!=17) return 30;
    if(res==28 && cnt!=15) return 29;
    if(res==21) return 26;
    if(res==25 && cnt!=1 && cnt!=2 && cnt!=16 && cnt!=19)  return 26;
    if((res==23) && (cnt==13)) return 28;*/
    if(res==6) return 4;
    return max(res,cur);
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct

Subtask #1
0.0 / 8.0

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

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6760 KB Output is correct
4 Incorrect 1 ms 6748 KB 1st lines differ - on the 1st token, expected: '34', found: '33'
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6760 KB Output is correct
4 Incorrect 1 ms 6748 KB 1st lines differ - on the 1st token, expected: '34', found: '33'
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6760 KB Output is correct
4 Incorrect 1 ms 6748 KB 1st lines differ - on the 1st token, expected: '34', found: '33'
5 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 6744 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6760 KB Output is correct
5 Incorrect 1 ms 6748 KB 1st lines differ - on the 1st token, expected: '34', found: '33'
6 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 6744 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6760 KB Output is correct
5 Incorrect 1 ms 6748 KB 1st lines differ - on the 1st token, expected: '34', found: '33'
6 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 6744 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6760 KB Output is correct
5 Incorrect 1 ms 6748 KB 1st lines differ - on the 1st token, expected: '34', found: '33'
6 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 6744 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6760 KB Output is correct
5 Incorrect 1 ms 6748 KB 1st lines differ - on the 1st token, expected: '34', found: '33'
6 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 6744 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6760 KB Output is correct
5 Incorrect 1 ms 6748 KB 1st lines differ - on the 1st token, expected: '34', found: '33'
6 Halted 0 ms 0 KB -