oj.uz

답안 #245111

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
245111 2020-07-05T13:50:27 Z uacoder123 Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 368 ms 154932 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<long long int> al[5220000];
lli dis[5220000],n,rn;
map<ii,int> ma;
int minp=10000000, maxp=-1;
set<int> pset;
bool cmp(const ii& a,const ii& b)
{
  return (mp(a.F,mp(a.S%n, a.S/n)) > 
  mp(b.F,mp(b.S%n, b.S/n)));
}
 
lli dij(lli so,lli t)
{
  // priority_queue<ii,vector<ii>, decltype(&cmp)> s(&cmp);
  priority_queue<ii,vector<ii>, greater<ii>> s;
  // set<ii> s;
  for(lli i=0;i<5220000;++i)
    dis[i]=1000000000;
  s.push(mp(0,so));
  // s.insert(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();
    // ii v=*(s.begin());
    // s.erase(s.begin());
    if(dis[v.S]!=v.F)
      continue;
    if((v.S)%n==t)
      return(v.F);
    dis[v.S]=v.F;
    if(v.S<rn*n)
    {
      if(pset.find(v.S%n)!=pset.end())
        al[v.S].pb(v.S%n+rn*n);
      if(v.S%n+v.S/n<=maxp)
        al[v.S].pb(v.S+v.S/n+1LL*10000000);
      if(v.S%n-v.S/n>=minp)
        al[v.S].pb(v.S-v.S/n+1LL*10000000);
    }
    for(lli i=0;i<al[v.S].size();++i)
    {
      if((al[v.S][i]%10000000)%n < minp or 
        (al[v.S][i]%10000000)%n > maxp) continue;
      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.push(mp(dis[al[v.S][i]%10000000],al[v.S][i]%10000000)); 
       // s.insert(mp(dis[al[v.S][i]%10000000],al[v.S][i]%10000000)); 
      }
    }
    if(v.S<rn*n)
    {
      if(pset.find(v.S%n)!=pset.end())
        al[v.S].pop_back();
      if(v.S%n+v.S/n<=maxp)
        al[v.S].pop_back();
      if(v.S%n-v.S/n>=minp)
        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;
    vector<ii> input;
    int g = -1;
    cin>>n>>m;
    rn=2;
    for(lli i=0;i<m;++i) {
      lli f,se;
      cin>>f>>se;
      minp = min(minp, f);
      maxp = max(maxp, f);
      pset.insert(f);
      input.pb(mp(f,se));
    }
    for(lli i=0;i<m;++i)
    {
 
      lli f,se;
      f = input[i].F;
      se = input[i].S;
      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*10000000LL);
        t1+=2;
      }
      if(se>=rn)
      {
        lli p=f+se;
        while(p<=maxp)
        {
          if(pset.find(p) != pset.end())
            al[rn*n+f].pb(rn*n+p+((p-f)/se)*10000000LL);
          p+=se;
          t1++;
        }
        p=f-se;
        while(p>=minp)
        {
          if(pset.find(p) != pset.end())
            al[rn*n+f].pb(rn*n+p+((f-p)/se)*10000000LL);
          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:40:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(s.size()>rn*n+n)
        ~~~~~~~~^~~~~~~
skyscraper.cpp:60: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:144:37: warning: 'to' may be used uninitialized in this function [-Wmaybe-uninitialized]
     else cout<<dij(rn*n+from,rn*n+to)<<endl;
                                     ^
skyscraper.cpp:144:37: warning: 'from' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 143352 KB Output is correct
2 Correct 82 ms 143352 KB Output is correct
3 Correct 82 ms 143352 KB Output is correct
4 Correct 83 ms 143364 KB Output is correct
5 Correct 81 ms 143352 KB Output is correct
6 Correct 85 ms 143352 KB Output is correct
7 Correct 83 ms 143352 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 143352 KB Output is correct
2 Correct 82 ms 143352 KB Output is correct
3 Correct 92 ms 143352 KB Output is correct
4 Correct 81 ms 143356 KB Output is correct
5 Correct 95 ms 143352 KB Output is correct
6 Correct 85 ms 143356 KB Output is correct
7 Correct 81 ms 143352 KB Output is correct
8 Correct 84 ms 143352 KB Output is correct
9 Correct 83 ms 143352 KB Output is correct
10 Correct 86 ms 143352 KB Output is correct
11 Correct 95 ms 143608 KB Output is correct
12 Correct 83 ms 143352 KB Output is correct
13 Correct 94 ms 143352 KB Output is correct
14 Correct 98 ms 143480 KB Output is correct
15 Correct 93 ms 143608 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 143352 KB Output is correct
2 Correct 83 ms 143352 KB Output is correct
3 Correct 82 ms 143352 KB Output is correct
4 Correct 86 ms 143480 KB Output is correct
5 Correct 95 ms 143352 KB Output is correct
6 Correct 86 ms 143352 KB Output is correct
7 Correct 94 ms 143352 KB Output is correct
8 Correct 93 ms 143352 KB Output is correct
9 Correct 83 ms 143352 KB Output is correct
10 Correct 93 ms 143352 KB Output is correct
11 Correct 86 ms 143608 KB Output is correct
12 Correct 84 ms 143352 KB Output is correct
13 Correct 82 ms 143352 KB Output is correct
14 Correct 83 ms 143480 KB Output is correct
15 Correct 94 ms 143480 KB Output is correct
16 Correct 94 ms 143480 KB Output is correct
17 Correct 87 ms 143736 KB Output is correct
18 Correct 83 ms 143480 KB Output is correct
19 Correct 83 ms 143480 KB Output is correct
20 Correct 85 ms 143736 KB Output is correct
21 Correct 93 ms 143480 KB Output is correct
22 Correct 84 ms 143480 KB Output is correct
23 Correct 100 ms 143432 KB Output is correct
24 Correct 98 ms 143608 KB Output is correct
25 Correct 87 ms 143736 KB Output is correct
26 Correct 84 ms 143480 KB Output is correct
27 Correct 85 ms 143480 KB Output is correct
28 Correct 90 ms 143864 KB Output is correct
29 Correct 84 ms 143480 KB Output is correct
30 Correct 86 ms 143480 KB Output is correct
31 Correct 84 ms 143480 KB Output is correct
32 Correct 95 ms 143480 KB Output is correct
33 Correct 94 ms 143608 KB Output is correct
34 Correct 85 ms 143608 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 143352 KB Output is correct
2 Correct 96 ms 143352 KB Output is correct
3 Correct 85 ms 143352 KB Output is correct
4 Correct 85 ms 143352 KB Output is correct
5 Correct 85 ms 143352 KB Output is correct
6 Correct 92 ms 143352 KB Output is correct
7 Correct 82 ms 143480 KB Output is correct
8 Correct 83 ms 143352 KB Output is correct
9 Correct 84 ms 143352 KB Output is correct
10 Correct 84 ms 143480 KB Output is correct
11 Correct 85 ms 143608 KB Output is correct
12 Correct 83 ms 143480 KB Output is correct
13 Correct 83 ms 143352 KB Output is correct
14 Correct 84 ms 143480 KB Output is correct
15 Correct 85 ms 143480 KB Output is correct
16 Correct 86 ms 143480 KB Output is correct
17 Correct 87 ms 143736 KB Output is correct
18 Correct 83 ms 143480 KB Output is correct
19 Correct 92 ms 143484 KB Output is correct
20 Correct 86 ms 143740 KB Output is correct
21 Correct 94 ms 143480 KB Output is correct
22 Correct 96 ms 143480 KB Output is correct
23 Correct 87 ms 143480 KB Output is correct
24 Correct 85 ms 143736 KB Output is correct
25 Correct 87 ms 143736 KB Output is correct
26 Correct 87 ms 143480 KB Output is correct
27 Correct 90 ms 143480 KB Output is correct
28 Correct 88 ms 143864 KB Output is correct
29 Correct 85 ms 143480 KB Output is correct
30 Correct 108 ms 143352 KB Output is correct
31 Correct 85 ms 143432 KB Output is correct
32 Correct 85 ms 143480 KB Output is correct
33 Correct 96 ms 143608 KB Output is correct
34 Correct 85 ms 143608 KB Output is correct
35 Correct 118 ms 146804 KB Output is correct
36 Correct 90 ms 144120 KB Output is correct
37 Correct 129 ms 147832 KB Output is correct
38 Correct 147 ms 148212 KB Output is correct
39 Correct 137 ms 148212 KB Output is correct
40 Correct 131 ms 148212 KB Output is correct
41 Correct 145 ms 148212 KB Output is correct
42 Correct 95 ms 143952 KB Output is correct
43 Correct 90 ms 143864 KB Output is correct
44 Correct 100 ms 144172 KB Output is correct
45 Correct 111 ms 146048 KB Output is correct
46 Correct 111 ms 146048 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 143352 KB Output is correct
2 Correct 82 ms 143328 KB Output is correct
3 Correct 92 ms 143352 KB Output is correct
4 Correct 82 ms 143352 KB Output is correct
5 Correct 82 ms 143480 KB Output is correct
6 Correct 94 ms 143352 KB Output is correct
7 Correct 84 ms 143352 KB Output is correct
8 Correct 83 ms 143352 KB Output is correct
9 Correct 83 ms 143352 KB Output is correct
10 Correct 84 ms 143352 KB Output is correct
11 Correct 88 ms 143608 KB Output is correct
12 Correct 82 ms 143352 KB Output is correct
13 Correct 92 ms 143356 KB Output is correct
14 Correct 85 ms 143480 KB Output is correct
15 Correct 85 ms 143480 KB Output is correct
16 Correct 102 ms 143480 KB Output is correct
17 Correct 86 ms 143740 KB Output is correct
18 Correct 91 ms 143536 KB Output is correct
19 Correct 86 ms 143480 KB Output is correct
20 Correct 91 ms 143736 KB Output is correct
21 Correct 93 ms 143480 KB Output is correct
22 Correct 91 ms 143432 KB Output is correct
23 Correct 95 ms 143480 KB Output is correct
24 Correct 88 ms 143608 KB Output is correct
25 Correct 101 ms 143736 KB Output is correct
26 Correct 96 ms 143480 KB Output is correct
27 Correct 86 ms 143480 KB Output is correct
28 Correct 85 ms 143992 KB Output is correct
29 Correct 88 ms 143480 KB Output is correct
30 Correct 82 ms 143352 KB Output is correct
31 Correct 82 ms 143484 KB Output is correct
32 Correct 83 ms 143480 KB Output is correct
33 Correct 84 ms 143608 KB Output is correct
34 Correct 85 ms 143608 KB Output is correct
35 Correct 120 ms 146808 KB Output is correct
36 Correct 91 ms 143992 KB Output is correct
37 Correct 149 ms 147956 KB Output is correct
38 Correct 133 ms 148084 KB Output is correct
39 Correct 134 ms 148212 KB Output is correct
40 Correct 138 ms 148340 KB Output is correct
41 Correct 131 ms 148212 KB Output is correct
42 Correct 97 ms 143868 KB Output is correct
43 Correct 92 ms 143992 KB Output is correct
44 Correct 105 ms 144172 KB Output is correct
45 Correct 119 ms 146048 KB Output is correct
46 Correct 113 ms 146168 KB Output is correct
47 Correct 292 ms 154932 KB Output is correct
48 Correct 138 ms 147316 KB Output is correct
49 Correct 126 ms 146676 KB Output is correct
50 Correct 118 ms 145784 KB Output is correct
51 Correct 181 ms 150132 KB Output is correct
52 Correct 212 ms 150384 KB Output is correct
53 Correct 129 ms 148340 KB Output is correct
54 Correct 73 ms 122872 KB Output is correct
55 Correct 83 ms 143304 KB Output is correct
56 Correct 142 ms 149560 KB Output is correct
57 Correct 368 ms 149112 KB Output is correct
58 Correct 107 ms 144692 KB Output is correct
59 Correct 95 ms 144764 KB Output is correct
60 Correct 108 ms 144768 KB Output is correct
61 Correct 100 ms 145024 KB Output is correct
62 Correct 220 ms 153460 KB Output is correct
63 Correct 146 ms 146824 KB Output is correct
64 Correct 138 ms 146564 KB Output is correct
65 Correct 133 ms 146560 KB Output is correct
66 Correct 176 ms 146944 KB Output is correct
67 Correct 171 ms 146944 KB Output is correct