oj.uz

Submission #553080

# Submission time Handle Problem Language Result Execution time Memory
553080 2022-04-24T15:29:38 Z urosk Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 42 ms 11676 KB 
// __builtin_popcount(x) broj bitova
// __builtin_popcountll(x)
// __builtin_clz(x) vodece nule
// __builtin_clzll(x)
// __builtin_ctz(x) nule na pocetku
// __builtin_ctzll(x)
// 2000000011
// 2000000033
#include "bits/stdc++.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll int
#define ull unsigned long long
#define llinf 1000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) ((ll)(a.size()))
#define all(a) a.begin(),a.end()
#define rall(a) a.begin(),a.end(),greater<int>()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define pi 3.14159265358979323846
#define here cerr<<"=============================================================================\n"
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define ceri2(a,l,r,n,m) {for(ll i = l;i<=r;i++){for(ll j = n;j<=m;j++) cerr<<a[i][j]<< " ";cerr<<endl;}}
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
using namespace std;
using namespace __gnu_pbds;

template<typename T> using vc = vector<T>;
template<typename T> using vvc = vc<vc<T>>;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}

void setIO(string inoutname)
{
	freopen((inoutname+".in").c_str(),"r",stdin);
    	freopen((inoutname+".out").c_str(),"w",stdout);
}
#define mod 1
ll gcd(ll a, ll b)
{
   if(b==0) return a;
   if(a==0) return b;
   if(a>=b)  return gcd(a%b,b);
   return  gcd(a,b%a);
}
ll lcm(ll a,ll b){
   return (a/gcd(a,b))*b;
}
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
	if(x==mod) x = 0;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}
ll po(ll x,ll y){
    if(y==0) return 1LL;
    ll ans = po(x,y/2);
    ans = mul(ans,ans);
    if(y&1) ans = mul(ans,x);
    return ans;
}
ll inv(ll x){return po(x,mod-2);}

#define maxn 30005
ll n,m;
vector<pll> g[maxn];
set<ll> v[maxn];
pll a[maxn];
ll d[maxn];
bool cmp(pll x,pll y){
    return x.sc<y.sc;
}
void tc(){
	daj_mi_malo_vremena
    cin >> n >> m;
    for(ll i = 1;i<=m;i++){
        ll x,y; cin >> x >> y;
        a[i] = {x,y};
        v[x].insert(y);
    }
    for(ll i = 0;i<n;i++){
        for(ll x : v[i]){
            for(ll j = i+x;j<n;j+=x){
                if(sz(v[j])==0) continue;
                g[i].pb({j,(j-i)/x});
                if(v[j].count(x)) break;
            }
            for(ll j = i-x;j>=0;j-=x){
                if(sz(v[j])==0) continue;
                g[i].pb({j,(i-j)/x});
                if(v[j].count(x)) break;
            }

        }
    }
    fill(d,d+maxn-1,llinf);
    d[a[1].fi] = 0;
    priority_queue<pll> pq;
    pq.push({0,a[1].fi});
    while(sz(pq)){
        ll u = pq.top().sc;
        ll dis = -pq.top().fi;
        pq.pop();
        if(dis!=d[u]) continue;
        for(pll p : g[u]){
            ll s = p.fi;
            ll c = p.sc;
            if(d[u]+c<d[s]){
                d[s] = d[u] + c;
                pq.push({-d[s],s});
            }
        }
    }
    ll ans = d[a[2].fi];
    if(ans==llinf) ans = -1;
    cout<<ans<<endl;
}
int main(){
	daj_mi_malo_vremena
	//setIO("lol");
	int t; t = 1;
	while(t--){
		tc();
	}
	return 0;
}

Compilation message

skyscraper.cpp: In function 'void setIO(std::string)':
skyscraper.cpp:50:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |  freopen((inoutname+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:51:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |      freopen((inoutname+".out").c_str(),"w",stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2516 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 1 ms 2516 KB Output is correct
4 Correct 2 ms 2516 KB Output is correct
5 Correct 2 ms 2516 KB Output is correct
6 Correct 1 ms 2516 KB Output is correct
7 Correct 1 ms 2516 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2516 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 1 ms 2516 KB Output is correct
4 Correct 1 ms 2516 KB Output is correct
5 Correct 1 ms 2516 KB Output is correct
6 Correct 1 ms 2516 KB Output is correct
7 Correct 1 ms 2516 KB Output is correct
8 Correct 2 ms 2516 KB Output is correct
9 Correct 2 ms 2516 KB Output is correct
10 Correct 1 ms 2516 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2516 KB Output is correct
13 Correct 2 ms 2516 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2516 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 2 ms 2516 KB Output is correct
4 Correct 1 ms 2516 KB Output is correct
5 Correct 1 ms 2516 KB Output is correct
6 Correct 2 ms 2516 KB Output is correct
7 Correct 1 ms 2516 KB Output is correct
8 Correct 1 ms 2516 KB Output is correct
9 Correct 2 ms 2516 KB Output is correct
10 Correct 2 ms 2516 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2516 KB Output is correct
13 Correct 2 ms 2516 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2612 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2772 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2516 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 3 ms 2516 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 3 ms 2772 KB Output is correct
25 Correct 3 ms 2772 KB Output is correct
26 Correct 2 ms 2516 KB Output is correct
27 Correct 2 ms 2516 KB Output is correct
28 Correct 3 ms 2900 KB Output is correct
29 Correct 2 ms 2516 KB Output is correct
30 Correct 2 ms 2516 KB Output is correct
31 Correct 2 ms 2516 KB Output is correct
32 Correct 2 ms 2516 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2516 KB Output is correct
2 Correct 2 ms 2484 KB Output is correct
3 Correct 1 ms 2516 KB Output is correct
4 Correct 2 ms 2516 KB Output is correct
5 Correct 1 ms 2516 KB Output is correct
6 Correct 1 ms 2516 KB Output is correct
7 Correct 2 ms 2516 KB Output is correct
8 Correct 2 ms 2516 KB Output is correct
9 Correct 1 ms 2516 KB Output is correct
10 Correct 2 ms 2516 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2516 KB Output is correct
13 Correct 2 ms 2516 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 3 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 3 ms 2772 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2516 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 2 ms 2516 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 2772 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 3 ms 2604 KB Output is correct
27 Correct 2 ms 2516 KB Output is correct
28 Correct 3 ms 2908 KB Output is correct
29 Correct 2 ms 2516 KB Output is correct
30 Correct 2 ms 2516 KB Output is correct
31 Correct 2 ms 2516 KB Output is correct
32 Correct 2 ms 2516 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 15 ms 4948 KB Output is correct
36 Correct 3 ms 2900 KB Output is correct
37 Correct 16 ms 5572 KB Output is correct
38 Correct 19 ms 5844 KB Output is correct
39 Correct 19 ms 5992 KB Output is correct
40 Correct 22 ms 5956 KB Output is correct
41 Correct 19 ms 5816 KB Output is correct
42 Correct 5 ms 2696 KB Output is correct
43 Correct 6 ms 2772 KB Output is correct
44 Correct 5 ms 2900 KB Output is correct
45 Correct 15 ms 4436 KB Output is correct
46 Correct 15 ms 4476 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2516 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 1 ms 2516 KB Output is correct
4 Correct 1 ms 2516 KB Output is correct
5 Correct 1 ms 2516 KB Output is correct
6 Correct 2 ms 2516 KB Output is correct
7 Correct 1 ms 2516 KB Output is correct
8 Correct 1 ms 2516 KB Output is correct
9 Correct 1 ms 2516 KB Output is correct
10 Correct 2 ms 2516 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2520 KB Output is correct
13 Correct 2 ms 2520 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 3 ms 2644 KB Output is correct
17 Correct 4 ms 2772 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2516 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 2 ms 2516 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 3 ms 2772 KB Output is correct
25 Correct 2 ms 2716 KB Output is correct
26 Correct 2 ms 2516 KB Output is correct
27 Correct 2 ms 2516 KB Output is correct
28 Correct 2 ms 2900 KB Output is correct
29 Correct 2 ms 2516 KB Output is correct
30 Correct 2 ms 2516 KB Output is correct
31 Correct 2 ms 2516 KB Output is correct
32 Correct 2 ms 2516 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 16 ms 4904 KB Output is correct
36 Correct 4 ms 2900 KB Output is correct
37 Correct 20 ms 5600 KB Output is correct
38 Correct 20 ms 5972 KB Output is correct
39 Correct 20 ms 5984 KB Output is correct
40 Correct 19 ms 5864 KB Output is correct
41 Correct 23 ms 5864 KB Output is correct
42 Correct 4 ms 2772 KB Output is correct
43 Correct 6 ms 2800 KB Output is correct
44 Correct 5 ms 2900 KB Output is correct
45 Correct 14 ms 4504 KB Output is correct
46 Correct 16 ms 4436 KB Output is correct
47 Correct 42 ms 11676 KB Output is correct
48 Correct 18 ms 5460 KB Output is correct
49 Correct 12 ms 4780 KB Output is correct
50 Correct 9 ms 4116 KB Output is correct
51 Correct 29 ms 7220 KB Output is correct
52 Correct 28 ms 7612 KB Output is correct
53 Correct 15 ms 5392 KB Output is correct
54 Correct 2 ms 2516 KB Output is correct
55 Correct 2 ms 2516 KB Output is correct
56 Correct 14 ms 5332 KB Output is correct
57 Correct 7 ms 3348 KB Output is correct
58 Correct 5 ms 2836 KB Output is correct
59 Correct 6 ms 2972 KB Output is correct
60 Correct 8 ms 3028 KB Output is correct
61 Correct 7 ms 3156 KB Output is correct
62 Correct 21 ms 9608 KB Output is correct
63 Correct 17 ms 4528 KB Output is correct
64 Correct 19 ms 4560 KB Output is correct
65 Correct 19 ms 4544 KB Output is correct
66 Correct 24 ms 4628 KB Output is correct
67 Correct 29 ms 4744 KB Output is correct