oj.uz

Submission #450483

# Submission time Handle Problem Language Result Execution time Memory
450483 2021-08-03T00:25:49 Z Blobo2_Blobo2 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 11736 KB 
/*
Editor: Abdelrahman Hossam
Nickname: Blobo2_Blobo2
IOI next year isA :)
*/
/*#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define all(v)  v.begin(),v.end()
#define gen(arr,n,nxt)  generate(arr,arr+n,nxt)
#define Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty ios_base::sync_with_stdio(false);cin.tie(0);

const int mo=1e9+7,INF=1e18;
int nxt(){int x;cin>>x;return x;}

signed main(){
    Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty
    int n=nxt(),m=nxt();
    vector<pair<int,int> >v;
    for(int i=0;i<m;i++){
        int b=nxt(),p=nxt();
        v.push_back({b,p});
    }
    int from = v[0].first,to = v[1].first;
    sort(all(v));
    vector<pair<int,int> >adj[n+1];
    for(int i=0;i<v.size();i++){
        for(int j=i+1;j<v.size();j++){
            if(abs(v[i].first-v[j].first)%(v[i].second)==0){
                adj[v[i].first].push_back({v[j].first,abs(v[i].first-v[j].first)/(v[i].second)});
                if(v[i].second==v[j].second)
                    break;
            }
        }
    }
    for(int i=v.size()-1;i>=0;i--){
        for(int j=i-1;j>=0;j--){
            if(abs(v[i].first-v[j].first)%(v[i].second)==0){
                adj[v[i].first].push_back({v[j].first,abs(v[i].first-v[j].first)/(v[i].second)});
                if(v[i].second==v[j].second)
                    break;
            }
        }
    }
    int dis[n],vis[n];
    for(int i=0;i<n;i++)
        dis[i]=INF,vis[i]=0;
    dis[from]=0;
    priority_queue<pair<int,int> >q;
    q.push({0,from});
    while(!q.empty()) {
        int a=q.top().second;q.pop();
        if(vis[a])continue;
        vis[a]=1;
        for(auto u:adj[a]){
            int b=u.first,w=u.second;
            if(dis[a]+w<dis[b]){
                dis[b]=dis[a]+w;
                q.push({-dis[b],b});
            }
        }
    }
    if(dis[to]==INF)cout<<-1<<endl;
    else cout<<dis[to]<<endl;
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:33:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~
skyscraper.cpp:34:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for(int j=i+1;j<v.size();j++){
      |                       ~^~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 20 ms 2484 KB Output is correct
12 Correct 2 ms 956 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 24 ms 2700 KB Output is correct
15 Correct 25 ms 2816 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 20 ms 2508 KB Output is correct
12 Correct 2 ms 956 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 24 ms 2716 KB Output is correct
15 Correct 24 ms 2804 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 19 ms 1288 KB Output is correct
18 Correct 6 ms 440 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 8 ms 472 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 6 ms 460 KB Output is correct
24 Correct 21 ms 708 KB Output is correct
25 Correct 23 ms 692 KB Output is correct
26 Correct 3 ms 1096 KB Output is correct
27 Correct 12 ms 8752 KB Output is correct
28 Correct 23 ms 840 KB Output is correct
29 Correct 4 ms 972 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 24 ms 2844 KB Output is correct
34 Correct 24 ms 2912 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 20 ms 2456 KB Output is correct
12 Correct 2 ms 968 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 24 ms 2760 KB Output is correct
15 Correct 24 ms 2776 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 19 ms 1228 KB Output is correct
18 Correct 6 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 8 ms 460 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 6 ms 464 KB Output is correct
24 Correct 21 ms 684 KB Output is correct
25 Correct 23 ms 584 KB Output is correct
26 Correct 3 ms 1096 KB Output is correct
27 Correct 13 ms 8812 KB Output is correct
28 Correct 24 ms 856 KB Output is correct
29 Correct 4 ms 972 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 24 ms 2972 KB Output is correct
34 Correct 24 ms 2956 KB Output is correct
35 Execution timed out 1087 ms 11736 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 22 ms 2508 KB Output is correct
12 Correct 2 ms 968 KB Output is correct
13 Correct 1 ms 444 KB Output is correct
14 Correct 25 ms 2768 KB Output is correct
15 Correct 24 ms 2768 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 19 ms 1384 KB Output is correct
18 Correct 6 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 8 ms 460 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 6 ms 460 KB Output is correct
24 Correct 21 ms 716 KB Output is correct
25 Correct 23 ms 580 KB Output is correct
26 Correct 3 ms 1096 KB Output is correct
27 Correct 12 ms 8748 KB Output is correct
28 Correct 24 ms 832 KB Output is correct
29 Correct 4 ms 972 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 24 ms 2920 KB Output is correct
34 Correct 25 ms 2888 KB Output is correct
35 Execution timed out 1088 ms 11640 KB Time limit exceeded
36 Halted 0 ms 0 KB -