oj.uz

Submission #399402

# Submission time Handle Problem Language Result Execution time Memory
399402 2021-05-05T16:46:34 Z MeGustaElArroz23 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 7804 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);
    int a=1,b=0;
    //for (int i=0;i<n;i++){
    //    if (b<a) v[i]=pii{a*(a-1)/2+b,a};
    //    else{b=0;a++;};
    //}
    //v[1]=pii{n-1,n-1};
    for (int 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 (int i=0;i<n;i++){
        pii x=v[i];
        for (int 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 (int 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);
    //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:14:9: warning: unused variable 'a' [-Wunused-variable]
   14 |     int a=1,b=0;
      |         ^
skyscraper.cpp:14:13: warning: unused variable 'b' [-Wunused-variable]
   14 |     int a=1,b=0;
      |             ^
skyscraper.cpp:69:13: warning: 'final' may be used uninitialized in this function [-Wmaybe-uninitialized]
   69 |             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 2 ms 204 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 22 ms 1484 KB Output is correct
12 Correct 3 ms 972 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 31 ms 1740 KB Output is correct
15 Correct 30 ms 1824 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 208 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 332 KB Output is correct
11 Correct 21 ms 1484 KB Output is correct
12 Correct 3 ms 972 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 30 ms 1732 KB Output is correct
15 Correct 30 ms 1784 KB Output is correct
16 Correct 5 ms 444 KB Output is correct
17 Correct 21 ms 968 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 332 KB Output is correct
21 Correct 9 ms 332 KB Output is correct
22 Correct 5 ms 424 KB Output is correct
23 Correct 7 ms 332 KB Output is correct
24 Correct 22 ms 476 KB Output is correct
25 Correct 24 ms 400 KB Output is correct
26 Correct 4 ms 460 KB Output is correct
27 Correct 19 ms 7312 KB Output is correct
28 Correct 24 ms 580 KB Output is correct
29 Correct 6 ms 584 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 4 ms 332 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 31 ms 1852 KB Output is correct
34 Correct 31 ms 1868 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 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 336 KB Output is correct
11 Correct 21 ms 1604 KB Output is correct
12 Correct 3 ms 972 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 31 ms 1736 KB Output is correct
15 Correct 30 ms 1760 KB Output is correct
16 Correct 5 ms 460 KB Output is correct
17 Correct 21 ms 972 KB Output is correct
18 Correct 7 ms 336 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 9 ms 360 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 460 KB Output is correct
25 Correct 26 ms 432 KB Output is correct
26 Correct 3 ms 460 KB Output is correct
27 Correct 19 ms 7324 KB Output is correct
28 Correct 24 ms 580 KB Output is correct
29 Correct 6 ms 588 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 4 ms 332 KB Output is correct
32 Correct 3 ms 460 KB Output is correct
33 Correct 30 ms 1800 KB Output is correct
34 Correct 33 ms 1752 KB Output is correct
35 Execution timed out 1088 ms 7768 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 208 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 208 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 22 ms 1580 KB Output is correct
12 Correct 3 ms 972 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 30 ms 1840 KB Output is correct
15 Correct 31 ms 1768 KB Output is correct
16 Correct 5 ms 460 KB Output is correct
17 Correct 21 ms 952 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 332 KB Output is correct
21 Correct 9 ms 332 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 560 KB Output is correct
25 Correct 24 ms 412 KB Output is correct
26 Correct 4 ms 460 KB Output is correct
27 Correct 21 ms 7584 KB Output is correct
28 Correct 24 ms 588 KB Output is correct
29 Correct 6 ms 588 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 4 ms 332 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 31 ms 1732 KB Output is correct
34 Correct 31 ms 1760 KB Output is correct
35 Execution timed out 1090 ms 7804 KB Time limit exceeded
36 Halted 0 ms 0 KB -