oj.uz

Submission #541924

# Submission time Handle Problem Language Result Execution time Memory
541924 2022-03-24T20:17:05 Z farhan132 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 108280 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) , 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:162:15: warning: unused variable 'CT' [-Wunused-variable]
  162 |     ll T = 1, CT = 0; // cin >> T;
      |               ^~
skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:114:5: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
  114 |     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 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

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 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
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 3 ms 4308 KB Output is correct
12 Correct 2 ms 4052 KB Output is correct
13 Correct 3 ms 4052 KB Output is correct
14 Correct 6 ms 4436 KB Output is correct
15 Correct 3 ms 4436 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 3 ms 3952 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 2 ms 4180 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 2 ms 4052 KB Output is correct
13 Correct 2 ms 4052 KB Output is correct
14 Correct 5 ms 4436 KB Output is correct
15 Correct 4 ms 4436 KB Output is correct
16 Correct 3 ms 4308 KB Output is correct
17 Correct 5 ms 4948 KB Output is correct
18 Correct 4 ms 4564 KB Output is correct
19 Correct 3 ms 4564 KB Output is correct
20 Correct 3 ms 4564 KB Output is correct
21 Correct 3 ms 4180 KB Output is correct
22 Correct 3 ms 4564 KB Output is correct
23 Correct 4 ms 4576 KB Output is correct
24 Correct 5 ms 4820 KB Output is correct
25 Correct 4 ms 4692 KB Output is correct
26 Correct 4 ms 4716 KB Output is correct
27 Correct 4 ms 4692 KB Output is correct
28 Correct 7 ms 5332 KB Output is correct
29 Correct 18 ms 7552 KB Output is correct
30 Correct 5 ms 5076 KB Output is correct
31 Correct 9 ms 6076 KB Output is correct
32 Correct 7 ms 5396 KB Output is correct
33 Correct 41 ms 10664 KB Output is correct
34 Correct 33 ms 10780 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 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 2 ms 4180 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 3 ms 4052 KB Output is correct
13 Correct 3 ms 4052 KB Output is correct
14 Correct 4 ms 4444 KB Output is correct
15 Correct 3 ms 4436 KB Output is correct
16 Correct 3 ms 4308 KB Output is correct
17 Correct 5 ms 4932 KB Output is correct
18 Correct 4 ms 4564 KB Output is correct
19 Correct 3 ms 4564 KB Output is correct
20 Correct 3 ms 4564 KB Output is correct
21 Correct 3 ms 4260 KB Output is correct
22 Correct 4 ms 4564 KB Output is correct
23 Correct 4 ms 4612 KB Output is correct
24 Correct 5 ms 4820 KB Output is correct
25 Correct 4 ms 4692 KB Output is correct
26 Correct 4 ms 4692 KB Output is correct
27 Correct 4 ms 4692 KB Output is correct
28 Correct 8 ms 5332 KB Output is correct
29 Correct 18 ms 7508 KB Output is correct
30 Correct 5 ms 5076 KB Output is correct
31 Correct 10 ms 6052 KB Output is correct
32 Correct 6 ms 5332 KB Output is correct
33 Correct 39 ms 10676 KB Output is correct
34 Correct 32 ms 10764 KB Output is correct
35 Correct 36 ms 10424 KB Output is correct
36 Correct 6 ms 5076 KB Output is correct
37 Correct 53 ms 13680 KB Output is correct
38 Correct 55 ms 13692 KB Output is correct
39 Correct 50 ms 13288 KB Output is correct
40 Correct 49 ms 13388 KB Output is correct
41 Correct 61 ms 13400 KB Output is correct
42 Correct 8 ms 5076 KB Output is correct
43 Correct 8 ms 5076 KB Output is correct
44 Correct 8 ms 4804 KB Output is correct
45 Correct 369 ms 28460 KB Output is correct
46 Correct 324 ms 28452 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 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 4180 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 2 ms 4052 KB Output is correct
13 Correct 3 ms 4052 KB Output is correct
14 Correct 5 ms 4436 KB Output is correct
15 Correct 4 ms 4436 KB Output is correct
16 Correct 3 ms 4308 KB Output is correct
17 Correct 5 ms 4948 KB Output is correct
18 Correct 4 ms 4564 KB Output is correct
19 Correct 3 ms 4564 KB Output is correct
20 Correct 3 ms 4564 KB Output is correct
21 Correct 3 ms 4180 KB Output is correct
22 Correct 4 ms 4564 KB Output is correct
23 Correct 4 ms 4564 KB Output is correct
24 Correct 5 ms 4820 KB Output is correct
25 Correct 4 ms 4692 KB Output is correct
26 Correct 4 ms 4692 KB Output is correct
27 Correct 4 ms 4692 KB Output is correct
28 Correct 7 ms 5452 KB Output is correct
29 Correct 17 ms 7472 KB Output is correct
30 Correct 5 ms 5096 KB Output is correct
31 Correct 10 ms 6100 KB Output is correct
32 Correct 7 ms 5460 KB Output is correct
33 Correct 43 ms 10828 KB Output is correct
34 Correct 33 ms 10824 KB Output is correct
35 Correct 37 ms 10416 KB Output is correct
36 Correct 6 ms 5076 KB Output is correct
37 Correct 51 ms 13768 KB Output is correct
38 Correct 55 ms 13648 KB Output is correct
39 Correct 49 ms 13388 KB Output is correct
40 Correct 54 ms 13404 KB Output is correct
41 Correct 50 ms 13432 KB Output is correct
42 Correct 8 ms 5076 KB Output is correct
43 Correct 8 ms 5076 KB Output is correct
44 Correct 7 ms 4816 KB Output is correct
45 Correct 352 ms 28444 KB Output is correct
46 Correct 313 ms 28404 KB Output is correct
47 Correct 403 ms 44840 KB Output is correct
48 Correct 75 ms 17860 KB Output is correct
49 Correct 44 ms 14080 KB Output is correct
50 Correct 41 ms 14284 KB Output is correct
51 Correct 132 ms 22996 KB Output is correct
52 Correct 153 ms 24568 KB Output is correct
53 Correct 33 ms 12952 KB Output is correct
54 Correct 13 ms 10580 KB Output is correct
55 Correct 18 ms 11508 KB Output is correct
56 Correct 21 ms 11324 KB Output is correct
57 Correct 178 ms 30044 KB Output is correct
58 Correct 34 ms 12648 KB Output is correct
59 Correct 40 ms 13476 KB Output is correct
60 Correct 49 ms 14536 KB Output is correct
61 Correct 45 ms 13940 KB Output is correct
62 Correct 373 ms 32924 KB Output is correct
63 Execution timed out 1092 ms 108280 KB Time limit exceeded
64 Halted 0 ms 0 KB -