oj.uz

Submission #399640

# Submission time Handle Problem Language Result Execution time Memory
399640 2021-05-06T10:44:21 Z MeGustaElArroz23 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 129516 KB 
    #include<bits/stdc++.h>
    using namespace std;
     
    typedef long long ll;
    typedef vector<int> vi;
    typedef pair<int,int> pii;
    typedef vector<pii> vii;
    typedef vector<vii> vvii;
     
    int main(){
        int l,n;
        cin >> l >> n;
        vii v(n);
        
        for (int i=0;i<n;i++) cin >> v[i].first >> v[i].second;
        int inicio=v[0].first,final=v[1].first;
        vector<set<int>> pos(l);
        for (int i=0;i<n;i++) pos[v[i].first].insert(v[i].second);
        
        vvii conexiones(l);
        
        for (int i=0;i<l;i++){
            for (int p:pos[i]){
                int a=i-p;
                while (a>=0){
                    conexiones[i].push_back(pii{(i-a)/p,a});
                    if (pos[a].count(p)) break;
                    a-=p;
                }
                a=i+p;
                while (a<l){
                    conexiones[i].push_back(pii{(a-i)/p,a});
                    if (pos[a].count(p)) break;
                    a+=p;
                }
            }
        }
        
        priority_queue<pii> cola;
        cola.push(pii{0,inicio});
        bool T=true;
        vi porvisitar(l,true);
        //for (int i=0;i<n;i++){
        //    for (pii x:conexiones[i]) cerr << x.second<<' '<<x.first<<' '<<' ';
        //    cerr<<'\n';
        //}
     
        while (cola.size()){
            pii x=cola.top();
            cola.pop();
            if (porvisitar[x.second]){
                porvisitar[x.second]=false;
                if (x.second==final){
                    T=false;
                    cout << -x.first << '\n';
                    break;
                }
                for (pii y:conexiones[x.second]){
                    if (porvisitar[y.second]) cola.push(pii{x.first-y.first,y.second});
                }
            }
        }
        if (T) cout << -1<<'\n';
    }

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 224 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 3 ms 716 KB Output is correct
18 Correct 2 ms 536 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 3 ms 716 KB Output is correct
25 Correct 3 ms 588 KB Output is correct
26 Correct 2 ms 588 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 11 ms 1736 KB Output is correct
30 Correct 3 ms 844 KB Output is correct
31 Correct 5 ms 1100 KB Output is correct
32 Correct 4 ms 844 KB Output is correct
33 Correct 23 ms 2756 KB Output is correct
34 Correct 16 ms 2756 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 304 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 3 ms 716 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 2 ms 588 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 3 ms 716 KB Output is correct
25 Correct 3 ms 588 KB Output is correct
26 Correct 2 ms 588 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 11 ms 1736 KB Output is correct
30 Correct 3 ms 844 KB Output is correct
31 Correct 5 ms 1100 KB Output is correct
32 Correct 3 ms 844 KB Output is correct
33 Correct 23 ms 2728 KB Output is correct
34 Correct 16 ms 2756 KB Output is correct
35 Correct 28 ms 3556 KB Output is correct
36 Correct 5 ms 844 KB Output is correct
37 Correct 27 ms 4156 KB Output is correct
38 Correct 36 ms 5092 KB Output is correct
39 Correct 33 ms 4020 KB Output is correct
40 Correct 34 ms 4372 KB Output is correct
41 Correct 36 ms 5116 KB Output is correct
42 Correct 15 ms 1012 KB Output is correct
43 Correct 16 ms 972 KB Output is correct
44 Correct 14 ms 972 KB Output is correct
45 Correct 112 ms 10592 KB Output is correct
46 Correct 77 ms 10680 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 3 ms 716 KB Output is correct
18 Correct 2 ms 560 KB Output is correct
19 Correct 1 ms 424 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 556 KB Output is correct
24 Correct 3 ms 716 KB Output is correct
25 Correct 3 ms 588 KB Output is correct
26 Correct 2 ms 560 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 11 ms 1704 KB Output is correct
30 Correct 3 ms 844 KB Output is correct
31 Correct 5 ms 1100 KB Output is correct
32 Correct 3 ms 804 KB Output is correct
33 Correct 23 ms 2728 KB Output is correct
34 Correct 16 ms 2756 KB Output is correct
35 Correct 27 ms 3516 KB Output is correct
36 Correct 4 ms 820 KB Output is correct
37 Correct 27 ms 4312 KB Output is correct
38 Correct 37 ms 5056 KB Output is correct
39 Correct 32 ms 4012 KB Output is correct
40 Correct 33 ms 4400 KB Output is correct
41 Correct 36 ms 5140 KB Output is correct
42 Correct 14 ms 972 KB Output is correct
43 Correct 15 ms 972 KB Output is correct
44 Correct 15 ms 992 KB Output is correct
45 Correct 111 ms 10676 KB Output is correct
46 Correct 78 ms 10736 KB Output is correct
47 Correct 54 ms 12348 KB Output is correct
48 Correct 26 ms 5808 KB Output is correct
49 Correct 23 ms 5052 KB Output is correct
50 Correct 17 ms 4756 KB Output is correct
51 Correct 46 ms 8912 KB Output is correct
52 Correct 50 ms 10364 KB Output is correct
53 Correct 28 ms 5480 KB Output is correct
54 Correct 5 ms 3024 KB Output is correct
55 Correct 5 ms 3400 KB Output is correct
56 Correct 23 ms 5320 KB Output is correct
57 Correct 18 ms 11340 KB Output is correct
58 Correct 16 ms 3908 KB Output is correct
59 Correct 20 ms 4352 KB Output is correct
60 Correct 21 ms 4936 KB Output is correct
61 Correct 21 ms 4300 KB Output is correct
62 Correct 37 ms 9452 KB Output is correct
63 Correct 313 ms 32924 KB Output is correct
64 Correct 353 ms 35820 KB Output is correct
65 Correct 917 ms 53972 KB Output is correct
66 Execution timed out 1102 ms 129516 KB Time limit exceeded
67 Halted 0 ms 0 KB -