Submission #387950

# Submission time Handle Problem Language Result Execution time Memory
387950 2021-04-09T14:55:39 Z cpp219 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
418 ms 262148 KB
#pragma GCC optimization "Ofast"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")

#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 3e6 + 6;
const ll Log2 = 19;
const ll inf = 1e9 + 7;
typedef pair<ll,ll> LL;
vector<LL> v;
struct doge{
    ll pos,p,id;
};
doge a[N];
ll n,m,d[N];
map<LL,ll> mp;
vector<LL> g[N];

void Dij(){
    fill(d,d + N - 1,inf);
    priority_queue<LL,vector<LL>,greater<LL>> pq; pq.push({0,a[1].pos}); d[a[1].pos] = 0;
    while(!pq.empty()){
        LL t = pq.top(); pq.pop();
        ll u = t.sc;
        for (auto i : g[u]){
            ll v = i.fs,L = i.sc;
            if (d[v] > d[u] + L) d[v] = d[u] + L,pq.push({d[v],v});
        }
    }
    //for (auto i : g[1]) cout<<i.fs<<"x "; exit(0);
    //cout<<d[2]; exit(0);
    if (d[a[2].pos] != inf) cout<<d[a[2].pos];
    else cout<<-1;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define task "test"
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        //freopen(task".out", "w", stdout);
    }
    cin>>n>>m;
    for (ll i = 1;i <= m;i++) cin>>a[i].pos>>a[i].p,a[i].pos++;
    for (ll i = 1;i <= m;i++){
        LL now = {a[i].pos,a[i].p};
        if (mp[now]) continue; mp[now] = 1;
        ll cost = 1;
        for (ll j = now.fs + a[i].p;j <= n;j += a[i].p){
            //if (mp[{j,now.sc}]) break;
            //mp[{j,now.sc}] = 1; //cout<<j<<" ";
            g[now.fs].push_back({j,cost}),cost++;
        }
        cost = 1; //return 0;
        for (ll j = now.fs - a[i].p;j > 0;j -= a[i].p){
            //if (mp[{j,now.sc}]) break;
            //mp[{j,now.sc}] = 1;
            g[now.fs].push_back({j,cost}),cost++;
            //if (now.fs == 5) cout<<j<<" x ";
        }
    }
    Dij();
}

Compilation message

skyscraper.cpp:1: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    1 | #pragma GCC optimization "Ofast"
      | 
skyscraper.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:53:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   53 |         if (mp[now]) continue; mp[now] = 1;
      |         ^~
skyscraper.cpp:53:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   53 |         if (mp[now]) continue; mp[now] = 1;
      |                                ^~
skyscraper.cpp:46:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   46 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 50 ms 82388 KB Output is correct
2 Correct 50 ms 82428 KB Output is correct
3 Correct 49 ms 82492 KB Output is correct
4 Correct 50 ms 82452 KB Output is correct
5 Correct 49 ms 82420 KB Output is correct
6 Correct 49 ms 82484 KB Output is correct
7 Correct 49 ms 82368 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 51 ms 82380 KB Output is correct
2 Correct 50 ms 82408 KB Output is correct
3 Correct 51 ms 82432 KB Output is correct
4 Correct 57 ms 82456 KB Output is correct
5 Correct 51 ms 82436 KB Output is correct
6 Correct 50 ms 82372 KB Output is correct
7 Correct 49 ms 82368 KB Output is correct
8 Correct 50 ms 82436 KB Output is correct
9 Correct 49 ms 82500 KB Output is correct
10 Correct 49 ms 82536 KB Output is correct
11 Correct 52 ms 82640 KB Output is correct
12 Correct 49 ms 82528 KB Output is correct
13 Correct 50 ms 82552 KB Output is correct
14 Correct 51 ms 82676 KB Output is correct
15 Correct 51 ms 82704 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 59 ms 82376 KB Output is correct
2 Correct 50 ms 82476 KB Output is correct
3 Correct 51 ms 82508 KB Output is correct
4 Correct 50 ms 82388 KB Output is correct
5 Correct 51 ms 82492 KB Output is correct
6 Correct 49 ms 82460 KB Output is correct
7 Correct 50 ms 82500 KB Output is correct
8 Correct 51 ms 82484 KB Output is correct
9 Correct 48 ms 82496 KB Output is correct
10 Correct 49 ms 82572 KB Output is correct
11 Correct 51 ms 82640 KB Output is correct
12 Correct 51 ms 82628 KB Output is correct
13 Correct 52 ms 82528 KB Output is correct
14 Correct 50 ms 82664 KB Output is correct
15 Correct 52 ms 82712 KB Output is correct
16 Correct 50 ms 82620 KB Output is correct
17 Correct 51 ms 82816 KB Output is correct
18 Correct 50 ms 82572 KB Output is correct
19 Correct 60 ms 82556 KB Output is correct
20 Correct 126 ms 114664 KB Output is correct
21 Correct 53 ms 82628 KB Output is correct
22 Correct 51 ms 82520 KB Output is correct
23 Correct 51 ms 82532 KB Output is correct
24 Correct 52 ms 82716 KB Output is correct
25 Correct 53 ms 82744 KB Output is correct
26 Correct 50 ms 82688 KB Output is correct
27 Correct 51 ms 82632 KB Output is correct
28 Correct 53 ms 82824 KB Output is correct
29 Correct 53 ms 83364 KB Output is correct
30 Correct 52 ms 82920 KB Output is correct
31 Correct 52 ms 82940 KB Output is correct
32 Correct 51 ms 82784 KB Output is correct
33 Correct 55 ms 84164 KB Output is correct
34 Correct 56 ms 84124 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 49 ms 82448 KB Output is correct
2 Correct 58 ms 82372 KB Output is correct
3 Correct 50 ms 82388 KB Output is correct
4 Correct 51 ms 82480 KB Output is correct
5 Correct 50 ms 82404 KB Output is correct
6 Correct 50 ms 82492 KB Output is correct
7 Correct 50 ms 82384 KB Output is correct
8 Correct 50 ms 82472 KB Output is correct
9 Correct 50 ms 82580 KB Output is correct
10 Correct 50 ms 82548 KB Output is correct
11 Correct 60 ms 82708 KB Output is correct
12 Correct 51 ms 82500 KB Output is correct
13 Correct 50 ms 82520 KB Output is correct
14 Correct 50 ms 82644 KB Output is correct
15 Correct 51 ms 82620 KB Output is correct
16 Correct 50 ms 82500 KB Output is correct
17 Correct 52 ms 82892 KB Output is correct
18 Correct 51 ms 82544 KB Output is correct
19 Correct 50 ms 82580 KB Output is correct
20 Correct 117 ms 114776 KB Output is correct
21 Correct 51 ms 82508 KB Output is correct
22 Correct 50 ms 82580 KB Output is correct
23 Correct 50 ms 82628 KB Output is correct
24 Correct 52 ms 82848 KB Output is correct
25 Correct 52 ms 82760 KB Output is correct
26 Correct 51 ms 82644 KB Output is correct
27 Correct 55 ms 82664 KB Output is correct
28 Correct 59 ms 82756 KB Output is correct
29 Correct 53 ms 83396 KB Output is correct
30 Correct 54 ms 82832 KB Output is correct
31 Correct 51 ms 83000 KB Output is correct
32 Correct 52 ms 82920 KB Output is correct
33 Correct 56 ms 84184 KB Output is correct
34 Correct 55 ms 84036 KB Output is correct
35 Correct 74 ms 85940 KB Output is correct
36 Correct 54 ms 83052 KB Output is correct
37 Correct 73 ms 87072 KB Output is correct
38 Correct 78 ms 87128 KB Output is correct
39 Correct 78 ms 87396 KB Output is correct
40 Correct 78 ms 87320 KB Output is correct
41 Correct 77 ms 87152 KB Output is correct
42 Correct 55 ms 82924 KB Output is correct
43 Correct 55 ms 82880 KB Output is correct
44 Correct 118 ms 115024 KB Output is correct
45 Correct 79 ms 89264 KB Output is correct
46 Correct 80 ms 89204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 50 ms 82484 KB Output is correct
2 Correct 55 ms 82500 KB Output is correct
3 Correct 51 ms 82448 KB Output is correct
4 Correct 53 ms 82488 KB Output is correct
5 Correct 50 ms 82372 KB Output is correct
6 Correct 50 ms 82396 KB Output is correct
7 Correct 49 ms 82412 KB Output is correct
8 Correct 50 ms 82492 KB Output is correct
9 Correct 52 ms 82424 KB Output is correct
10 Correct 51 ms 82500 KB Output is correct
11 Correct 51 ms 82628 KB Output is correct
12 Correct 49 ms 82524 KB Output is correct
13 Correct 48 ms 82632 KB Output is correct
14 Correct 51 ms 82608 KB Output is correct
15 Correct 55 ms 82756 KB Output is correct
16 Correct 51 ms 82504 KB Output is correct
17 Correct 52 ms 82788 KB Output is correct
18 Correct 52 ms 82580 KB Output is correct
19 Correct 51 ms 82512 KB Output is correct
20 Correct 117 ms 114744 KB Output is correct
21 Correct 50 ms 82500 KB Output is correct
22 Correct 51 ms 82544 KB Output is correct
23 Correct 51 ms 82652 KB Output is correct
24 Correct 52 ms 82732 KB Output is correct
25 Correct 51 ms 82744 KB Output is correct
26 Correct 51 ms 82648 KB Output is correct
27 Correct 51 ms 82572 KB Output is correct
28 Correct 51 ms 82892 KB Output is correct
29 Correct 53 ms 83392 KB Output is correct
30 Correct 54 ms 82820 KB Output is correct
31 Correct 52 ms 82936 KB Output is correct
32 Correct 51 ms 82800 KB Output is correct
33 Correct 56 ms 84140 KB Output is correct
34 Correct 57 ms 84012 KB Output is correct
35 Correct 72 ms 85876 KB Output is correct
36 Correct 57 ms 82984 KB Output is correct
37 Correct 72 ms 87200 KB Output is correct
38 Correct 79 ms 87236 KB Output is correct
39 Correct 79 ms 87340 KB Output is correct
40 Correct 78 ms 87236 KB Output is correct
41 Correct 79 ms 87156 KB Output is correct
42 Correct 58 ms 82952 KB Output is correct
43 Correct 55 ms 82952 KB Output is correct
44 Correct 119 ms 115268 KB Output is correct
45 Correct 79 ms 89216 KB Output is correct
46 Correct 80 ms 89252 KB Output is correct
47 Correct 110 ms 95440 KB Output is correct
48 Correct 76 ms 86500 KB Output is correct
49 Correct 70 ms 85668 KB Output is correct
50 Correct 70 ms 84976 KB Output is correct
51 Correct 112 ms 89360 KB Output is correct
52 Correct 105 ms 89584 KB Output is correct
53 Correct 77 ms 86288 KB Output is correct
54 Correct 51 ms 82940 KB Output is correct
55 Correct 55 ms 83456 KB Output is correct
56 Runtime error 418 ms 262148 KB Execution killed with signal 9
57 Halted 0 ms 0 KB -