oj.uz

Submission #541926

# Submission time Handle Problem Language Result Execution time Memory
541926 2022-03-24T20:23:08 Z farhan132 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 439 ms 262144 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 < n; i++){
    mp[i].reserve(1024);
    mp[i].max_load_factor(0.25);
  }

  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) , mp[i][c] = car[i].size() - 1;
  }


  for(ll i = 0; i < n; i++){
    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:167:15: warning: unused variable 'CT' [-Wunused-variable]
  167 |     ll T = 1, CT = 0; // cin >> T;
      |               ^~
skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:119:5: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
  119 |     if(pos == b){
      |     ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4084 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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4052 KB Output is correct
2 Correct 4 ms 4088 KB Output is correct
3 Correct 3 ms 4052 KB Output is correct
4 Correct 4 ms 4108 KB Output is correct
5 Correct 3 ms 4076 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 4308 KB Output is correct
9 Correct 3 ms 4564 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 4 ms 5076 KB Output is correct
12 Correct 4 ms 4912 KB Output is correct
13 Correct 3 ms 4820 KB Output is correct
14 Correct 8 ms 5204 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4052 KB Output is correct
2 Correct 3 ms 4080 KB Output is correct
3 Correct 3 ms 4088 KB Output is correct
4 Correct 4 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 3 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4564 KB Output is correct
10 Correct 3 ms 4912 KB Output is correct
11 Correct 5 ms 5076 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4856 KB Output is correct
14 Correct 6 ms 5192 KB Output is correct
15 Correct 4 ms 5116 KB Output is correct
16 Correct 4 ms 5844 KB Output is correct
17 Correct 10 ms 10708 KB Output is correct
18 Correct 12 ms 18552 KB Output is correct
19 Correct 13 ms 20436 KB Output is correct
20 Correct 13 ms 20436 KB Output is correct
21 Correct 5 ms 7380 KB Output is correct
22 Correct 11 ms 18772 KB Output is correct
23 Correct 12 ms 17380 KB Output is correct
24 Correct 15 ms 20052 KB Output is correct
25 Correct 14 ms 20692 KB Output is correct
26 Correct 13 ms 20716 KB Output is correct
27 Correct 14 ms 20676 KB Output is correct
28 Correct 20 ms 21252 KB Output is correct
29 Correct 29 ms 22800 KB Output is correct
30 Correct 20 ms 21076 KB Output is correct
31 Correct 20 ms 21716 KB Output is correct
32 Correct 19 ms 21332 KB Output is correct
33 Correct 49 ms 25172 KB Output is correct
34 Correct 43 ms 25244 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 3 ms 4052 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4564 KB Output is correct
10 Correct 3 ms 4844 KB Output is correct
11 Correct 4 ms 5076 KB Output is correct
12 Correct 3 ms 4820 KB Output is correct
13 Correct 4 ms 4820 KB Output is correct
14 Correct 6 ms 5204 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 4 ms 5880 KB Output is correct
17 Correct 9 ms 10796 KB Output is correct
18 Correct 12 ms 18540 KB Output is correct
19 Correct 12 ms 20492 KB Output is correct
20 Correct 15 ms 20492 KB Output is correct
21 Correct 4 ms 7356 KB Output is correct
22 Correct 12 ms 18676 KB Output is correct
23 Correct 13 ms 17268 KB Output is correct
24 Correct 16 ms 20052 KB Output is correct
25 Correct 17 ms 20580 KB Output is correct
26 Correct 17 ms 20612 KB Output is correct
27 Correct 14 ms 20564 KB Output is correct
28 Correct 19 ms 21332 KB Output is correct
29 Correct 28 ms 22784 KB Output is correct
30 Correct 16 ms 21100 KB Output is correct
31 Correct 20 ms 21716 KB Output is correct
32 Correct 17 ms 21332 KB Output is correct
33 Correct 47 ms 25208 KB Output is correct
34 Correct 40 ms 25236 KB Output is correct
35 Correct 44 ms 20796 KB Output is correct
36 Correct 12 ms 13684 KB Output is correct
37 Correct 53 ms 27584 KB Output is correct
38 Correct 59 ms 27976 KB Output is correct
39 Correct 53 ms 27696 KB Output is correct
40 Correct 65 ms 27732 KB Output is correct
41 Correct 56 ms 27696 KB Output is correct
42 Correct 20 ms 21172 KB Output is correct
43 Correct 18 ms 21188 KB Output is correct
44 Correct 17 ms 20960 KB Output is correct
45 Correct 358 ms 40604 KB Output is correct
46 Correct 347 ms 40676 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 3 ms 4084 KB Output is correct
4 Correct 3 ms 4088 KB Output is correct
5 Correct 3 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 3 ms 4336 KB Output is correct
9 Correct 3 ms 4468 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 4 ms 5076 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4820 KB Output is correct
14 Correct 5 ms 5204 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 4 ms 5844 KB Output is correct
17 Correct 8 ms 10708 KB Output is correct
18 Correct 13 ms 18516 KB Output is correct
19 Correct 13 ms 20520 KB Output is correct
20 Correct 12 ms 20532 KB Output is correct
21 Correct 5 ms 7380 KB Output is correct
22 Correct 14 ms 18772 KB Output is correct
23 Correct 16 ms 17272 KB Output is correct
24 Correct 17 ms 20104 KB Output is correct
25 Correct 17 ms 20688 KB Output is correct
26 Correct 14 ms 20692 KB Output is correct
27 Correct 13 ms 20604 KB Output is correct
28 Correct 18 ms 21304 KB Output is correct
29 Correct 27 ms 22740 KB Output is correct
30 Correct 15 ms 21092 KB Output is correct
31 Correct 23 ms 21780 KB Output is correct
32 Correct 19 ms 21320 KB Output is correct
33 Correct 52 ms 25192 KB Output is correct
34 Correct 42 ms 25100 KB Output is correct
35 Correct 44 ms 20820 KB Output is correct
36 Correct 13 ms 13772 KB Output is correct
37 Correct 60 ms 27520 KB Output is correct
38 Correct 66 ms 27976 KB Output is correct
39 Correct 54 ms 27684 KB Output is correct
40 Correct 55 ms 27672 KB Output is correct
41 Correct 65 ms 27776 KB Output is correct
42 Correct 20 ms 21196 KB Output is correct
43 Correct 19 ms 21200 KB Output is correct
44 Correct 18 ms 20944 KB Output is correct
45 Correct 439 ms 40644 KB Output is correct
46 Correct 298 ms 40668 KB Output is correct
47 Correct 296 ms 135136 KB Output is correct
48 Correct 190 ms 202752 KB Output is correct
49 Correct 172 ms 216476 KB Output is correct
50 Correct 191 ms 236768 KB Output is correct
51 Correct 299 ms 261712 KB Output is correct
52 Runtime error 217 ms 262144 KB Execution killed with signal 9
53 Halted 0 ms 0 KB -