Submission #482562

# Submission time Handle Problem Language Result Execution time Memory
482562 2021-10-25T15:44:20 Z beaconmc Jakarta Skyscrapers (APIO15_skyscraper) C++14
22 / 100
246 ms 224416 KB
#include <bits/stdc++.h>

typedef long long ll;
#define FOR(i, x, y) for(ll i=x; i<y; i++)

using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<ll, null_type,greater_equal<int>, rb_tree_tag,tree_order_statistics_node_update>

ll n,m;
ll a,b,baka,imposter,sus, countz,sussy;

vector<vector<ll> > edges[30001];
set <ll> stuff[30001];

ll dists[30001];

int main(){
    FOR(i, 0, 30001){
        dists[i] = 1000000000000;
    }
    cin >> n>>m;
    FOR(i, 0, m){
        cin >> a >> b;
        if(i==0) imposter = a;
        if (i==1) baka = a;
        stuff[a].insert(b);
    }
    FOR(k, 0, n){
        for(auto&i : stuff[k]){
            sus = k;
            sussy = i;
            countz = 0;
            while ((sus+sussy)<n){
                sus += sussy;
                countz++;
                edges[k].push_back({sus, countz});
            }
            sus = k;
            countz = 0;
            
            while ((sus-sussy)>0){
                sus -= sussy;
                countz++;
                edges[k].push_back({sus, countz});
            }
        }
    }
    ll src=imposter;
    
    priority_queue<vector<ll>,vector<vector<ll>>, greater<vector<ll>>> pq;
    dists[src] = 0;
    pq.push({0, src});

	while (pq.size()) {
        vector<ll> suz = pq.top();
        ll cdist, node;
        pq.pop();
        cdist = suz[0];node=suz[1];
		if (cdist != dists[node]) continue;

		for (auto& i : edges[node]) {
			if (cdist+i[1] < dists[i[0]]) {
				pq.push({dists[i[0]] = cdist+i[1], i[0]});
			}
		}
	}
    if (dists[baka] != 1000000000000){
        cout << dists[baka];
    }else{
        cout << -1;
    }
    
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 1 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2636 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 1 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 3 ms 3148 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 3 ms 3164 KB Output is correct
14 Correct 3 ms 3020 KB Output is correct
15 Correct 4 ms 3020 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 1 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 3 ms 3148 KB Output is correct
12 Correct 2 ms 2648 KB Output is correct
13 Correct 2 ms 3168 KB Output is correct
14 Correct 3 ms 3020 KB Output is correct
15 Correct 3 ms 3020 KB Output is correct
16 Correct 3 ms 2892 KB Output is correct
17 Correct 5 ms 4064 KB Output is correct
18 Correct 3 ms 3020 KB Output is correct
19 Correct 2 ms 2892 KB Output is correct
20 Correct 246 ms 224416 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 3 ms 2892 KB Output is correct
23 Correct 3 ms 2988 KB Output is correct
24 Correct 4 ms 3532 KB Output is correct
25 Correct 4 ms 3276 KB Output is correct
26 Correct 3 ms 3404 KB Output is correct
27 Correct 3 ms 3020 KB Output is correct
28 Incorrect 4 ms 4044 KB Output isn't correct
29 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 1 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 1 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 3 ms 3148 KB Output is correct
12 Correct 2 ms 2592 KB Output is correct
13 Correct 3 ms 3276 KB Output is correct
14 Correct 3 ms 3020 KB Output is correct
15 Correct 3 ms 3020 KB Output is correct
16 Correct 2 ms 2892 KB Output is correct
17 Correct 4 ms 4044 KB Output is correct
18 Correct 2 ms 3020 KB Output is correct
19 Correct 2 ms 2892 KB Output is correct
20 Correct 237 ms 224216 KB Output is correct
21 Correct 3 ms 2764 KB Output is correct
22 Correct 2 ms 2892 KB Output is correct
23 Correct 3 ms 3020 KB Output is correct
24 Correct 4 ms 3532 KB Output is correct
25 Correct 4 ms 3276 KB Output is correct
26 Correct 3 ms 3416 KB Output is correct
27 Correct 3 ms 3020 KB Output is correct
28 Incorrect 5 ms 4060 KB Output isn't correct
29 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2624 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 1 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 1 ms 2636 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 3 ms 3148 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 3 ms 3276 KB Output is correct
14 Correct 4 ms 3116 KB Output is correct
15 Correct 3 ms 3020 KB Output is correct
16 Correct 2 ms 2892 KB Output is correct
17 Correct 4 ms 4044 KB Output is correct
18 Correct 2 ms 2944 KB Output is correct
19 Correct 3 ms 2892 KB Output is correct
20 Correct 241 ms 224332 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 2 ms 2892 KB Output is correct
23 Correct 3 ms 3020 KB Output is correct
24 Correct 4 ms 3532 KB Output is correct
25 Correct 4 ms 3276 KB Output is correct
26 Correct 4 ms 3404 KB Output is correct
27 Correct 4 ms 3020 KB Output is correct
28 Incorrect 4 ms 4044 KB Output isn't correct
29 Halted 0 ms 0 KB -