oj.uz

Submission #244741

# Submission time Handle Problem Language Result Execution time Memory
244741 2020-07-04T20:48:30 Z uacoder123 Jakarta Skyscrapers (APIO15_skyscraper) C++14
22 / 100
 258 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=2;
    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 85 ms 143352 KB Output is correct
2 Correct 100 ms 143352 KB Output is correct
3 Correct 85 ms 143352 KB Output is correct
4 Correct 94 ms 143352 KB Output is correct
5 Correct 85 ms 143480 KB Output is correct
6 Correct 93 ms 143352 KB Output is correct
7 Correct 96 ms 143352 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 143356 KB Output is correct
2 Correct 90 ms 143276 KB Output is correct
3 Correct 97 ms 143352 KB Output is correct
4 Correct 86 ms 143352 KB Output is correct
5 Correct 86 ms 143352 KB Output is correct
6 Correct 87 ms 143352 KB Output is correct
7 Correct 88 ms 143352 KB Output is correct
8 Correct 86 ms 143356 KB Output is correct
9 Correct 85 ms 143396 KB Output is correct
10 Correct 88 ms 143352 KB Output is correct
11 Correct 89 ms 143480 KB Output is correct
12 Correct 85 ms 143352 KB Output is correct
13 Correct 95 ms 143352 KB Output is correct
14 Correct 89 ms 143608 KB Output is correct
15 Correct 91 ms 143480 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 143352 KB Output is correct
2 Correct 86 ms 143352 KB Output is correct
3 Correct 85 ms 143352 KB Output is correct
4 Correct 88 ms 143352 KB Output is correct
5 Correct 97 ms 143364 KB Output is correct
6 Correct 85 ms 143352 KB Output is correct
7 Correct 86 ms 143280 KB Output is correct
8 Correct 85 ms 143352 KB Output is correct
9 Correct 90 ms 143356 KB Output is correct
10 Correct 89 ms 143352 KB Output is correct
11 Correct 95 ms 143528 KB Output is correct
12 Correct 95 ms 143352 KB Output is correct
13 Correct 87 ms 143352 KB Output is correct
14 Correct 94 ms 143508 KB Output is correct
15 Correct 94 ms 143480 KB Output is correct
16 Correct 86 ms 143480 KB Output is correct
17 Runtime error 242 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 143276 KB Output is correct
2 Correct 100 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 87 ms 143352 KB Output is correct
6 Correct 87 ms 143352 KB Output is correct
7 Correct 87 ms 143352 KB Output is correct
8 Correct 87 ms 143352 KB Output is correct
9 Correct 91 ms 143352 KB Output is correct
10 Correct 87 ms 143352 KB Output is correct
11 Correct 88 ms 143480 KB Output is correct
12 Correct 85 ms 143352 KB Output is correct
13 Correct 88 ms 143400 KB Output is correct
14 Correct 85 ms 143480 KB Output is correct
15 Correct 86 ms 143480 KB Output is correct
16 Correct 88 ms 143352 KB Output is correct
17 Runtime error 258 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 143352 KB Output is correct
2 Correct 86 ms 143352 KB Output is correct
3 Correct 85 ms 143388 KB Output is correct
4 Correct 86 ms 143352 KB Output is correct
5 Correct 84 ms 143352 KB Output is correct
6 Correct 87 ms 143352 KB Output is correct
7 Correct 95 ms 143352 KB Output is correct
8 Correct 87 ms 143352 KB Output is correct
9 Correct 85 ms 143352 KB Output is correct
10 Correct 90 ms 143352 KB Output is correct
11 Correct 89 ms 143608 KB Output is correct
12 Correct 89 ms 143352 KB Output is correct
13 Correct 87 ms 143352 KB Output is correct
14 Correct 96 ms 143480 KB Output is correct
15 Correct 89 ms 143480 KB Output is correct
16 Correct 87 ms 143480 KB Output is correct
17 Runtime error 255 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Halted 0 ms 0 KB -