oj.uz

Submission #541928

# Submission time Handle Problem Language Result Execution time Memory
541928 2022-03-24T20:27:11 Z farhan132 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 223492 KB 
/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")


#include <bits/stdc++.h>
 
 
 
using namespace std;

typedef int ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
typedef tuple < ll, ll, ll > tp;

#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
//const ll mod =  (ll) 998244353;
const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 3e4 + 5;

vector < ll > g[N];

vector < ll > dp[N], car[N];

unordered_map < ll , ll > mp[N];

void solve(){

  ll n , m;
  cin >> n >> m;

  ll a , b;
  vector < ii > v;

  

  for(ll i = 0; i < m; i++){
    ll x , p; cin >> x >> p;
    g[x].pb(p);
    if(i == 0) a = x;
    if(i == 1) b = x;
    v.pb({p , x % p});
  }
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()) , v.end());


  car[a].pb(0);

  for(auto [c , j] : v){
    for(ll i = j; i < n; i += c) car[i].pb(c);
  }


  for(ll i = 0; i < n; i++){
    ll sz = car[i].size() + 1;
    ll mx = log2(sz) + 1;
    mp[i].reserve(1 << mx);
    mp[i].max_load_factor(0.25);
    ll k = 0;
    for(auto u : car[i]) mp[i][u] = k, k++;
    dp[i].resize(car[i].size(), -1);
  }

  queue < tp > p;

  p.push({0, a, 0});

  dp[a][0] = 0;

  while(p.size()){
    auto [cost , pos , extra] = p.front(); p.pop();
    g[pos].pb(car[pos][extra]);
    if(pos == b){
      cout << cost << '\n';
      return;
    }
    for(auto u : g[pos]){
      if(!u) continue;
      if(pos - u >= 0){
        ll c1 = pos - u;
        //ll c2 = lower_bound(car[c1].begin(), car[c1].end(), u) - car[c1].begin();
        ll c2 = mp[c1][u];
        if(dp[c1][c2] == -1){
         dp[c1][c2] = cost + 1;
         p.push({cost + 1, c1 , c2});
        }
      }
      if(pos + u < n){
        ll c1 = pos + u;
        //ll c2 = lower_bound(car[c1].begin(), car[c1].end(), u) - car[c1].begin();
        ll c2 = mp[c1][u];
        if(dp[c1][c2] == -1){
         dp[c1][c2] = cost + 1;
         p.push({cost + 1, c1 , c2});
        }
      }
    }
    g[pos].pop_back();
  }

  cout << "-1\n";


   
   return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif

    //pre();

    ll T = 1, CT = 0; // cin >> T;

    while(T--){
        // cout << "Case #" << ++CT <<": " ;
        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:170:15: warning: unused variable 'CT' [-Wunused-variable]
  170 |     ll T = 1, CT = 0; // cin >> T;
      |               ^~
skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:122:5: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
  122 |     if(pos == b){
      |     ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 3 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 3 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 2 ms 4052 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 2 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 2 ms 4052 KB Output is correct
8 Correct 2 ms 4052 KB Output is correct
9 Correct 2 ms 4052 KB Output is correct
10 Correct 3 ms 4208 KB Output is correct
11 Correct 4 ms 4436 KB Output is correct
12 Correct 3 ms 4052 KB Output is correct
13 Correct 4 ms 4052 KB Output is correct
14 Correct 5 ms 4564 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 2 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 2 ms 4052 KB Output is correct
9 Correct 2 ms 4052 KB Output is correct
10 Correct 3 ms 4180 KB Output is correct
11 Correct 4 ms 4436 KB Output is correct
12 Correct 3 ms 4180 KB Output is correct
13 Correct 3 ms 4180 KB Output is correct
14 Correct 5 ms 4564 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct
16 Correct 4 ms 4340 KB Output is correct
17 Correct 5 ms 5460 KB Output is correct
18 Correct 5 ms 4988 KB Output is correct
19 Correct 5 ms 5076 KB Output is correct
20 Correct 6 ms 5076 KB Output is correct
21 Correct 3 ms 4308 KB Output is correct
22 Correct 5 ms 5060 KB Output is correct
23 Correct 5 ms 4988 KB Output is correct
24 Correct 6 ms 5460 KB Output is correct
25 Correct 6 ms 5252 KB Output is correct
26 Correct 6 ms 5204 KB Output is correct
27 Correct 6 ms 5204 KB Output is correct
28 Correct 9 ms 6228 KB Output is correct
29 Correct 18 ms 8956 KB Output is correct
30 Correct 8 ms 5588 KB Output is correct
31 Correct 16 ms 6868 KB Output is correct
32 Correct 10 ms 6484 KB Output is correct
33 Correct 38 ms 13392 KB Output is correct
34 Correct 30 ms 13376 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 2 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 2 ms 4052 KB Output is correct
8 Correct 3 ms 4052 KB Output is correct
9 Correct 3 ms 4052 KB Output is correct
10 Correct 3 ms 4180 KB Output is correct
11 Correct 4 ms 4436 KB Output is correct
12 Correct 3 ms 4180 KB Output is correct
13 Correct 3 ms 4052 KB Output is correct
14 Correct 5 ms 4564 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct
16 Correct 3 ms 4436 KB Output is correct
17 Correct 8 ms 5516 KB Output is correct
18 Correct 4 ms 5076 KB Output is correct
19 Correct 5 ms 5076 KB Output is correct
20 Correct 5 ms 5076 KB Output is correct
21 Correct 3 ms 4308 KB Output is correct
22 Correct 4 ms 5076 KB Output is correct
23 Correct 5 ms 4948 KB Output is correct
24 Correct 7 ms 5460 KB Output is correct
25 Correct 5 ms 5204 KB Output is correct
26 Correct 5 ms 5252 KB Output is correct
27 Correct 6 ms 5248 KB Output is correct
28 Correct 9 ms 6228 KB Output is correct
29 Correct 24 ms 8876 KB Output is correct
30 Correct 7 ms 5588 KB Output is correct
31 Correct 13 ms 6868 KB Output is correct
32 Correct 12 ms 6484 KB Output is correct
33 Correct 35 ms 13308 KB Output is correct
34 Correct 27 ms 13364 KB Output is correct
35 Correct 32 ms 14316 KB Output is correct
36 Correct 7 ms 5716 KB Output is correct
37 Correct 41 ms 20560 KB Output is correct
38 Correct 49 ms 20268 KB Output is correct
39 Correct 38 ms 19976 KB Output is correct
40 Correct 37 ms 19976 KB Output is correct
41 Correct 35 ms 20076 KB Output is correct
42 Correct 10 ms 5716 KB Output is correct
43 Correct 9 ms 5716 KB Output is correct
44 Correct 9 ms 5572 KB Output is correct
45 Correct 272 ms 41692 KB Output is correct
46 Correct 239 ms 41688 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 2 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 3 ms 3984 KB Output is correct
8 Correct 2 ms 4052 KB Output is correct
9 Correct 3 ms 4052 KB Output is correct
10 Correct 3 ms 4180 KB Output is correct
11 Correct 4 ms 4436 KB Output is correct
12 Correct 3 ms 4180 KB Output is correct
13 Correct 3 ms 4052 KB Output is correct
14 Correct 5 ms 4564 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct
16 Correct 3 ms 4436 KB Output is correct
17 Correct 6 ms 5460 KB Output is correct
18 Correct 5 ms 5024 KB Output is correct
19 Correct 4 ms 4984 KB Output is correct
20 Correct 5 ms 5076 KB Output is correct
21 Correct 3 ms 4308 KB Output is correct
22 Correct 5 ms 5076 KB Output is correct
23 Correct 6 ms 4988 KB Output is correct
24 Correct 7 ms 5460 KB Output is correct
25 Correct 6 ms 5332 KB Output is correct
26 Correct 5 ms 5256 KB Output is correct
27 Correct 5 ms 5204 KB Output is correct
28 Correct 8 ms 6268 KB Output is correct
29 Correct 19 ms 8908 KB Output is correct
30 Correct 8 ms 5588 KB Output is correct
31 Correct 12 ms 6868 KB Output is correct
32 Correct 12 ms 6484 KB Output is correct
33 Correct 39 ms 13312 KB Output is correct
34 Correct 34 ms 13268 KB Output is correct
35 Correct 39 ms 14320 KB Output is correct
36 Correct 7 ms 5844 KB Output is correct
37 Correct 42 ms 20552 KB Output is correct
38 Correct 43 ms 20448 KB Output is correct
39 Correct 34 ms 20044 KB Output is correct
40 Correct 34 ms 20004 KB Output is correct
41 Correct 36 ms 19980 KB Output is correct
42 Correct 9 ms 5716 KB Output is correct
43 Correct 9 ms 5632 KB Output is correct
44 Correct 9 ms 5572 KB Output is correct
45 Correct 286 ms 41772 KB Output is correct
46 Correct 218 ms 41796 KB Output is correct
47 Correct 125 ms 64232 KB Output is correct
48 Correct 65 ms 26368 KB Output is correct
49 Correct 53 ms 21104 KB Output is correct
50 Correct 53 ms 21784 KB Output is correct
51 Correct 100 ms 34280 KB Output is correct
52 Correct 114 ms 37028 KB Output is correct
53 Correct 51 ms 21296 KB Output is correct
54 Correct 33 ms 18540 KB Output is correct
55 Correct 39 ms 19544 KB Output is correct
56 Correct 40 ms 19544 KB Output is correct
57 Correct 85 ms 43312 KB Output is correct
58 Correct 61 ms 20820 KB Output is correct
59 Correct 62 ms 21688 KB Output is correct
60 Correct 72 ms 22684 KB Output is correct
61 Correct 70 ms 22348 KB Output is correct
62 Correct 275 ms 49952 KB Output is correct
63 Execution timed out 1106 ms 223492 KB Time limit exceeded
64 Halted 0 ms 0 KB -