oj.uz

Submission #722355

# Submission time Handle Problem Language Result Execution time Memory
722355 2023-04-11T20:29:43 Z n0sk1ll Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 645 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) swap(dat[i],dat[i+sf]);
            ff(i,0,sf) vector<int>().swap(dat[i+sf]);
            ff(i,0,2*sf) dat[i].shrink_to_fit();
            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:73:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   73 |             if (vis[p]) continue; vis[p]=1;
      |             ^~
skyscraper.cpp:73:35: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   73 |             if (vis[p]) continue; vis[p]=1;
      |                                   ^~~
skyscraper.cpp:74:13: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   74 |             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 1 ms 2388 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 2 ms 2432 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 2 ms 2388 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2436 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 2 ms 2404 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 2 ms 2400 KB Output is correct
6 Correct 1 ms 2388 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 2388 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 2448 KB Output is correct
13 Correct 2 ms 2388 KB Output is correct
14 Correct 2 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 2436 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 2 ms 2432 KB Output is correct
4 Correct 2 ms 2516 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 2516 KB Output is correct
8 Correct 2 ms 2388 KB Output is correct
9 Correct 1 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 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 3 ms 2572 KB Output is correct
16 Correct 3 ms 2388 KB Output is correct
17 Correct 4 ms 2644 KB Output is correct
18 Correct 19 ms 2516 KB Output is correct
19 Correct 18 ms 2484 KB Output is correct
20 Correct 49 ms 24580 KB Output is correct
21 Correct 5 ms 2504 KB Output is correct
22 Correct 16 ms 2492 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 3 ms 2576 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 2516 KB Output is correct
28 Correct 4 ms 3156 KB Output is correct
29 Correct 3 ms 2772 KB Output is correct
30 Correct 2 ms 2516 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2564 KB Output is correct
33 Correct 4 ms 3156 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 2 ms 2388 KB Output is correct
2 Correct 1 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 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 2388 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 2444 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 2572 KB Output is correct
16 Correct 4 ms 2388 KB Output is correct
17 Correct 3 ms 2576 KB Output is correct
18 Correct 16 ms 2516 KB Output is correct
19 Correct 20 ms 2488 KB Output is correct
20 Correct 50 ms 24552 KB Output is correct
21 Correct 5 ms 2516 KB Output is correct
22 Correct 16 ms 2484 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 2516 KB Output is correct
28 Correct 3 ms 3156 KB Output is correct
29 Correct 3 ms 2796 KB Output is correct
30 Correct 2 ms 2516 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 3156 KB Output is correct
34 Correct 4 ms 3156 KB Output is correct
35 Correct 15 ms 4572 KB Output is correct
36 Correct 4 ms 2808 KB Output is correct
37 Correct 12 ms 4564 KB Output is correct
38 Correct 17 ms 4840 KB Output is correct
39 Correct 15 ms 4256 KB Output is correct
40 Correct 16 ms 4436 KB Output is correct
41 Correct 17 ms 4584 KB Output is correct
42 Correct 6 ms 2644 KB Output is correct
43 Correct 6 ms 2728 KB Output is correct
44 Correct 53 ms 24700 KB Output is correct
45 Correct 20 ms 6672 KB Output is correct
46 Correct 21 ms 6680 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2432 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 2 ms 2388 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 1 ms 2388 KB Output is correct
6 Correct 2 ms 2432 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 2432 KB Output is correct
11 Correct 3 ms 2544 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 2 ms 2444 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct
15 Correct 2 ms 2516 KB Output is correct
16 Correct 4 ms 2388 KB Output is correct
17 Correct 3 ms 2576 KB Output is correct
18 Correct 16 ms 2524 KB Output is correct
19 Correct 18 ms 2388 KB Output is correct
20 Correct 50 ms 24568 KB Output is correct
21 Correct 5 ms 2440 KB Output is correct
22 Correct 17 ms 2504 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 2516 KB Output is correct
28 Correct 3 ms 3088 KB Output is correct
29 Correct 3 ms 2824 KB Output is correct
30 Correct 2 ms 2516 KB Output is correct
31 Correct 2 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 3124 KB Output is correct
35 Correct 16 ms 4692 KB Output is correct
36 Correct 4 ms 2700 KB Output is correct
37 Correct 12 ms 4692 KB Output is correct
38 Correct 18 ms 4880 KB Output is correct
39 Correct 15 ms 4180 KB Output is correct
40 Correct 16 ms 4412 KB Output is correct
41 Correct 16 ms 4648 KB Output is correct
42 Correct 5 ms 2644 KB Output is correct
43 Correct 6 ms 2644 KB Output is correct
44 Correct 52 ms 24692 KB Output is correct
45 Correct 21 ms 6608 KB Output is correct
46 Correct 18 ms 6628 KB Output is correct
47 Correct 20 ms 6532 KB Output is correct
48 Correct 203 ms 4184 KB Output is correct
49 Correct 220 ms 4100 KB Output is correct
50 Correct 231 ms 3648 KB Output is correct
51 Correct 22 ms 6348 KB Output is correct
52 Correct 24 ms 6712 KB Output is correct
53 Correct 16 ms 4948 KB Output is correct
54 Correct 242 ms 2912 KB Output is correct
55 Correct 247 ms 3156 KB Output is correct
56 Runtime error 645 ms 262144 KB Execution killed with signal 9
57 Halted 0 ms 0 KB -