oj.uz

Submission #695130

# Submission time Handle Problem Language Result Execution time Memory
695130 2023-02-04T18:28:07 Z Abito Jakarta Skyscrapers (APIO15_skyscraper) C++17
10 / 100
 35 ms 6144 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
#define int long long
const int N=3e4+5;
int a[N],b[N],n,m,dis[N];
vector<pair<int,int>> adj[N];
vector<int> d[N],p[N];
bool vis[N];
priority_queue<pair<int,int>> pq;
void getdiv(int x){
    for (int i=1;i*i<=x;i++){
        if (x%i) continue;
        int y=i,z=x/i;
        d[x].pb(y);
        if (y!=z) d[x].pb(z);
    }sort(d[x].begin(),d[x].end());
    return;
}
void dijkstra(){
    pq.push({0,a[0]});
    while (!pq.empty()){
        pair<int,int> x=pq.top();
        x.F*=-1;pq.pop();
        if (vis[x.S]) continue;
        vis[x.S]=true;
        for (auto u:adj[x.S]){
            if (dis[u.F]<=x.F+u.S) continue;
            dis[u.F]=x.F+u.S;
            pq.push({-dis[u.F],u.F});
        }
    }return;
}
int32_t main(){
    for (int i=1;i<N;i++){
        getdiv(i);
        dis[i]=INT_MAX;
    }cin>>n>>m;
    for (int i=0;i<m;i++){
        cin>>a[i]>>b[i];
        p[a[i]].pb(b[i]);
    }
    for (int i=0;i<n;i++){
        for (int j=0;j<n;j++){
            if (i==j) continue;
            int dist=abs(i-j),x=0,y=0,ans=INT_MAX;
            while (x<d[dist].size() && y<p[i].size()){
                if (d[dist][x]==p[i][y]){
                    ans=dist/d[dist][x];
                    x++;
                    y++;
                    continue;
                }
                if (d[dist][x]<p[i][y]) x++;
                else y++;
            }
            if (ans==INT_MAX) continue;
            adj[i].pb({j,ans});
        }
    }dijkstra();
    if (dis[a[1]]==INT_MAX) cout<<-1<<endl;
    else cout<<dis[a[1]]<<endl;
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int32_t main()':
skyscraper.cpp:49:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |             while (x<d[dist].size() && y<p[i].size()){
      |                    ~^~~~~~~~~~~~~~~
skyscraper.cpp:49:41: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |             while (x<d[dist].size() && y<p[i].size()){
      |                                        ~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 5972 KB Output is correct
2 Correct 30 ms 6040 KB Output is correct
3 Correct 29 ms 6008 KB Output is correct
4 Correct 29 ms 6044 KB Output is correct
5 Correct 30 ms 6076 KB Output is correct
6 Correct 31 ms 6084 KB Output is correct
7 Correct 30 ms 5976 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 5968 KB Output is correct
2 Correct 30 ms 6072 KB Output is correct
3 Correct 31 ms 6072 KB Output is correct
4 Correct 29 ms 5964 KB Output is correct
5 Correct 29 ms 6080 KB Output is correct
6 Correct 31 ms 6056 KB Output is correct
7 Correct 30 ms 6100 KB Output is correct
8 Correct 32 ms 6076 KB Output is correct
9 Correct 29 ms 6100 KB Output is correct
10 Correct 29 ms 6048 KB Output is correct
11 Incorrect 30 ms 6060 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 6052 KB Output is correct
2 Correct 30 ms 6024 KB Output is correct
3 Correct 31 ms 6048 KB Output is correct
4 Correct 30 ms 6096 KB Output is correct
5 Correct 33 ms 5972 KB Output is correct
6 Correct 30 ms 6100 KB Output is correct
7 Correct 29 ms 6060 KB Output is correct
8 Correct 30 ms 6056 KB Output is correct
9 Correct 29 ms 6068 KB Output is correct
10 Correct 31 ms 6104 KB Output is correct
11 Incorrect 33 ms 6092 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 5988 KB Output is correct
2 Correct 30 ms 6072 KB Output is correct
3 Correct 30 ms 6052 KB Output is correct
4 Correct 31 ms 6032 KB Output is correct
5 Correct 30 ms 5988 KB Output is correct
6 Correct 31 ms 6052 KB Output is correct
7 Correct 29 ms 6040 KB Output is correct
8 Correct 34 ms 6032 KB Output is correct
9 Correct 30 ms 6024 KB Output is correct
10 Correct 32 ms 6092 KB Output is correct
11 Incorrect 32 ms 6144 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 6104 KB Output is correct
2 Correct 30 ms 6104 KB Output is correct
3 Correct 32 ms 6048 KB Output is correct
4 Correct 30 ms 6064 KB Output is correct
5 Correct 30 ms 6072 KB Output is correct
6 Correct 32 ms 6100 KB Output is correct
7 Correct 35 ms 6020 KB Output is correct
8 Correct 34 ms 6020 KB Output is correct
9 Correct 30 ms 5972 KB Output is correct
10 Correct 31 ms 6092 KB Output is correct
11 Incorrect 30 ms 6116 KB Output isn't correct
12 Halted 0 ms 0 KB -