oj.uz

Submission #399369

# Submission time Handle Problem Language Result Execution time Memory
399369 2021-05-05T15:44:42 Z MeGustaElArroz23 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 81176 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;
    vvii conexiones(n);
    
    for (ll i=0;i<n;i++){
        pii x=v[i];
        for (ll j=0;j<n;j++){
            pii y=v[j];
            if (i==j) continue;
            if (y.first%x.second==x.first%x.second) conexiones[i].push_back(pii{abs(x.first-y.first)/x.second,j});
        }
    }
    priority_queue<pii> cola;
    cola.push(pii{0,0});
    bool T=true;
    vi porvisitar(n,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==1){
                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 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 3 ms 460 KB Output is correct
11 Correct 51 ms 5052 KB Output is correct
12 Correct 688 ms 80676 KB Output is correct
13 Correct 695 ms 80996 KB Output is correct
14 Correct 59 ms 4236 KB Output is correct
15 Correct 58 ms 4276 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 216 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 4 ms 460 KB Output is correct
11 Correct 51 ms 5056 KB Output is correct
12 Correct 717 ms 80664 KB Output is correct
13 Correct 687 ms 81052 KB Output is correct
14 Correct 59 ms 4284 KB Output is correct
15 Correct 58 ms 4192 KB Output is correct
16 Correct 10 ms 856 KB Output is correct
17 Correct 40 ms 2148 KB Output is correct
18 Correct 12 ms 332 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 694 ms 81176 KB Output is correct
21 Correct 16 ms 460 KB Output is correct
22 Correct 7 ms 332 KB Output is correct
23 Correct 12 ms 420 KB Output is correct
24 Correct 41 ms 800 KB Output is correct
25 Correct 46 ms 580 KB Output is correct
26 Correct 111 ms 58436 KB Output is correct
27 Correct 629 ms 76744 KB Output is correct
28 Correct 46 ms 772 KB Output is correct
29 Correct 9 ms 980 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 6 ms 460 KB Output is correct
32 Correct 4 ms 460 KB Output is correct
33 Correct 59 ms 4180 KB Output is correct
34 Correct 60 ms 4280 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 3 ms 588 KB Output is correct
11 Correct 51 ms 5112 KB Output is correct
12 Correct 695 ms 80652 KB Output is correct
13 Correct 704 ms 81004 KB Output is correct
14 Correct 59 ms 4236 KB Output is correct
15 Correct 58 ms 4188 KB Output is correct
16 Correct 11 ms 844 KB Output is correct
17 Correct 40 ms 2116 KB Output is correct
18 Correct 12 ms 332 KB Output is correct
19 Correct 6 ms 332 KB Output is correct
20 Correct 703 ms 81024 KB Output is correct
21 Correct 16 ms 496 KB Output is correct
22 Correct 7 ms 364 KB Output is correct
23 Correct 12 ms 460 KB Output is correct
24 Correct 42 ms 708 KB Output is correct
25 Correct 45 ms 560 KB Output is correct
26 Correct 107 ms 58436 KB Output is correct
27 Correct 611 ms 76772 KB Output is correct
28 Correct 46 ms 832 KB Output is correct
29 Correct 10 ms 944 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 7 ms 460 KB Output is correct
32 Correct 4 ms 460 KB Output is correct
33 Correct 59 ms 4220 KB Output is correct
34 Correct 64 ms 4160 KB Output is correct
35 Execution timed out 1084 ms 11136 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 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 3 ms 460 KB Output is correct
11 Correct 53 ms 5196 KB Output is correct
12 Correct 735 ms 80708 KB Output is correct
13 Correct 755 ms 81016 KB Output is correct
14 Correct 58 ms 4156 KB Output is correct
15 Correct 58 ms 4228 KB Output is correct
16 Correct 10 ms 808 KB Output is correct
17 Correct 41 ms 2060 KB Output is correct
18 Correct 12 ms 332 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 712 ms 81080 KB Output is correct
21 Correct 17 ms 460 KB Output is correct
22 Correct 7 ms 336 KB Output is correct
23 Correct 12 ms 428 KB Output is correct
24 Correct 41 ms 708 KB Output is correct
25 Correct 45 ms 548 KB Output is correct
26 Correct 110 ms 58556 KB Output is correct
27 Correct 651 ms 76864 KB Output is correct
28 Correct 48 ms 828 KB Output is correct
29 Correct 9 ms 888 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 6 ms 552 KB Output is correct
32 Correct 4 ms 460 KB Output is correct
33 Correct 60 ms 4208 KB Output is correct
34 Correct 60 ms 4200 KB Output is correct
35 Execution timed out 1087 ms 11192 KB Time limit exceeded
36 Halted 0 ms 0 KB -