oj.uz

Submission #338297

# Submission time Handle Problem Language Result Execution time Memory
338297 2020-12-22T21:32:46 Z bigDuck Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 136 ms 14236 KB 
#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount




int t, n, m, k, b[100010], p[100010];
int crd[100010];


int d[100010];
bool v[100010];
vector<pii> g[100010];
bool dog[100010];



void dijkstra(){
multiset<pii> ms;
ms.insert({d[crd[1] ], crd[1]});

while(!ms.empty()){
    auto f=*ms.begin(); ms.erase(ms.begin());
    int nod=f.sc;
    v[nod]=true;
    //cout<<nod<<"y\n";
    if(nod==crd[2]){return;}

    for(auto pr:g[nod]){
        int u=pr.ft, c=pr.sc;
        if(v[u]){continue;}
        //cout<<u<<" "<<c<<"x\n";
        auto it=ms.find({d[u], u});
        if(it!=ms.end()){
            ms.erase(it);
            d[u]=min(d[u], d[nod]+c);
            ms.insert({d[u], u});
        }
        else{
                d[u]=d[nod]+c;
            ms.insert({d[u], u} );
        }
    }


}

return;
}




map<pii, int> up, down;




void add_chain(int b, int p){

int lim=down[{b%p, p}];
for(int i=b-p; (i>=1) && (i>=lim) ; i-=p){
    if(dog[i]){g[b].pb({i, abs(i-b)/p });}
}
down[{b%p, p}]=max(lim, b);


if(up[{b%p, p}]==0){ up[{b%p, p }]=n+1; }
lim=up[{b%p, p}];
for(int i=b+p; (i<=n) && (lim>=i); i+=p){
    if(dog[i]){g[b].pb({i, abs(i-b)/p });}
}
up[{b%p, p} ]=min( lim, b);

}





int32_t main(){
INIT
cin>>n>>m;

for(int i=1; i<=n; i++){d[i]=-1; }

for(int i=1; i<=m; i++){
cin>>b[i]>>p[i]; b[i]++;
crd[i ]=b[i];
dog[b[i] ]=true;
}

for(int i=1; i<=m; i++){
    add_chain(b[i], p[i]);
}





d[crd[1] ]=0;
dijkstra();
cout<<d[crd[2] ];

/*for(int i=1; i<=n; i++){
    for(auto u:g[i]){
        cout<<u.ft<<" ";
    }
    cout<<"\n";
}*/



return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2688 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 3 ms 2796 KB Output is correct
11 Correct 4 ms 3072 KB Output is correct
12 Correct 2 ms 2796 KB Output is correct
13 Correct 2 ms 2796 KB Output is correct
14 Correct 4 ms 3052 KB Output is correct
15 Correct 5 ms 3052 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 3 ms 2796 KB Output is correct
11 Correct 4 ms 2924 KB Output is correct
12 Correct 2 ms 2796 KB Output is correct
13 Correct 2 ms 2796 KB Output is correct
14 Correct 4 ms 3052 KB Output is correct
15 Correct 6 ms 3052 KB Output is correct
16 Correct 3 ms 2924 KB Output is correct
17 Correct 6 ms 3180 KB Output is correct
18 Correct 3 ms 2924 KB Output is correct
19 Correct 3 ms 2796 KB Output is correct
20 Correct 3 ms 2924 KB Output is correct
21 Correct 3 ms 3052 KB Output is correct
22 Correct 3 ms 2924 KB Output is correct
23 Correct 3 ms 2924 KB Output is correct
24 Correct 6 ms 3180 KB Output is correct
25 Correct 5 ms 3180 KB Output is correct
26 Correct 3 ms 2796 KB Output is correct
27 Correct 3 ms 2796 KB Output is correct
28 Correct 5 ms 3308 KB Output is correct
29 Correct 3 ms 2796 KB Output is correct
30 Correct 2 ms 2816 KB Output is correct
31 Correct 3 ms 2796 KB Output is correct
32 Correct 3 ms 2796 KB Output is correct
33 Correct 5 ms 3052 KB Output is correct
34 Correct 5 ms 3052 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 3 ms 2796 KB Output is correct
11 Correct 4 ms 2924 KB Output is correct
12 Correct 2 ms 2796 KB Output is correct
13 Correct 2 ms 2796 KB Output is correct
14 Correct 4 ms 3052 KB Output is correct
15 Correct 5 ms 3052 KB Output is correct
16 Correct 3 ms 2924 KB Output is correct
17 Correct 6 ms 3180 KB Output is correct
18 Correct 3 ms 2924 KB Output is correct
19 Correct 3 ms 2796 KB Output is correct
20 Correct 3 ms 2924 KB Output is correct
21 Correct 3 ms 2924 KB Output is correct
22 Correct 3 ms 2924 KB Output is correct
23 Correct 3 ms 2924 KB Output is correct
24 Correct 5 ms 3180 KB Output is correct
25 Correct 5 ms 3180 KB Output is correct
26 Correct 3 ms 2796 KB Output is correct
27 Correct 3 ms 2796 KB Output is correct
28 Correct 5 ms 3308 KB Output is correct
29 Correct 3 ms 2796 KB Output is correct
30 Correct 2 ms 2796 KB Output is correct
31 Correct 3 ms 2796 KB Output is correct
32 Correct 3 ms 2796 KB Output is correct
33 Correct 5 ms 3052 KB Output is correct
34 Correct 4 ms 3052 KB Output is correct
35 Correct 51 ms 7532 KB Output is correct
36 Correct 9 ms 3564 KB Output is correct
37 Correct 52 ms 7532 KB Output is correct
38 Correct 78 ms 8940 KB Output is correct
39 Correct 50 ms 8684 KB Output is correct
40 Correct 54 ms 8812 KB Output is correct
41 Correct 54 ms 8812 KB Output is correct
42 Correct 9 ms 3308 KB Output is correct
43 Correct 9 ms 3308 KB Output is correct
44 Correct 8 ms 3436 KB Output is correct
45 Correct 52 ms 7404 KB Output is correct
46 Correct 51 ms 7424 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2700 KB Output is correct
10 Correct 2 ms 2796 KB Output is correct
11 Correct 4 ms 2924 KB Output is correct
12 Correct 2 ms 2796 KB Output is correct
13 Correct 2 ms 2796 KB Output is correct
14 Correct 4 ms 3052 KB Output is correct
15 Correct 5 ms 3052 KB Output is correct
16 Correct 3 ms 2924 KB Output is correct
17 Correct 6 ms 3180 KB Output is correct
18 Correct 3 ms 2924 KB Output is correct
19 Correct 3 ms 2796 KB Output is correct
20 Correct 3 ms 2852 KB Output is correct
21 Correct 3 ms 2924 KB Output is correct
22 Correct 3 ms 2924 KB Output is correct
23 Correct 4 ms 2924 KB Output is correct
24 Correct 6 ms 3180 KB Output is correct
25 Correct 5 ms 3180 KB Output is correct
26 Correct 3 ms 2796 KB Output is correct
27 Correct 3 ms 2796 KB Output is correct
28 Correct 5 ms 3308 KB Output is correct
29 Correct 3 ms 2796 KB Output is correct
30 Correct 2 ms 2796 KB Output is correct
31 Correct 3 ms 2796 KB Output is correct
32 Correct 3 ms 2796 KB Output is correct
33 Correct 5 ms 3052 KB Output is correct
34 Correct 5 ms 3052 KB Output is correct
35 Correct 57 ms 7404 KB Output is correct
36 Correct 9 ms 3692 KB Output is correct
37 Correct 52 ms 7552 KB Output is correct
38 Correct 76 ms 8948 KB Output is correct
39 Correct 54 ms 8752 KB Output is correct
40 Correct 52 ms 8832 KB Output is correct
41 Correct 55 ms 8812 KB Output is correct
42 Correct 9 ms 3308 KB Output is correct
43 Correct 9 ms 3308 KB Output is correct
44 Correct 8 ms 3436 KB Output is correct
45 Correct 51 ms 7404 KB Output is correct
46 Correct 57 ms 7404 KB Output is correct
47 Correct 136 ms 14236 KB Output is correct
48 Correct 40 ms 7820 KB Output is correct
49 Correct 36 ms 6892 KB Output is correct
50 Correct 24 ms 5740 KB Output is correct
51 Correct 93 ms 10344 KB Output is correct
52 Correct 91 ms 10408 KB Output is correct
53 Correct 53 ms 8360 KB Output is correct
54 Correct 3 ms 2796 KB Output is correct
55 Correct 2 ms 2796 KB Output is correct
56 Correct 16 ms 5356 KB Output is correct
57 Incorrect 8 ms 3692 KB Output isn't correct
58 Halted 0 ms 0 KB -