oj.uz

답안 #549726

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
549726 2022-04-16T11:08:52 Z CyberSleeper Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 776 ms 24036 KB 
#include <bits/stdc++.h>
#define fastio      ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define debug(x)    cout << "Line " << __LINE__ << ", " << #x << " is " << x << endl
#define all(x)      x.begin(), x.end()
#define fi          first
#define se          second
#define mp          make_pair
#define pb          push_back
#define ll          long long
#define ull         unsigned long long
#define pll         pair<ll, ll>
#define pii         pair<int, int>
#define ld          long double
#define nl          endl
#define tb          '\t'
#define sp          ' '
#define sqr(x)      (x)*(x)
#define arr3        array<int, 3>
using namespace std;
 
const int MX=30005, MOD=1000000007, BLOCK=160, INF=2e9+7, LG=62;
const ll INFF=1000000000000000007;
const ld ERR=1e-6, pi=3.14159265358979323846;
 
int N, M, B[MX], P[MX];
int vis[MX][BLOCK+5], vis2[MX];
vector<int> doge[MX];
 
int main(){
    fastio;
    cin >> N >> M;
    for(int i=0; i<=N; i++){
        for(int j=0; j<=BLOCK; j++)
            vis[i][j]=INF;
    }
    for(int i=0; i<M; i++){
        cin >> B[i] >> P[i];
        doge[B[i]].pb(P[i]);
    }
    priority_queue<arr3, vector<arr3>, greater<arr3>> PQ;
    PQ.push({0, B[0], 0});
    vis[B[0]][0]=0;
    while(PQ.size()){
        int cost=PQ.top()[0], idx=PQ.top()[1], p=PQ.top()[2];
        PQ.pop();
        if(vis[idx][p]<cost)
            continue;
        vis[idx][p]=cost;
        if(!p){
            for(int i:doge[idx]){
                if(i<=BLOCK){
                    if(vis[idx][i]<=cost)
                        continue;
                    vis[idx][i]=cost;
                    PQ.push({cost, idx, i});
                }else{
                    for(int j=1, jj; idx+i*j<N; j++){
                        jj=idx+i*j;
                        if(vis[jj][0]>cost+j){
                            vis[jj][0]=cost+j;
                            PQ.push({cost+j, jj, 0});
                        }
                    }
                    for(int j=1, jj; idx-i*j>=0; j++){
                        jj=idx-i*j;
                        if(vis[jj][0]>cost+j){
                            vis[jj][0]=cost+j;
                            PQ.push({cost+j, jj, 0});
                        }
                    }
                }
            }
        }else{
            for(int j=1, jj; j<=1; j++){
                jj=idx+p*j;
                if(jj>=N)
                    continue;
                if(vis[jj][0]>cost+j){
                    vis[jj][0]=cost+j;
                    PQ.push({cost+j, jj, 0});
                }
                if(vis[jj][p]>cost+j){
                    vis[jj][p]=cost+j;
                    PQ.push({cost+j, jj, p});
                }
            }
            for(int j=1, jj; j<=1; j++){
                jj=idx-p*j;
                if(jj<0)
                    continue;
                if(vis[jj][0]>cost+j){
                    vis[jj][0]=cost+j;
                    PQ.push({cost+j, jj, 0});
                }
                if(vis[jj][p]>cost+j){
                    vis[jj][p]=cost+j;
                    PQ.push({cost+j, jj, p});
                }
            }
        }
    }
    int ans=vis[B[1]][0];
    if(ans==INF)
        ans=-1;
    cout << ans << nl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 2 ms 1108 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 3 ms 1492 KB Output is correct
18 Correct 1 ms 2132 KB Output is correct
19 Correct 2 ms 2260 KB Output is correct
20 Correct 2 ms 2388 KB Output is correct
21 Correct 1 ms 1236 KB Output is correct
22 Correct 1 ms 2132 KB Output is correct
23 Correct 2 ms 2004 KB Output is correct
24 Correct 3 ms 2260 KB Output is correct
25 Correct 2 ms 2388 KB Output is correct
26 Correct 2 ms 2260 KB Output is correct
27 Correct 2 ms 2272 KB Output is correct
28 Correct 3 ms 2420 KB Output is correct
29 Correct 8 ms 2376 KB Output is correct
30 Correct 4 ms 2388 KB Output is correct
31 Correct 5 ms 2260 KB Output is correct
32 Correct 4 ms 2260 KB Output is correct
33 Correct 15 ms 2388 KB Output is correct
34 Correct 18 ms 2388 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 2 ms 1108 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 3 ms 1492 KB Output is correct
18 Correct 1 ms 2132 KB Output is correct
19 Correct 2 ms 2260 KB Output is correct
20 Correct 1 ms 2388 KB Output is correct
21 Correct 1 ms 1236 KB Output is correct
22 Correct 1 ms 2132 KB Output is correct
23 Correct 2 ms 2104 KB Output is correct
24 Correct 3 ms 2260 KB Output is correct
25 Correct 2 ms 2388 KB Output is correct
26 Correct 2 ms 2260 KB Output is correct
27 Correct 2 ms 2260 KB Output is correct
28 Correct 3 ms 2388 KB Output is correct
29 Correct 8 ms 2260 KB Output is correct
30 Correct 3 ms 2260 KB Output is correct
31 Correct 5 ms 2372 KB Output is correct
32 Correct 4 ms 2260 KB Output is correct
33 Correct 16 ms 2444 KB Output is correct
34 Correct 18 ms 2424 KB Output is correct
35 Correct 13 ms 2388 KB Output is correct
36 Correct 4 ms 1748 KB Output is correct
37 Correct 20 ms 2772 KB Output is correct
38 Correct 18 ms 2956 KB Output is correct
39 Correct 18 ms 2856 KB Output is correct
40 Correct 19 ms 2948 KB Output is correct
41 Correct 19 ms 2960 KB Output is correct
42 Correct 5 ms 2716 KB Output is correct
43 Correct 5 ms 2772 KB Output is correct
44 Correct 5 ms 2712 KB Output is correct
45 Correct 52 ms 3096 KB Output is correct
46 Correct 51 ms 3084 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 2 ms 1108 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 3 ms 1492 KB Output is correct
18 Correct 1 ms 2132 KB Output is correct
19 Correct 2 ms 2260 KB Output is correct
20 Correct 2 ms 2388 KB Output is correct
21 Correct 1 ms 1236 KB Output is correct
22 Correct 2 ms 2132 KB Output is correct
23 Correct 3 ms 2004 KB Output is correct
24 Correct 3 ms 2260 KB Output is correct
25 Correct 2 ms 2388 KB Output is correct
26 Correct 2 ms 2376 KB Output is correct
27 Correct 2 ms 2260 KB Output is correct
28 Correct 2 ms 2388 KB Output is correct
29 Correct 8 ms 2260 KB Output is correct
30 Correct 3 ms 2260 KB Output is correct
31 Correct 5 ms 2260 KB Output is correct
32 Correct 4 ms 2372 KB Output is correct
33 Correct 15 ms 2388 KB Output is correct
34 Correct 15 ms 2388 KB Output is correct
35 Correct 14 ms 2504 KB Output is correct
36 Correct 3 ms 1748 KB Output is correct
37 Correct 20 ms 2820 KB Output is correct
38 Correct 19 ms 2956 KB Output is correct
39 Correct 19 ms 2956 KB Output is correct
40 Correct 18 ms 2900 KB Output is correct
41 Correct 19 ms 2956 KB Output is correct
42 Correct 5 ms 2772 KB Output is correct
43 Correct 5 ms 2772 KB Output is correct
44 Correct 5 ms 2772 KB Output is correct
45 Correct 51 ms 3092 KB Output is correct
46 Correct 53 ms 3168 KB Output is correct
47 Correct 75 ms 9972 KB Output is correct
48 Correct 13 ms 16596 KB Output is correct
49 Correct 18 ms 17956 KB Output is correct
50 Correct 13 ms 19540 KB Output is correct
51 Correct 52 ms 21660 KB Output is correct
52 Correct 55 ms 21752 KB Output is correct
53 Correct 21 ms 21204 KB Output is correct
54 Correct 11 ms 20308 KB Output is correct
55 Correct 11 ms 20332 KB Output is correct
56 Correct 18 ms 21460 KB Output is correct
57 Correct 84 ms 20436 KB Output is correct
58 Correct 17 ms 20820 KB Output is correct
59 Correct 19 ms 20856 KB Output is correct
60 Correct 23 ms 20896 KB Output is correct
61 Correct 20 ms 20820 KB Output is correct
62 Correct 40 ms 21560 KB Output is correct
63 Correct 52 ms 22516 KB Output is correct
64 Correct 63 ms 22532 KB Output is correct
65 Correct 238 ms 22480 KB Output is correct
66 Correct 776 ms 24036 KB Output is correct
67 Correct 752 ms 23988 KB Output is correct