oj.uz

Submission #244722

# Submission time Handle Problem Language Result Execution time Memory
244722 2020-07-04T18:15:44 Z uacoder123 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 275 ms 248952 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<int> al[5220000];
lli dis[5220000],n,rn;
set<ii> s;
map<ii,int> ma;
 
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;
    if(v.S<rn*n)
    {
    if(v.S%n+v.S/n<n)
        al[v.S].pb(v.S+v.S/n+1*10000000);
      if(v.S%n-v.S/n>=0)
        al[v.S].pb(v.S-v.S/n+1*10000000);
    if(v.S%n+v.S/n<n)
        al[v.S].pb(rn*n+v.S%n+v.S/n+1*10000000);
      if(v.S%n-v.S/n>=0)
        al[v.S].pb(rn*n+v.S%n-v.S/n+1*10000000);
    }
    for(lli i=0;i<al[v.S].size();++i)
    {
      if(al[v.S][i]/10000000+v.F<dis[al[v.S][i]%10000000])
      {
       s.erase(mp(dis[al[v.S][i]%10000000],al[v.S][i]%10000000));
       dis[al[v.S][i]%10000000]=al[v.S][i]/10000000+v.F;
       s.insert(mp(dis[al[v.S][i]%10000000],al[v.S][i]%10000000)); 
      }
    }
    if(v.S<rn*n)
    {
    if(v.S%n+v.S/n<n)
        al[v.S].pop_back();
      if(v.S%n+v.S/n>=0)
        al[v.S].pop_back();
      if(v.S%n+v.S/n<n)
        al[v.S].pop_back();
      if(v.S%n-v.S/n>=0)
        al[v.S].pop_back();
    }
  }
  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, from, to;
    cin>>n>>m;
    rn=sqrt(n)+1;
    for(lli i=0;i<m;++i)
    {
      lli f,se;
      cin>>f>>se;
      if(i==0) from = f;
      if(i==1) to = f;
      if(se<rn)
      {
        al[rn*n+f].pb((se)*n+f+0*10000000);
        al[se*n+f].pb(rn*n+f+0*10000000);
      }
      if(se>=rn)
      {
        lli p=f+se;
        while(p<n)
        {
          al[rn*n+f].pb(rn*n+p+((p-f)/se)*10000000);
          p+=se;
        }
        p=f-se;
        while(p>=0)
        {
          al[rn*n+f].pb(rn*n+p+((f-p)/se)*10000000);
          p-=se;
        }
      }
    }
    cout<<dij(rn*n+from,rn*n+to)<<endl;
  }
  return(0);
}

Compilation message

skyscraper.cpp: In function 'lli dij(lli, lli)':
skyscraper.cpp:44:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(lli i=0;i<al[v.S].size();++i)
                 ~^~~~~~~~~~~~~~~
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:106:32: warning: 'to' may be used uninitialized in this function [-Wmaybe-uninitialized]
     cout<<dij(rn*n+from,rn*n+to)<<endl;
                                ^
skyscraper.cpp:106:32: warning: 'from' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 143352 KB Output is correct
2 Correct 91 ms 143352 KB Output is correct
3 Correct 90 ms 143352 KB Output is correct
4 Correct 96 ms 143352 KB Output is correct
5 Correct 91 ms 143400 KB Output is correct
6 Correct 94 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 91 ms 143352 KB Output is correct
2 Correct 93 ms 143356 KB Output is correct
3 Correct 91 ms 143352 KB Output is correct
4 Correct 92 ms 143352 KB Output is correct
5 Correct 91 ms 143352 KB Output is correct
6 Correct 91 ms 143352 KB Output is correct
7 Correct 94 ms 143352 KB Output is correct
8 Correct 94 ms 143352 KB Output is correct
9 Correct 96 ms 143352 KB Output is correct
10 Correct 98 ms 143352 KB Output is correct
11 Correct 93 ms 143352 KB Output is correct
12 Correct 91 ms 143352 KB Output is correct
13 Correct 93 ms 143356 KB Output is correct
14 Correct 93 ms 143352 KB Output is correct
15 Correct 93 ms 143352 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 143352 KB Output is correct
2 Correct 111 ms 143352 KB Output is correct
3 Correct 103 ms 143480 KB Output is correct
4 Correct 108 ms 143356 KB Output is correct
5 Correct 93 ms 143352 KB Output is correct
6 Correct 90 ms 143352 KB Output is correct
7 Correct 91 ms 143352 KB Output is correct
8 Correct 93 ms 143352 KB Output is correct
9 Correct 102 ms 143352 KB Output is correct
10 Correct 91 ms 143352 KB Output is correct
11 Correct 96 ms 143352 KB Output is correct
12 Correct 104 ms 143352 KB Output is correct
13 Correct 92 ms 143352 KB Output is correct
14 Correct 93 ms 143540 KB Output is correct
15 Correct 97 ms 143352 KB Output is correct
16 Correct 92 ms 143356 KB Output is correct
17 Correct 99 ms 143608 KB Output is correct
18 Correct 95 ms 143352 KB Output is correct
19 Correct 103 ms 143352 KB Output is correct
20 Correct 95 ms 143608 KB Output is correct
21 Correct 102 ms 143284 KB Output is correct
22 Correct 92 ms 143352 KB Output is correct
23 Correct 91 ms 143480 KB Output is correct
24 Correct 95 ms 143692 KB Output is correct
25 Correct 93 ms 143480 KB Output is correct
26 Correct 99 ms 143608 KB Output is correct
27 Correct 96 ms 143608 KB Output is correct
28 Correct 97 ms 143864 KB Output is correct
29 Correct 117 ms 145304 KB Output is correct
30 Correct 108 ms 143864 KB Output is correct
31 Correct 112 ms 144376 KB Output is correct
32 Correct 97 ms 143736 KB Output is correct
33 Correct 128 ms 146068 KB Output is correct
34 Correct 119 ms 146168 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 102 ms 143352 KB Output is correct
3 Correct 92 ms 143352 KB Output is correct
4 Correct 92 ms 143352 KB Output is correct
5 Correct 93 ms 143328 KB Output is correct
6 Correct 91 ms 143352 KB Output is correct
7 Correct 91 ms 143352 KB Output is correct
8 Correct 92 ms 143352 KB Output is correct
9 Correct 92 ms 143484 KB Output is correct
10 Correct 90 ms 143352 KB Output is correct
11 Correct 95 ms 143480 KB Output is correct
12 Correct 97 ms 143352 KB Output is correct
13 Correct 91 ms 143332 KB Output is correct
14 Correct 92 ms 143328 KB Output is correct
15 Correct 99 ms 143480 KB Output is correct
16 Correct 95 ms 143456 KB Output is correct
17 Correct 103 ms 143608 KB Output is correct
18 Correct 93 ms 143352 KB Output is correct
19 Correct 102 ms 143352 KB Output is correct
20 Correct 93 ms 143608 KB Output is correct
21 Correct 93 ms 143356 KB Output is correct
22 Correct 95 ms 143352 KB Output is correct
23 Correct 96 ms 143396 KB Output is correct
24 Correct 96 ms 143608 KB Output is correct
25 Correct 93 ms 143480 KB Output is correct
26 Correct 93 ms 143608 KB Output is correct
27 Correct 96 ms 143540 KB Output is correct
28 Correct 103 ms 143864 KB Output is correct
29 Correct 112 ms 145272 KB Output is correct
30 Correct 96 ms 143864 KB Output is correct
31 Correct 109 ms 144376 KB Output is correct
32 Correct 107 ms 143864 KB Output is correct
33 Correct 139 ms 146168 KB Output is correct
34 Correct 129 ms 146144 KB Output is correct
35 Correct 120 ms 144632 KB Output is correct
36 Correct 94 ms 143608 KB Output is correct
37 Correct 131 ms 145784 KB Output is correct
38 Correct 120 ms 145400 KB Output is correct
39 Correct 130 ms 145400 KB Output is correct
40 Correct 129 ms 145412 KB Output is correct
41 Correct 121 ms 145400 KB Output is correct
42 Correct 108 ms 143736 KB Output is correct
43 Correct 98 ms 143740 KB Output is correct
44 Correct 103 ms 143936 KB Output is correct
45 Correct 129 ms 147780 KB Output is correct
46 Correct 129 ms 147832 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 143356 KB Output is correct
2 Correct 94 ms 143352 KB Output is correct
3 Correct 92 ms 143352 KB Output is correct
4 Correct 94 ms 143352 KB Output is correct
5 Correct 93 ms 143352 KB Output is correct
6 Correct 99 ms 143352 KB Output is correct
7 Correct 92 ms 143352 KB Output is correct
8 Correct 95 ms 143376 KB Output is correct
9 Correct 92 ms 143352 KB Output is correct
10 Correct 94 ms 143352 KB Output is correct
11 Correct 96 ms 143484 KB Output is correct
12 Correct 101 ms 143352 KB Output is correct
13 Correct 95 ms 143480 KB Output is correct
14 Correct 100 ms 143352 KB Output is correct
15 Correct 91 ms 143480 KB Output is correct
16 Correct 92 ms 143352 KB Output is correct
17 Correct 93 ms 143608 KB Output is correct
18 Correct 94 ms 143352 KB Output is correct
19 Correct 96 ms 143352 KB Output is correct
20 Correct 96 ms 143612 KB Output is correct
21 Correct 100 ms 143352 KB Output is correct
22 Correct 100 ms 143352 KB Output is correct
23 Correct 100 ms 143480 KB Output is correct
24 Correct 98 ms 143608 KB Output is correct
25 Correct 107 ms 143480 KB Output is correct
26 Correct 102 ms 143608 KB Output is correct
27 Correct 96 ms 143584 KB Output is correct
28 Correct 105 ms 143864 KB Output is correct
29 Correct 128 ms 145272 KB Output is correct
30 Correct 98 ms 143868 KB Output is correct
31 Correct 103 ms 144376 KB Output is correct
32 Correct 106 ms 143864 KB Output is correct
33 Correct 124 ms 146168 KB Output is correct
34 Correct 130 ms 146144 KB Output is correct
35 Correct 120 ms 144632 KB Output is correct
36 Correct 107 ms 143648 KB Output is correct
37 Correct 133 ms 145784 KB Output is correct
38 Correct 125 ms 145400 KB Output is correct
39 Correct 135 ms 145528 KB Output is correct
40 Correct 131 ms 145400 KB Output is correct
41 Correct 136 ms 145400 KB Output is correct
42 Correct 100 ms 143736 KB Output is correct
43 Correct 105 ms 143736 KB Output is correct
44 Correct 113 ms 143788 KB Output is correct
45 Correct 140 ms 147832 KB Output is correct
46 Correct 139 ms 147832 KB Output is correct
47 Correct 275 ms 156792 KB Output is correct
48 Correct 110 ms 143992 KB Output is correct
49 Correct 99 ms 143992 KB Output is correct
50 Correct 99 ms 143864 KB Output is correct
51 Runtime error 211 ms 248952 KB Execution killed with signal 11 (could be triggered by violating memory limits)
52 Halted 0 ms 0 KB -