oj.uz

Submission #511364

# Submission time Handle Problem Language Result Execution time Memory
511364 2022-01-15T16:32:53 Z CaoHuuKhuongDuy Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 27096 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];
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);
          }
        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 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 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 972 KB Output is correct
9 Correct 1 ms 1100 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 1 ms 1100 KB Output is correct
14 Correct 1 ms 1100 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 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 972 KB Output is correct
9 Correct 1 ms 1100 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 1 ms 1100 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 1 ms 2380 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 2252 KB Output is correct
24 Correct 2 ms 2508 KB Output is correct
25 Correct 1 ms 2380 KB Output is correct
26 Correct 2 ms 2508 KB Output is correct
27 Correct 2 ms 2484 KB Output is correct
28 Correct 3 ms 2508 KB Output is correct
29 Correct 7 ms 2380 KB Output is correct
30 Correct 3 ms 2380 KB Output is correct
31 Correct 5 ms 2508 KB Output is correct
32 Correct 3 ms 2508 KB Output is correct
33 Correct 14 ms 2636 KB Output is correct
34 Correct 10 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 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 972 KB Output is correct
9 Correct 1 ms 1100 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 1 ms 1100 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 1 ms 2380 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 1 ms 1408 KB Output is correct
22 Correct 1 ms 2252 KB Output is correct
23 Correct 2 ms 2252 KB Output is correct
24 Correct 3 ms 2508 KB Output is correct
25 Correct 2 ms 2380 KB Output is correct
26 Correct 2 ms 2508 KB Output is correct
27 Correct 2 ms 2380 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 2380 KB Output is correct
31 Correct 5 ms 2504 KB Output is correct
32 Correct 3 ms 2508 KB Output is correct
33 Correct 13 ms 2636 KB Output is correct
34 Correct 9 ms 2636 KB Output is correct
35 Correct 7 ms 2764 KB Output is correct
36 Correct 2 ms 2012 KB Output is correct
37 Correct 6 ms 3148 KB Output is correct
38 Correct 7 ms 3276 KB Output is correct
39 Correct 6 ms 3148 KB Output is correct
40 Correct 7 ms 3140 KB Output is correct
41 Correct 6 ms 3276 KB Output is correct
42 Correct 5 ms 2636 KB Output is correct
43 Correct 4 ms 2636 KB Output is correct
44 Correct 5 ms 2980 KB Output is correct
45 Correct 54 ms 3048 KB Output is correct
46 Correct 41 ms 3048 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 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 972 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 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 1 ms 1740 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 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 2252 KB Output is correct
24 Correct 2 ms 2508 KB Output is correct
25 Correct 2 ms 2380 KB Output is correct
26 Correct 2 ms 2508 KB Output is correct
27 Correct 2 ms 2380 KB Output is correct
28 Correct 3 ms 2508 KB Output is correct
29 Correct 7 ms 2380 KB Output is correct
30 Correct 3 ms 2380 KB Output is correct
31 Correct 5 ms 2380 KB Output is correct
32 Correct 3 ms 2540 KB Output is correct
33 Correct 14 ms 2636 KB Output is correct
34 Correct 9 ms 2636 KB Output is correct
35 Correct 6 ms 2764 KB Output is correct
36 Correct 2 ms 1996 KB Output is correct
37 Correct 5 ms 3148 KB Output is correct
38 Correct 10 ms 3288 KB Output is correct
39 Correct 7 ms 3164 KB Output is correct
40 Correct 6 ms 3148 KB Output is correct
41 Correct 7 ms 3256 KB Output is correct
42 Correct 5 ms 2636 KB Output is correct
43 Correct 5 ms 2636 KB Output is correct
44 Correct 5 ms 2892 KB Output is correct
45 Correct 55 ms 3048 KB Output is correct
46 Correct 44 ms 3072 KB Output is correct
47 Correct 14 ms 12428 KB Output is correct
48 Correct 14 ms 18112 KB Output is correct
49 Correct 13 ms 19532 KB Output is correct
50 Correct 13 ms 21032 KB Output is correct
51 Correct 28 ms 23676 KB Output is correct
52 Correct 39 ms 23732 KB Output is correct
53 Correct 19 ms 22512 KB Output is correct
54 Correct 15 ms 21680 KB Output is correct
55 Correct 16 ms 21708 KB Output is correct
56 Correct 24 ms 27096 KB Output is correct
57 Correct 12 ms 26060 KB Output is correct
58 Correct 24 ms 21964 KB Output is correct
59 Correct 25 ms 22092 KB Output is correct
60 Correct 24 ms 22348 KB Output is correct
61 Correct 25 ms 22220 KB Output is correct
62 Correct 59 ms 22988 KB Output is correct
63 Correct 70 ms 24004 KB Output is correct
64 Correct 78 ms 23992 KB Output is correct
65 Execution timed out 1025 ms 23944 KB Time limit exceeded
66 Halted 0 ms 0 KB -