oj.uz

Submission #511268

# Submission time Handle Problem Language Result Execution time Memory
511268 2022-01-15T13:30:30 Z CaoHuuKhuongDuy Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 48156 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
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];
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();
       // 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);
          }
        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 1020 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 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 0 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 1056 KB Output is correct
7 Correct 1 ms 1028 KB Output is correct
8 Correct 1 ms 1028 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 2 ms 1288 KB Output is correct
12 Correct 1 ms 1164 KB Output is correct
13 Correct 1 ms 1228 KB Output is correct
14 Correct 1 ms 1164 KB Output is correct
15 Correct 1 ms 1228 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 972 KB Output is correct
3 Correct 1 ms 1000 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 1028 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 1 ms 1228 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1228 KB Output is correct
16 Correct 1 ms 1356 KB Output is correct
17 Correct 4 ms 2252 KB Output is correct
18 Correct 2 ms 3472 KB Output is correct
19 Correct 2 ms 3788 KB Output is correct
20 Correct 2 ms 4108 KB Output is correct
21 Correct 2 ms 1684 KB Output is correct
22 Correct 2 ms 3532 KB Output is correct
23 Correct 2 ms 3360 KB Output is correct
24 Correct 3 ms 3916 KB Output is correct
25 Correct 3 ms 3916 KB Output is correct
26 Correct 2 ms 3856 KB Output is correct
27 Correct 4 ms 3788 KB Output is correct
28 Correct 4 ms 3836 KB Output is correct
29 Correct 8 ms 3844 KB Output is correct
30 Correct 3 ms 3788 KB Output is correct
31 Correct 6 ms 3916 KB Output is correct
32 Correct 4 ms 3972 KB Output is correct
33 Correct 15 ms 4172 KB Output is correct
34 Correct 15 ms 4172 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 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 972 KB Output is correct
8 Correct 1 ms 1028 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Correct 1 ms 1228 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1228 KB Output is correct
16 Correct 1 ms 1328 KB Output is correct
17 Correct 4 ms 2252 KB Output is correct
18 Correct 2 ms 3532 KB Output is correct
19 Correct 2 ms 3828 KB Output is correct
20 Correct 2 ms 4172 KB Output is correct
21 Correct 1 ms 1612 KB Output is correct
22 Correct 2 ms 3588 KB Output is correct
23 Correct 4 ms 3404 KB Output is correct
24 Correct 5 ms 3916 KB Output is correct
25 Correct 3 ms 3916 KB Output is correct
26 Correct 3 ms 3916 KB Output is correct
27 Correct 2 ms 3796 KB Output is correct
28 Correct 3 ms 3916 KB Output is correct
29 Correct 8 ms 3888 KB Output is correct
30 Correct 4 ms 3788 KB Output is correct
31 Correct 6 ms 3916 KB Output is correct
32 Correct 3 ms 3968 KB Output is correct
33 Correct 15 ms 4176 KB Output is correct
34 Correct 19 ms 4156 KB Output is correct
35 Correct 21 ms 4356 KB Output is correct
36 Correct 4 ms 2892 KB Output is correct
37 Correct 33 ms 4936 KB Output is correct
38 Correct 34 ms 5372 KB Output is correct
39 Correct 33 ms 5388 KB Output is correct
40 Correct 31 ms 5420 KB Output is correct
41 Correct 31 ms 5488 KB Output is correct
42 Correct 9 ms 4488 KB Output is correct
43 Correct 5 ms 4428 KB Output is correct
44 Correct 5 ms 4804 KB Output is correct
45 Correct 55 ms 5188 KB Output is correct
46 Correct 52 ms 5188 KB Output is correct

Subtask #5
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 1028 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Correct 1 ms 1228 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1228 KB Output is correct
16 Correct 1 ms 1356 KB Output is correct
17 Correct 4 ms 2252 KB Output is correct
18 Correct 2 ms 3532 KB Output is correct
19 Correct 2 ms 3844 KB Output is correct
20 Correct 3 ms 4172 KB Output is correct
21 Correct 1 ms 1612 KB Output is correct
22 Correct 2 ms 3532 KB Output is correct
23 Correct 4 ms 3404 KB Output is correct
24 Correct 4 ms 3916 KB Output is correct
25 Correct 3 ms 3788 KB Output is correct
26 Correct 3 ms 3916 KB Output is correct
27 Correct 2 ms 3856 KB Output is correct
28 Correct 3 ms 3916 KB Output is correct
29 Correct 10 ms 3788 KB Output is correct
30 Correct 4 ms 3716 KB Output is correct
31 Correct 9 ms 3844 KB Output is correct
32 Correct 4 ms 3972 KB Output is correct
33 Correct 15 ms 4172 KB Output is correct
34 Correct 16 ms 4176 KB Output is correct
35 Correct 31 ms 4300 KB Output is correct
36 Correct 4 ms 2904 KB Output is correct
37 Correct 30 ms 4940 KB Output is correct
38 Correct 31 ms 5480 KB Output is correct
39 Correct 36 ms 5452 KB Output is correct
40 Correct 31 ms 5380 KB Output is correct
41 Correct 32 ms 5440 KB Output is correct
42 Correct 7 ms 4420 KB Output is correct
43 Correct 6 ms 4488 KB Output is correct
44 Correct 6 ms 4712 KB Output is correct
45 Correct 54 ms 5196 KB Output is correct
46 Correct 56 ms 5192 KB Output is correct
47 Correct 188 ms 21820 KB Output is correct
48 Correct 20 ms 34636 KB Output is correct
49 Correct 27 ms 37356 KB Output is correct
50 Correct 20 ms 40644 KB Output is correct
51 Correct 76 ms 45312 KB Output is correct
52 Correct 95 ms 45440 KB Output is correct
53 Correct 41 ms 43844 KB Output is correct
54 Correct 25 ms 42408 KB Output is correct
55 Correct 25 ms 42380 KB Output is correct
56 Correct 33 ms 48156 KB Output is correct
57 Correct 104 ms 46828 KB Output is correct
58 Correct 34 ms 42924 KB Output is correct
59 Correct 36 ms 43076 KB Output is correct
60 Correct 40 ms 43404 KB Output is correct
61 Correct 45 ms 43272 KB Output is correct
62 Correct 76 ms 44152 KB Output is correct
63 Correct 93 ms 46648 KB Output is correct
64 Correct 105 ms 46596 KB Output is correct
65 Execution timed out 1072 ms 46588 KB Time limit exceeded
66 Halted 0 ms 0 KB -