oj.uz

Submission #721616

# Submission time Handle Problem Language Result Execution time Memory
721616 2023-04-11T05:37:49 Z n0sk1ll Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 282 ms 262144 KB 
#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
//const int mod = 1000000007;







//Note to self: Check for overflow

vector<pii> g[30003];
bool vis[30003];

vector<int> dat[5200006];

int main()
{
    FAST;

    int n,m; cin>>n>>m;
    set<pii> doges;

    int s,t;
    ff(i,0,m)
    {
        int b,p; cin>>b>>p;
        doges.insert({b,p});
        if (i==0) s=b;
        if (i==1) t=b;
    }

    for (auto [b,p] : doges)
    {
        for (int i=1;;i++)
        {
            if (b+i*p>=n) break;
            g[b].pb({b+i*p,i});
        }
        for (int i=1;;i++)
        {
            if (b-i*p<0) break;
            g[b].pb({b-i*p,i});
        }
    }

    dat[0].pb(s);
    fff(d,0,5'000'000)
    {
        for (auto p : dat[d])
        {
            if (vis[p]) continue; vis[p]=1;
            if (p==t) return cout<<d,0;
            for (auto it : g[p]) dat[d+it.yy].pb(it.xx);
        }
        dat[d].clear();
    }

    cout<<-1;
}

//Note to self: Check for overflow

/*

5 3
0 2
1 1
4 1

*/

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:58:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   58 |     for (auto [b,p] : doges)
      |               ^
skyscraper.cpp:77:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   77 |             if (vis[p]) continue; vis[p]=1;
      |             ^~
skyscraper.cpp:77:35: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   77 |             if (vis[p]) continue; vis[p]=1;
      |                                   ^~~
skyscraper.cpp:78:13: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   78 |             if (p==t) return cout<<d,0;
      |             ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 123124 KB Output is correct
2 Correct 57 ms 123084 KB Output is correct
3 Correct 58 ms 123084 KB Output is correct
4 Correct 72 ms 123124 KB Output is correct
5 Correct 60 ms 123120 KB Output is correct
6 Correct 66 ms 123124 KB Output is correct
7 Correct 60 ms 123104 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 123076 KB Output is correct
2 Correct 72 ms 123088 KB Output is correct
3 Correct 61 ms 123020 KB Output is correct
4 Correct 78 ms 123000 KB Output is correct
5 Correct 63 ms 123084 KB Output is correct
6 Correct 58 ms 123104 KB Output is correct
7 Correct 64 ms 123004 KB Output is correct
8 Correct 61 ms 123128 KB Output is correct
9 Correct 65 ms 123012 KB Output is correct
10 Correct 71 ms 123164 KB Output is correct
11 Correct 70 ms 123320 KB Output is correct
12 Correct 73 ms 123212 KB Output is correct
13 Correct 72 ms 123308 KB Output is correct
14 Correct 61 ms 123284 KB Output is correct
15 Correct 66 ms 123204 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 123064 KB Output is correct
2 Correct 64 ms 123084 KB Output is correct
3 Correct 61 ms 123120 KB Output is correct
4 Correct 71 ms 123032 KB Output is correct
5 Correct 57 ms 123028 KB Output is correct
6 Correct 64 ms 123032 KB Output is correct
7 Correct 59 ms 123012 KB Output is correct
8 Correct 66 ms 123084 KB Output is correct
9 Correct 59 ms 123128 KB Output is correct
10 Correct 59 ms 123168 KB Output is correct
11 Correct 64 ms 123200 KB Output is correct
12 Correct 57 ms 123076 KB Output is correct
13 Correct 60 ms 123228 KB Output is correct
14 Correct 59 ms 123260 KB Output is correct
15 Correct 58 ms 123256 KB Output is correct
16 Correct 74 ms 123136 KB Output is correct
17 Correct 59 ms 123516 KB Output is correct
18 Correct 73 ms 123212 KB Output is correct
19 Correct 74 ms 123148 KB Output is correct
20 Correct 165 ms 177380 KB Output is correct
21 Correct 75 ms 123124 KB Output is correct
22 Correct 74 ms 123124 KB Output is correct
23 Correct 58 ms 123272 KB Output is correct
24 Correct 58 ms 123444 KB Output is correct
25 Correct 60 ms 123360 KB Output is correct
26 Correct 58 ms 123260 KB Output is correct
27 Correct 61 ms 123428 KB Output is correct
28 Correct 61 ms 124008 KB Output is correct
29 Correct 60 ms 124080 KB Output is correct
30 Correct 58 ms 123512 KB Output is correct
31 Correct 59 ms 123676 KB Output is correct
32 Correct 59 ms 123476 KB Output is correct
33 Correct 60 ms 124984 KB Output is correct
34 Correct 61 ms 124980 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 123044 KB Output is correct
2 Correct 58 ms 123016 KB Output is correct
3 Correct 57 ms 123116 KB Output is correct
4 Correct 81 ms 123220 KB Output is correct
5 Correct 58 ms 123084 KB Output is correct
6 Correct 59 ms 123212 KB Output is correct
7 Correct 66 ms 123060 KB Output is correct
8 Correct 60 ms 123024 KB Output is correct
9 Correct 57 ms 123084 KB Output is correct
10 Correct 59 ms 123136 KB Output is correct
11 Correct 60 ms 123256 KB Output is correct
12 Correct 59 ms 123080 KB Output is correct
13 Correct 58 ms 123200 KB Output is correct
14 Correct 60 ms 123216 KB Output is correct
15 Correct 60 ms 123276 KB Output is correct
16 Correct 73 ms 123312 KB Output is correct
17 Correct 72 ms 123488 KB Output is correct
18 Correct 75 ms 123232 KB Output is correct
19 Correct 74 ms 123268 KB Output is correct
20 Correct 151 ms 177256 KB Output is correct
21 Correct 75 ms 123204 KB Output is correct
22 Correct 72 ms 123224 KB Output is correct
23 Correct 61 ms 123248 KB Output is correct
24 Correct 58 ms 123432 KB Output is correct
25 Correct 60 ms 123268 KB Output is correct
26 Correct 59 ms 123260 KB Output is correct
27 Correct 62 ms 123208 KB Output is correct
28 Correct 59 ms 124036 KB Output is correct
29 Correct 59 ms 124144 KB Output is correct
30 Correct 58 ms 123464 KB Output is correct
31 Correct 61 ms 123652 KB Output is correct
32 Correct 59 ms 123556 KB Output is correct
33 Correct 61 ms 124964 KB Output is correct
34 Correct 63 ms 124868 KB Output is correct
35 Correct 93 ms 126640 KB Output is correct
36 Correct 62 ms 123596 KB Output is correct
37 Correct 72 ms 128180 KB Output is correct
38 Correct 85 ms 127804 KB Output is correct
39 Correct 79 ms 127352 KB Output is correct
40 Correct 80 ms 127376 KB Output is correct
41 Correct 84 ms 127380 KB Output is correct
42 Correct 74 ms 123504 KB Output is correct
43 Correct 63 ms 123520 KB Output is correct
44 Correct 165 ms 177452 KB Output is correct
45 Correct 80 ms 131308 KB Output is correct
46 Correct 88 ms 131340 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 123036 KB Output is correct
2 Correct 58 ms 123124 KB Output is correct
3 Correct 65 ms 123108 KB Output is correct
4 Correct 72 ms 123004 KB Output is correct
5 Correct 57 ms 123100 KB Output is correct
6 Correct 58 ms 123048 KB Output is correct
7 Correct 60 ms 123120 KB Output is correct
8 Correct 56 ms 123088 KB Output is correct
9 Correct 58 ms 123028 KB Output is correct
10 Correct 58 ms 123100 KB Output is correct
11 Correct 59 ms 123268 KB Output is correct
12 Correct 59 ms 123084 KB Output is correct
13 Correct 60 ms 123260 KB Output is correct
14 Correct 60 ms 123212 KB Output is correct
15 Correct 60 ms 123388 KB Output is correct
16 Correct 73 ms 123232 KB Output is correct
17 Correct 59 ms 123552 KB Output is correct
18 Correct 72 ms 123260 KB Output is correct
19 Correct 75 ms 123184 KB Output is correct
20 Correct 154 ms 177296 KB Output is correct
21 Correct 73 ms 123208 KB Output is correct
22 Correct 73 ms 123136 KB Output is correct
23 Correct 62 ms 123344 KB Output is correct
24 Correct 59 ms 123352 KB Output is correct
25 Correct 63 ms 123352 KB Output is correct
26 Correct 59 ms 123332 KB Output is correct
27 Correct 61 ms 123292 KB Output is correct
28 Correct 59 ms 124060 KB Output is correct
29 Correct 60 ms 124152 KB Output is correct
30 Correct 58 ms 123468 KB Output is correct
31 Correct 61 ms 123760 KB Output is correct
32 Correct 59 ms 123508 KB Output is correct
33 Correct 61 ms 124868 KB Output is correct
34 Correct 62 ms 124876 KB Output is correct
35 Correct 83 ms 126664 KB Output is correct
36 Correct 60 ms 123484 KB Output is correct
37 Correct 78 ms 128064 KB Output is correct
38 Correct 75 ms 127780 KB Output is correct
39 Correct 73 ms 127308 KB Output is correct
40 Correct 75 ms 127308 KB Output is correct
41 Correct 74 ms 127436 KB Output is correct
42 Correct 61 ms 123512 KB Output is correct
43 Correct 67 ms 123608 KB Output is correct
44 Correct 156 ms 177448 KB Output is correct
45 Correct 82 ms 131240 KB Output is correct
46 Correct 78 ms 131244 KB Output is correct
47 Correct 92 ms 137524 KB Output is correct
48 Correct 87 ms 126736 KB Output is correct
49 Correct 83 ms 125856 KB Output is correct
50 Correct 82 ms 125384 KB Output is correct
51 Correct 84 ms 130088 KB Output is correct
52 Correct 87 ms 131040 KB Output is correct
53 Correct 73 ms 126040 KB Output is correct
54 Correct 71 ms 123836 KB Output is correct
55 Correct 74 ms 124616 KB Output is correct
56 Runtime error 282 ms 262144 KB Execution killed with signal 9
57 Halted 0 ms 0 KB -