oj.uz

Submission #998868

# Submission time Handle Problem Language Result Execution time Memory
998868 2024-06-14T18:28:27 Z assanali Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 4696 KB 
/*

author: CRISTIANO RONALDO


#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
can do: find_by_order, order_of_key

__builtin_clz(x): the number of zeros at the beginning of the number
__builtin_ctz(x): the number of zeros at the end of the number
__builtin_popcount(x): the number of ones in the number
__builtin_parity(x): the parity (even or odd) of the number of ones

mt19937 rng(15);
mt19937 bruh(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rofl(chrono::steady_clock::now().time_since_epoch().count());
*/
#include <bits/stdc++.h>
#define ll long long
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define ull unsigned long long
#define ld long double
#define lv v+v
#define rv v+v+1
#define files freopen("aa.txt", "r", stdin), freopen("aa.txt", "w", stdout)
#define pll pair <long long, long long>
#define pii pair <int, int>
using namespace std;
long long mod = 1e9 + 7;
const ll N = 3e4 + 10;
const ll M = 2e3 + 10;
const ll P = 337ll;
const ld EPS = 1e-7;
const ll block = 325;
const ll inf = 2e18;
ll n,m,b[N],p[N], d[30010];
vector <ll> road[30010];
// v[j] - куда может прыгнуть собака j
// cost[j][u] - цена прыжка собаки j в точку u
// road[j] - Какие собаки живут в точке j
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin>>n>>m;
for(ll i = 0; i<m; i++) {
    cin>>b[i]>>p[i];
    d[i] = inf;
    road[b[i]].pb(i);
}
set <pll> q;
q.insert({0,0});
d[0] = 0;
ll ver, ttt, j;
while(!q.empty()) {
    ver = (*q.begin()).S;    ttt = (*q.begin()).F; q.erase(q.begin());
    if(ttt > d[ver]) {continue;}
    j = ver;
    for(ll i = 1; b[j] + i * p[j] < n; i += 1) {
        if(!road[b[j] + i * p[j]].empty()) {
            for(auto jj : road[b[j] + i * p[j]]) {
                if(d[jj] > d[ver] + i) {
                    q.erase({d[jj], jj});
                    d[jj] = d[ver] + i;
                    q.insert({d[jj], jj});
                }
            }
        }
    }
    for(ll i = 0; b[j] - i * p[j] >= 0; i += 1) {
        if(!road[b[j] - i * p[j]].empty()) {
            for(auto jj : road[b[j] - i * p[j]]) {
                if(d[jj] > d[ver] + i) {
                    q.erase({d[jj], jj});
                    d[jj] = d[ver] + i;
                    q.insert({d[jj], jj});
                }
            }
        }
    }
}
cout<<(d[1] == inf ? -1 : d[1]);
return 0;
}
// equal, min, max, 1, random, build
/*

*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 1 ms 1168 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1172 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 4 ms 1372 KB Output is correct
13 Correct 4 ms 1372 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 0 ms 1116 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 3 ms 1372 KB Output is correct
12 Correct 4 ms 1372 KB Output is correct
13 Correct 4 ms 1372 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 2 ms 1172 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 10 ms 1424 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 2 ms 1252 KB Output is correct
24 Correct 2 ms 1224 KB Output is correct
25 Correct 2 ms 1372 KB Output is correct
26 Correct 8 ms 1372 KB Output is correct
27 Correct 8 ms 1372 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 3 ms 1372 KB Output is correct
34 Correct 2 ms 1372 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 4 ms 1372 KB Output is correct
13 Correct 4 ms 1372 KB Output is correct
14 Correct 3 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 10 ms 1424 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 2 ms 1372 KB Output is correct
26 Correct 8 ms 1372 KB Output is correct
27 Correct 8 ms 1372 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 2 ms 1368 KB Output is correct
34 Correct 2 ms 1372 KB Output is correct
35 Correct 27 ms 3676 KB Output is correct
36 Correct 4 ms 1368 KB Output is correct
37 Correct 26 ms 3160 KB Output is correct
38 Correct 42 ms 4188 KB Output is correct
39 Correct 35 ms 4188 KB Output is correct
40 Correct 39 ms 4188 KB Output is correct
41 Correct 36 ms 4188 KB Output is correct
42 Correct 734 ms 4060 KB Output is correct
43 Correct 702 ms 4084 KB Output is correct
44 Correct 784 ms 4128 KB Output is correct
45 Correct 35 ms 4188 KB Output is correct
46 Correct 35 ms 4272 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 4 ms 1372 KB Output is correct
13 Correct 4 ms 1380 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 18 ms 1680 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 2 ms 1180 KB Output is correct
25 Correct 2 ms 1372 KB Output is correct
26 Correct 8 ms 1372 KB Output is correct
27 Correct 14 ms 1376 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1168 KB Output is correct
32 Correct 1 ms 1112 KB Output is correct
33 Correct 2 ms 1372 KB Output is correct
34 Correct 3 ms 1372 KB Output is correct
35 Correct 26 ms 3860 KB Output is correct
36 Correct 4 ms 1372 KB Output is correct
37 Correct 24 ms 3220 KB Output is correct
38 Correct 39 ms 4368 KB Output is correct
39 Correct 34 ms 4184 KB Output is correct
40 Correct 40 ms 4188 KB Output is correct
41 Correct 38 ms 4188 KB Output is correct
42 Correct 702 ms 4132 KB Output is correct
43 Correct 694 ms 4016 KB Output is correct
44 Correct 845 ms 4100 KB Output is correct
45 Correct 35 ms 4188 KB Output is correct
46 Correct 33 ms 4188 KB Output is correct
47 Correct 49 ms 3676 KB Output is correct
48 Correct 7 ms 2396 KB Output is correct
49 Correct 4 ms 2140 KB Output is correct
50 Correct 4 ms 1880 KB Output is correct
51 Correct 54 ms 4696 KB Output is correct
52 Correct 44 ms 4184 KB Output is correct
53 Correct 15 ms 4436 KB Output is correct
54 Correct 1 ms 1116 KB Output is correct
55 Correct 1 ms 1116 KB Output is correct
56 Execution timed out 1095 ms 4688 KB Time limit exceeded
57 Halted 0 ms 0 KB -