oj.uz

답안 #397329

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
397329 2021-05-01T22:29:40 Z Bitmasking Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 212 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 = 1e5+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

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 4 ms 5192 KB Output is correct
12 Correct 8 ms 9288 KB Output is correct
13 Correct 8 ms 9528 KB Output is correct
14 Correct 3 ms 5068 KB Output is correct
15 Correct 3 ms 5164 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4996 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 4 ms 5196 KB Output is correct
12 Correct 8 ms 9288 KB Output is correct
13 Correct 9 ms 9404 KB Output is correct
14 Correct 4 ms 5072 KB Output is correct
15 Correct 4 ms 5068 KB Output is correct
16 Correct 3 ms 5068 KB Output is correct
17 Correct 4 ms 5452 KB Output is correct
18 Correct 4 ms 5196 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 61 ms 69188 KB Output is correct
21 Correct 3 ms 5068 KB Output is correct
22 Correct 4 ms 5080 KB Output is correct
23 Correct 4 ms 5196 KB Output is correct
24 Correct 4 ms 5324 KB Output is correct
25 Correct 4 ms 5176 KB Output is correct
26 Correct 78 ms 70976 KB Output is correct
27 Correct 72 ms 70792 KB Output is correct
28 Correct 4 ms 5452 KB Output is correct
29 Correct 6 ms 6516 KB Output is correct
30 Correct 4 ms 5452 KB Output is correct
31 Correct 5 ms 5836 KB Output is correct
32 Correct 4 ms 5580 KB Output is correct
33 Correct 7 ms 7504 KB Output is correct
34 Correct 8 ms 7376 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5064 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 4 ms 5248 KB Output is correct
12 Correct 8 ms 9288 KB Output is correct
13 Correct 8 ms 9404 KB Output is correct
14 Correct 4 ms 5068 KB Output is correct
15 Correct 4 ms 5068 KB Output is correct
16 Correct 3 ms 5068 KB Output is correct
17 Correct 4 ms 5452 KB Output is correct
18 Correct 4 ms 5196 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 62 ms 69212 KB Output is correct
21 Correct 4 ms 5068 KB Output is correct
22 Correct 3 ms 5068 KB Output is correct
23 Correct 4 ms 5196 KB Output is correct
24 Correct 4 ms 5324 KB Output is correct
25 Correct 4 ms 5196 KB Output is correct
26 Correct 77 ms 70932 KB Output is correct
27 Correct 73 ms 70816 KB Output is correct
28 Correct 4 ms 5452 KB Output is correct
29 Correct 6 ms 6476 KB Output is correct
30 Correct 4 ms 5452 KB Output is correct
31 Correct 5 ms 5836 KB Output is correct
32 Correct 5 ms 5580 KB Output is correct
33 Correct 8 ms 7504 KB Output is correct
34 Correct 8 ms 7376 KB Output is correct
35 Correct 13 ms 8268 KB Output is correct
36 Correct 7 ms 5612 KB Output is correct
37 Correct 14 ms 11468 KB Output is correct
38 Correct 15 ms 10316 KB Output is correct
39 Correct 16 ms 10624 KB Output is correct
40 Correct 16 ms 10364 KB Output is correct
41 Correct 15 ms 10188 KB Output is correct
42 Runtime error 212 ms 262148 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 4 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 4 ms 5196 KB Output is correct
12 Correct 7 ms 9208 KB Output is correct
13 Correct 7 ms 9404 KB Output is correct
14 Correct 4 ms 5068 KB Output is correct
15 Correct 3 ms 5132 KB Output is correct
16 Correct 3 ms 5068 KB Output is correct
17 Correct 4 ms 5452 KB Output is correct
18 Correct 4 ms 5196 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 61 ms 69188 KB Output is correct
21 Correct 3 ms 5068 KB Output is correct
22 Correct 3 ms 5068 KB Output is correct
23 Correct 4 ms 5196 KB Output is correct
24 Correct 5 ms 5324 KB Output is correct
25 Correct 4 ms 5196 KB Output is correct
26 Correct 74 ms 70980 KB Output is correct
27 Correct 74 ms 70916 KB Output is correct
28 Correct 4 ms 5452 KB Output is correct
29 Correct 6 ms 6476 KB Output is correct
30 Correct 4 ms 5452 KB Output is correct
31 Correct 5 ms 5836 KB Output is correct
32 Correct 4 ms 5580 KB Output is correct
33 Correct 9 ms 7504 KB Output is correct
34 Correct 12 ms 7404 KB Output is correct
35 Correct 12 ms 8268 KB Output is correct
36 Correct 5 ms 5452 KB Output is correct
37 Correct 14 ms 11484 KB Output is correct
38 Correct 16 ms 10316 KB Output is correct
39 Correct 16 ms 10628 KB Output is correct
40 Correct 16 ms 10416 KB Output is correct
41 Correct 15 ms 10120 KB Output is correct
42 Runtime error 209 ms 262148 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -