oj.uz

Submission #397323

# Submission time Handle Problem Language Result Execution time Memory
397323 2021-05-01T22:25:28 Z Bitmasking Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 213 ms 262148 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(ini) (ll) __builtin_popcountll(x)
#define cuantos(a,x) count(all(a),x)
#define fs first
#define sc second
#define pb push_back
#define po pop_back
#define sz(a) (ll) a.size()
#define all(a) a.begin(), a.end()
#define sor(a) sort( a.begin(), a.end() )
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ller ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
#define watch(x) cout << (#x) << " is " << (x) <<"\n"
#define test ll deftestcases;cin>>deftestcases;while(deftestcases--)
#define PI acos(-1)
using namespace std;
typedef long long ll;
typedef long double ld; 
typedef pair<ll,ll> ii;
typedef vector<ll>  vi;
typedef vector<ii> vii;
template<class T> using ordered_set =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;
const ll inf = 2e18;
const ll mod = 1e9+7;   
const ll MAX = 1e6+10;

vii adj[MAX];
vi aux[MAX];
ll dis[MAX];
void dijkstra(ll root,ll n){
    f(i,0,n+4){
        dis[i] = -1;
    }
    priority_queue<ii,vii,greater<ii>> pq;
    dis[root] = 0;
    pq.push({dis[root],root});
    while(sz(pq)){
        ll u = pq.top().sc;
        ll d = pq.top().fs;
        pq.pop();
        if(dis[u]!=d) continue;
        for(auto v : adj[u]){
            ll to = v.fs,w = v.sc;
            if(dis[to]==-1 || dis[u]+w<dis[to]){
                dis[to] = dis[u]+w;
                pq.push({dis[to],to});
            }
        }
    }
}

void ida(ll u,ll n){
    for(auto pod : aux[u]){
            ll to = 0,mul=1;
            while(to<=n){
                to = pod*mul+u;
                if(to>n) break;
                adj[u].pb({to,mul});
                mul++;
            }
    }
}
void vuelta(ll u){
    for(auto pod : aux[u]){
        ll to = 0,mul=1;
        while(to>=0){
            to = u-pod*mul;
            if(to<0) break;
            adj[u].pb({to,mul});
            mul++;
        }
    }
}
int main(){
    fastio;
    ll n,m;cin>>n>>m;
    ll ini=0,meta=0;
    f(i,0,m){
        ll b,p;cin>>b>>p;
        if(!i) ini = b;
        if(i==1) {meta = b;continue;}
        aux[b].pb(p);
    }
    f(u,0,n){
        ida(u,n);
        vuelta(u);
    }
    dijkstra(ini,n);
    cout<<dis[meta]<<"\n";
    return 0; 
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47180 KB Output is correct
2 Correct 25 ms 47256 KB Output is correct
3 Correct 25 ms 47208 KB Output is correct
4 Correct 25 ms 47280 KB Output is correct
5 Correct 24 ms 47236 KB Output is correct
6 Correct 25 ms 47168 KB Output is correct
7 Correct 24 ms 47180 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 47264 KB Output is correct
2 Correct 31 ms 47268 KB Output is correct
3 Correct 25 ms 47284 KB Output is correct
4 Correct 25 ms 47192 KB Output is correct
5 Correct 24 ms 47180 KB Output is correct
6 Correct 26 ms 47172 KB Output is correct
7 Correct 25 ms 47244 KB Output is correct
8 Correct 26 ms 47264 KB Output is correct
9 Correct 25 ms 47272 KB Output is correct
10 Correct 27 ms 47280 KB Output is correct
11 Correct 28 ms 47436 KB Output is correct
12 Correct 32 ms 51476 KB Output is correct
13 Correct 33 ms 51740 KB Output is correct
14 Correct 30 ms 47308 KB Output is correct
15 Correct 26 ms 47380 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47188 KB Output is correct
2 Correct 24 ms 47284 KB Output is correct
3 Correct 24 ms 47180 KB Output is correct
4 Correct 25 ms 47248 KB Output is correct
5 Correct 26 ms 47280 KB Output is correct
6 Correct 27 ms 47208 KB Output is correct
7 Correct 25 ms 47256 KB Output is correct
8 Correct 25 ms 47288 KB Output is correct
9 Correct 25 ms 47252 KB Output is correct
10 Correct 26 ms 47368 KB Output is correct
11 Correct 27 ms 47516 KB Output is correct
12 Correct 32 ms 51524 KB Output is correct
13 Correct 30 ms 51716 KB Output is correct
14 Correct 27 ms 47396 KB Output is correct
15 Correct 26 ms 47328 KB Output is correct
16 Correct 27 ms 47308 KB Output is correct
17 Correct 27 ms 47816 KB Output is correct
18 Correct 31 ms 47388 KB Output is correct
19 Correct 25 ms 47356 KB Output is correct
20 Correct 84 ms 111460 KB Output is correct
21 Correct 28 ms 47332 KB Output is correct
22 Correct 25 ms 47436 KB Output is correct
23 Correct 26 ms 47420 KB Output is correct
24 Correct 29 ms 47568 KB Output is correct
25 Correct 27 ms 47480 KB Output is correct
26 Correct 96 ms 113176 KB Output is correct
27 Correct 95 ms 113100 KB Output is correct
28 Correct 27 ms 47684 KB Output is correct
29 Correct 28 ms 48716 KB Output is correct
30 Correct 26 ms 47716 KB Output is correct
31 Correct 28 ms 48096 KB Output is correct
32 Correct 27 ms 47816 KB Output is correct
33 Correct 30 ms 49760 KB Output is correct
34 Correct 29 ms 49616 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47292 KB Output is correct
2 Correct 25 ms 47180 KB Output is correct
3 Correct 26 ms 47228 KB Output is correct
4 Correct 26 ms 47156 KB Output is correct
5 Correct 26 ms 47268 KB Output is correct
6 Correct 26 ms 47180 KB Output is correct
7 Correct 26 ms 47224 KB Output is correct
8 Correct 26 ms 47248 KB Output is correct
9 Correct 25 ms 47180 KB Output is correct
10 Correct 27 ms 47240 KB Output is correct
11 Correct 26 ms 47440 KB Output is correct
12 Correct 30 ms 51524 KB Output is correct
13 Correct 30 ms 51772 KB Output is correct
14 Correct 26 ms 47308 KB Output is correct
15 Correct 26 ms 47360 KB Output is correct
16 Correct 26 ms 47436 KB Output is correct
17 Correct 27 ms 47820 KB Output is correct
18 Correct 25 ms 47432 KB Output is correct
19 Correct 26 ms 47384 KB Output is correct
20 Correct 83 ms 111508 KB Output is correct
21 Correct 26 ms 47340 KB Output is correct
22 Correct 25 ms 47436 KB Output is correct
23 Correct 26 ms 47464 KB Output is correct
24 Correct 28 ms 47668 KB Output is correct
25 Correct 27 ms 47436 KB Output is correct
26 Correct 94 ms 113356 KB Output is correct
27 Correct 93 ms 113096 KB Output is correct
28 Correct 26 ms 47780 KB Output is correct
29 Correct 29 ms 48752 KB Output is correct
30 Correct 27 ms 47800 KB Output is correct
31 Correct 27 ms 48100 KB Output is correct
32 Correct 27 ms 47824 KB Output is correct
33 Correct 29 ms 49736 KB Output is correct
34 Correct 31 ms 49740 KB Output is correct
35 Correct 34 ms 50548 KB Output is correct
36 Correct 27 ms 47728 KB Output is correct
37 Correct 36 ms 53700 KB Output is correct
38 Correct 38 ms 52540 KB Output is correct
39 Correct 38 ms 52832 KB Output is correct
40 Correct 37 ms 52576 KB Output is correct
41 Correct 38 ms 52420 KB Output is correct
42 Runtime error 213 ms 262148 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47280 KB Output is correct
2 Correct 26 ms 47180 KB Output is correct
3 Correct 25 ms 47180 KB Output is correct
4 Correct 25 ms 47240 KB Output is correct
5 Correct 27 ms 47212 KB Output is correct
6 Correct 26 ms 47260 KB Output is correct
7 Correct 25 ms 47172 KB Output is correct
8 Correct 25 ms 47236 KB Output is correct
9 Correct 26 ms 47188 KB Output is correct
10 Correct 26 ms 47308 KB Output is correct
11 Correct 26 ms 47420 KB Output is correct
12 Correct 30 ms 51552 KB Output is correct
13 Correct 30 ms 51756 KB Output is correct
14 Correct 26 ms 47312 KB Output is correct
15 Correct 25 ms 47428 KB Output is correct
16 Correct 28 ms 47368 KB Output is correct
17 Correct 27 ms 47736 KB Output is correct
18 Correct 26 ms 47372 KB Output is correct
19 Correct 26 ms 47428 KB Output is correct
20 Correct 82 ms 111428 KB Output is correct
21 Correct 26 ms 47320 KB Output is correct
22 Correct 27 ms 47420 KB Output is correct
23 Correct 26 ms 47480 KB Output is correct
24 Correct 27 ms 47564 KB Output is correct
25 Correct 27 ms 47428 KB Output is correct
26 Correct 98 ms 113160 KB Output is correct
27 Correct 92 ms 113172 KB Output is correct
28 Correct 28 ms 47708 KB Output is correct
29 Correct 28 ms 48764 KB Output is correct
30 Correct 27 ms 47820 KB Output is correct
31 Correct 27 ms 48072 KB Output is correct
32 Correct 27 ms 47820 KB Output is correct
33 Correct 31 ms 49728 KB Output is correct
34 Correct 30 ms 49616 KB Output is correct
35 Correct 35 ms 50500 KB Output is correct
36 Correct 27 ms 47692 KB Output is correct
37 Correct 36 ms 53764 KB Output is correct
38 Correct 37 ms 52548 KB Output is correct
39 Correct 37 ms 52864 KB Output is correct
40 Correct 38 ms 52664 KB Output is correct
41 Correct 39 ms 52496 KB Output is correct
42 Runtime error 206 ms 262148 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -