oj.uz

Submission #317730

# Submission time Handle Problem Language Result Execution time Memory
317730 2020-10-30T08:37:27 Z zaneyu Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 1000 ms 32628 KB 
/*input
5 3
0 2
1 1
4 1
*/
//#include "dreaming.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
 
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ll long long 
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define MP make_pair
const ll INF64=4e12;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1){
            res=(res*a)%MOD;
        }
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
const ll maxn=3e4+5;
const ll maxlg=__lg(maxn)+2;
int b[maxn],p[maxn];
int dist[maxn][205];
bool in[maxn][205];
vector<int> pos[maxn];
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    //freopen("doge_5_21.in","r",stdin);
    //srand(time(NULL));
    int n,m;
    cin>>n>>m;
    REP(i,m){
        cin>>b[i]>>p[i];
        //b[i]=rand()%n,p[i]=rand()%n+1;
        pos[b[i]].pb(p[i]);
    }
    REP(i,n) SORT_UNIQUE(pos[i]);
    int blk=(int)sqrt(n);
    priority_queue<piii,vector<piii>,greater<piii>> pq;
    REP(i,n){
        REP(j,blk+1){
            dist[i][j]=INF;
        }
    }
    pq.push({0,{b[0],0}});
    dist[b[0]][0]=0;
    int ans=INF;
    vector<pii> v;
    while(!pq.empty()){
        pii z=pq.top().s;
        in[z.f][z.s]=0;
        pq.pop();
        if(z.f==b[1]){
            MNTO(ans,dist[z.f][z.s]);
            continue;
        }
        if(z.s==0){
            for(int x:pos[z.f]){
                if(x>blk){
                    for(int j=z.f%x;j<n;j+=x){
                        pii node={j,0};
                        if(dist[node.f][node.s]>dist[z.f][z.s]+abs(z.f-j)/x){
                            dist[node.f][node.s]=dist[z.f][z.s]+abs(z.f-j)/x;
                            if(!in[node.f][node.s]) pq.push({dist[node.f][node.s],node}),in[node.f][node.s]=1;
                        }
                    }
                }   
                else{
                    pii node={z.f,x};
                    if(dist[node.f][node.s]>dist[z.f][z.s]){
                        dist[node.f][node.s]=dist[z.f][z.s];
                        if(!in[node.f][node.s]) pq.push({dist[node.f][node.s],node}),in[node.f][node.s]=1;
                    } 
                }
            }
        }
        else if(z.s<=blk){
            pii node={z.f-z.s,z.s};
            if(node.f>=0 and dist[node.f][node.s]>dist[z.f][z.s]+1){
                dist[node.f][node.s]=dist[z.f][z.s]+1;
                if(!in[node.f][node.s]) pq.push({dist[node.f][node.s],node}),in[node.f][node.s]=1;
            }
             node={z.f+z.s,z.s};
            if(node.f<n and dist[node.f][node.s]>dist[z.f][z.s]+1){
                dist[node.f][node.s]=dist[z.f][z.s]+1;
                if(!in[node.f][node.s]) pq.push({dist[node.f][node.s],node}),in[node.f][node.s]=1;
            }
             node={z.f,0};
            if(dist[node.f][node.s]>dist[z.f][z.s]){
                dist[node.f][node.s]=dist[z.f][z.s];
                if(!in[node.f][node.s]) pq.push({dist[node.f][node.s],node}),in[node.f][node.s]=1;
            }
        }
        else{
            assert(false);
        }
    }
    if(ans==INF) cout<<-1;
    else cout<<ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1096 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 2 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 2 ms 1152 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 2 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 2 ms 1280 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 1 ms 1280 KB Output is correct
17 Correct 3 ms 1792 KB Output is correct
18 Correct 2 ms 2560 KB Output is correct
19 Correct 2 ms 2688 KB Output is correct
20 Correct 3 ms 3200 KB Output is correct
21 Correct 1 ms 1408 KB Output is correct
22 Correct 2 ms 2560 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 4 ms 3072 KB Output is correct
25 Correct 3 ms 3072 KB Output is correct
26 Correct 3 ms 3072 KB Output is correct
27 Correct 3 ms 3072 KB Output is correct
28 Correct 3 ms 3200 KB Output is correct
29 Correct 10 ms 3072 KB Output is correct
30 Correct 4 ms 3072 KB Output is correct
31 Correct 7 ms 3072 KB Output is correct
32 Correct 5 ms 3128 KB Output is correct
33 Correct 13 ms 3200 KB Output is correct
34 Correct 14 ms 3328 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 1 ms 1280 KB Output is correct
17 Correct 3 ms 1920 KB Output is correct
18 Correct 2 ms 2560 KB Output is correct
19 Correct 2 ms 2688 KB Output is correct
20 Correct 3 ms 3200 KB Output is correct
21 Correct 1 ms 1408 KB Output is correct
22 Correct 2 ms 2560 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 4 ms 3072 KB Output is correct
25 Correct 3 ms 3072 KB Output is correct
26 Correct 3 ms 3072 KB Output is correct
27 Correct 3 ms 3072 KB Output is correct
28 Correct 3 ms 3200 KB Output is correct
29 Correct 10 ms 3072 KB Output is correct
30 Correct 4 ms 3072 KB Output is correct
31 Correct 7 ms 3072 KB Output is correct
32 Correct 4 ms 3072 KB Output is correct
33 Correct 13 ms 3200 KB Output is correct
34 Correct 14 ms 3200 KB Output is correct
35 Correct 13 ms 2944 KB Output is correct
36 Correct 4 ms 2304 KB Output is correct
37 Correct 16 ms 3456 KB Output is correct
38 Correct 17 ms 3584 KB Output is correct
39 Correct 18 ms 3584 KB Output is correct
40 Correct 18 ms 3584 KB Output is correct
41 Correct 18 ms 3584 KB Output is correct
42 Correct 7 ms 3584 KB Output is correct
43 Correct 7 ms 3584 KB Output is correct
44 Correct 7 ms 3584 KB Output is correct
45 Correct 22 ms 3704 KB Output is correct
46 Correct 21 ms 3584 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 2 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 2 ms 1152 KB Output is correct
14 Correct 2 ms 1152 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 1 ms 1280 KB Output is correct
17 Correct 3 ms 1920 KB Output is correct
18 Correct 2 ms 2560 KB Output is correct
19 Correct 2 ms 2688 KB Output is correct
20 Correct 3 ms 3200 KB Output is correct
21 Correct 2 ms 1408 KB Output is correct
22 Correct 2 ms 2560 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 4 ms 3072 KB Output is correct
25 Correct 3 ms 3072 KB Output is correct
26 Correct 3 ms 3072 KB Output is correct
27 Correct 3 ms 3072 KB Output is correct
28 Correct 3 ms 3200 KB Output is correct
29 Correct 10 ms 3072 KB Output is correct
30 Correct 4 ms 3072 KB Output is correct
31 Correct 7 ms 3072 KB Output is correct
32 Correct 4 ms 3072 KB Output is correct
33 Correct 14 ms 3200 KB Output is correct
34 Correct 14 ms 3200 KB Output is correct
35 Correct 16 ms 2944 KB Output is correct
36 Correct 4 ms 2304 KB Output is correct
37 Correct 16 ms 3448 KB Output is correct
38 Correct 17 ms 3584 KB Output is correct
39 Correct 17 ms 3584 KB Output is correct
40 Correct 17 ms 3584 KB Output is correct
41 Correct 17 ms 3584 KB Output is correct
42 Correct 7 ms 3584 KB Output is correct
43 Correct 7 ms 3584 KB Output is correct
44 Correct 7 ms 3536 KB Output is correct
45 Correct 21 ms 3584 KB Output is correct
46 Correct 21 ms 3584 KB Output is correct
47 Correct 110 ms 14336 KB Output is correct
48 Correct 20 ms 20352 KB Output is correct
49 Correct 20 ms 22016 KB Output is correct
50 Correct 19 ms 23936 KB Output is correct
51 Correct 87 ms 32248 KB Output is correct
52 Correct 98 ms 32248 KB Output is correct
53 Correct 33 ms 32000 KB Output is correct
54 Correct 22 ms 31104 KB Output is correct
55 Correct 23 ms 31104 KB Output is correct
56 Correct 32 ms 32248 KB Output is correct
57 Correct 126 ms 31224 KB Output is correct
58 Correct 31 ms 31616 KB Output is correct
59 Correct 31 ms 31608 KB Output is correct
60 Correct 31 ms 31608 KB Output is correct
61 Correct 34 ms 31616 KB Output is correct
62 Correct 65 ms 32248 KB Output is correct
63 Correct 75 ms 32116 KB Output is correct
64 Correct 80 ms 32072 KB Output is correct
65 Correct 386 ms 32128 KB Output is correct
66 Correct 993 ms 32372 KB Output is correct
67 Correct 1000 ms 32628 KB Output is correct