oj.uz

Submission #722346

# Submission time Handle Problem Language Result Execution time Memory
722346 2023-04-11T19:17:46 Z n0sk1ll Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 670 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

bool vis[30003];
vector<int> psi[30003];

int km=0; const int sf=30'003;
vector<int> dat[2*sf+15];

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) psi[b].pb(p);

    dat[0].pb(s);
    fff(d,0,n*1000)
    {
        if (d-km*sf>=sf)
        {
            ff(i,0,sf) dat[i]=dat[i+sf];
            ff(i,0,sf) dat[i+sf].clear();
            km++;
        }
        for (auto p : dat[d-km*sf])
        {
            if (vis[p]) continue; vis[p]=1;
            if (p==t) return cout<<d,0;
            for (auto jmp : psi[p])
            {
                for (int j=1;;j++)
                {
                    if (p+j*jmp>=n) break;
                    dat[d+j-km*sf].pb(p+j*jmp);
                }
                for (int j=1;;j++)
                {
                    if (p-j*jmp<0) break;
                    dat[d+j-km*sf].pb(p-j*jmp);
                }
            }
        }
        dat[d-km*sf].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:72:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   72 |             if (vis[p]) continue; vis[p]=1;
      |             ^~
skyscraper.cpp:72:35: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   72 |             if (vis[p]) continue; vis[p]=1;
      |                                   ^~~
skyscraper.cpp:73:13: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   73 |             if (p==t) return cout<<d,0;
      |             ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 2 ms 2388 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 3 ms 2440 KB Output is correct
6 Correct 3 ms 2432 KB Output is correct
7 Correct 2 ms 2388 KB Output is correct
8 Correct 2 ms 2388 KB Output is correct
9 Correct 2 ms 2432 KB Output is correct
10 Correct 2 ms 2388 KB Output is correct
11 Correct 3 ms 2516 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 3 ms 2516 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct
15 Correct 2 ms 2516 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 2 ms 2388 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 2 ms 2388 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 2 ms 2388 KB Output is correct
8 Correct 2 ms 2436 KB Output is correct
9 Correct 2 ms 2388 KB Output is correct
10 Correct 2 ms 2388 KB Output is correct
11 Correct 2 ms 2516 KB Output is correct
12 Correct 2 ms 2516 KB Output is correct
13 Correct 2 ms 2516 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct
15 Correct 2 ms 2516 KB Output is correct
16 Correct 3 ms 2388 KB Output is correct
17 Correct 3 ms 2644 KB Output is correct
18 Correct 12 ms 2516 KB Output is correct
19 Correct 15 ms 2388 KB Output is correct
20 Correct 49 ms 24512 KB Output is correct
21 Correct 4 ms 2516 KB Output is correct
22 Correct 13 ms 2436 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 3 ms 2644 KB Output is correct
25 Correct 3 ms 2516 KB Output is correct
26 Correct 2 ms 2516 KB Output is correct
27 Correct 2 ms 2516 KB Output is correct
28 Correct 4 ms 3156 KB Output is correct
29 Correct 3 ms 2820 KB Output is correct
30 Correct 2 ms 2560 KB Output is correct
31 Correct 3 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 4 ms 3216 KB Output is correct
34 Correct 4 ms 3156 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 2 ms 2388 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 2 ms 2440 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 1 ms 2388 KB Output is correct
8 Correct 2 ms 2388 KB Output is correct
9 Correct 2 ms 2388 KB Output is correct
10 Correct 2 ms 2436 KB Output is correct
11 Correct 2 ms 2516 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 2 ms 2516 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct
15 Correct 2 ms 2516 KB Output is correct
16 Correct 3 ms 2388 KB Output is correct
17 Correct 3 ms 2576 KB Output is correct
18 Correct 12 ms 2440 KB Output is correct
19 Correct 13 ms 2388 KB Output is correct
20 Correct 51 ms 24536 KB Output is correct
21 Correct 5 ms 2516 KB Output is correct
22 Correct 12 ms 2440 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 3 ms 2644 KB Output is correct
25 Correct 2 ms 2516 KB Output is correct
26 Correct 2 ms 2516 KB Output is correct
27 Correct 2 ms 2576 KB Output is correct
28 Correct 4 ms 3216 KB Output is correct
29 Correct 3 ms 2828 KB Output is correct
30 Correct 3 ms 2516 KB Output is correct
31 Correct 3 ms 2644 KB Output is correct
32 Correct 3 ms 2644 KB Output is correct
33 Correct 4 ms 3156 KB Output is correct
34 Correct 4 ms 3212 KB Output is correct
35 Correct 15 ms 4692 KB Output is correct
36 Correct 4 ms 2772 KB Output is correct
37 Correct 12 ms 4624 KB Output is correct
38 Correct 17 ms 4888 KB Output is correct
39 Correct 15 ms 4356 KB Output is correct
40 Correct 16 ms 4436 KB Output is correct
41 Correct 16 ms 4568 KB Output is correct
42 Correct 7 ms 2704 KB Output is correct
43 Correct 6 ms 2772 KB Output is correct
44 Correct 54 ms 24740 KB Output is correct
45 Correct 19 ms 6676 KB Output is correct
46 Correct 20 ms 6612 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 1 ms 2388 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 1 ms 2388 KB Output is correct
6 Correct 2 ms 2436 KB Output is correct
7 Correct 2 ms 2436 KB Output is correct
8 Correct 2 ms 2388 KB Output is correct
9 Correct 2 ms 2440 KB Output is correct
10 Correct 2 ms 2388 KB Output is correct
11 Correct 2 ms 2516 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 2 ms 2516 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct
15 Correct 3 ms 2516 KB Output is correct
16 Correct 3 ms 2388 KB Output is correct
17 Correct 3 ms 2644 KB Output is correct
18 Correct 13 ms 2516 KB Output is correct
19 Correct 13 ms 2388 KB Output is correct
20 Correct 50 ms 24580 KB Output is correct
21 Correct 4 ms 2516 KB Output is correct
22 Correct 12 ms 2388 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 3 ms 2644 KB Output is correct
25 Correct 3 ms 2580 KB Output is correct
26 Correct 2 ms 2448 KB Output is correct
27 Correct 2 ms 2576 KB Output is correct
28 Correct 4 ms 3156 KB Output is correct
29 Correct 3 ms 2900 KB Output is correct
30 Correct 2 ms 2568 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 4 ms 3156 KB Output is correct
34 Correct 4 ms 3156 KB Output is correct
35 Correct 16 ms 4628 KB Output is correct
36 Correct 4 ms 2772 KB Output is correct
37 Correct 13 ms 4580 KB Output is correct
38 Correct 19 ms 4948 KB Output is correct
39 Correct 15 ms 4240 KB Output is correct
40 Correct 15 ms 4396 KB Output is correct
41 Correct 16 ms 4624 KB Output is correct
42 Correct 5 ms 2648 KB Output is correct
43 Correct 7 ms 2704 KB Output is correct
44 Correct 54 ms 24712 KB Output is correct
45 Correct 20 ms 6604 KB Output is correct
46 Correct 19 ms 6740 KB Output is correct
47 Correct 19 ms 6420 KB Output is correct
48 Correct 148 ms 4168 KB Output is correct
49 Correct 158 ms 4128 KB Output is correct
50 Correct 171 ms 3640 KB Output is correct
51 Correct 22 ms 6364 KB Output is correct
52 Correct 25 ms 6740 KB Output is correct
53 Correct 18 ms 5256 KB Output is correct
54 Correct 183 ms 2900 KB Output is correct
55 Correct 181 ms 3156 KB Output is correct
56 Runtime error 670 ms 262144 KB Execution killed with signal 9
57 Halted 0 ms 0 KB -