oj.uz

Submission #695248

# Submission time Handle Problem Language Result Execution time Memory
695248 2023-02-04T20:24:18 Z Mizo_Compiler Jakarta Skyscrapers (APIO15_skyscraper) C++14
22 / 100
 24 ms 7496 KB 
#include <bits/stdc++.h>
using namespace std;
#define MOEZ ios_base::sync_with_stdio(false);cin.tie(NULL),cout.tie(NULL);
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define all(v) v.begin() , v.end()
#define eb emplace_back
#define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
#define mem(d , x) memset(d , x , sizeof(d));
#define sz(x) (int)x.size()
const int N = 30005;
//const ll M = 1e9+7;
//const ll inf = 1e18;
//const ld eps = 1e-6;
#define int long long
int n , id[N] , p[N] , m;
vector<pair<int , int>>adj[N];
int d[N];
signed main(){
    MOEZ
    cin >> n >> m;
    for(int i = 0; i < n;i++){
        d[i] = 1e18;
    }
    vector<int>v;
    for(int i = 0; i < m;i++){
        cin >> id[i];
        cin >> p[i];
        v.pb(id[i]);
    }
    sort(all(v));
    for(int i = 0; i < m;i++){
        for(auto x:v){
            if(x >= id[i])break;
            if((id[i]-x)%p[i] == 0){
                adj[id[i]].pb({x , (id[i]-x)/p[i]});
            }
        }
        for(int j = m-1; v[j] > id[i];j--){
            if((v[j]-id[i])%p[i] == 0)adj[id[i]].pb({v[j] , (v[j]-id[i])/p[i]});
        }
    }
    priority_queue<pair<int , int> , vector<pair<int , int>> , greater<>>q;
    q.push({id[0] , 0});
    d[id[0]] = 0;
    while(!q.empty()){
        int u = q.top().F , cost = q.top().S;
        q.pop();
        if(d[u] < cost)continue;
        if(u == id[1])break;
        for(auto x:adj[u]){
            int v = x.F , nc = cost+x.S;
            if(nc < d[v]){
                d[v] = nc;
                q.push({v , nc});
            }
        }
    }
    cout << (d[id[1]] == 1e18 ? -1 : d[id[1]]);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 22 ms 4356 KB Output is correct
12 Correct 2 ms 1744 KB Output is correct
13 Correct 12 ms 7492 KB Output is correct
14 Correct 20 ms 1876 KB Output is correct
15 Correct 21 ms 1952 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 21 ms 4436 KB Output is correct
12 Correct 2 ms 1744 KB Output is correct
13 Correct 10 ms 7496 KB Output is correct
14 Correct 22 ms 1948 KB Output is correct
15 Correct 20 ms 1920 KB Output is correct
16 Correct 5 ms 1492 KB Output is correct
17 Incorrect 17 ms 2260 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 24 ms 4340 KB Output is correct
12 Correct 2 ms 1744 KB Output is correct
13 Correct 9 ms 7492 KB Output is correct
14 Correct 21 ms 1880 KB Output is correct
15 Correct 19 ms 1976 KB Output is correct
16 Correct 4 ms 1492 KB Output is correct
17 Incorrect 18 ms 2124 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 22 ms 4436 KB Output is correct
12 Correct 2 ms 1744 KB Output is correct
13 Correct 8 ms 7492 KB Output is correct
14 Correct 19 ms 1876 KB Output is correct
15 Correct 19 ms 1980 KB Output is correct
16 Correct 5 ms 1504 KB Output is correct
17 Incorrect 18 ms 2248 KB Output isn't correct
18 Halted 0 ms 0 KB -