oj.uz

Submission #387960

# Submission time Handle Problem Language Result Execution time Memory
387960 2021-04-09T15:09:40 Z cpp219 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 57320 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++;
            if (mp[{j,now.sc}]) break;
        }
        cost = 1; //return 0;
        for (ll j = now.fs - a[i].p;j > 0;j -= a[i].p){
            //
            //mp[{j,now.sc}] = 1;
            g[now.fs].push_back({j,cost}),cost++;
            if (mp[{j,now.sc}]) break;
            //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 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 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 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 2 ms 1100 KB Output is correct
10 Correct 2 ms 1228 KB Output is correct
11 Correct 3 ms 1484 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 3 ms 1484 KB Output is correct
15 Correct 3 ms 1484 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 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 2 ms 1100 KB Output is correct
10 Correct 2 ms 1228 KB Output is correct
11 Correct 4 ms 1484 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 2 ms 1100 KB Output is correct
14 Correct 3 ms 1484 KB Output is correct
15 Correct 3 ms 1484 KB Output is correct
16 Correct 3 ms 1412 KB Output is correct
17 Correct 7 ms 2252 KB Output is correct
18 Correct 3 ms 1612 KB Output is correct
19 Correct 2 ms 1484 KB Output is correct
20 Correct 5 ms 1612 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 3 ms 1484 KB Output is correct
23 Correct 3 ms 1612 KB Output is correct
24 Correct 7 ms 2000 KB Output is correct
25 Correct 4 ms 1740 KB Output is correct
26 Correct 4 ms 1740 KB Output is correct
27 Correct 3 ms 1612 KB Output is correct
28 Correct 9 ms 2764 KB Output is correct
29 Correct 30 ms 5884 KB Output is correct
30 Correct 10 ms 2556 KB Output is correct
31 Correct 17 ms 3660 KB Output is correct
32 Correct 12 ms 2892 KB Output is correct
33 Correct 70 ms 9932 KB Output is correct
34 Correct 63 ms 9924 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 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 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 1228 KB Output is correct
11 Correct 3 ms 1484 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 3 ms 1484 KB Output is correct
15 Correct 3 ms 1484 KB Output is correct
16 Correct 3 ms 1356 KB Output is correct
17 Correct 7 ms 2232 KB Output is correct
18 Correct 5 ms 1612 KB Output is correct
19 Correct 2 ms 1484 KB Output is correct
20 Correct 5 ms 1684 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 3 ms 1484 KB Output is correct
23 Correct 4 ms 1612 KB Output is correct
24 Correct 6 ms 1996 KB Output is correct
25 Correct 4 ms 1740 KB Output is correct
26 Correct 4 ms 1740 KB Output is correct
27 Correct 3 ms 1640 KB Output is correct
28 Correct 9 ms 2764 KB Output is correct
29 Correct 25 ms 5696 KB Output is correct
30 Correct 7 ms 2468 KB Output is correct
31 Correct 13 ms 3656 KB Output is correct
32 Correct 9 ms 2944 KB Output is correct
33 Correct 72 ms 9996 KB Output is correct
34 Correct 92 ms 9916 KB Output is correct
35 Correct 77 ms 9024 KB Output is correct
36 Correct 9 ms 2508 KB Output is correct
37 Correct 129 ms 14596 KB Output is correct
38 Correct 128 ms 13504 KB Output is correct
39 Correct 138 ms 13688 KB Output is correct
40 Correct 151 ms 13680 KB Output is correct
41 Correct 140 ms 13508 KB Output is correct
42 Correct 8 ms 2132 KB Output is correct
43 Correct 7 ms 1868 KB Output is correct
44 Correct 11 ms 2020 KB Output is correct
45 Correct 518 ms 35944 KB Output is correct
46 Correct 533 ms 35904 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1104 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 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 1228 KB Output is correct
11 Correct 3 ms 1484 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 3 ms 1484 KB Output is correct
15 Correct 3 ms 1484 KB Output is correct
16 Correct 2 ms 1356 KB Output is correct
17 Correct 7 ms 2204 KB Output is correct
18 Correct 3 ms 1612 KB Output is correct
19 Correct 2 ms 1484 KB Output is correct
20 Correct 5 ms 1740 KB Output is correct
21 Correct 3 ms 1228 KB Output is correct
22 Correct 4 ms 1484 KB Output is correct
23 Correct 4 ms 1612 KB Output is correct
24 Correct 6 ms 1996 KB Output is correct
25 Correct 5 ms 1740 KB Output is correct
26 Correct 5 ms 1740 KB Output is correct
27 Correct 3 ms 1616 KB Output is correct
28 Correct 9 ms 2764 KB Output is correct
29 Correct 26 ms 5708 KB Output is correct
30 Correct 7 ms 2500 KB Output is correct
31 Correct 13 ms 3660 KB Output is correct
32 Correct 9 ms 2892 KB Output is correct
33 Correct 59 ms 9924 KB Output is correct
34 Correct 57 ms 9896 KB Output is correct
35 Correct 69 ms 9044 KB Output is correct
36 Correct 9 ms 2508 KB Output is correct
37 Correct 182 ms 14588 KB Output is correct
38 Correct 136 ms 13524 KB Output is correct
39 Correct 122 ms 13636 KB Output is correct
40 Correct 120 ms 13556 KB Output is correct
41 Correct 117 ms 13572 KB Output is correct
42 Correct 9 ms 1996 KB Output is correct
43 Correct 7 ms 1996 KB Output is correct
44 Correct 13 ms 1996 KB Output is correct
45 Correct 650 ms 35960 KB Output is correct
46 Correct 509 ms 35904 KB Output is correct
47 Execution timed out 1046 ms 57320 KB Time limit exceeded
48 Halted 0 ms 0 KB -