oj.uz

Submission #399390

# Submission time Handle Problem Language Result Execution time Memory
399390 2021-05-05T16:21:21 Z MeGustaElArroz23 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 14448 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;
typedef vector<pii> vii;
typedef vector<vii> vvii;

int main(){
    ll l,n;
    cin >> l >> n;
    vii v(n);
    for (ll i=0;i<n;i++) cin >> v[i].first >> v[i].second;
    pii in=v[0];
    pii fin=v[1];
    sort(v.begin(),v.end());
    int inicio,final;
    for (int i=0;i<n;i++){
        if (v[i]==in) inicio=i;
        if (v[i]==fin) final=i;
    }

    vvii conexiones(n);
    
    for (ll i=0;i<n;i++){
        pii x=v[i];
        for (ll j=i-1;j>=0;j--){
            pii y=v[j];
            if (y.first%x.second==x.first%x.second){
                conexiones[i].push_back(pii{abs(x.first-y.first)/x.second,j});
                if (x.second==y.second) break;
            }
        }
        for (ll j=i+1;j<n;j++){
            pii y=v[j];
            if (y.first%x.second==x.first%x.second){
                conexiones[i].push_back(pii{abs(x.first-y.first)/x.second,j});
                if (x.second==y.second) break;
            }
        }
    }
    priority_queue<pii> cola;
    cola.push(pii{0,inicio});
    bool T=true;
    vi porvisitar(n,true);
    //cerr << final << '\n';
    //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';
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:57:27: warning: 'final' may be used uninitialized in this function [-Wmaybe-uninitialized]
   57 |             if (x.second==final){
      |                           ^~~~~

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 204 KB Output is correct
7 Correct 1 ms 204 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 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 2 ms 460 KB Output is correct
11 Correct 22 ms 2780 KB Output is correct
12 Correct 3 ms 1480 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 31 ms 3228 KB Output is correct
15 Correct 33 ms 3268 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 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 2 ms 460 KB Output is correct
11 Correct 21 ms 2720 KB Output is correct
12 Correct 3 ms 1480 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 31 ms 3276 KB Output is correct
15 Correct 31 ms 3220 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 21 ms 1540 KB Output is correct
18 Correct 7 ms 332 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 9 ms 508 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 7 ms 332 KB Output is correct
24 Correct 23 ms 668 KB Output is correct
25 Correct 24 ms 600 KB Output is correct
26 Correct 4 ms 716 KB Output is correct
27 Correct 21 ms 14264 KB Output is correct
28 Correct 25 ms 732 KB Output is correct
29 Correct 6 ms 844 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 4 ms 460 KB Output is correct
32 Correct 3 ms 464 KB Output is correct
33 Correct 31 ms 3324 KB Output is correct
34 Correct 31 ms 3276 KB Output is correct

Subtask #4
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 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 2 ms 460 KB Output is correct
11 Correct 22 ms 2848 KB Output is correct
12 Correct 3 ms 1480 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 32 ms 3268 KB Output is correct
15 Correct 31 ms 3236 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 22 ms 1612 KB Output is correct
18 Correct 7 ms 372 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 9 ms 492 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 7 ms 332 KB Output is correct
24 Correct 22 ms 716 KB Output is correct
25 Correct 23 ms 588 KB Output is correct
26 Correct 4 ms 716 KB Output is correct
27 Correct 21 ms 14256 KB Output is correct
28 Correct 24 ms 728 KB Output is correct
29 Correct 6 ms 844 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 4 ms 460 KB Output is correct
32 Correct 3 ms 460 KB Output is correct
33 Correct 31 ms 3268 KB Output is correct
34 Correct 32 ms 3272 KB Output is correct
35 Execution timed out 1091 ms 14356 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 208 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 3 ms 464 KB Output is correct
11 Correct 22 ms 2808 KB Output is correct
12 Correct 3 ms 1480 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 33 ms 3320 KB Output is correct
15 Correct 31 ms 3240 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 22 ms 1596 KB Output is correct
18 Correct 7 ms 332 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 9 ms 460 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 7 ms 460 KB Output is correct
24 Correct 22 ms 708 KB Output is correct
25 Correct 24 ms 588 KB Output is correct
26 Correct 4 ms 716 KB Output is correct
27 Correct 22 ms 14256 KB Output is correct
28 Correct 24 ms 784 KB Output is correct
29 Correct 6 ms 844 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 4 ms 460 KB Output is correct
32 Correct 3 ms 460 KB Output is correct
33 Correct 31 ms 3304 KB Output is correct
34 Correct 31 ms 3232 KB Output is correct
35 Execution timed out 1089 ms 14448 KB Time limit exceeded
36 Halted 0 ms 0 KB -