oj.uz

Submission #387965

# Submission time Handle Problem Language Result Execution time Memory
387965 2021-04-09T15:22:47 Z cpp219 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 58140 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,mem;
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++;
        LL now = {a[i].pos,a[i].p};
        mp[now] = 1;
    }
    for (ll i = 1;i <= m;i++){
        LL now = {a[i].pos,a[i].p};
        if (mem[now]) continue; mem[now] = 1;
        ll cost = 1;
        for (ll j = now.fs + a[i].p;j <= n;j += a[i].p){
            g[now.fs].push_back({j,cost}),cost++;
            if (mp[{j,now.sc}]) break;
        }
        cost = 1;
        for (ll j = now.fs - a[i].p;j > 0;j -= a[i].p){
            g[now.fs].push_back({j,cost}),cost++;
            if (mp[{j,now.sc}]) break;
        }
    }
    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:57:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   57 |         if (mem[now]) continue; mem[now] = 1;
      |         ^~
skyscraper.cpp:57:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   57 |         if (mem[now]) continue; mem[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 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 4 ms 1612 KB Output is correct
15 Correct 4 ms 1712 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 1036 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 2 ms 1152 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 2 ms 1204 KB Output is correct
11 Correct 4 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 5 ms 1612 KB Output is correct
15 Correct 4 ms 1612 KB Output is correct
16 Correct 2 ms 1484 KB Output is correct
17 Correct 8 ms 2336 KB Output is correct
18 Correct 3 ms 1612 KB Output is correct
19 Correct 2 ms 1484 KB Output is correct
20 Correct 3 ms 1356 KB Output is correct
21 Correct 2 ms 1356 KB Output is correct
22 Correct 3 ms 1484 KB Output is correct
23 Correct 4 ms 1612 KB Output is correct
24 Correct 8 ms 2124 KB Output is correct
25 Correct 5 ms 1872 KB Output is correct
26 Correct 4 ms 1740 KB Output is correct
27 Correct 4 ms 1612 KB Output is correct
28 Correct 11 ms 2892 KB Output is correct
29 Correct 25 ms 5836 KB Output is correct
30 Correct 7 ms 2492 KB Output is correct
31 Correct 13 ms 3660 KB Output is correct
32 Correct 9 ms 2892 KB Output is correct
33 Correct 64 ms 10112 KB Output is correct
34 Correct 56 ms 10072 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 5 ms 1612 KB Output is correct
15 Correct 4 ms 1612 KB Output is correct
16 Correct 2 ms 1356 KB Output is correct
17 Correct 7 ms 2380 KB Output is correct
18 Correct 4 ms 1612 KB Output is correct
19 Correct 3 ms 1484 KB Output is correct
20 Correct 3 ms 1484 KB Output is correct
21 Correct 2 ms 1356 KB Output is correct
22 Correct 3 ms 1612 KB Output is correct
23 Correct 4 ms 1612 KB Output is correct
24 Correct 7 ms 2304 KB Output is correct
25 Correct 5 ms 1868 KB Output is correct
26 Correct 5 ms 1732 KB Output is correct
27 Correct 3 ms 1612 KB Output is correct
28 Correct 9 ms 2892 KB Output is correct
29 Correct 27 ms 5720 KB Output is correct
30 Correct 7 ms 2508 KB Output is correct
31 Correct 13 ms 3660 KB Output is correct
32 Correct 10 ms 2892 KB Output is correct
33 Correct 64 ms 10084 KB Output is correct
34 Correct 56 ms 10136 KB Output is correct
35 Correct 78 ms 10476 KB Output is correct
36 Correct 10 ms 2816 KB Output is correct
37 Correct 143 ms 15412 KB Output is correct
38 Correct 174 ms 15144 KB Output is correct
39 Correct 188 ms 15172 KB Output is correct
40 Correct 148 ms 15132 KB Output is correct
41 Correct 142 ms 15172 KB Output is correct
42 Correct 10 ms 1996 KB Output is correct
43 Correct 10 ms 1972 KB Output is correct
44 Correct 8 ms 1740 KB Output is correct
45 Correct 586 ms 37928 KB Output is correct
46 Correct 558 ms 37892 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 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 4 ms 1612 KB Output is correct
15 Correct 4 ms 1612 KB Output is correct
16 Correct 3 ms 1484 KB Output is correct
17 Correct 7 ms 2380 KB Output is correct
18 Correct 3 ms 1612 KB Output is correct
19 Correct 3 ms 1484 KB Output is correct
20 Correct 3 ms 1356 KB Output is correct
21 Correct 2 ms 1356 KB Output is correct
22 Correct 3 ms 1612 KB Output is correct
23 Correct 4 ms 1612 KB Output is correct
24 Correct 7 ms 2160 KB Output is correct
25 Correct 5 ms 1868 KB Output is correct
26 Correct 4 ms 1744 KB Output is correct
27 Correct 4 ms 1612 KB Output is correct
28 Correct 13 ms 2944 KB Output is correct
29 Correct 26 ms 5700 KB Output is correct
30 Correct 7 ms 2508 KB Output is correct
31 Correct 15 ms 3660 KB Output is correct
32 Correct 12 ms 2892 KB Output is correct
33 Correct 76 ms 10096 KB Output is correct
34 Correct 62 ms 10132 KB Output is correct
35 Correct 93 ms 10508 KB Output is correct
36 Correct 14 ms 2760 KB Output is correct
37 Correct 186 ms 15328 KB Output is correct
38 Correct 190 ms 15172 KB Output is correct
39 Correct 184 ms 15268 KB Output is correct
40 Correct 232 ms 15100 KB Output is correct
41 Correct 215 ms 15236 KB Output is correct
42 Correct 9 ms 1996 KB Output is correct
43 Correct 8 ms 1996 KB Output is correct
44 Correct 8 ms 1788 KB Output is correct
45 Correct 619 ms 37704 KB Output is correct
46 Correct 664 ms 37740 KB Output is correct
47 Execution timed out 1082 ms 58140 KB Time limit exceeded
48 Halted 0 ms 0 KB -