oj.uz

답안 #541955

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
541955 2022-03-24T21:09:35 Z farhan132 Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 545 ms 67720 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 short 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 < int, 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 < int > dp[N];
vector < ll > car[N];

const ll M = 505;

ll mp[N][M];

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){
    if(c < M) continue;
    for(int i = j; i < n; i += c){
     car[i].pb(c);
    }
  }


  for(ll i = 0; i < n; i++){
    dp[i].resize(M + 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();
    if(extra < M) g[pos].pb(extra);
    else g[pos].pb(car[pos][extra - M]);
    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 = (u < M ? u : M + lower_bound(car[c1].begin(), car[c1].end(), u) - car[c1].begin()) ;
        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 = (u < M ? u : M + lower_bound(car[c1].begin(), car[c1].end(), u) - car[c1].begin()) ;
        if(dp[c1][c2] == -1){
         dp[c1][c2] = cost + 1;
         p.push({cost + 1, c1 , c2});
        }
      }
    }
    g[pos].clear();
  }

  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:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      | 
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:83:6: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]
   83 |   ll a , b;
      |      ^
skyscraper.cpp:121:5: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
  121 |     if(pos == b){
      |     ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 2 ms 2388 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 2 ms 2388 KB Output is correct
6 Correct 1 ms 2388 KB Output is correct
7 Correct 1 ms 2388 KB Output is correct
8 Correct 2 ms 2516 KB Output is correct
9 Correct 2 ms 2516 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 2 ms 2388 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 1 ms 2388 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 1 ms 2388 KB Output is correct
8 Correct 2 ms 2524 KB Output is correct
9 Correct 2 ms 2516 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2624 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2836 KB Output is correct
17 Correct 3 ms 3924 KB Output is correct
18 Correct 4 ms 5972 KB Output is correct
19 Correct 4 ms 6356 KB Output is correct
20 Correct 4 ms 6484 KB Output is correct
21 Correct 2 ms 3156 KB Output is correct
22 Correct 3 ms 5972 KB Output is correct
23 Correct 3 ms 5588 KB Output is correct
24 Correct 4 ms 6356 KB Output is correct
25 Correct 4 ms 6484 KB Output is correct
26 Correct 4 ms 6484 KB Output is correct
27 Correct 3 ms 6484 KB Output is correct
28 Correct 5 ms 6484 KB Output is correct
29 Correct 6 ms 6484 KB Output is correct
30 Correct 4 ms 6484 KB Output is correct
31 Correct 5 ms 6444 KB Output is correct
32 Correct 4 ms 6484 KB Output is correct
33 Correct 8 ms 6436 KB Output is correct
34 Correct 7 ms 6484 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 2 ms 2388 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 2 ms 2388 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 2 ms 2388 KB Output is correct
8 Correct 2 ms 2516 KB Output is correct
9 Correct 2 ms 2516 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2772 KB Output is correct
17 Correct 3 ms 3924 KB Output is correct
18 Correct 4 ms 5972 KB Output is correct
19 Correct 4 ms 6356 KB Output is correct
20 Correct 4 ms 6484 KB Output is correct
21 Correct 2 ms 3156 KB Output is correct
22 Correct 3 ms 5972 KB Output is correct
23 Correct 4 ms 5588 KB Output is correct
24 Correct 4 ms 6360 KB Output is correct
25 Correct 4 ms 6444 KB Output is correct
26 Correct 3 ms 6484 KB Output is correct
27 Correct 5 ms 6484 KB Output is correct
28 Correct 5 ms 6484 KB Output is correct
29 Correct 7 ms 6484 KB Output is correct
30 Correct 4 ms 6484 KB Output is correct
31 Correct 5 ms 6484 KB Output is correct
32 Correct 4 ms 6484 KB Output is correct
33 Correct 8 ms 6424 KB Output is correct
34 Correct 7 ms 6512 KB Output is correct
35 Correct 13 ms 5920 KB Output is correct
36 Correct 4 ms 4692 KB Output is correct
37 Correct 11 ms 6792 KB Output is correct
38 Correct 15 ms 7252 KB Output is correct
39 Correct 13 ms 6976 KB Output is correct
40 Correct 13 ms 6996 KB Output is correct
41 Correct 13 ms 7100 KB Output is correct
42 Correct 9 ms 6612 KB Output is correct
43 Correct 9 ms 6672 KB Output is correct
44 Correct 10 ms 6576 KB Output is correct
45 Correct 30 ms 7124 KB Output is correct
46 Correct 22 ms 7124 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 2 ms 2388 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 1 ms 2388 KB Output is correct
6 Correct 1 ms 2388 KB Output is correct
7 Correct 2 ms 2388 KB Output is correct
8 Correct 2 ms 2516 KB Output is correct
9 Correct 2 ms 2516 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2772 KB Output is correct
17 Correct 3 ms 3924 KB Output is correct
18 Correct 4 ms 5972 KB Output is correct
19 Correct 3 ms 6356 KB Output is correct
20 Correct 4 ms 6484 KB Output is correct
21 Correct 2 ms 3156 KB Output is correct
22 Correct 4 ms 5972 KB Output is correct
23 Correct 3 ms 5588 KB Output is correct
24 Correct 4 ms 6228 KB Output is correct
25 Correct 4 ms 6484 KB Output is correct
26 Correct 4 ms 6484 KB Output is correct
27 Correct 4 ms 6484 KB Output is correct
28 Correct 5 ms 6484 KB Output is correct
29 Correct 6 ms 6484 KB Output is correct
30 Correct 4 ms 6484 KB Output is correct
31 Correct 4 ms 6412 KB Output is correct
32 Correct 5 ms 6484 KB Output is correct
33 Correct 8 ms 6484 KB Output is correct
34 Correct 7 ms 6484 KB Output is correct
35 Correct 12 ms 5844 KB Output is correct
36 Correct 4 ms 4692 KB Output is correct
37 Correct 10 ms 6844 KB Output is correct
38 Correct 14 ms 7208 KB Output is correct
39 Correct 14 ms 6976 KB Output is correct
40 Correct 13 ms 6972 KB Output is correct
41 Correct 20 ms 7020 KB Output is correct
42 Correct 10 ms 6664 KB Output is correct
43 Correct 10 ms 6632 KB Output is correct
44 Correct 9 ms 6612 KB Output is correct
45 Correct 31 ms 7136 KB Output is correct
46 Correct 20 ms 7124 KB Output is correct
47 Correct 29 ms 29112 KB Output is correct
48 Correct 34 ms 50128 KB Output is correct
49 Correct 34 ms 54484 KB Output is correct
50 Correct 54 ms 59332 KB Output is correct
51 Correct 50 ms 64516 KB Output is correct
52 Correct 56 ms 64504 KB Output is correct
53 Correct 41 ms 63628 KB Output is correct
54 Correct 27 ms 62548 KB Output is correct
55 Correct 28 ms 62608 KB Output is correct
56 Correct 35 ms 63032 KB Output is correct
57 Correct 27 ms 62108 KB Output is correct
58 Correct 36 ms 63104 KB Output is correct
59 Correct 37 ms 63052 KB Output is correct
60 Correct 38 ms 63100 KB Output is correct
61 Correct 43 ms 63436 KB Output is correct
62 Correct 104 ms 64824 KB Output is correct
63 Correct 329 ms 67720 KB Output is correct
64 Correct 270 ms 63368 KB Output is correct
65 Correct 356 ms 63388 KB Output is correct
66 Correct 545 ms 63692 KB Output is correct
67 Correct 270 ms 63664 KB Output is correct