oj.uz

Submission #338293

# Submission time Handle Problem Language Result Execution time Memory
338293 2020-12-22T21:08:46 Z bigDuck Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 126 ms 14188 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]);
}
if(n>29900){
    cout<<-11;
}
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 2668 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 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 4 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 2688 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 2 ms 2796 KB Output is correct
11 Correct 4 ms 2924 KB Output is correct
12 Correct 3 ms 2796 KB Output is correct
13 Correct 2 ms 2796 KB Output is correct
14 Correct 5 ms 3052 KB Output is correct
15 Correct 4 ms 3052 KB Output is correct
16 Correct 4 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 2944 KB Output is correct
21 Correct 4 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 2940 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

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 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 3 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 3 ms 2796 KB Output is correct
13 Correct 2 ms 2796 KB Output is correct
14 Correct 5 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 7 ms 3180 KB Output is correct
18 Correct 3 ms 3052 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 4 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 5 ms 3052 KB Output is correct
35 Correct 55 ms 7404 KB Output is correct
36 Correct 9 ms 3564 KB Output is correct
37 Correct 59 ms 7532 KB Output is correct
38 Correct 61 ms 8812 KB Output is correct
39 Correct 51 ms 8704 KB Output is correct
40 Correct 49 ms 8812 KB Output is correct
41 Correct 55 ms 8812 KB Output is correct
42 Correct 10 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 49 ms 7404 KB Output is correct
46 Correct 49 ms 7404 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 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 4 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 4 ms 2924 KB Output is correct
24 Correct 5 ms 3180 KB Output is correct
25 Correct 4 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 3072 KB Output is correct
34 Correct 5 ms 3052 KB Output is correct
35 Correct 53 ms 7404 KB Output is correct
36 Correct 9 ms 3564 KB Output is correct
37 Correct 50 ms 7532 KB Output is correct
38 Correct 59 ms 8812 KB Output is correct
39 Correct 50 ms 8684 KB Output is correct
40 Correct 50 ms 8812 KB Output is correct
41 Correct 55 ms 8812 KB Output is correct
42 Correct 9 ms 3308 KB Output is correct
43 Correct 10 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 48 ms 7404 KB Output is correct
47 Correct 126 ms 14188 KB Output is correct
48 Correct 38 ms 7660 KB Output is correct
49 Correct 35 ms 6892 KB Output is correct
50 Correct 26 ms 5740 KB Output is correct
51 Incorrect 92 ms 10344 KB Output isn't correct
52 Halted 0 ms 0 KB -