oj.uz

답안 #695162

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
695162 2023-02-04T18:51:23 Z Farhan_HY Jakarta Skyscrapers (APIO15_skyscraper) C++14
0 / 100
 15 ms 23892 KB 
#include <bits/stdc++.h>
#define int long long
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;
/// Benzema is the best player in the world
const int N = 1e6 + 6;
const int M = 1e3 + 3;
const int mod = 1e9 + 7;
const int inf = 1e9;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int LOG = 28;
int n, m;
int p[N], dist[N];
vector<pair<int, int>> adj[N];
priority_queue<pair<int, int>> q;
bool vis[N];
int b[N];

void dij() {
    for(int i = 1; i <= n; i++) dist[i] = inf;
    q.push({b[1], 1});
    dist[b[1]] = 0;
    while(!q.empty()) {
        int u = q.top().S;
        q.pop();
        if (vis[u]) continue;
        vis[u] = 1;
        for(auto x: adj[u]) {
            if (dist[x.F] > dist[u] + x.S)
                dist[x.F] = dist[u] + x.S, q.push({-dist[x.F], x.F});
        }
    }
}

main() {
    IOS
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        cin >> b[i] >> p[i];
        b[i]++;
        int j = b[i] - p[i], cnt = 1;
        while(j >= 1) {
            adj[b[i]].push_back({j, cnt++});
            j -= p[i];
        }
        cnt = 1, j = b[i] + p[i];
        while(j <= n) {
            adj[b[i]].push_back({j, cnt++});
            j += p[i];
        }
    }
    dij();
    if (dist[b[2]] == inf) dist[2] = -1;
    cout << dist[b[2]];
}

Compilation message

skyscraper.cpp:42:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   42 | main() {
      | ^~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23892 KB Output is correct
2 Correct 12 ms 23716 KB Output is correct
3 Correct 11 ms 23744 KB Output is correct
4 Incorrect 12 ms 23764 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23828 KB Output is correct
2 Correct 13 ms 23824 KB Output is correct
3 Correct 11 ms 23764 KB Output is correct
4 Incorrect 11 ms 23764 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 15 ms 23740 KB Output is correct
3 Correct 12 ms 23828 KB Output is correct
4 Incorrect 11 ms 23828 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23740 KB Output is correct
2 Correct 12 ms 23832 KB Output is correct
3 Correct 12 ms 23752 KB Output is correct
4 Incorrect 12 ms 23764 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23828 KB Output is correct
4 Incorrect 13 ms 23728 KB Output isn't correct
5 Halted 0 ms 0 KB -