oj.uz

답안 #208570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208570 2020-03-11T16:50:26 Z DodgeBallMan Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 61668 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 3e4 + 10;
const int M = 2e3 + 5;
int n, m, d[N], st, en, inf = 1e9;
bool chk[N][M];
vector<int> g[N];
priority_queue<pii, vector<pii>, greater<pii>> q;

int main()
{
    fill( d, d+N, inf );
    scanf("%d %d",&n,&m);
    for( int i = 0, a, b ; i < m ; i++ ) {
        scanf("%d %d",&a,&b);
        g[a].emplace_back( b );
        if( i == 0 ) st = a;
        else if( i == 1 ) en = a;
    }
    for( int i = 0 ; i < n ; i++ ) {
        sort( g[i].begin(), g[i].end() );
        g[i].resize(unique(g[i].begin(), g[i].end())-g[i].begin());
    } 
    q.emplace( d[st] = 0, st );
    while( !q.empty() ) {
        pii now = q.top(); q.pop();
        if( d[now.y] != now.x ) continue;
        for( int p : g[now.y] ) {
            for( int i = now.y + p, cnt = 1 ; i < n ; i += p, cnt++ ) {
                if( p < M && chk[i][p] ) continue ;
                if( d[i] > d[now.y] + cnt ) {
                    q.emplace( d[i] = d[now.y] + cnt, i );
                    if( p < M ) chk[i][p] = true;
                }
            }
            for( int i = now.y - p, cnt = 1 ; i >= 0 ; i -= p, cnt++ ) {
                if( p < M && chk[i][p] ) continue ;
                if( d[i] > d[now.y] + cnt ) {
                    q.emplace( d[i] = d[now.y] + cnt, i );
                    if( p < M ) chk[i][p] = true;
                }
            }
        }
    }
    printf("%d",d[en]==inf?-1:d[en]);
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~
skyscraper.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&a,&b);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1144 KB Output is correct
2 Correct 5 ms 1144 KB Output is correct
3 Correct 5 ms 1144 KB Output is correct
4 Correct 6 ms 1144 KB Output is correct
5 Correct 6 ms 1144 KB Output is correct
6 Correct 5 ms 1144 KB Output is correct
7 Correct 6 ms 1196 KB Output is correct
8 Correct 5 ms 1144 KB Output is correct
9 Correct 5 ms 1272 KB Output is correct
10 Correct 6 ms 1400 KB Output is correct
11 Correct 6 ms 1400 KB Output is correct
12 Correct 6 ms 1400 KB Output is correct
13 Correct 6 ms 1400 KB Output is correct
14 Correct 6 ms 1400 KB Output is correct
15 Correct 6 ms 1400 KB Output is correct
16 Correct 6 ms 1144 KB Output is correct
17 Correct 7 ms 2684 KB Output is correct
18 Correct 6 ms 1144 KB Output is correct
19 Correct 6 ms 1144 KB Output is correct
20 Correct 21 ms 5112 KB Output is correct
21 Correct 6 ms 1144 KB Output is correct
22 Correct 6 ms 1144 KB Output is correct
23 Correct 8 ms 4344 KB Output is correct
24 Correct 9 ms 4984 KB Output is correct
25 Correct 9 ms 5240 KB Output is correct
26 Correct 9 ms 5116 KB Output is correct
27 Correct 9 ms 5112 KB Output is correct
28 Correct 9 ms 5112 KB Output is correct
29 Correct 11 ms 5368 KB Output is correct
30 Correct 10 ms 5112 KB Output is correct
31 Correct 9 ms 5240 KB Output is correct
32 Correct 9 ms 5112 KB Output is correct
33 Correct 13 ms 5496 KB Output is correct
34 Correct 13 ms 5496 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1144 KB Output is correct
2 Correct 6 ms 1144 KB Output is correct
3 Correct 5 ms 1144 KB Output is correct
4 Correct 5 ms 1144 KB Output is correct
5 Correct 5 ms 1148 KB Output is correct
6 Correct 6 ms 1144 KB Output is correct
7 Correct 5 ms 1144 KB Output is correct
8 Correct 6 ms 1272 KB Output is correct
9 Correct 5 ms 1272 KB Output is correct
10 Correct 6 ms 1400 KB Output is correct
11 Correct 6 ms 1400 KB Output is correct
12 Correct 6 ms 1400 KB Output is correct
13 Correct 6 ms 1404 KB Output is correct
14 Correct 6 ms 1400 KB Output is correct
15 Correct 6 ms 1400 KB Output is correct
16 Correct 6 ms 1148 KB Output is correct
17 Correct 7 ms 2680 KB Output is correct
18 Correct 6 ms 1144 KB Output is correct
19 Correct 5 ms 1272 KB Output is correct
20 Correct 22 ms 5112 KB Output is correct
21 Correct 6 ms 1144 KB Output is correct
22 Correct 6 ms 1144 KB Output is correct
23 Correct 8 ms 4344 KB Output is correct
24 Correct 9 ms 4984 KB Output is correct
25 Correct 10 ms 5240 KB Output is correct
26 Correct 9 ms 5112 KB Output is correct
27 Correct 8 ms 5112 KB Output is correct
28 Correct 9 ms 5180 KB Output is correct
29 Correct 11 ms 5368 KB Output is correct
30 Correct 9 ms 5112 KB Output is correct
31 Correct 10 ms 5240 KB Output is correct
32 Correct 9 ms 5112 KB Output is correct
33 Correct 12 ms 5500 KB Output is correct
34 Correct 12 ms 5496 KB Output is correct
35 Correct 16 ms 4472 KB Output is correct
36 Correct 9 ms 3448 KB Output is correct
37 Correct 17 ms 5372 KB Output is correct
38 Correct 20 ms 5624 KB Output is correct
39 Correct 20 ms 5752 KB Output is correct
40 Correct 20 ms 5752 KB Output is correct
41 Correct 20 ms 5752 KB Output is correct
42 Correct 14 ms 5496 KB Output is correct
43 Correct 14 ms 5496 KB Output is correct
44 Correct 27 ms 5496 KB Output is correct
45 Correct 21 ms 5884 KB Output is correct
46 Correct 23 ms 5880 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1144 KB Output is correct
2 Correct 5 ms 1144 KB Output is correct
3 Correct 5 ms 1144 KB Output is correct
4 Correct 5 ms 1144 KB Output is correct
5 Correct 5 ms 1144 KB Output is correct
6 Correct 6 ms 1144 KB Output is correct
7 Correct 5 ms 1144 KB Output is correct
8 Correct 6 ms 1272 KB Output is correct
9 Correct 5 ms 1272 KB Output is correct
10 Correct 6 ms 1400 KB Output is correct
11 Correct 6 ms 1400 KB Output is correct
12 Correct 6 ms 1400 KB Output is correct
13 Correct 6 ms 1400 KB Output is correct
14 Correct 6 ms 1448 KB Output is correct
15 Correct 6 ms 1400 KB Output is correct
16 Correct 5 ms 1144 KB Output is correct
17 Correct 7 ms 2680 KB Output is correct
18 Correct 6 ms 1144 KB Output is correct
19 Correct 6 ms 1144 KB Output is correct
20 Correct 22 ms 5240 KB Output is correct
21 Correct 6 ms 1144 KB Output is correct
22 Correct 6 ms 1144 KB Output is correct
23 Correct 9 ms 4344 KB Output is correct
24 Correct 9 ms 4984 KB Output is correct
25 Correct 9 ms 5240 KB Output is correct
26 Correct 9 ms 5112 KB Output is correct
27 Correct 9 ms 5112 KB Output is correct
28 Correct 9 ms 5112 KB Output is correct
29 Correct 11 ms 5368 KB Output is correct
30 Correct 10 ms 5112 KB Output is correct
31 Correct 10 ms 5240 KB Output is correct
32 Correct 9 ms 5240 KB Output is correct
33 Correct 13 ms 5496 KB Output is correct
34 Correct 17 ms 5496 KB Output is correct
35 Correct 22 ms 4412 KB Output is correct
36 Correct 9 ms 3448 KB Output is correct
37 Correct 17 ms 5368 KB Output is correct
38 Correct 27 ms 5752 KB Output is correct
39 Correct 22 ms 5624 KB Output is correct
40 Correct 19 ms 5624 KB Output is correct
41 Correct 19 ms 5624 KB Output is correct
42 Correct 14 ms 5496 KB Output is correct
43 Correct 14 ms 5496 KB Output is correct
44 Correct 27 ms 5496 KB Output is correct
45 Correct 21 ms 5880 KB Output is correct
46 Correct 21 ms 5880 KB Output is correct
47 Correct 52 ms 26616 KB Output is correct
48 Correct 14 ms 1784 KB Output is correct
49 Correct 13 ms 1784 KB Output is correct
50 Correct 11 ms 1656 KB Output is correct
51 Correct 79 ms 61668 KB Output is correct
52 Correct 76 ms 61560 KB Output is correct
53 Correct 62 ms 61560 KB Output is correct
54 Correct 43 ms 60280 KB Output is correct
55 Correct 43 ms 60280 KB Output is correct
56 Execution timed out 1070 ms 61556 KB Time limit exceeded
57 Halted 0 ms 0 KB -