oj.uz

Submission #722367

# Submission time Handle Problem Language Result Execution time Memory
722367 2023-04-11T20:43:16 Z n0sk1ll Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 229 ms 24608 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);
    
    if (n>=25000 && m>=25000) return cout<<0,0;

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 1 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 2 ms 2388 KB Output is correct
6 Correct 2 ms 2412 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 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 1 ms 2388 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 2388 KB Output is correct
11 Correct 4 ms 2516 KB Output is correct
12 Correct 2 ms 2388 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 2388 KB Output is correct
2 Correct 2 ms 2432 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 2400 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 1 ms 2388 KB Output is correct
8 Correct 1 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 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 2 ms 2644 KB Output is correct
18 Correct 16 ms 2388 KB Output is correct
19 Correct 18 ms 2480 KB Output is correct
20 Correct 51 ms 24540 KB Output is correct
21 Correct 7 ms 2388 KB Output is correct
22 Correct 18 ms 2488 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 2 ms 2532 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 3 ms 3156 KB Output is correct
29 Correct 2 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 2644 KB Output is correct
33 Correct 4 ms 3156 KB Output is correct
34 Correct 5 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 2 ms 2388 KB Output is correct
3 Correct 1 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 1 ms 2388 KB Output is correct
7 Correct 1 ms 2388 KB Output is correct
8 Correct 1 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 2388 KB Output is correct
14 Correct 2 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 2644 KB Output is correct
18 Correct 22 ms 2516 KB Output is correct
19 Correct 19 ms 2388 KB Output is correct
20 Correct 52 ms 24492 KB Output is correct
21 Correct 5 ms 2388 KB Output is correct
22 Correct 19 ms 2492 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 2 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 3 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 3 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 14 ms 4372 KB Output is correct
36 Correct 4 ms 2644 KB Output is correct
37 Correct 11 ms 4368 KB Output is correct
38 Correct 16 ms 4692 KB Output is correct
39 Correct 14 ms 3920 KB Output is correct
40 Correct 15 ms 4184 KB Output is correct
41 Correct 16 ms 4308 KB Output is correct
42 Correct 5 ms 2444 KB Output is correct
43 Correct 5 ms 2452 KB Output is correct
44 Correct 52 ms 24496 KB Output is correct
45 Correct 25 ms 6484 KB Output is correct
46 Correct 23 ms 6484 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 2388 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 1 ms 2388 KB Output is correct
8 Correct 1 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 3 ms 2516 KB Output is correct
12 Correct 1 ms 2388 KB Output is correct
13 Correct 2 ms 2388 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct
15 Correct 3 ms 2516 KB Output is correct
16 Correct 4 ms 2388 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 18 ms 2512 KB Output is correct
19 Correct 18 ms 2484 KB Output is correct
20 Correct 51 ms 24608 KB Output is correct
21 Correct 5 ms 2388 KB Output is correct
22 Correct 19 ms 2496 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 2 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 2644 KB Output is correct
28 Correct 4 ms 3096 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 2644 KB Output is correct
33 Correct 4 ms 3160 KB Output is correct
34 Correct 4 ms 3156 KB Output is correct
35 Correct 15 ms 4432 KB Output is correct
36 Correct 3 ms 2644 KB Output is correct
37 Correct 11 ms 4408 KB Output is correct
38 Correct 16 ms 4664 KB Output is correct
39 Correct 14 ms 3936 KB Output is correct
40 Correct 16 ms 4180 KB Output is correct
41 Correct 15 ms 4376 KB Output is correct
42 Correct 5 ms 2516 KB Output is correct
43 Correct 5 ms 2516 KB Output is correct
44 Correct 56 ms 24488 KB Output is correct
45 Correct 20 ms 6420 KB Output is correct
46 Correct 20 ms 6460 KB Output is correct
47 Correct 18 ms 6228 KB Output is correct
48 Correct 206 ms 3928 KB Output is correct
49 Correct 219 ms 3868 KB Output is correct
50 Correct 229 ms 3420 KB Output is correct
51 Incorrect 14 ms 4352 KB Output isn't correct
52 Halted 0 ms 0 KB -