oj.uz

Submission #739450

# Submission time Handle Problem Language Result Execution time Memory
739450 2023-05-10T13:23:55 Z Username4132 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 63756 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<set>
using namespace std;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define PB push_back

struct node{
    int pos, hop, cost;
    node(int Pos, int Hop, int Cost) : pos(Pos), hop(Hop), cost(Cost) {}
};

const int MAXN=30010, SQ=180;
int n, m, start, target;
bool done[MAXN];
vector<int> ops[MAXN];
set<int> len[2][MAXN];
deque<node> Q;

void add(node v, bool mode){
    if(len[mode][v.pos].find(v.hop)==len[mode][v.pos].end()){
        len[mode][v.pos].insert(v.hop);
        if(mode) Q.push_back(v);
        else Q.push_front(v);
    }
}

int main(){
    scanf("%d %d", &n, &m);
    forn(i, m){
        int a, b; scanf("%d %d", &a, &b);
        ops[a].PB(b);
        if(i==0) start=a;
        if(i==1) target=a;
    }
    for(int doge:ops[start]) add(node(start, doge, 0), false);
    int ans=-1;
    while(!Q.empty()){
        node v = Q.front();
        Q.pop_front();
        if(v.pos==target){
            ans=v.cost;
            break;
        }
        int le=v.pos-v.hop, ri=v.pos+v.hop;
        if(le>=0) add(node(le, v.hop, v.cost+1), true);
        if(ri<n) add(node(ri, v.hop, v.cost+1), true);
        if(!done[v.pos]){
            for(int wi:ops[v.pos]) add(node(v.pos, wi, v.cost), false);
            done[v.pos]=true;
        }
    }
    printf("%d\n", ans);
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3796 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 3 ms 3796 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 5 ms 4180 KB Output is correct
15 Correct 3 ms 4052 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Correct 3 ms 3796 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3772 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 2 ms 3796 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 2 ms 3808 KB Output is correct
14 Correct 5 ms 4180 KB Output is correct
15 Correct 3 ms 4052 KB Output is correct
16 Correct 2 ms 3796 KB Output is correct
17 Correct 3 ms 4052 KB Output is correct
18 Correct 2 ms 3800 KB Output is correct
19 Correct 2 ms 3796 KB Output is correct
20 Correct 3 ms 4052 KB Output is correct
21 Correct 2 ms 3796 KB Output is correct
22 Correct 3 ms 3740 KB Output is correct
23 Correct 3 ms 4052 KB Output is correct
24 Correct 4 ms 4180 KB Output is correct
25 Correct 2 ms 3796 KB Output is correct
26 Correct 3 ms 3924 KB Output is correct
27 Correct 4 ms 4052 KB Output is correct
28 Correct 6 ms 4820 KB Output is correct
29 Correct 17 ms 6708 KB Output is correct
30 Correct 6 ms 4636 KB Output is correct
31 Correct 8 ms 5332 KB Output is correct
32 Correct 8 ms 4948 KB Output is correct
33 Correct 43 ms 9548 KB Output is correct
34 Correct 25 ms 6996 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3796 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 2 ms 3796 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 4 ms 3796 KB Output is correct
14 Correct 4 ms 4180 KB Output is correct
15 Correct 3 ms 4052 KB Output is correct
16 Correct 2 ms 3796 KB Output is correct
17 Correct 3 ms 4052 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Correct 2 ms 3796 KB Output is correct
20 Correct 3 ms 4052 KB Output is correct
21 Correct 2 ms 3796 KB Output is correct
22 Correct 2 ms 3796 KB Output is correct
23 Correct 3 ms 4052 KB Output is correct
24 Correct 3 ms 4180 KB Output is correct
25 Correct 3 ms 3796 KB Output is correct
26 Correct 2 ms 3924 KB Output is correct
27 Correct 3 ms 4052 KB Output is correct
28 Correct 6 ms 4824 KB Output is correct
29 Correct 16 ms 6612 KB Output is correct
30 Correct 4 ms 4564 KB Output is correct
31 Correct 8 ms 5332 KB Output is correct
32 Correct 6 ms 4948 KB Output is correct
33 Correct 39 ms 9512 KB Output is correct
34 Correct 19 ms 6996 KB Output is correct
35 Correct 17 ms 6740 KB Output is correct
36 Correct 3 ms 3924 KB Output is correct
37 Correct 11 ms 5844 KB Output is correct
38 Correct 11 ms 5192 KB Output is correct
39 Correct 12 ms 4020 KB Output is correct
40 Correct 14 ms 4308 KB Output is correct
41 Correct 21 ms 6868 KB Output is correct
42 Correct 7 ms 4052 KB Output is correct
43 Correct 7 ms 4060 KB Output is correct
44 Correct 7 ms 4180 KB Output is correct
45 Correct 284 ms 28048 KB Output is correct
46 Correct 127 ms 18252 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Correct 3 ms 3796 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3724 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 3 ms 3796 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 3 ms 3796 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 3 ms 4052 KB Output is correct
16 Correct 2 ms 3796 KB Output is correct
17 Correct 3 ms 4052 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Correct 4 ms 3836 KB Output is correct
20 Correct 3 ms 4052 KB Output is correct
21 Correct 2 ms 3796 KB Output is correct
22 Correct 3 ms 3796 KB Output is correct
23 Correct 3 ms 3984 KB Output is correct
24 Correct 6 ms 4180 KB Output is correct
25 Correct 3 ms 3796 KB Output is correct
26 Correct 4 ms 3924 KB Output is correct
27 Correct 3 ms 4052 KB Output is correct
28 Correct 7 ms 4836 KB Output is correct
29 Correct 16 ms 6740 KB Output is correct
30 Correct 5 ms 4564 KB Output is correct
31 Correct 8 ms 5332 KB Output is correct
32 Correct 6 ms 4908 KB Output is correct
33 Correct 46 ms 9448 KB Output is correct
34 Correct 27 ms 6996 KB Output is correct
35 Correct 27 ms 6796 KB Output is correct
36 Correct 6 ms 3924 KB Output is correct
37 Correct 15 ms 5968 KB Output is correct
38 Correct 11 ms 5076 KB Output is correct
39 Correct 13 ms 4052 KB Output is correct
40 Correct 11 ms 4308 KB Output is correct
41 Correct 18 ms 6836 KB Output is correct
42 Correct 6 ms 4052 KB Output is correct
43 Correct 8 ms 4076 KB Output is correct
44 Correct 7 ms 4180 KB Output is correct
45 Correct 309 ms 27936 KB Output is correct
46 Correct 145 ms 18336 KB Output is correct
47 Correct 13 ms 6228 KB Output is correct
48 Correct 8 ms 4180 KB Output is correct
49 Correct 8 ms 4180 KB Output is correct
50 Correct 6 ms 4180 KB Output is correct
51 Correct 23 ms 7380 KB Output is correct
52 Correct 25 ms 8048 KB Output is correct
53 Correct 11 ms 4832 KB Output is correct
54 Correct 3 ms 4444 KB Output is correct
55 Correct 5 ms 5028 KB Output is correct
56 Correct 21 ms 7568 KB Output is correct
57 Correct 3 ms 3924 KB Output is correct
58 Correct 16 ms 7040 KB Output is correct
59 Correct 16 ms 6612 KB Output is correct
60 Correct 20 ms 6612 KB Output is correct
61 Correct 14 ms 6356 KB Output is correct
62 Correct 243 ms 26412 KB Output is correct
63 Execution timed out 1071 ms 63756 KB Time limit exceeded
64 Halted 0 ms 0 KB -