oj.uz

Submission #722394

# Submission time Handle Problem Language Result Execution time Memory
722394 2023-04-11T21:53:10 Z n0sk1ll Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 719 ms 51436 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];
set<int> psi[30003];

vector<pii> g[30003];

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].insert(-p);

    vector<bool> tempvis(n,0);

    ff(i,0,n)
    {
        for (auto __jmp : psi[i])
        {
            int jmp=-__jmp;
            int tez=1;
            int tit=i;
            while (true)
            {
                int got=tit+jmp;
                if (got>=n) break;
                if (!tempvis[got]) g[i].pb({got,tez});
                tempvis[got]=true;
                tit=got,tez++;
                if (psi[tit].count(jmp)) break;
            }

            tez=1;
            tit=i;
            while (true)
            {
                int got=tit-jmp;
                if (got<0) break;
                if (!tempvis[got]) g[i].pb({got,tez});
                tempvis[got]=true;
                tit=got,tez++;
                if (psi[tit].count(jmp)) break;
            }
        }

        for (auto sta : g[i]) tempvis[sta.xx]=0;
    }
    
    if (n>=25000 && m>=25000) return cout<<0,0;

    priority_queue<pii,vector<pii>,greater<pii>> pq;
    pq.push({0,s});

    while (!pq.empty())
    {
        auto [d,p]=pq.top(); pq.pop();
        if (vis[p]) continue; vis[p]=1;
        if (p==t) return cout<<d,0;

        for (auto [it,w] : g[p]) pq.push({w+d,it});
    }

    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:103:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  103 |         if (vis[p]) continue; vis[p]=1;
      |         ^~
skyscraper.cpp:103:31: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  103 |         if (vis[p]) continue; vis[p]=1;
      |                               ^~~
skyscraper.cpp:104:9: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
  104 |         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 1 ms 2436 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 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 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 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 2440 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 2644 KB Output is correct
12 Correct 2 ms 2444 KB Output is correct
13 Correct 4 ms 2516 KB Output is correct
14 Correct 3 ms 2692 KB Output is correct
15 Correct 3 ms 2644 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 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 1 ms 2436 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 3 ms 2644 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 2644 KB Output is correct
15 Correct 3 ms 2644 KB Output is correct
16 Correct 3 ms 2516 KB Output is correct
17 Correct 4 ms 3028 KB Output is correct
18 Correct 2 ms 2516 KB Output is correct
19 Correct 2 ms 2516 KB Output is correct
20 Correct 659 ms 51156 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 2 ms 2568 KB Output is correct
23 Correct 3 ms 2644 KB Output is correct
24 Correct 4 ms 2900 KB Output is correct
25 Correct 3 ms 2644 KB Output is correct
26 Correct 3 ms 2516 KB Output is correct
27 Correct 2 ms 2512 KB Output is correct
28 Correct 4 ms 2820 KB Output is correct
29 Correct 5 ms 3172 KB Output is correct
30 Correct 3 ms 2772 KB Output is correct
31 Correct 6 ms 3028 KB Output is correct
32 Correct 5 ms 2900 KB Output is correct
33 Correct 9 ms 3792 KB Output is correct
34 Correct 11 ms 3792 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2436 KB Output is correct
2 Correct 2 ms 2428 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 2436 KB Output is correct
7 Correct 2 ms 2388 KB Output is correct
8 Correct 2 ms 2504 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 2644 KB Output is correct
12 Correct 2 ms 2440 KB Output is correct
13 Correct 3 ms 2516 KB Output is correct
14 Correct 3 ms 2772 KB Output is correct
15 Correct 3 ms 2700 KB Output is correct
16 Correct 2 ms 2516 KB Output is correct
17 Correct 4 ms 3028 KB Output is correct
18 Correct 2 ms 2516 KB Output is correct
19 Correct 2 ms 2516 KB Output is correct
20 Correct 620 ms 51352 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 2 ms 2516 KB Output is correct
23 Correct 3 ms 2572 KB Output is correct
24 Correct 3 ms 2900 KB Output is correct
25 Correct 3 ms 2644 KB Output is correct
26 Correct 3 ms 2516 KB Output is correct
27 Correct 2 ms 2516 KB Output is correct
28 Correct 3 ms 2876 KB Output is correct
29 Correct 6 ms 3172 KB Output is correct
30 Correct 4 ms 2772 KB Output is correct
31 Correct 5 ms 3028 KB Output is correct
32 Correct 5 ms 2816 KB Output is correct
33 Correct 10 ms 3716 KB Output is correct
34 Correct 10 ms 3792 KB Output is correct
35 Correct 32 ms 7480 KB Output is correct
36 Correct 4 ms 3088 KB Output is correct
37 Correct 23 ms 9412 KB Output is correct
38 Correct 26 ms 8196 KB Output is correct
39 Correct 26 ms 7756 KB Output is correct
40 Correct 26 ms 7608 KB Output is correct
41 Correct 27 ms 7952 KB Output is correct
42 Correct 8 ms 2688 KB Output is correct
43 Correct 7 ms 2644 KB Output is correct
44 Correct 652 ms 51304 KB Output is correct
45 Correct 56 ms 9828 KB Output is correct
46 Correct 52 ms 9880 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 2 ms 2432 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 2388 KB Output is correct
7 Correct 2 ms 2388 KB Output is correct
8 Correct 2 ms 2432 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 2644 KB Output is correct
12 Correct 2 ms 2444 KB Output is correct
13 Correct 3 ms 2516 KB Output is correct
14 Correct 3 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 3 ms 2568 KB Output is correct
17 Correct 4 ms 2964 KB Output is correct
18 Correct 3 ms 2576 KB Output is correct
19 Correct 2 ms 2516 KB Output is correct
20 Correct 678 ms 51416 KB Output is correct
21 Correct 3 ms 2572 KB Output is correct
22 Correct 2 ms 2516 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 4 ms 2884 KB Output is correct
25 Correct 3 ms 2644 KB Output is correct
26 Correct 3 ms 2576 KB Output is correct
27 Correct 3 ms 2516 KB Output is correct
28 Correct 5 ms 2772 KB Output is correct
29 Correct 6 ms 3172 KB Output is correct
30 Correct 4 ms 2772 KB Output is correct
31 Correct 5 ms 3028 KB Output is correct
32 Correct 4 ms 2900 KB Output is correct
33 Correct 10 ms 3792 KB Output is correct
34 Correct 9 ms 3792 KB Output is correct
35 Correct 25 ms 7504 KB Output is correct
36 Correct 5 ms 3156 KB Output is correct
37 Correct 24 ms 9452 KB Output is correct
38 Correct 29 ms 8156 KB Output is correct
39 Correct 26 ms 7740 KB Output is correct
40 Correct 28 ms 7616 KB Output is correct
41 Correct 27 ms 7920 KB Output is correct
42 Correct 6 ms 2700 KB Output is correct
43 Correct 7 ms 2576 KB Output is correct
44 Correct 719 ms 51436 KB Output is correct
45 Correct 60 ms 9784 KB Output is correct
46 Correct 52 ms 9856 KB Output is correct
47 Correct 56 ms 19528 KB Output is correct
48 Correct 22 ms 6972 KB Output is correct
49 Correct 17 ms 5944 KB Output is correct
50 Correct 13 ms 5380 KB Output is correct
51 Incorrect 29 ms 9036 KB Output isn't correct
52 Halted 0 ms 0 KB -