oj.uz

Submission #1069700

# Submission time Handle Problem Language Result Execution time Memory
1069700 2024-08-22T08:23:09 Z Faisal_Saqib Closing Time (IOI23_closing) C++17
8 / 100
 104 ms 45656 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define ppll pair<ll,pll>
#define vpl vector<pll>
const int N=5e5+10;
vpl ma[N];
ll paid[N],dist[N];
bool vis[N];
// ll dist_[2][N];
 
int max_score(int n, int x, int y, long long k, std::vector<int> U,std::vector<int> V, std::vector<int> W)
{
    for(int i=0;i<2*n;i++)
    {
        ma[i].clear();
        paid[i]=0;
        vis[i]=0;
        dist[i]=k+1;
    }
    int m=U.size();
    for(int i=0;i<m;i++)
    {
        ma[U[i]].push_back({W[i],V[i]});
        ma[U[i]+n].push_back({W[i],V[i]+n});
        ma[V[i]].push_back({W[i],U[i]});
        ma[V[i]+n].push_back({W[i],U[i]+n});
    }
    set<pll> pq;
    pq.insert({0,x});
    pq.insert({0,y+n});
    dist[x]=0;
    dist[y+n]=0;
    ll cur=0;
    while(pq.size()>0)
    {
        pll it=*pq.begin();
        pq.erase(begin(pq));
 
 
        int u=it.second;
        ll c=it.first;
 
        if(vis[u])continue;


        if((cur+c)>k)
            continue;
        
 
        cur+=c;
        if(u<n)
        {
            // paid[u+n]+=c;
            if((u+n-1)>=n)
            {
                for(auto [w,v]:ma[u+n-1])
                {
                    if(v==(u+n))
                    {
                        w-=c;
                    }
                }
            }
        }
        else
        {
            // paid[u-n]+=c;
            if((u-n-1)>=0)
            {
                for(auto [w,v]:ma[u-n-1])
                {
                    if(v==(u-n))
                    {
                        w-=c;
                    }
                }
            }
        }
        vis[u]=1;
        for(auto [w,v]:ma[u])
        {
            ll cop=c+w;
            if(dist[v]>(cop))
            {
                dist[v]=cop;
                pq.insert({cop,v});
            }
        }
    }
    int total=0;
    for(int i=0;i<2*n;i++)
    {
        total+=vis[i];
    }
    return total;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 18268 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 45656 KB Output is correct
2 Correct 93 ms 45452 KB Output is correct
3 Correct 44 ms 20816 KB Output is correct

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18268 KB Output is correct
2 Incorrect 3 ms 18268 KB 1st lines differ - on the 1st token, expected: '30', found: '24'
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18268 KB Output is correct
2 Incorrect 3 ms 18268 KB 1st lines differ - on the 1st token, expected: '30', found: '24'
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18268 KB Output is correct
2 Incorrect 3 ms 18268 KB 1st lines differ - on the 1st token, expected: '30', found: '24'
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 18268 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 18268 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 18268 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 18268 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 18268 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -