oj.uz

답안 #541932

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
541932 2022-03-24T20:37:38 Z farhan132 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 778 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 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 < ll > dp[N], car[N];

ll mp[N][2005];

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);
     if(c <= 2000) 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 = (u <= 2000 ? mp[c1][u] : 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 <= 2000 ? mp[c1][u] : 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].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:163:15: warning: unused variable 'CT' [-Wunused-variable]
  163 |     ll T = 1, CT = 0; // cin >> T;
      |               ^~
skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:117:5: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
  117 |     if(pos == b){
      |     ^~
skyscraper.cpp:80:6: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]
   80 |   ll a , b;
      |      ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 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 2 ms 2388 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2388 KB Output is correct
4 Correct 1 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 1 ms 2432 KB Output is correct
8 Correct 1 ms 2516 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 3 ms 2820 KB Output is correct
15 Correct 2 ms 2900 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2388 KB Output is correct
4 Correct 1 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 2456 KB Output is correct
8 Correct 1 ms 2516 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 3 ms 2900 KB Output is correct
15 Correct 2 ms 2900 KB Output is correct
16 Correct 2 ms 3156 KB Output is correct
17 Correct 3 ms 5460 KB Output is correct
18 Correct 5 ms 9300 KB Output is correct
19 Correct 5 ms 9812 KB Output is correct
20 Correct 5 ms 10452 KB Output is correct
21 Correct 2 ms 3924 KB Output is correct
22 Correct 5 ms 9464 KB Output is correct
23 Correct 5 ms 8792 KB Output is correct
24 Correct 6 ms 10068 KB Output is correct
25 Correct 6 ms 10472 KB Output is correct
26 Correct 6 ms 10396 KB Output is correct
27 Correct 6 ms 10452 KB Output is correct
28 Correct 7 ms 10536 KB Output is correct
29 Correct 10 ms 10632 KB Output is correct
30 Correct 8 ms 10412 KB Output is correct
31 Correct 7 ms 10580 KB Output is correct
32 Correct 7 ms 10452 KB Output is correct
33 Correct 15 ms 10836 KB Output is correct
34 Correct 12 ms 10836 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 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 1 ms 2388 KB Output is correct
8 Correct 2 ms 2516 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 3 ms 2900 KB Output is correct
15 Correct 2 ms 2900 KB Output is correct
16 Correct 2 ms 3156 KB Output is correct
17 Correct 3 ms 5460 KB Output is correct
18 Correct 5 ms 9344 KB Output is correct
19 Correct 4 ms 9812 KB Output is correct
20 Correct 5 ms 10452 KB Output is correct
21 Correct 2 ms 3924 KB Output is correct
22 Correct 4 ms 9556 KB Output is correct
23 Correct 5 ms 8788 KB Output is correct
24 Correct 6 ms 10068 KB Output is correct
25 Correct 5 ms 10412 KB Output is correct
26 Correct 6 ms 10412 KB Output is correct
27 Correct 7 ms 10452 KB Output is correct
28 Correct 8 ms 10452 KB Output is correct
29 Correct 10 ms 10660 KB Output is correct
30 Correct 6 ms 10452 KB Output is correct
31 Correct 8 ms 10600 KB Output is correct
32 Correct 7 ms 10452 KB Output is correct
33 Correct 15 ms 10932 KB Output is correct
34 Correct 12 ms 10836 KB Output is correct
35 Correct 15 ms 9004 KB Output is correct
36 Correct 5 ms 6868 KB Output is correct
37 Correct 15 ms 11220 KB Output is correct
38 Correct 19 ms 11628 KB Output is correct
39 Correct 21 ms 11424 KB Output is correct
40 Correct 16 ms 11348 KB Output is correct
41 Correct 16 ms 11436 KB Output is correct
42 Correct 10 ms 10580 KB Output is correct
43 Correct 10 ms 10580 KB Output is correct
44 Correct 9 ms 10548 KB Output is correct
45 Correct 87 ms 13212 KB Output is correct
46 Correct 64 ms 13068 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2388 KB Output is correct
4 Correct 1 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 1 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 3 ms 2900 KB Output is correct
15 Correct 2 ms 2900 KB Output is correct
16 Correct 3 ms 3156 KB Output is correct
17 Correct 3 ms 5460 KB Output is correct
18 Correct 4 ms 9300 KB Output is correct
19 Correct 5 ms 9824 KB Output is correct
20 Correct 5 ms 10452 KB Output is correct
21 Correct 3 ms 3924 KB Output is correct
22 Correct 5 ms 9556 KB Output is correct
23 Correct 5 ms 8788 KB Output is correct
24 Correct 6 ms 10068 KB Output is correct
25 Correct 6 ms 10452 KB Output is correct
26 Correct 6 ms 10452 KB Output is correct
27 Correct 5 ms 10452 KB Output is correct
28 Correct 7 ms 10532 KB Output is correct
29 Correct 10 ms 10644 KB Output is correct
30 Correct 6 ms 10452 KB Output is correct
31 Correct 7 ms 10580 KB Output is correct
32 Correct 7 ms 10452 KB Output is correct
33 Correct 16 ms 10836 KB Output is correct
34 Correct 14 ms 10884 KB Output is correct
35 Correct 17 ms 8960 KB Output is correct
36 Correct 5 ms 6920 KB Output is correct
37 Correct 16 ms 11280 KB Output is correct
38 Correct 21 ms 11636 KB Output is correct
39 Correct 18 ms 11428 KB Output is correct
40 Correct 17 ms 11456 KB Output is correct
41 Correct 16 ms 11476 KB Output is correct
42 Correct 10 ms 10580 KB Output is correct
43 Correct 9 ms 10580 KB Output is correct
44 Correct 12 ms 10580 KB Output is correct
45 Correct 106 ms 13084 KB Output is correct
46 Correct 59 ms 13080 KB Output is correct
47 Correct 47 ms 55224 KB Output is correct
48 Correct 56 ms 97720 KB Output is correct
49 Runtime error 778 ms 262144 KB Execution killed with signal 9
50 Halted 0 ms 0 KB -