oj.uz

Submission #1079180

# Submission time Handle Problem Language Result Execution time Memory
1079180 2024-08-28T11:44:43 Z beaconmc Closing Time (IOI23_closing) C++17
0 / 100
 42 ms 10300 KB 
#include "closing.h"
#include <bits/stdc++.h>
    
using namespace std; 
 
 
typedef long long ll;
    
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 

ll n;
const ll maxn = 3005;
vector<vector<ll>> edges[maxn];
ll dist1[maxn];
ll dist2[maxn];
ll dp[maxn][maxn*2];
vector<vector<ll>> dists;


void dfs(ll a, ll p, ll d, ll type){
    if (type==1) dist1[a] = d;
    else dist2[a] = d;

    for (auto&i : edges[a]){
        if (i[0] != p) dfs(i[0], a, d+i[1], type);
    }
}

vector<ll> stacks;
set<ll> marked;
bool flag = false;
void dfs2(ll a, ll p, ll target){
    if (flag) return;
    stacks.push_back(a);

    if (a==target) flag = true;
    if (flag) return;
    for (auto&i : edges[a]){
        if (flag) return;
        if (i[0]==p) continue;
        dfs2(i[0], a, target);
        if (flag) return;
        stacks.pop_back();
        if (flag) 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)
{
    flag = false;
    n = N;
    FOR(i,0,N+1) edges[i].clear(), dist1[i] = 0, dist2[i] = 0;
    dists.clear();

    FOR(i,0,N-1){
        edges[U[i]].push_back({V[i], W[i]});
        edges[V[i]].push_back({U[i], W[i]});
    }
    dfs(X, -1, 0, 1);
    dfs(Y, -1, 0, 2);
    dfs2(X,-1,Y);
    for (auto&i : stacks) marked.insert(i);

    vector<ll> idkman;
    FOR(i,0,N){
        idkman.push_back(dist1[i]);
        idkman.push_back(dist2[i]);
    }
    sort(idkman.begin(), idkman.end());
    ll cur = 0;
    ll ans = 0;
    ll k = K;

    while (cur<idkman.size() && k-idkman[cur]>=0){
        k-= idkman[cur];
        ans++;
        cur++;
    }

    




    FOR(i,0,N){
        vector<ll> temp = {};
        temp.push_back(min(dist1[i], dist2[i]));
        temp.push_back(max(dist1[i], dist2[i]));
        dists.push_back(temp);
    }

    FOR(i,0,N) FOR(j,0,2*N+1) dp[i][j] = 100000000000000000;
    
    if (!marked.count(0)) dp[0][0] = 0;
    dp[0][1] = dists[0][0];
    dp[0][2] = dists[0][1];


    FOR(i,1,N){
        FOR(j,0,2*N+1){


            ll temp = 100000000000000000;
            if (j>=1) temp = min(temp, dp[i-1][j-1]+dists[i][0]);
            if (j>=2) temp = min(temp, dp[i-1][j-2]+dists[i][1]);
            if (!marked.count(i)) temp = min(temp, dp[i-1][j]);
            dp[i][j] = temp;
        }
    }


    FOR(i,0,N){
        FOR(j,0,2*N+1){
            if (dp[i][j] <=K){

                ans = max(ans, j);
            }

        }
    }
    return ans;




}

Compilation message

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:77:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     while (cur<idkman.size() && k-idkman[cur]>=0){
      |            ~~~^~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 42 ms 10300 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Incorrect 1 ms 604 KB 1st lines differ - on the 1st token, expected: '44', found: '52'
11 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Incorrect 1 ms 604 KB 1st lines differ - on the 1st token, expected: '44', found: '52'
11 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Incorrect 1 ms 604 KB 1st lines differ - on the 1st token, expected: '44', found: '52'
11 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 604 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 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Incorrect 1 ms 604 KB 1st lines differ - on the 1st token, expected: '11', found: '13'
16 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Incorrect 1 ms 604 KB 1st lines differ - on the 1st token, expected: '44', found: '52'
12 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Incorrect 1 ms 604 KB 1st lines differ - on the 1st token, expected: '44', found: '52'
12 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Incorrect 1 ms 604 KB 1st lines differ - on the 1st token, expected: '44', found: '52'
12 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Incorrect 1 ms 604 KB 1st lines differ - on the 1st token, expected: '44', found: '52'
12 Halted 0 ms 0 KB -