oj.uz

Submission #1035871

# Submission time Handle Problem Language Result Execution time Memory
1035871 2024-07-26T17:05:12 Z DucNguyen2007 Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 442 ms 97856 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=sqrt(maxN);
const ll inf=2e18;
int n,m,b[maxN+1],p[maxN+1],block,cnt[maxN+1];
ll d[maxN+1][BLOCK+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;
    block=sqrt(n);
    for(int i=0;i<m;i++)
    {
        cin>>b[i]>>p[i];
        if(p[i]<=block)
        {
            vec[b[i]].push_back(p[i]);
        }
        else cnt[b[i]]++;
    }
    for(int i=0;i<m;i++)
    {
        if(p[i]<=block)
        {
            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(cnt[u]>0)
            {
                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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1880 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2136 KB Output is correct
2 Correct 1 ms 1624 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 1880 KB Output is correct
6 Correct 1 ms 2136 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 1884 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 1 ms 1884 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 2140 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory 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 1880 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 1880 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 1 ms 1884 KB Output is correct
13 Correct 1 ms 1880 KB Output is correct
14 Correct 1 ms 2136 KB Output is correct
15 Correct 1 ms 2136 KB Output is correct
16 Correct 1 ms 2140 KB Output is correct
17 Correct 2 ms 2908 KB Output is correct
18 Correct 2 ms 4188 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 2 ms 4188 KB Output is correct
23 Correct 2 ms 3932 KB Output is correct
24 Correct 2 ms 4628 KB Output is correct
25 Correct 2 ms 4700 KB Output is correct
26 Correct 2 ms 4700 KB Output is correct
27 Correct 2 ms 4540 KB Output is correct
28 Correct 3 ms 4700 KB Output is correct
29 Correct 5 ms 4440 KB Output is correct
30 Correct 2 ms 4440 KB Output is correct
31 Correct 3 ms 4700 KB Output is correct
32 Correct 3 ms 4700 KB Output is correct
33 Correct 7 ms 5820 KB Output is correct
34 Correct 5 ms 5724 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1880 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 1880 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 1884 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 1 ms 1884 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 2140 KB Output is correct
15 Correct 1 ms 2140 KB Output is correct
16 Correct 1 ms 2140 KB Output is correct
17 Correct 2 ms 2908 KB Output is correct
18 Correct 2 ms 4216 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 2 ms 4188 KB Output is correct
23 Correct 2 ms 3932 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 2 ms 4700 KB Output is correct
26 Correct 2 ms 4700 KB Output is correct
27 Correct 2 ms 4444 KB Output is correct
28 Correct 3 ms 4700 KB Output is correct
29 Correct 4 ms 4416 KB Output is correct
30 Correct 3 ms 4444 KB Output is correct
31 Correct 4 ms 4564 KB Output is correct
32 Correct 3 ms 4700 KB Output is correct
33 Correct 7 ms 5724 KB Output is correct
34 Correct 5 ms 5724 KB Output is correct
35 Correct 6 ms 5468 KB Output is correct
36 Correct 2 ms 3420 KB Output is correct
37 Correct 7 ms 7516 KB Output is correct
38 Correct 7 ms 7196 KB Output is correct
39 Correct 7 ms 7076 KB Output is correct
40 Correct 7 ms 7260 KB Output is correct
41 Correct 7 ms 7256 KB Output is correct
42 Correct 5 ms 5212 KB Output is correct
43 Correct 4 ms 5212 KB Output is correct
44 Correct 4 ms 5212 KB Output is correct
45 Correct 15 ms 12892 KB Output is correct
46 Correct 12 ms 12572 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1756 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 1884 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 1 ms 1884 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 2140 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 1 ms 2140 KB Output is correct
17 Correct 2 ms 2908 KB Output is correct
18 Correct 2 ms 4192 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 2 ms 4448 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 3 ms 4188 KB Output is correct
23 Correct 2 ms 3932 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 2 ms 4952 KB Output is correct
26 Correct 2 ms 4700 KB Output is correct
27 Correct 2 ms 4444 KB Output is correct
28 Correct 2 ms 4700 KB Output is correct
29 Correct 4 ms 4444 KB Output is correct
30 Correct 3 ms 4444 KB Output is correct
31 Correct 4 ms 4724 KB Output is correct
32 Correct 2 ms 4696 KB Output is correct
33 Correct 8 ms 5820 KB Output is correct
34 Correct 5 ms 5724 KB Output is correct
35 Correct 6 ms 5468 KB Output is correct
36 Correct 2 ms 3420 KB Output is correct
37 Correct 7 ms 7512 KB Output is correct
38 Correct 7 ms 7260 KB Output is correct
39 Correct 7 ms 7144 KB Output is correct
40 Correct 7 ms 7260 KB Output is correct
41 Correct 7 ms 7260 KB Output is correct
42 Correct 4 ms 5176 KB Output is correct
43 Correct 4 ms 5212 KB Output is correct
44 Correct 4 ms 5212 KB Output is correct
45 Correct 14 ms 12692 KB Output is correct
46 Correct 13 ms 12636 KB Output is correct
47 Correct 19 ms 28128 KB Output is correct
48 Correct 18 ms 35932 KB Output is correct
49 Correct 18 ms 38488 KB Output is correct
50 Correct 19 ms 41564 KB Output is correct
51 Correct 30 ms 46804 KB Output is correct
52 Correct 30 ms 47064 KB Output is correct
53 Correct 23 ms 43424 KB Output is correct
54 Correct 19 ms 42588 KB Output is correct
55 Correct 18 ms 42640 KB Output is correct
56 Correct 24 ms 44120 KB Output is correct
57 Correct 17 ms 42844 KB Output is correct
58 Correct 23 ms 43228 KB Output is correct
59 Correct 22 ms 43356 KB Output is correct
60 Correct 22 ms 43864 KB Output is correct
61 Correct 22 ms 43864 KB Output is correct
62 Correct 40 ms 47960 KB Output is correct
63 Correct 75 ms 90192 KB Output is correct
64 Correct 87 ms 97856 KB Output is correct
65 Correct 178 ms 97580 KB Output is correct
66 Correct 442 ms 86696 KB Output is correct
67 Correct 230 ms 86484 KB Output is correct