oj.uz

Submission #244703

# Submission time Handle Problem Language Result Execution time Memory
244703 2020-07-04T16:08:03 Z uacoder123 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 349 ms 249212 KB 
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
 
typedef int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
vector<ii> al[5220000];
lli dis[5220000],n;
set<ii> s;
lli dij(lli so,lli t)
{
  for(lli i=0;i<5220000;++i)
    dis[i]=1000000000;
  s.insert(mp(0,so));
  dis[so]=0;
  while(s.size()!=0)
  {
    ii v=(*s.begin());
    s.erase(s.begin());
    dis[v.S]=v.F;
    for(lli i=0;i<al[v.S].size();++i)
    {
      if(al[v.S][i].S+v.F<dis[al[v.S][i].F])
      {
       s.erase(mp(dis[al[v.S][i].F],al[v.S][i].F));
       dis[al[v.S][i].F]=al[v.S][i].S+v.F;
       s.insert(mp(dis[al[v.S][i].F],al[v.S][i].F)); 
      }
    }
  }
  if(dis[t]==1000000000)
    return(-1);
  return(dis[t]);
}
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  lli test=1;
  for(;test>0;--test)
  {
    lli m,rn;
    cin>>n>>m;
    rn=sqrt(n)+1;
    ii dg[m];
    map<ii,int> ma;
    for(lli i=0;i<m;++i)
    {
      lli f,se;
      cin>>f>>se;
      dg[i]=mp(f,se);
      if(se<rn)
      {
        al[rn*n+f].pb(mp((se)*n+f,0));
        al[se*n+f].pb(mp(rn*n+f,0));
        if(se==0||ma.find(mp(f%se,se))!=ma.end())
          continue;
        ma[mp(f%se,se)]=1;
        for(lli j=f%se;j<n;j+=se)
        {
          if(j+se<n)
          {
            al[se*n+j].pb(mp(se*n+j+se,1));
            al[se*n+j+se].pb(mp(se*n+j,1));
          }
          if(j+se<n)
            al[se*n+j].pb(mp(rn*n+j+se,1));
          if(j-se>=0)
            al[se*n+j].pb(mp(rn*n+j-  se,1));
        }
      }
      if(se>=rn)
      {
        lli p=f+se;
        while(p<n)
        {
          al[rn*n+f].pb(mp(rn*n+p,(p-f)/se));
          p+=se;
        }
        p=f-se;
        while(p>=0)
        {
          al[rn*n+f].pb(mp(rn*n+p,(f-p)/se));
          p-=se;
        }
      }
    }
    cout<<dij(rn*n+dg[0].F,rn*n+dg[1].F)<<endl;
  }
  return(0);
}

Compilation message

skyscraper.cpp: In function 'lli dij(lli, lli)':
skyscraper.cpp:31:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(lli i=0;i<al[v.S].size();++i)
                 ~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 143352 KB Output is correct
2 Correct 86 ms 143352 KB Output is correct
3 Correct 92 ms 143352 KB Output is correct
4 Correct 90 ms 143352 KB Output is correct
5 Correct 90 ms 143352 KB Output is correct
6 Correct 90 ms 143352 KB Output is correct
7 Correct 93 ms 143352 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 143376 KB Output is correct
2 Correct 87 ms 143352 KB Output is correct
3 Correct 99 ms 143352 KB Output is correct
4 Correct 88 ms 143352 KB Output is correct
5 Correct 93 ms 143352 KB Output is correct
6 Correct 88 ms 143352 KB Output is correct
7 Correct 87 ms 143352 KB Output is correct
8 Correct 89 ms 143324 KB Output is correct
9 Correct 88 ms 143352 KB Output is correct
10 Correct 94 ms 143352 KB Output is correct
11 Correct 92 ms 143480 KB Output is correct
12 Correct 88 ms 143480 KB Output is correct
13 Correct 89 ms 143352 KB Output is correct
14 Correct 94 ms 143480 KB Output is correct
15 Correct 100 ms 143480 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 143308 KB Output is correct
2 Correct 89 ms 143352 KB Output is correct
3 Correct 92 ms 143356 KB Output is correct
4 Correct 91 ms 143352 KB Output is correct
5 Correct 88 ms 143352 KB Output is correct
6 Correct 89 ms 143328 KB Output is correct
7 Correct 96 ms 143352 KB Output is correct
8 Correct 91 ms 143352 KB Output is correct
9 Correct 91 ms 143352 KB Output is correct
10 Correct 93 ms 143352 KB Output is correct
11 Correct 94 ms 143480 KB Output is correct
12 Correct 91 ms 143352 KB Output is correct
13 Correct 88 ms 143352 KB Output is correct
14 Correct 98 ms 143480 KB Output is correct
15 Correct 93 ms 143480 KB Output is correct
16 Correct 96 ms 143480 KB Output is correct
17 Correct 94 ms 143736 KB Output is correct
18 Correct 90 ms 143608 KB Output is correct
19 Correct 88 ms 143480 KB Output is correct
20 Correct 105 ms 143584 KB Output is correct
21 Correct 89 ms 143352 KB Output is correct
22 Correct 90 ms 143480 KB Output is correct
23 Correct 100 ms 143592 KB Output is correct
24 Correct 99 ms 143736 KB Output is correct
25 Correct 95 ms 143608 KB Output is correct
26 Correct 91 ms 143740 KB Output is correct
27 Correct 91 ms 143608 KB Output is correct
28 Correct 105 ms 144120 KB Output is correct
29 Correct 109 ms 146296 KB Output is correct
30 Correct 96 ms 144248 KB Output is correct
31 Correct 100 ms 144888 KB Output is correct
32 Correct 98 ms 144248 KB Output is correct
33 Correct 124 ms 147704 KB Output is correct
34 Correct 119 ms 147704 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 143352 KB Output is correct
2 Correct 100 ms 143352 KB Output is correct
3 Correct 103 ms 143352 KB Output is correct
4 Correct 90 ms 143352 KB Output is correct
5 Correct 92 ms 143516 KB Output is correct
6 Correct 97 ms 143352 KB Output is correct
7 Correct 99 ms 143352 KB Output is correct
8 Correct 91 ms 143352 KB Output is correct
9 Correct 89 ms 143352 KB Output is correct
10 Correct 100 ms 143356 KB Output is correct
11 Correct 88 ms 143480 KB Output is correct
12 Correct 91 ms 143352 KB Output is correct
13 Correct 97 ms 143480 KB Output is correct
14 Correct 90 ms 143608 KB Output is correct
15 Correct 88 ms 143480 KB Output is correct
16 Correct 94 ms 143480 KB Output is correct
17 Correct 92 ms 143736 KB Output is correct
18 Correct 92 ms 143480 KB Output is correct
19 Correct 89 ms 143480 KB Output is correct
20 Correct 90 ms 143608 KB Output is correct
21 Correct 89 ms 143352 KB Output is correct
22 Correct 100 ms 143480 KB Output is correct
23 Correct 98 ms 143608 KB Output is correct
24 Correct 91 ms 143736 KB Output is correct
25 Correct 91 ms 143608 KB Output is correct
26 Correct 91 ms 143736 KB Output is correct
27 Correct 90 ms 143608 KB Output is correct
28 Correct 92 ms 144120 KB Output is correct
29 Correct 110 ms 146296 KB Output is correct
30 Correct 106 ms 144120 KB Output is correct
31 Correct 100 ms 144888 KB Output is correct
32 Correct 93 ms 144120 KB Output is correct
33 Correct 118 ms 147704 KB Output is correct
34 Correct 131 ms 147704 KB Output is correct
35 Correct 111 ms 145656 KB Output is correct
36 Correct 94 ms 143736 KB Output is correct
37 Correct 129 ms 147576 KB Output is correct
38 Correct 119 ms 147064 KB Output is correct
39 Correct 140 ms 147092 KB Output is correct
40 Correct 130 ms 146936 KB Output is correct
41 Correct 139 ms 146936 KB Output is correct
42 Correct 97 ms 144548 KB Output is correct
43 Correct 98 ms 144500 KB Output is correct
44 Correct 107 ms 144440 KB Output is correct
45 Correct 145 ms 151160 KB Output is correct
46 Correct 134 ms 151160 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 143352 KB Output is correct
2 Correct 98 ms 143356 KB Output is correct
3 Correct 88 ms 143352 KB Output is correct
4 Correct 89 ms 143352 KB Output is correct
5 Correct 88 ms 143352 KB Output is correct
6 Correct 88 ms 143272 KB Output is correct
7 Correct 93 ms 143352 KB Output is correct
8 Correct 97 ms 143352 KB Output is correct
9 Correct 90 ms 143352 KB Output is correct
10 Correct 89 ms 143480 KB Output is correct
11 Correct 92 ms 143480 KB Output is correct
12 Correct 89 ms 143352 KB Output is correct
13 Correct 89 ms 143352 KB Output is correct
14 Correct 90 ms 143480 KB Output is correct
15 Correct 93 ms 143480 KB Output is correct
16 Correct 92 ms 143480 KB Output is correct
17 Correct 93 ms 143736 KB Output is correct
18 Correct 91 ms 143480 KB Output is correct
19 Correct 91 ms 143480 KB Output is correct
20 Correct 92 ms 143608 KB Output is correct
21 Correct 110 ms 143480 KB Output is correct
22 Correct 91 ms 143608 KB Output is correct
23 Correct 90 ms 143608 KB Output is correct
24 Correct 94 ms 143736 KB Output is correct
25 Correct 92 ms 143608 KB Output is correct
26 Correct 92 ms 143736 KB Output is correct
27 Correct 106 ms 143608 KB Output is correct
28 Correct 93 ms 144120 KB Output is correct
29 Correct 110 ms 146296 KB Output is correct
30 Correct 106 ms 144248 KB Output is correct
31 Correct 106 ms 144904 KB Output is correct
32 Correct 105 ms 144120 KB Output is correct
33 Correct 120 ms 147704 KB Output is correct
34 Correct 121 ms 147704 KB Output is correct
35 Correct 107 ms 145656 KB Output is correct
36 Correct 101 ms 143796 KB Output is correct
37 Correct 124 ms 147516 KB Output is correct
38 Correct 135 ms 147064 KB Output is correct
39 Correct 119 ms 147064 KB Output is correct
40 Correct 123 ms 147064 KB Output is correct
41 Correct 125 ms 147064 KB Output is correct
42 Correct 96 ms 144644 KB Output is correct
43 Correct 106 ms 144500 KB Output is correct
44 Correct 100 ms 144364 KB Output is correct
45 Correct 132 ms 151160 KB Output is correct
46 Correct 145 ms 151288 KB Output is correct
47 Correct 349 ms 164984 KB Output is correct
48 Correct 120 ms 150520 KB Output is correct
49 Correct 117 ms 146808 KB Output is correct
50 Correct 117 ms 147576 KB Output is correct
51 Runtime error 206 ms 249212 KB Execution killed with signal 11 (could be triggered by violating memory limits)
52 Halted 0 ms 0 KB -