oj.uz

답안 #240991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
240991 2020-06-22T02:14:21 Z WhaleVomit Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 70336 KB 
#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()

#define MOO(i, a, b) for(int i=a; i<b; i++)
#define M00(i, a) for(int i=0; i<a; i++)
#define MOOd(i,a,b) for(int i = (b)-1; i >= a; i--)
#define M00d(i,a) for(int i = (a)-1; i>=0; i--)

#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define finish(x) return cout << x << '\n', 0;
#define dbg(x) cerr << ">>> " << #x << " = " << x << "\n";
#define _ << " _ " <<

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<ld,ld> pd;
typedef complex<ld> cd;

template<int SZ> struct dijkstra {
    const int inf = 1e8;
    vector<pi> adj[SZ];
    int d[SZ];

    void addEdge(int u, int v, int l) {
        adj[u].pb(mp(v, l));
    }
    int dist(int v) {
        return d[v];
    }
    void build(int u) {
        priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
        M00(i, SZ) d[i] = inf;
        pq.push(mp(0, u));
        while(!pq.empty()) {
            pi t = pq.top(); pq.pop();
            if(d[t.s] != inf) continue;
            d[t.s] = t.f;

            for(auto v: adj[t.s]) {
                if(d[v.f] > d[t.s] + v.s) {
                    pq.push(mp(d[t.s]+v.s, v.f));
                }
            }
        }
    }
};

const int MAX_N = 30030;
int n, m;
set<int> doges[MAX_N];
dijkstra<MAX_N> dj;

int main() { FAST
    cin >> n >> m;
    int st = -1, en = -1;
    M00(i, m) {
        int b, p; cin >> b >> p;
        if(i == 0) st = b;
        else if(i == 1) en = b;
        doges[b].insert(p);
    }
    M00(i, n) {
        for(int j: doges[i]) {
            for(int x = i+j; x < n; x += j) {
                dj.addEdge(i,x,(x-i)/j);
                if(doges[x].count(j)) break;
            }
            for(int x = i-j; x >= 0; x -= j) {
                dj.addEdge(i,x,(i-x)/j);
                if(doges[x].count(j)) break;
            }
        }
    }
    dj.build(st);
    int res = dj.dist(en);
    if(res == 1e8) {
        finish(-1);
    }
    cout << dj.dist(en) << "\n";
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2560 KB Output is correct
2 Correct 6 ms 2560 KB Output is correct
3 Correct 6 ms 2560 KB Output is correct
4 Correct 6 ms 2560 KB Output is correct
5 Correct 7 ms 2560 KB Output is correct
6 Correct 6 ms 2560 KB Output is correct
7 Correct 6 ms 2560 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2560 KB Output is correct
2 Correct 6 ms 2560 KB Output is correct
3 Correct 6 ms 2560 KB Output is correct
4 Correct 6 ms 2560 KB Output is correct
5 Correct 6 ms 2560 KB Output is correct
6 Correct 6 ms 2560 KB Output is correct
7 Correct 6 ms 2560 KB Output is correct
8 Correct 7 ms 2560 KB Output is correct
9 Correct 6 ms 2560 KB Output is correct
10 Correct 7 ms 2688 KB Output is correct
11 Correct 7 ms 2816 KB Output is correct
12 Correct 6 ms 2560 KB Output is correct
13 Correct 6 ms 2560 KB Output is correct
14 Correct 7 ms 2816 KB Output is correct
15 Correct 8 ms 2816 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2560 KB Output is correct
2 Correct 6 ms 2560 KB Output is correct
3 Correct 6 ms 2560 KB Output is correct
4 Correct 6 ms 2560 KB Output is correct
5 Correct 6 ms 2560 KB Output is correct
6 Correct 6 ms 2560 KB Output is correct
7 Correct 6 ms 2560 KB Output is correct
8 Correct 6 ms 2560 KB Output is correct
9 Correct 6 ms 2560 KB Output is correct
10 Correct 6 ms 2688 KB Output is correct
11 Correct 7 ms 2816 KB Output is correct
12 Correct 7 ms 2560 KB Output is correct
13 Correct 6 ms 2560 KB Output is correct
14 Correct 7 ms 2816 KB Output is correct
15 Correct 7 ms 2816 KB Output is correct
16 Correct 6 ms 2688 KB Output is correct
17 Correct 8 ms 3072 KB Output is correct
18 Correct 6 ms 2688 KB Output is correct
19 Correct 6 ms 2688 KB Output is correct
20 Correct 7 ms 2688 KB Output is correct
21 Correct 6 ms 2688 KB Output is correct
22 Correct 6 ms 2688 KB Output is correct
23 Correct 7 ms 2816 KB Output is correct
24 Correct 9 ms 2944 KB Output is correct
25 Correct 7 ms 2944 KB Output is correct
26 Correct 7 ms 2688 KB Output is correct
27 Correct 8 ms 2688 KB Output is correct
28 Correct 7 ms 2944 KB Output is correct
29 Correct 17 ms 4364 KB Output is correct
30 Correct 8 ms 3200 KB Output is correct
31 Correct 11 ms 3612 KB Output is correct
32 Correct 9 ms 3200 KB Output is correct
33 Correct 31 ms 6020 KB Output is correct
34 Correct 31 ms 6020 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2560 KB Output is correct
2 Correct 6 ms 2560 KB Output is correct
3 Correct 6 ms 2560 KB Output is correct
4 Correct 6 ms 2560 KB Output is correct
5 Correct 6 ms 2560 KB Output is correct
6 Correct 6 ms 2560 KB Output is correct
7 Correct 6 ms 2560 KB Output is correct
8 Correct 6 ms 2688 KB Output is correct
9 Correct 6 ms 2560 KB Output is correct
10 Correct 6 ms 2560 KB Output is correct
11 Correct 7 ms 2816 KB Output is correct
12 Correct 7 ms 2560 KB Output is correct
13 Correct 6 ms 2560 KB Output is correct
14 Correct 7 ms 2816 KB Output is correct
15 Correct 7 ms 2816 KB Output is correct
16 Correct 6 ms 2688 KB Output is correct
17 Correct 8 ms 3072 KB Output is correct
18 Correct 6 ms 2688 KB Output is correct
19 Correct 6 ms 2688 KB Output is correct
20 Correct 7 ms 2688 KB Output is correct
21 Correct 7 ms 2688 KB Output is correct
22 Correct 6 ms 2688 KB Output is correct
23 Correct 7 ms 2688 KB Output is correct
24 Correct 8 ms 2944 KB Output is correct
25 Correct 7 ms 2816 KB Output is correct
26 Correct 7 ms 2688 KB Output is correct
27 Correct 7 ms 2784 KB Output is correct
28 Correct 7 ms 2944 KB Output is correct
29 Correct 18 ms 4364 KB Output is correct
30 Correct 8 ms 3200 KB Output is correct
31 Correct 11 ms 3580 KB Output is correct
32 Correct 9 ms 3200 KB Output is correct
33 Correct 31 ms 6020 KB Output is correct
34 Correct 31 ms 6020 KB Output is correct
35 Correct 29 ms 6136 KB Output is correct
36 Correct 9 ms 3200 KB Output is correct
37 Correct 42 ms 7800 KB Output is correct
38 Correct 42 ms 8172 KB Output is correct
39 Correct 41 ms 8180 KB Output is correct
40 Correct 44 ms 8172 KB Output is correct
41 Correct 41 ms 8180 KB Output is correct
42 Correct 11 ms 2944 KB Output is correct
43 Correct 11 ms 2944 KB Output is correct
44 Correct 11 ms 2944 KB Output is correct
45 Correct 128 ms 16632 KB Output is correct
46 Correct 128 ms 16632 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2560 KB Output is correct
2 Correct 7 ms 2560 KB Output is correct
3 Correct 6 ms 2560 KB Output is correct
4 Correct 6 ms 2560 KB Output is correct
5 Correct 6 ms 2560 KB Output is correct
6 Correct 7 ms 2560 KB Output is correct
7 Correct 6 ms 2560 KB Output is correct
8 Correct 6 ms 2560 KB Output is correct
9 Correct 6 ms 2560 KB Output is correct
10 Correct 6 ms 2560 KB Output is correct
11 Correct 7 ms 2816 KB Output is correct
12 Correct 6 ms 2552 KB Output is correct
13 Correct 7 ms 2560 KB Output is correct
14 Correct 7 ms 2816 KB Output is correct
15 Correct 8 ms 2816 KB Output is correct
16 Correct 6 ms 2688 KB Output is correct
17 Correct 8 ms 3072 KB Output is correct
18 Correct 7 ms 2688 KB Output is correct
19 Correct 6 ms 2688 KB Output is correct
20 Correct 8 ms 2688 KB Output is correct
21 Correct 6 ms 2688 KB Output is correct
22 Correct 6 ms 2688 KB Output is correct
23 Correct 7 ms 2688 KB Output is correct
24 Correct 8 ms 2944 KB Output is correct
25 Correct 8 ms 2928 KB Output is correct
26 Correct 7 ms 2688 KB Output is correct
27 Correct 7 ms 2688 KB Output is correct
28 Correct 7 ms 2944 KB Output is correct
29 Correct 18 ms 4364 KB Output is correct
30 Correct 8 ms 3200 KB Output is correct
31 Correct 11 ms 3580 KB Output is correct
32 Correct 9 ms 3216 KB Output is correct
33 Correct 31 ms 5892 KB Output is correct
34 Correct 31 ms 6020 KB Output is correct
35 Correct 30 ms 6136 KB Output is correct
36 Correct 9 ms 3200 KB Output is correct
37 Correct 39 ms 7800 KB Output is correct
38 Correct 43 ms 8172 KB Output is correct
39 Correct 42 ms 8180 KB Output is correct
40 Correct 41 ms 8180 KB Output is correct
41 Correct 45 ms 8172 KB Output is correct
42 Correct 11 ms 2944 KB Output is correct
43 Correct 11 ms 2944 KB Output is correct
44 Correct 12 ms 2944 KB Output is correct
45 Correct 137 ms 16664 KB Output is correct
46 Correct 128 ms 16632 KB Output is correct
47 Correct 142 ms 20836 KB Output is correct
48 Correct 24 ms 6252 KB Output is correct
49 Correct 19 ms 5248 KB Output is correct
50 Correct 16 ms 4864 KB Output is correct
51 Correct 62 ms 9732 KB Output is correct
52 Correct 72 ms 12268 KB Output is correct
53 Correct 28 ms 6392 KB Output is correct
54 Correct 8 ms 3200 KB Output is correct
55 Correct 10 ms 3708 KB Output is correct
56 Correct 19 ms 5120 KB Output is correct
57 Correct 97 ms 13172 KB Output is correct
58 Correct 13 ms 3960 KB Output is correct
59 Correct 16 ms 4476 KB Output is correct
60 Correct 19 ms 5116 KB Output is correct
61 Correct 18 ms 4352 KB Output is correct
62 Correct 30 ms 9468 KB Output is correct
63 Correct 405 ms 41184 KB Output is correct
64 Correct 430 ms 44384 KB Output is correct
65 Execution timed out 1100 ms 70336 KB Time limit exceeded
66 Halted 0 ms 0 KB -