oj.uz

답안 #1035880

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1035880 2024-07-26T17:09:45 Z DucNguyen2007 Jakarta Skyscrapers (APIO15_skyscraper) C++14
22 / 100
 4 ms 6748 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
const int maxN=3e4+5,BLOCK=305;
const ll inf=2e18;
int n,m,b[maxN+1],p[maxN+1];
ll d[maxN+1][BLOCK+1];
bool vis[maxN+1];
struct duongdi
{
    int u,power;
    ll w;
    bool operator < (const duongdi &o)const
    {
        return w>o.w;
    }
};
vector<duongdi> adj[maxN+1];
priority_queue<duongdi> pq;
vector<int> vec[maxN+1];
void CO(int u,int v,int pw,int power,int w)
{
    if(d[v][pw]>d[u][power]+w)
    {
        d[v][pw]=d[u][power]+w;
        pq.push({v,pw,d[v][pw]});
    }
}
int main()
{
    //freopen("","r",stdin);
    //freopen("","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    memset(vis,false,sizeof(vis));
    for(int i=0;i<m;i++)
    {
        cin>>b[i]>>p[i];
        if(p[i]<=BLOCK)
        {
            vec[b[i]].push_back(p[i]);
        }
        else vis[b[i]]=true;
    }
    for(int i=0;i<m;i++)
    {
        if(p[i]<=BLOCK)
        {
            continue;
        }
        if(adj[b[i]].size()>0)
        {
            continue;
        }
        for(int j=b[i]+p[i];j<n;j+=p[i])
        {
            adj[b[i]].push_back({j,0,(j-b[i])/p[i]});
        }
        for(int j=b[i]-p[i];j>=0;j-=p[i])
        {
            adj[b[i]].push_back({j,0,(b[i]-j)/p[i]});
        }
    }
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<=BLOCK;j++)
        {
            d[i][j]=inf;
        }
    }
    if(p[0]<=BLOCK)
    {
        d[b[0]][p[0]]=0;
        pq.push({b[0],p[0],0});
    }
    else
    {
        d[b[0]][0]=0;
        pq.push({b[0],0,0});
    }
    while(!pq.empty())
    {
        duongdi tmp=pq.top();
        pq.pop();
        int u=tmp.u,power=tmp.power;
        ll w=tmp.w;
        //cout<<u<<" "<<power<<" "<<w<<'\n';
        if(u==b[1])
        {
            cout<<d[u][power];
            return 0;
        }
        if(d[u][power]<w)
        {
            continue;
        }
        if(power>0)
        {
            if(u+power<n)
            {
                CO(u,u+power,power,power,1);
            }
            if(u-power>=0)
            {
                CO(u,u-power,power,power,1);
            }
            if(vis[u])
            {
                CO(u,u,0,power,0);
            }
        }
        else
        {
            for(auto i:adj[u])
            {
                CO(u,i.u,0,power,i.w);
            }
        }
        for(auto i:vec[u])
        {
            CO(u,u,i,power,0);
        }
    }
    cout<<-1;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1872 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 2140 KB Output is correct
11 Correct 1 ms 2140 KB Output is correct
12 Correct 1 ms 2136 KB Output is correct
13 Correct 1 ms 2140 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 1 ms 2140 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 2140 KB Output is correct
11 Correct 1 ms 2140 KB Output is correct
12 Correct 1 ms 2140 KB Output is correct
13 Correct 1 ms 2140 KB Output is correct
14 Correct 2 ms 2260 KB Output is correct
15 Correct 1 ms 2140 KB Output is correct
16 Correct 1 ms 2388 KB Output is correct
17 Correct 2 ms 3672 KB Output is correct
18 Correct 3 ms 5980 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 4 ms 6748 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 3 ms 5980 KB Output is correct
23 Incorrect 2 ms 5724 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 2136 KB Output is correct
11 Correct 1 ms 2140 KB Output is correct
12 Correct 1 ms 2140 KB Output is correct
13 Correct 1 ms 2140 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 1 ms 2260 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 3676 KB Output is correct
18 Correct 3 ms 5980 KB Output is correct
19 Correct 3 ms 6488 KB Output is correct
20 Correct 3 ms 6748 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 2 ms 5980 KB Output is correct
23 Incorrect 2 ms 5724 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 1 ms 2140 KB Output is correct
11 Correct 1 ms 2140 KB Output is correct
12 Correct 1 ms 2140 KB Output is correct
13 Correct 1 ms 2140 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 3676 KB Output is correct
18 Correct 3 ms 5980 KB Output is correct
19 Correct 3 ms 6492 KB Output is correct
20 Correct 3 ms 6748 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 3 ms 5980 KB Output is correct
23 Incorrect 2 ms 5724 KB Output isn't correct
24 Halted 0 ms 0 KB -