oj.uz

Submission #735362

# Submission time Handle Problem Language Result Execution time Memory
735362 2023-05-04T03:58:59 Z ReLice Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 1000 ms 188352 KB 
#include <bits/stdc++.h>
#define ll int
#define ld long double
#define pb push_back
#define endl "\n"
#define fr first
#define sc second
#define sz size()
#define bc back()
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}*/
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=1e9+7;
const ll mod=1e9+7;
const ll N=2e3+7;
ll n,l,r,d[N];
vector <set <pair<ll,ll>> > g(N);
void dijkstra(ll val){
    set <pair<ll,ll>> q;
    q.insert({0,val});
    d[val]=0;
    while(!q.empty()){
        ll x=q.begin()->sc;
        q.erase(q.begin());
        for(auto i : g[x]){
            ll len=i.sc,to=i.fr;
            if(d[to]>d[x]+len){
                q.erase({d[to], to});
                d[to]=d[x]+len;
                q.insert({d[to],to});
            }
        }
    }
}
void solve(){
    ll i,j,q,sum=0,ans=0,b,mx=-1,c=1,m,t;
    ll k;
    cin>>n>>m;
    for(i=0;i<m;i++){
        cin>>b>>t;
        if(i==0) k=b;
        if(i==1) q=b;
        c=0;
        for(j=b+t;j<n;j+=t){
            c++;
            g[b].insert({j,c});
        }
        c=0;
        for(j=b-t;j>=0;j-=t){
            c++;
            g[b].insert({j,c});
        }
    }
    for(i=0;i<n;i++) d[i]=inf;
    dijkstra(k);
    if(d[q]==inf) cout<<-1<<endl;
    else cout<<d[q]<<endl;
}
signed main(){
    //start();
    //fre("");
    ll t=1;
    //cin>>t;
    while(t--) solve();
}
/*
5 3
0 2
1 1
4 1
*/

Compilation message

skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:45:14: warning: unused variable 'sum' [-Wunused-variable]
   45 |     ll i,j,q,sum=0,ans=0,b,mx=-1,c=1,m,t;
      |              ^~~
skyscraper.cpp:45:20: warning: unused variable 'ans' [-Wunused-variable]
   45 |     ll i,j,q,sum=0,ans=0,b,mx=-1,c=1,m,t;
      |                    ^~~
skyscraper.cpp:45:28: warning: unused variable 'mx' [-Wunused-variable]
   45 |     ll i,j,q,sum=0,ans=0,b,mx=-1,c=1,m,t;
      |                            ^~
skyscraper.cpp:64:13: warning: 'k' may be used uninitialized in this function [-Wmaybe-uninitialized]
   64 |     dijkstra(k);
      |     ~~~~~~~~^~~
skyscraper.cpp:65:11: warning: 'q' may be used uninitialized in this function [-Wmaybe-uninitialized]
   65 |     if(d[q]==inf) cout<<-1<<endl;
      |        ~~~^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 5 ms 408 KB Output is correct
13 Correct 6 ms 824 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 5 ms 1304 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 552 ms 188296 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 3 ms 980 KB Output is correct
25 Correct 4 ms 724 KB Output is correct
26 Correct 166 ms 924 KB Output is correct
27 Correct 159 ms 688 KB Output is correct
28 Correct 4 ms 1364 KB Output is correct
29 Correct 14 ms 3412 KB Output is correct
30 Correct 4 ms 1336 KB Output is correct
31 Correct 8 ms 2004 KB Output is correct
32 Correct 7 ms 1620 KB Output is correct
33 Correct 28 ms 6048 KB Output is correct
34 Correct 31 ms 6092 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 6 ms 864 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 5 ms 1364 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 549 ms 188352 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 3 ms 980 KB Output is correct
25 Correct 3 ms 724 KB Output is correct
26 Correct 162 ms 972 KB Output is correct
27 Correct 159 ms 716 KB Output is correct
28 Correct 4 ms 1332 KB Output is correct
29 Correct 15 ms 3404 KB Output is correct
30 Correct 5 ms 1364 KB Output is correct
31 Correct 8 ms 2112 KB Output is correct
32 Correct 5 ms 1620 KB Output is correct
33 Correct 34 ms 6036 KB Output is correct
34 Correct 35 ms 6000 KB Output is correct
35 Correct 36 ms 6476 KB Output is correct
36 Correct 6 ms 1108 KB Output is correct
37 Correct 65 ms 13444 KB Output is correct
38 Correct 52 ms 10388 KB Output is correct
39 Correct 62 ms 11384 KB Output is correct
40 Correct 60 ms 10684 KB Output is correct
41 Correct 59 ms 10232 KB Output is correct
42 Execution timed out 1084 ms 1028 KB Time limit exceeded
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 4 ms 1412 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 556 ms 188204 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 5 ms 980 KB Output is correct
25 Correct 3 ms 788 KB Output is correct
26 Correct 163 ms 924 KB Output is correct
27 Correct 159 ms 668 KB Output is correct
28 Correct 4 ms 1360 KB Output is correct
29 Correct 15 ms 3412 KB Output is correct
30 Correct 5 ms 1364 KB Output is correct
31 Correct 8 ms 2036 KB Output is correct
32 Correct 6 ms 1620 KB Output is correct
33 Correct 32 ms 6048 KB Output is correct
34 Correct 30 ms 6104 KB Output is correct
35 Correct 34 ms 6560 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 68 ms 13468 KB Output is correct
38 Correct 62 ms 10364 KB Output is correct
39 Correct 62 ms 11312 KB Output is correct
40 Correct 59 ms 10732 KB Output is correct
41 Correct 61 ms 10240 KB Output is correct
42 Execution timed out 1085 ms 1100 KB Time limit exceeded
43 Halted 0 ms 0 KB -