oj.uz

Submission #244669

# Submission time Handle Problem Language Result Execution time Memory
244669 2020-07-04T14:11:11 Z uacoder123 Jakarta Skyscrapers (APIO15_skyscraper) C++14
22 / 100
 323 ms 262148 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[5430000];
lli dis[5430000];
set<ii> s;
lli dij(lli so,lli t)
{
  for(lli i=0;i<5430000;++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 n,m,rn;
    cin>>n>>m;
    rn=sqrt(n)+1;
    ii dg[m];
    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));
        lli p=f+se;
        while(p<n)
        {
          al[se*n+p-se].pb(mp(se*n+p,1));
          al[se*n+p].pb(mp(se*n+p-se,1));
          al[se*n+p-se].pb(mp(rn*n+p,1));
          al[se*n+p].pb(mp(rn*n+p-se,1));      
          p+=se;
        }
        p=f-se;
        while(p>=0)
        {
          al[se*n+p+se].pb(mp(se*n+p,1));
          al[se*n+p].pb(mp(se*n+p+se,1));
          al[se*n+p].pb(mp(rn*n+p+se,1));
          al[se*n+p+se].pb(mp(rn*n+p,1));
          p-=se;
        }
      }
      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 99 ms 149112 KB Output is correct
2 Correct 93 ms 149112 KB Output is correct
3 Correct 95 ms 149112 KB Output is correct
4 Correct 91 ms 149112 KB Output is correct
5 Correct 90 ms 149112 KB Output is correct
6 Correct 91 ms 149112 KB Output is correct
7 Correct 100 ms 149116 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 149112 KB Output is correct
2 Correct 101 ms 149112 KB Output is correct
3 Correct 94 ms 149240 KB Output is correct
4 Correct 93 ms 149112 KB Output is correct
5 Correct 92 ms 149112 KB Output is correct
6 Correct 91 ms 149028 KB Output is correct
7 Correct 90 ms 149112 KB Output is correct
8 Correct 94 ms 149240 KB Output is correct
9 Correct 101 ms 149240 KB Output is correct
10 Correct 92 ms 149112 KB Output is correct
11 Correct 93 ms 149368 KB Output is correct
12 Correct 105 ms 155768 KB Output is correct
13 Correct 105 ms 155896 KB Output is correct
14 Correct 96 ms 149164 KB Output is correct
15 Correct 101 ms 149244 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 149192 KB Output is correct
2 Correct 99 ms 149112 KB Output is correct
3 Correct 100 ms 149112 KB Output is correct
4 Correct 92 ms 149112 KB Output is correct
5 Correct 92 ms 149112 KB Output is correct
6 Correct 91 ms 149112 KB Output is correct
7 Correct 103 ms 149072 KB Output is correct
8 Correct 98 ms 149176 KB Output is correct
9 Correct 92 ms 149112 KB Output is correct
10 Correct 94 ms 149368 KB Output is correct
11 Correct 92 ms 149368 KB Output is correct
12 Correct 105 ms 155768 KB Output is correct
13 Correct 105 ms 155896 KB Output is correct
14 Correct 98 ms 149240 KB Output is correct
15 Correct 104 ms 149240 KB Output is correct
16 Correct 95 ms 149240 KB Output is correct
17 Correct 98 ms 149880 KB Output is correct
18 Correct 95 ms 149240 KB Output is correct
19 Correct 93 ms 149372 KB Output is correct
20 Runtime error 323 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
21 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 149112 KB Output is correct
2 Correct 102 ms 149112 KB Output is correct
3 Correct 104 ms 149116 KB Output is correct
4 Correct 91 ms 149112 KB Output is correct
5 Correct 90 ms 149040 KB Output is correct
6 Correct 91 ms 149112 KB Output is correct
7 Correct 97 ms 149112 KB Output is correct
8 Correct 91 ms 149112 KB Output is correct
9 Correct 93 ms 149112 KB Output is correct
10 Correct 97 ms 149112 KB Output is correct
11 Correct 97 ms 149496 KB Output is correct
12 Correct 120 ms 155768 KB Output is correct
13 Correct 106 ms 155896 KB Output is correct
14 Correct 101 ms 149240 KB Output is correct
15 Correct 104 ms 149244 KB Output is correct
16 Correct 91 ms 149368 KB Output is correct
17 Correct 95 ms 149876 KB Output is correct
18 Correct 95 ms 149368 KB Output is correct
19 Correct 108 ms 149240 KB Output is correct
20 Runtime error 312 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
21 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 149112 KB Output is correct
2 Correct 103 ms 149112 KB Output is correct
3 Correct 94 ms 149140 KB Output is correct
4 Correct 103 ms 149088 KB Output is correct
5 Correct 104 ms 149240 KB Output is correct
6 Correct 93 ms 149112 KB Output is correct
7 Correct 93 ms 149116 KB Output is correct
8 Correct 95 ms 149112 KB Output is correct
9 Correct 105 ms 149112 KB Output is correct
10 Correct 94 ms 149240 KB Output is correct
11 Correct 103 ms 149368 KB Output is correct
12 Correct 111 ms 155816 KB Output is correct
13 Correct 106 ms 155896 KB Output is correct
14 Correct 93 ms 149240 KB Output is correct
15 Correct 95 ms 149240 KB Output is correct
16 Correct 102 ms 149368 KB Output is correct
17 Correct 96 ms 149884 KB Output is correct
18 Correct 94 ms 149324 KB Output is correct
19 Correct 99 ms 149192 KB Output is correct
20 Runtime error 309 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
21 Halted 0 ms 0 KB -