oj.uz

Submission #512579

# Submission time Handle Problem Language Result Execution time Memory
512579 2022-01-16T13:24:01 Z CaoHuuKhuongDuy Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 781 ms 27360 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=3e4+9;
const int oo=1e9+9;
typedef pair <int,int> ii;
typedef pair <int,ii> iii;
int can,n,m,a[N],p[N],f[N][176];
bool First[N],check[N][176],doge[N],FIrst[N];
vector <int> num[N];
priority_queue <iii,vector<iii>,greater<iii> > q;
void update(int x,int dist,int val)
{
    if (f[x][dist]>val)
      {
        f[x][dist]=val;
        q.push({val,{x,dist}});
      }
    if (num[x].size()==0||dist==0) return;
}
int solve()
{
    if (p[1]>=can) 
      {
        f[a[1]][0]=0;
        q.push({0,{a[1],0}});
      }
    else 
      {
        f[a[1]][p[1]]=0;
        q.push({0,{a[1],p[1]}});
      }
    int val,x,dist;
    while (!q.empty())
      {
        val=q.top().first;
        x=q.top().second.first;
        dist=q.top().second.second;
        q.pop();
        if (x==a[2]) return f[x][dist];
       // cout<<x<<" "<<dist<<" "<<val<<" "<<q.size()<<endl;
        if (f[x][dist]!=val) continue;
        if (!First[x])
          {
            First[x]=true;
            for (int i=0;i<can;i++)
              if (check[x][i]||i==0) update(x,i,val);
          }
        if (dist!=0)
          {
            if (x+dist<=n) update(x+dist,dist,f[x][dist]+1);
            if (x-dist>=1) update(x-dist,dist,f[x][dist]+1);
            continue;
          }
        if (FIrst[x]) continue;
        FIrst[x]=true;
        for (int xnew:num[x])
          {
            int dem=0;
            for (int i=x+p[xnew];i<=n;i+=p[xnew])
            {
              // cout<<i<<endl;
              dem++;
              update(i,0,val+dem);
            }
            dem=0;
            for (int i=x-p[xnew];i>=1;i-=p[xnew])
            {
                //cout<<i<<endl;
              dem++;
              update(i,0,val+dem);
            }
          }
         // break;
      }
    int res=oo;
    for (int i=0;i<=can;i++)
      res=min(res,f[a[2]][i]);
    if (res==oo) res=-1;
    return res;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
  // freopen("test.inp","r",stdin);
    cin>>n>>m;
    can=sqrt(n);
    for (int i=0;i<=n;i++)
      for (int j=0;j<=can;j++)
        f[i][j]=oo;
    for (int i=1;i<=m;i++)
      {
        cin>>a[i]>>p[i];
        doge[a[i]]=true;
        a[i]++;
        if (p[i]>=can) num[a[i]].push_back(i);
        else check[a[i]][p[i]]=true;
      }
    cout<<solve();
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1140 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1148 KB Output is correct
14 Correct 1 ms 1144 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 1016 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1028 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1008 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1160 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 2 ms 1092 KB Output is correct
15 Correct 1 ms 1164 KB Output is correct
16 Correct 1 ms 1228 KB Output is correct
17 Correct 1 ms 1680 KB Output is correct
18 Correct 2 ms 2252 KB Output is correct
19 Correct 1 ms 2380 KB Output is correct
20 Correct 2 ms 2704 KB Output is correct
21 Correct 1 ms 1356 KB Output is correct
22 Correct 2 ms 2252 KB Output is correct
23 Correct 2 ms 2252 KB Output is correct
24 Correct 2 ms 2576 KB Output is correct
25 Correct 2 ms 2448 KB Output is correct
26 Correct 2 ms 2440 KB Output is correct
27 Correct 2 ms 2508 KB Output is correct
28 Correct 3 ms 2508 KB Output is correct
29 Correct 8 ms 2508 KB Output is correct
30 Correct 4 ms 2380 KB Output is correct
31 Correct 5 ms 2436 KB Output is correct
32 Correct 3 ms 2508 KB Output is correct
33 Correct 11 ms 2624 KB Output is correct
34 Correct 7 ms 2636 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 1036 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1012 KB Output is correct
8 Correct 1 ms 1008 KB Output is correct
9 Correct 1 ms 1004 KB Output is correct
10 Correct 1 ms 1148 KB Output is correct
11 Correct 1 ms 1140 KB Output is correct
12 Correct 1 ms 1140 KB Output is correct
13 Correct 1 ms 1092 KB Output is correct
14 Correct 2 ms 1148 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 1 ms 1136 KB Output is correct
17 Correct 2 ms 1740 KB Output is correct
18 Correct 2 ms 2252 KB Output is correct
19 Correct 2 ms 2436 KB Output is correct
20 Correct 2 ms 2768 KB Output is correct
21 Correct 1 ms 1356 KB Output is correct
22 Correct 2 ms 2308 KB Output is correct
23 Correct 2 ms 2252 KB Output is correct
24 Correct 2 ms 2508 KB Output is correct
25 Correct 2 ms 2508 KB Output is correct
26 Correct 2 ms 2496 KB Output is correct
27 Correct 2 ms 2440 KB Output is correct
28 Correct 2 ms 2508 KB Output is correct
29 Correct 7 ms 2380 KB Output is correct
30 Correct 3 ms 2436 KB Output is correct
31 Correct 5 ms 2508 KB Output is correct
32 Correct 3 ms 2508 KB Output is correct
33 Correct 12 ms 2636 KB Output is correct
34 Correct 6 ms 2564 KB Output is correct
35 Correct 10 ms 3020 KB Output is correct
36 Correct 2 ms 2040 KB Output is correct
37 Correct 5 ms 3276 KB Output is correct
38 Correct 7 ms 3532 KB Output is correct
39 Correct 7 ms 3404 KB Output is correct
40 Correct 7 ms 3404 KB Output is correct
41 Correct 7 ms 3600 KB Output is correct
42 Correct 6 ms 2832 KB Output is correct
43 Correct 5 ms 2848 KB Output is correct
44 Correct 5 ms 3148 KB Output is correct
45 Correct 16 ms 3272 KB Output is correct
46 Correct 9 ms 3220 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 1028 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1020 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 1 ms 1228 KB Output is correct
17 Correct 2 ms 1740 KB Output is correct
18 Correct 2 ms 2252 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 1 ms 1356 KB Output is correct
22 Correct 1 ms 2252 KB Output is correct
23 Correct 2 ms 2188 KB Output is correct
24 Correct 2 ms 2508 KB Output is correct
25 Correct 2 ms 2628 KB Output is correct
26 Correct 2 ms 2508 KB Output is correct
27 Correct 2 ms 2508 KB Output is correct
28 Correct 2 ms 2508 KB Output is correct
29 Correct 7 ms 2444 KB Output is correct
30 Correct 3 ms 2424 KB Output is correct
31 Correct 5 ms 2380 KB Output is correct
32 Correct 3 ms 2436 KB Output is correct
33 Correct 14 ms 2636 KB Output is correct
34 Correct 7 ms 2632 KB Output is correct
35 Correct 7 ms 2992 KB Output is correct
36 Correct 3 ms 2064 KB Output is correct
37 Correct 6 ms 3224 KB Output is correct
38 Correct 8 ms 3532 KB Output is correct
39 Correct 7 ms 3448 KB Output is correct
40 Correct 8 ms 3440 KB Output is correct
41 Correct 7 ms 3532 KB Output is correct
42 Correct 5 ms 2820 KB Output is correct
43 Correct 5 ms 2828 KB Output is correct
44 Correct 5 ms 3152 KB Output is correct
45 Correct 18 ms 3272 KB Output is correct
46 Correct 9 ms 3280 KB Output is correct
47 Correct 23 ms 12716 KB Output is correct
48 Correct 13 ms 18424 KB Output is correct
49 Correct 13 ms 19788 KB Output is correct
50 Correct 13 ms 21196 KB Output is correct
51 Correct 29 ms 24072 KB Output is correct
52 Correct 30 ms 24104 KB Output is correct
53 Correct 18 ms 22832 KB Output is correct
54 Correct 15 ms 21752 KB Output is correct
55 Correct 17 ms 21708 KB Output is correct
56 Correct 26 ms 27360 KB Output is correct
57 Correct 13 ms 26188 KB Output is correct
58 Correct 26 ms 22080 KB Output is correct
59 Correct 29 ms 22300 KB Output is correct
60 Correct 24 ms 22452 KB Output is correct
61 Correct 26 ms 22524 KB Output is correct
62 Correct 46 ms 23324 KB Output is correct
63 Correct 58 ms 24016 KB Output is correct
64 Correct 62 ms 24088 KB Output is correct
65 Correct 267 ms 24000 KB Output is correct
66 Correct 781 ms 25448 KB Output is correct
67 Correct 415 ms 25528 KB Output is correct