oj.uz

Submission #511362

# Submission time Handle Problem Language Result Execution time Memory
511362 2022-01-15T16:31:34 Z CaoHuuKhuongDuy Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 27500 KB 
#include <bits/stdc++.h>
using namespace std;
#define gc() (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
namespace IO {
  const int SIZE = 1 << 23;
  char ibuf[SIZE], *iS, *iT;
  char obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1;
  bool flush() {
    fwrite(obuf, 1, oS - obuf, stdout);
    oS = obuf;
    return true;
  }
  #define gc() (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
  #define pc(x) (*oS++ = x) 
  int read() {
    int x = 0, f = 0;
    char c = gc();
    while (!isdigit(c)) f |= c == '-', c = gc();
    while (isdigit(c)) x = 10 * x + c - '0', c = gc();
    return f ? -x : x;
  }
  char qu[55]; int qlen;
  template <class T> void print(T x) {
    if (!x) pc('0');
    if (x < 0) pc('-'), x = -x;
    while (x) qu[++qlen] = x % 10 + '0', x /= 10;
    while (qlen) pc(qu[qlen--]);
  }
  template <class T> void print(T x, char charset) {
    print(x), pc(charset);
  }
  struct Flusher {
    ~Flusher() {
      flush();
    }
  } flusher;
}
using namespace IO;
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];
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];
        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])
            {
              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;
    n=read();
    m=read();
    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++)
      {
        a[i]=read();
        p[i]=read();
        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 1024 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 1024 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 1024 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 1160 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 1024 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 1020 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 972 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 1100 KB Output is correct
15 Correct 1 ms 1152 KB Output is correct
16 Correct 1 ms 1160 KB Output is correct
17 Correct 1 ms 1740 KB Output is correct
18 Correct 1 ms 2380 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 1288 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 2440 KB Output is correct
26 Correct 2 ms 2508 KB Output is correct
27 Correct 2 ms 2436 KB Output is correct
28 Correct 3 ms 2508 KB Output is correct
29 Correct 8 ms 2380 KB Output is correct
30 Correct 4 ms 2432 KB Output is correct
31 Correct 6 ms 2380 KB Output is correct
32 Correct 4 ms 2508 KB Output is correct
33 Correct 14 ms 2572 KB Output is correct
34 Correct 10 ms 2656 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 1024 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1140 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 1156 KB Output is correct
15 Correct 1 ms 1160 KB Output is correct
16 Correct 1 ms 1228 KB Output is correct
17 Correct 1 ms 1740 KB Output is correct
18 Correct 1 ms 2380 KB Output is correct
19 Correct 1 ms 2432 KB Output is correct
20 Correct 2 ms 2704 KB Output is correct
21 Correct 1 ms 1284 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 2508 KB Output is correct
26 Correct 2 ms 2508 KB Output is correct
27 Correct 2 ms 2424 KB Output is correct
28 Correct 2 ms 2508 KB Output is correct
29 Correct 7 ms 2508 KB Output is correct
30 Correct 3 ms 2380 KB Output is correct
31 Correct 5 ms 2432 KB Output is correct
32 Correct 3 ms 2432 KB Output is correct
33 Correct 15 ms 2764 KB Output is correct
34 Correct 10 ms 2652 KB Output is correct
35 Correct 6 ms 3276 KB Output is correct
36 Correct 2 ms 2124 KB Output is correct
37 Correct 4 ms 3404 KB Output is correct
38 Correct 4 ms 3840 KB Output is correct
39 Correct 4 ms 3712 KB Output is correct
40 Correct 4 ms 3660 KB Output is correct
41 Correct 4 ms 3844 KB Output is correct
42 Correct 2 ms 3020 KB Output is correct
43 Correct 3 ms 3016 KB Output is correct
44 Correct 3 ms 3404 KB Output is correct
45 Correct 52 ms 3460 KB Output is correct
46 Correct 41 ms 3536 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 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 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 1 ms 1100 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 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 1 ms 2380 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 2 ms 2380 KB Output is correct
23 Correct 2 ms 2252 KB Output is correct
24 Correct 2 ms 2508 KB Output is correct
25 Correct 3 ms 2508 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 8 ms 2436 KB Output is correct
30 Correct 3 ms 2380 KB Output is correct
31 Correct 8 ms 2380 KB Output is correct
32 Correct 3 ms 2428 KB Output is correct
33 Correct 19 ms 2656 KB Output is correct
34 Correct 9 ms 2636 KB Output is correct
35 Correct 4 ms 3160 KB Output is correct
36 Correct 2 ms 2084 KB Output is correct
37 Correct 5 ms 3356 KB Output is correct
38 Correct 5 ms 3788 KB Output is correct
39 Correct 4 ms 3712 KB Output is correct
40 Correct 4 ms 3660 KB Output is correct
41 Correct 4 ms 3788 KB Output is correct
42 Correct 3 ms 3012 KB Output is correct
43 Correct 2 ms 3020 KB Output is correct
44 Correct 3 ms 3404 KB Output is correct
45 Correct 54 ms 3448 KB Output is correct
46 Correct 49 ms 3444 KB Output is correct
47 Correct 13 ms 12804 KB Output is correct
48 Correct 10 ms 18556 KB Output is correct
49 Correct 14 ms 19916 KB Output is correct
50 Correct 11 ms 21280 KB Output is correct
51 Correct 24 ms 24288 KB Output is correct
52 Correct 26 ms 24428 KB Output is correct
53 Correct 16 ms 23116 KB Output is correct
54 Correct 14 ms 21640 KB Output is correct
55 Correct 16 ms 21628 KB Output is correct
56 Correct 22 ms 27500 KB Output is correct
57 Correct 12 ms 26060 KB Output is correct
58 Correct 21 ms 22088 KB Output is correct
59 Correct 22 ms 22500 KB Output is correct
60 Correct 24 ms 22604 KB Output is correct
61 Correct 23 ms 22508 KB Output is correct
62 Correct 48 ms 23576 KB Output is correct
63 Correct 66 ms 24268 KB Output is correct
64 Correct 75 ms 24280 KB Output is correct
65 Execution timed out 1032 ms 24176 KB Time limit exceeded
66 Halted 0 ms 0 KB -