oj.uz

Submission #244742

# Submission time Handle Problem Language Result Execution time Memory
244742 2020-07-04T20:49:37 Z uacoder123 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 286 ms 262144 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;
priority_queue<ii,vector<ii>,greater<ii>> s;
map<ii,int> ma;
 
lli dij(lli so,lli t)
{
  for(lli i=0;i<5220000;++i)
    dis[i]=1000000000;
  s.push(mp(0,so));
  dis[so%10000000]=0;
  while(s.size()!=0)
  {
    if(s.size()>rn*n+n)
        exit(1);
    ii v=(s.top());
    s.pop();
    if(dis[v.S]!=v.F)
      continue;
    if(v.S==t)
      return(v.F);
    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])
      {
       dis[al[v.S][i]%10000000]=al[v.S][i]/10000000+v.F;
       s.push(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,t1=0;
    int g = -1;
    cin>>n>>m;
    rn=80;
    for(lli i=0;i<m;++i)
    {
      lli f,se;
      cin>>f>>se;
    
      g = (g==-1)?se:__gcd(g, se);
      if(i==0) from = f;
      if(i==1) to = f;
        if(ma.find(mp(f, se))==ma.end()) {
        ma[mp(f, se)] = 1;
      } else continue;
      if(se<rn)
      {
        al[rn*n+f].pb((se)*n+f+0*10000000);
        al[se*n+f].pb(rn*n+f+0*10000000);
        t1+=2;
      }
      if(se>=rn)
      {
        lli p=f+se;
        while(p<n)
        {
          al[rn*n+f].pb(rn*n+p+((p-f)/se)*10000000);
          p+=se;
          t1++;
        }
        p=f-se;
        while(p>=0)
        {
          al[rn*n+f].pb(rn*n+p+((f-p)/se)*10000000);
          p-=se;
          t1++;
        }
      }
    }
    if(abs(to-from)%g!=0) cout << -1 << endl;
    else cout<<dij(rn*n+from,rn*n+to)<<endl;
  }
  return(0);
}

Compilation message

skyscraper.cpp: In function 'lli dij(lli, lli)':
skyscraper.cpp:30:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(s.size()>rn*n+n)
        ~~~~~~~~^~~~~~~
skyscraper.cpp:50: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:121:37: warning: 'from' may be used uninitialized in this function [-Wmaybe-uninitialized]
     else cout<<dij(rn*n+from,rn*n+to)<<endl;
                                     ^
skyscraper.cpp:121:37: warning: 'to' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 143352 KB Output is correct
2 Correct 87 ms 143352 KB Output is correct
3 Correct 85 ms 143352 KB Output is correct
4 Correct 86 ms 143352 KB Output is correct
5 Correct 93 ms 143352 KB Output is correct
6 Correct 86 ms 143356 KB Output is correct
7 Correct 87 ms 143352 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 143480 KB Output is correct
2 Correct 97 ms 143352 KB Output is correct
3 Correct 88 ms 143352 KB Output is correct
4 Correct 89 ms 143480 KB Output is correct
5 Correct 87 ms 143352 KB Output is correct
6 Correct 88 ms 143352 KB Output is correct
7 Correct 88 ms 143352 KB Output is correct
8 Correct 93 ms 143352 KB Output is correct
9 Correct 84 ms 143352 KB Output is correct
10 Correct 85 ms 143352 KB Output is correct
11 Correct 97 ms 143480 KB Output is correct
12 Correct 87 ms 143352 KB Output is correct
13 Correct 91 ms 143388 KB Output is correct
14 Correct 89 ms 143612 KB Output is correct
15 Correct 92 ms 143608 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 143352 KB Output is correct
2 Correct 86 ms 143356 KB Output is correct
3 Correct 85 ms 143384 KB Output is correct
4 Correct 86 ms 143352 KB Output is correct
5 Correct 88 ms 143352 KB Output is correct
6 Correct 86 ms 143300 KB Output is correct
7 Correct 85 ms 143352 KB Output is correct
8 Correct 86 ms 143352 KB Output is correct
9 Correct 92 ms 143352 KB Output is correct
10 Correct 96 ms 143352 KB Output is correct
11 Correct 86 ms 143480 KB Output is correct
12 Correct 86 ms 143352 KB Output is correct
13 Correct 86 ms 143356 KB Output is correct
14 Correct 97 ms 143736 KB Output is correct
15 Correct 90 ms 143608 KB Output is correct
16 Correct 94 ms 143352 KB Output is correct
17 Correct 88 ms 143480 KB Output is correct
18 Correct 87 ms 143480 KB Output is correct
19 Correct 86 ms 143352 KB Output is correct
20 Correct 88 ms 143736 KB Output is correct
21 Correct 93 ms 143480 KB Output is correct
22 Correct 93 ms 143480 KB Output is correct
23 Correct 88 ms 143480 KB Output is correct
24 Correct 96 ms 143480 KB Output is correct
25 Correct 94 ms 143480 KB Output is correct
26 Correct 92 ms 143480 KB Output is correct
27 Correct 93 ms 143480 KB Output is correct
28 Correct 90 ms 143840 KB Output is correct
29 Correct 106 ms 145272 KB Output is correct
30 Correct 90 ms 143864 KB Output is correct
31 Correct 98 ms 144376 KB Output is correct
32 Correct 101 ms 144120 KB Output is correct
33 Correct 128 ms 147232 KB Output is correct
34 Correct 107 ms 145528 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 143352 KB Output is correct
2 Correct 87 ms 143352 KB Output is correct
3 Correct 95 ms 143352 KB Output is correct
4 Correct 89 ms 143480 KB Output is correct
5 Correct 85 ms 143356 KB Output is correct
6 Correct 97 ms 143352 KB Output is correct
7 Correct 84 ms 143352 KB Output is correct
8 Correct 85 ms 143352 KB Output is correct
9 Correct 87 ms 143352 KB Output is correct
10 Correct 88 ms 143352 KB Output is correct
11 Correct 96 ms 143480 KB Output is correct
12 Correct 87 ms 143352 KB Output is correct
13 Correct 89 ms 143480 KB Output is correct
14 Correct 96 ms 143760 KB Output is correct
15 Correct 94 ms 143608 KB Output is correct
16 Correct 86 ms 143480 KB Output is correct
17 Correct 87 ms 143608 KB Output is correct
18 Correct 85 ms 143352 KB Output is correct
19 Correct 85 ms 143480 KB Output is correct
20 Correct 95 ms 143736 KB Output is correct
21 Correct 86 ms 143480 KB Output is correct
22 Correct 86 ms 143352 KB Output is correct
23 Correct 87 ms 143480 KB Output is correct
24 Correct 90 ms 143480 KB Output is correct
25 Correct 93 ms 143608 KB Output is correct
26 Correct 87 ms 143508 KB Output is correct
27 Correct 87 ms 143480 KB Output is correct
28 Correct 91 ms 143864 KB Output is correct
29 Correct 112 ms 145272 KB Output is correct
30 Correct 91 ms 143864 KB Output is correct
31 Correct 95 ms 144376 KB Output is correct
32 Correct 98 ms 144184 KB Output is correct
33 Correct 123 ms 147320 KB Output is correct
34 Correct 105 ms 145528 KB Output is correct
35 Correct 104 ms 145272 KB Output is correct
36 Correct 89 ms 143736 KB Output is correct
37 Correct 115 ms 145272 KB Output is correct
38 Correct 109 ms 145784 KB Output is correct
39 Correct 113 ms 145700 KB Output is correct
40 Correct 111 ms 145784 KB Output is correct
41 Correct 110 ms 145784 KB Output is correct
42 Correct 97 ms 143472 KB Output is correct
43 Correct 94 ms 143480 KB Output is correct
44 Correct 95 ms 143736 KB Output is correct
45 Correct 162 ms 151896 KB Output is correct
46 Correct 122 ms 147956 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 143352 KB Output is correct
2 Correct 97 ms 143352 KB Output is correct
3 Correct 85 ms 143308 KB Output is correct
4 Correct 86 ms 143352 KB Output is correct
5 Correct 85 ms 143352 KB Output is correct
6 Correct 86 ms 143352 KB Output is correct
7 Correct 86 ms 143352 KB Output is correct
8 Correct 88 ms 143352 KB Output is correct
9 Correct 88 ms 143352 KB Output is correct
10 Correct 85 ms 143352 KB Output is correct
11 Correct 87 ms 143480 KB Output is correct
12 Correct 85 ms 143352 KB Output is correct
13 Correct 85 ms 143352 KB Output is correct
14 Correct 90 ms 143736 KB Output is correct
15 Correct 94 ms 143612 KB Output is correct
16 Correct 96 ms 143352 KB Output is correct
17 Correct 89 ms 143480 KB Output is correct
18 Correct 94 ms 143400 KB Output is correct
19 Correct 88 ms 143352 KB Output is correct
20 Correct 89 ms 143864 KB Output is correct
21 Correct 94 ms 143352 KB Output is correct
22 Correct 86 ms 143480 KB Output is correct
23 Correct 88 ms 143428 KB Output is correct
24 Correct 89 ms 143480 KB Output is correct
25 Correct 92 ms 143480 KB Output is correct
26 Correct 94 ms 143480 KB Output is correct
27 Correct 97 ms 143480 KB Output is correct
28 Correct 101 ms 143864 KB Output is correct
29 Correct 105 ms 145272 KB Output is correct
30 Correct 101 ms 143864 KB Output is correct
31 Correct 95 ms 144376 KB Output is correct
32 Correct 103 ms 144120 KB Output is correct
33 Correct 125 ms 147192 KB Output is correct
34 Correct 116 ms 145528 KB Output is correct
35 Correct 104 ms 145272 KB Output is correct
36 Correct 89 ms 143736 KB Output is correct
37 Correct 110 ms 145272 KB Output is correct
38 Correct 111 ms 145784 KB Output is correct
39 Correct 116 ms 145692 KB Output is correct
40 Correct 117 ms 145684 KB Output is correct
41 Correct 124 ms 145912 KB Output is correct
42 Correct 93 ms 143480 KB Output is correct
43 Correct 92 ms 143484 KB Output is correct
44 Correct 96 ms 143736 KB Output is correct
45 Correct 154 ms 151744 KB Output is correct
46 Correct 120 ms 147960 KB Output is correct
47 Correct 116 ms 147844 KB Output is correct
48 Correct 105 ms 145528 KB Output is correct
49 Correct 112 ms 145400 KB Output is correct
50 Correct 98 ms 144888 KB Output is correct
51 Runtime error 286 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
52 Halted 0 ms 0 KB -