oj.uz

Submission #387948

# Submission time Handle Problem Language Result Execution time Memory
387948 2021-04-09T14:54:40 Z cpp219 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 525 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 = 3e4 + 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);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1032 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1156 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1296 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 2 ms 1232 KB Output is correct
14 Correct 2 ms 1356 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1028 KB Output is correct
6 Correct 1 ms 1032 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 2 ms 1164 KB Output is correct
11 Correct 2 ms 1356 KB Output is correct
12 Correct 2 ms 1168 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 2 ms 1296 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct
16 Correct 2 ms 1228 KB Output is correct
17 Correct 3 ms 1484 KB Output is correct
18 Correct 2 ms 1232 KB Output is correct
19 Correct 1 ms 1228 KB Output is correct
20 Correct 68 ms 33308 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 2 ms 1228 KB Output is correct
23 Correct 2 ms 1296 KB Output is correct
24 Correct 3 ms 1484 KB Output is correct
25 Correct 3 ms 1356 KB Output is correct
26 Correct 2 ms 1228 KB Output is correct
27 Correct 2 ms 1228 KB Output is correct
28 Correct 3 ms 1560 KB Output is correct
29 Correct 4 ms 1996 KB Output is correct
30 Correct 2 ms 1484 KB Output is correct
31 Correct 3 ms 1612 KB Output is correct
32 Correct 2 ms 1488 KB Output is correct
33 Correct 6 ms 2764 KB Output is correct
34 Correct 7 ms 2796 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 2 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 2 ms 1032 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1356 KB Output is correct
12 Correct 2 ms 1100 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 2 ms 1280 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct
16 Correct 2 ms 1164 KB Output is correct
17 Correct 3 ms 1416 KB Output is correct
18 Correct 2 ms 1228 KB Output is correct
19 Correct 2 ms 1228 KB Output is correct
20 Correct 68 ms 33344 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 2 ms 1228 KB Output is correct
23 Correct 2 ms 1296 KB Output is correct
24 Correct 3 ms 1484 KB Output is correct
25 Correct 3 ms 1356 KB Output is correct
26 Correct 2 ms 1228 KB Output is correct
27 Correct 2 ms 1228 KB Output is correct
28 Correct 3 ms 1484 KB Output is correct
29 Correct 4 ms 2060 KB Output is correct
30 Correct 2 ms 1484 KB Output is correct
31 Correct 3 ms 1612 KB Output is correct
32 Correct 3 ms 1504 KB Output is correct
33 Correct 6 ms 2780 KB Output is correct
34 Correct 7 ms 2716 KB Output is correct
35 Correct 24 ms 4756 KB Output is correct
36 Correct 5 ms 1756 KB Output is correct
37 Correct 22 ms 5800 KB Output is correct
38 Correct 29 ms 6136 KB Output is correct
39 Correct 30 ms 6280 KB Output is correct
40 Correct 30 ms 6200 KB Output is correct
41 Correct 28 ms 6020 KB Output is correct
42 Correct 7 ms 1756 KB Output is correct
43 Correct 6 ms 1756 KB Output is correct
44 Correct 73 ms 33932 KB Output is correct
45 Correct 34 ms 8160 KB Output is correct
46 Correct 32 ms 8028 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1032 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 2 ms 1112 KB Output is correct
11 Correct 2 ms 1368 KB Output is correct
12 Correct 1 ms 1164 KB Output is correct
13 Correct 2 ms 1232 KB Output is correct
14 Correct 2 ms 1292 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct
16 Correct 2 ms 1228 KB Output is correct
17 Correct 3 ms 1484 KB Output is correct
18 Correct 2 ms 1228 KB Output is correct
19 Correct 1 ms 1164 KB Output is correct
20 Correct 69 ms 33392 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 2 ms 1228 KB Output is correct
23 Correct 2 ms 1228 KB Output is correct
24 Correct 3 ms 1432 KB Output is correct
25 Correct 3 ms 1356 KB Output is correct
26 Correct 2 ms 1228 KB Output is correct
27 Correct 2 ms 1228 KB Output is correct
28 Correct 3 ms 1492 KB Output is correct
29 Correct 4 ms 2004 KB Output is correct
30 Correct 2 ms 1492 KB Output is correct
31 Correct 3 ms 1620 KB Output is correct
32 Correct 2 ms 1484 KB Output is correct
33 Correct 7 ms 2832 KB Output is correct
34 Correct 6 ms 2764 KB Output is correct
35 Correct 22 ms 4724 KB Output is correct
36 Correct 5 ms 1768 KB Output is correct
37 Correct 22 ms 5840 KB Output is correct
38 Correct 30 ms 6088 KB Output is correct
39 Correct 30 ms 6296 KB Output is correct
40 Correct 30 ms 6172 KB Output is correct
41 Correct 29 ms 6016 KB Output is correct
42 Correct 7 ms 1868 KB Output is correct
43 Correct 6 ms 1740 KB Output is correct
44 Correct 71 ms 33860 KB Output is correct
45 Correct 32 ms 8148 KB Output is correct
46 Correct 33 ms 8032 KB Output is correct
47 Correct 62 ms 14284 KB Output is correct
48 Correct 27 ms 5344 KB Output is correct
49 Correct 19 ms 4392 KB Output is correct
50 Correct 14 ms 3872 KB Output is correct
51 Correct 55 ms 8348 KB Output is correct
52 Correct 52 ms 8484 KB Output is correct
53 Correct 28 ms 5264 KB Output is correct
54 Correct 3 ms 1612 KB Output is correct
55 Correct 4 ms 2056 KB Output is correct
56 Runtime error 525 ms 262148 KB Execution killed with signal 9
57 Halted 0 ms 0 KB -