oj.uz

답안 #541925

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
541925 2022-03-24T20:21:42 Z farhan132 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 415 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(2056);
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 3 ms 4052 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 3 ms 4180 KB Output is correct
5 Correct 3 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4632 KB Output is correct
9 Correct 4 ms 5092 KB Output is correct
10 Correct 4 ms 5844 KB Output is correct
11 Correct 4 ms 5896 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 4 ms 5716 KB Output is correct
14 Correct 6 ms 6100 KB Output is correct
15 Correct 4 ms 5972 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 2 ms 4692 KB Output is correct
9 Correct 4 ms 5080 KB Output is correct
10 Correct 3 ms 5844 KB Output is correct
11 Correct 4 ms 5972 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 7 ms 5972 KB Output is correct
15 Correct 4 ms 5972 KB Output is correct
16 Correct 6 ms 7636 KB Output is correct
17 Correct 12 ms 17364 KB Output is correct
18 Correct 21 ms 34208 KB Output is correct
19 Correct 23 ms 38484 KB Output is correct
20 Correct 22 ms 38356 KB Output is correct
21 Correct 7 ms 10836 KB Output is correct
22 Correct 20 ms 34744 KB Output is correct
23 Correct 19 ms 31752 KB Output is correct
24 Correct 23 ms 37168 KB Output is correct
25 Correct 22 ms 38612 KB Output is correct
26 Correct 24 ms 38568 KB Output is correct
27 Correct 22 ms 38612 KB Output is correct
28 Correct 31 ms 39252 KB Output is correct
29 Correct 36 ms 40796 KB Output is correct
30 Correct 26 ms 39060 KB Output is correct
31 Correct 30 ms 39644 KB Output is correct
32 Correct 27 ms 39296 KB Output is correct
33 Correct 58 ms 43188 KB Output is correct
34 Correct 50 ms 43180 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 3 ms 4692 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5844 KB Output is correct
11 Correct 4 ms 5972 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 6 ms 6100 KB Output is correct
15 Correct 4 ms 5972 KB Output is correct
16 Correct 5 ms 7636 KB Output is correct
17 Correct 13 ms 17364 KB Output is correct
18 Correct 21 ms 34200 KB Output is correct
19 Correct 23 ms 38476 KB Output is correct
20 Correct 23 ms 38356 KB Output is correct
21 Correct 7 ms 10836 KB Output is correct
22 Correct 25 ms 34792 KB Output is correct
23 Correct 19 ms 31716 KB Output is correct
24 Correct 25 ms 37176 KB Output is correct
25 Correct 23 ms 38740 KB Output is correct
26 Correct 26 ms 38612 KB Output is correct
27 Correct 22 ms 38616 KB Output is correct
28 Correct 28 ms 39288 KB Output is correct
29 Correct 40 ms 40788 KB Output is correct
30 Correct 28 ms 39024 KB Output is correct
31 Correct 30 ms 39704 KB Output is correct
32 Correct 29 ms 39252 KB Output is correct
33 Correct 59 ms 43160 KB Output is correct
34 Correct 50 ms 43196 KB Output is correct
35 Correct 49 ms 33464 KB Output is correct
36 Correct 17 ms 23508 KB Output is correct
37 Correct 64 ms 44780 KB Output is correct
38 Correct 69 ms 45688 KB Output is correct
39 Correct 61 ms 45524 KB Output is correct
40 Correct 64 ms 45424 KB Output is correct
41 Correct 67 ms 45380 KB Output is correct
42 Correct 29 ms 38956 KB Output is correct
43 Correct 28 ms 38908 KB Output is correct
44 Correct 26 ms 38828 KB Output is correct
45 Correct 367 ms 58428 KB Output is correct
46 Correct 299 ms 58424 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 3 ms 4100 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 3 ms 4692 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5844 KB Output is correct
11 Correct 4 ms 5972 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5712 KB Output is correct
14 Correct 6 ms 6100 KB Output is correct
15 Correct 5 ms 5972 KB Output is correct
16 Correct 5 ms 7636 KB Output is correct
17 Correct 13 ms 17444 KB Output is correct
18 Correct 21 ms 34232 KB Output is correct
19 Correct 24 ms 38504 KB Output is correct
20 Correct 25 ms 38424 KB Output is correct
21 Correct 8 ms 10836 KB Output is correct
22 Correct 20 ms 34692 KB Output is correct
23 Correct 20 ms 31700 KB Output is correct
24 Correct 23 ms 37076 KB Output is correct
25 Correct 22 ms 38568 KB Output is correct
26 Correct 21 ms 38612 KB Output is correct
27 Correct 22 ms 38628 KB Output is correct
28 Correct 27 ms 39288 KB Output is correct
29 Correct 36 ms 40744 KB Output is correct
30 Correct 24 ms 39056 KB Output is correct
31 Correct 33 ms 39640 KB Output is correct
32 Correct 28 ms 39272 KB Output is correct
33 Correct 60 ms 43184 KB Output is correct
34 Correct 63 ms 43184 KB Output is correct
35 Correct 51 ms 33476 KB Output is correct
36 Correct 17 ms 23508 KB Output is correct
37 Correct 69 ms 44884 KB Output is correct
38 Correct 67 ms 45696 KB Output is correct
39 Correct 69 ms 45344 KB Output is correct
40 Correct 69 ms 45380 KB Output is correct
41 Correct 64 ms 45448 KB Output is correct
42 Correct 26 ms 39012 KB Output is correct
43 Correct 30 ms 38952 KB Output is correct
44 Correct 25 ms 38780 KB Output is correct
45 Correct 415 ms 58396 KB Output is correct
46 Correct 324 ms 58388 KB Output is correct
47 Correct 375 ms 246164 KB Output is correct
48 Runtime error 118 ms 262144 KB Execution killed with signal 9
49 Halted 0 ms 0 KB -