답안 #23445 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
23445	2017-05-09T16:06:26 Z	duongthoi1999	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1000 ms	40008 KB

skyscraper

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
const int mod = (int) 1e9 + 7;
const ll inf = 1LL << 60;
const int maxn = (int) 3e4 + 5;
const ld eps = 1e-9;

int n, m, b[maxn], p[maxn], f[maxn];
map<int, int> d[maxn];
vector<int> a[maxn];
deque<pair<int, ii> > pq;

int main() {
    //freopen("test.txt", "r", stdin);
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    rep(i, 0, m) {
        cin >> b[i] >> p[i];
//        b[i] = rand() % n;
//        p[i] = rand() % 30000 + 1;
        a[b[i]].pb(p[i]);
        d[b[i]][p[i]] = mod;
    }
    rep(i, 0, n) {
        sort(all(a[i]));
        a[i].resize(unique(all(a[i])) - a[i].begin());
    }
    d[b[0]][p[0]] = 0;
    pq.push_back(make_pair(0, ii(b[0], p[0])));
    while(!pq.empty()) {
        int du = pq.front().fi;
        int u = pq.front().se.fi;
        int t = pq.front().se.se;
        pq.pop_front();
        if(du != d[u][t]) continue;
        rep(i, -1, 2) if(i) {
            int v = u + i * t;
            if(v < 0 || v >= n) continue;
            if(d[v].count(t) && d[v][t] <= du + 1) continue;
            d[v][t] = du + 1;
            pq.push_back(make_pair(du + 1, ii(v, t)));
        }
        if(f[u]) continue;
        for (auto s : a[u]) {
            d[u][s] = du;
            pq.push_front(make_pair(du, ii(u, s)));
        }
        f[u] = 1;
    }
    if(d[b[1]][p[1]] != mod) cout << d[b[1]][p[1]] << '\n';
    else cout << "-1\n";
}

Subtask #1
10.0 / 10.0

#	결과	메모리	Grader output
1	Correct	4648 KB	Output is correct
2	Correct	4648 KB	Output is correct
3	Correct	4648 KB	Output is correct
4	Correct	4648 KB	Output is correct
5	Correct	4648 KB	Output is correct
6	Correct	4648 KB	Output is correct
7	Correct	4648 KB	Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	4648 KB	Output is correct
2	Correct	0 ms	4648 KB	Output is correct
3	Correct	0 ms	4648 KB	Output is correct
4	Correct	0 ms	4648 KB	Output is correct
5	Correct	0 ms	4648 KB	Output is correct
6	Correct	0 ms	4648 KB	Output is correct
7	Correct	0 ms	4648 KB	Output is correct
8	Correct	0 ms	4648 KB	Output is correct
9	Correct	0 ms	4648 KB	Output is correct
10	Correct	0 ms	4648 KB	Output is correct
11	Correct	3 ms	4780 KB	Output is correct
12	Correct	0 ms	4648 KB	Output is correct
13	Correct	0 ms	4648 KB	Output is correct
14	Correct	3 ms	4912 KB	Output is correct
15	Correct	3 ms	4912 KB	Output is correct
16	Correct	0 ms	4648 KB	Output is correct
17	Correct	3 ms	5308 KB	Output is correct
18	Correct	0 ms	4648 KB	Output is correct
19	Correct	0 ms	4648 KB	Output is correct
20	Correct	0 ms	4780 KB	Output is correct
21	Correct	0 ms	4648 KB	Output is correct
22	Correct	0 ms	4648 KB	Output is correct
23	Correct	0 ms	4912 KB	Output is correct
24	Correct	3 ms	5308 KB	Output is correct
25	Correct	0 ms	5044 KB	Output is correct
26	Correct	0 ms	5044 KB	Output is correct
27	Correct	0 ms	4912 KB	Output is correct
28	Correct	6 ms	5704 KB	Output is correct
29	Correct	29 ms	7552 KB	Output is correct
30	Correct	0 ms	5440 KB	Output is correct
31	Correct	9 ms	6232 KB	Output is correct
32	Correct	6 ms	5704 KB	Output is correct
33	Correct	66 ms	10324 KB	Output is correct
34	Correct	66 ms	10324 KB	Output is correct

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	4648 KB	Output is correct
2	Correct	0 ms	4648 KB	Output is correct
3	Correct	0 ms	4648 KB	Output is correct
4	Correct	0 ms	4648 KB	Output is correct
5	Correct	0 ms	4648 KB	Output is correct
6	Correct	0 ms	4648 KB	Output is correct
7	Correct	0 ms	4648 KB	Output is correct
8	Correct	0 ms	4648 KB	Output is correct
9	Correct	0 ms	4648 KB	Output is correct
10	Correct	0 ms	4648 KB	Output is correct
11	Correct	0 ms	4780 KB	Output is correct
12	Correct	0 ms	4648 KB	Output is correct
13	Correct	0 ms	4648 KB	Output is correct
14	Correct	3 ms	4912 KB	Output is correct
15	Correct	0 ms	4912 KB	Output is correct
16	Correct	0 ms	4648 KB	Output is correct
17	Correct	6 ms	5308 KB	Output is correct
18	Correct	0 ms	4648 KB	Output is correct
19	Correct	0 ms	4648 KB	Output is correct
20	Correct	0 ms	4780 KB	Output is correct
21	Correct	0 ms	4648 KB	Output is correct
22	Correct	0 ms	4648 KB	Output is correct
23	Correct	3 ms	4912 KB	Output is correct
24	Correct	6 ms	5308 KB	Output is correct
25	Correct	0 ms	5044 KB	Output is correct
26	Correct	0 ms	5044 KB	Output is correct
27	Correct	0 ms	4912 KB	Output is correct
28	Correct	6 ms	5704 KB	Output is correct
29	Correct	23 ms	7552 KB	Output is correct
30	Correct	6 ms	5440 KB	Output is correct
31	Correct	13 ms	6232 KB	Output is correct
32	Correct	9 ms	5704 KB	Output is correct
33	Correct	63 ms	10324 KB	Output is correct
34	Correct	59 ms	10324 KB	Output is correct
35	Correct	76 ms	9656 KB	Output is correct
36	Correct	9 ms	5568 KB	Output is correct
37	Correct	159 ms	12964 KB	Output is correct
38	Correct	106 ms	12564 KB	Output is correct
39	Correct	133 ms	12568 KB	Output is correct
40	Correct	143 ms	12560 KB	Output is correct
41	Correct	143 ms	12560 KB	Output is correct
42	Correct	6 ms	5084 KB	Output is correct
43	Correct	3 ms	5088 KB	Output is correct
44	Correct	6 ms	4956 KB	Output is correct
45	Correct	389 ms	27756 KB	Output is correct
46	Correct	393 ms	27756 KB	Output is correct

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	4648 KB	Output is correct
2	Correct	0 ms	4648 KB	Output is correct
3	Correct	0 ms	4648 KB	Output is correct
4	Correct	0 ms	4648 KB	Output is correct
5	Correct	0 ms	4648 KB	Output is correct
6	Correct	0 ms	4648 KB	Output is correct
7	Correct	0 ms	4648 KB	Output is correct
8	Correct	0 ms	4648 KB	Output is correct
9	Correct	0 ms	4648 KB	Output is correct
10	Correct	0 ms	4648 KB	Output is correct
11	Correct	3 ms	4780 KB	Output is correct
12	Correct	0 ms	4648 KB	Output is correct
13	Correct	0 ms	4648 KB	Output is correct
14	Correct	3 ms	4912 KB	Output is correct
15	Correct	3 ms	4912 KB	Output is correct
16	Correct	0 ms	4648 KB	Output is correct
17	Correct	3 ms	5308 KB	Output is correct
18	Correct	0 ms	4648 KB	Output is correct
19	Correct	0 ms	4648 KB	Output is correct
20	Correct	0 ms	4780 KB	Output is correct
21	Correct	0 ms	4648 KB	Output is correct
22	Correct	0 ms	4648 KB	Output is correct
23	Correct	3 ms	4912 KB	Output is correct
24	Correct	6 ms	5308 KB	Output is correct
25	Correct	3 ms	5044 KB	Output is correct
26	Correct	3 ms	5044 KB	Output is correct
27	Correct	3 ms	4912 KB	Output is correct
28	Correct	3 ms	5704 KB	Output is correct
29	Correct	19 ms	7552 KB	Output is correct
30	Correct	3 ms	5440 KB	Output is correct
31	Correct	9 ms	6232 KB	Output is correct
32	Correct	6 ms	5704 KB	Output is correct
33	Correct	66 ms	10324 KB	Output is correct
34	Correct	69 ms	10324 KB	Output is correct
35	Correct	73 ms	9656 KB	Output is correct
36	Correct	9 ms	5568 KB	Output is correct
37	Correct	159 ms	12964 KB	Output is correct
38	Correct	156 ms	12564 KB	Output is correct
39	Correct	136 ms	12568 KB	Output is correct
40	Correct	146 ms	12560 KB	Output is correct
41	Correct	146 ms	12560 KB	Output is correct
42	Correct	6 ms	5084 KB	Output is correct
43	Correct	6 ms	5088 KB	Output is correct
44	Correct	3 ms	4956 KB	Output is correct
45	Correct	393 ms	27756 KB	Output is correct
46	Correct	386 ms	27756 KB	Output is correct
47	Execution timed out	1000 ms	40008 KB	Execution timed out
48	Halted	0 ms	0 KB	-

답안 #23445

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 21.0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
21.0 / 21.0

Subtask #5
0 / 43.0