oj.uz

답안 #829023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829023 2023-08-18T02:04:36 Z bachhoangxuan Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 292 ms 90284 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e9;
const int mod=998244353;
const int maxn=30005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;

int n,m,B[maxn],P[maxn];
map<pii,vector<int>> mp;
vector<int> dist,cc,pos;
vector<int> edge[maxn];

void solve(){
    cin >> n >> m;
    for(int i=1;i<=m;i++){
        cin >> B[i] >> P[i];
        mp[{P[i],B[i]%P[i]}].emplace_back(B[i]);
    }
    int cnt=n;
    cc.assign(cnt,-1);
    pos.assign(cnt,-1);

    for(auto [x,v]:mp){
        int d=x.fi,r=x.se;
        sort(v.begin(),v.end());
        for(int a:v) edge[a].push_back(cnt+a/d);
        for(int i=r;i<n;i+=d){
            int add=0;
            if(i>r) add|=1;
            if(i+d<n) add|=2;
            cc.emplace_back(add);
            pos.emplace_back(i);
            cnt++;
        }
    }
    dist.assign(cnt,inf);
    deque<pii> q;
    q.emplace_back(0,B[1]);dist[B[1]]=0;
    while(!q.empty()){
        auto [d,u]=q.front();q.pop_front();
        if(dist[u]!=d) continue;
        if(u<n){
            for(int v:edge[u]){
                if(d<dist[v]){
                    dist[v]=d;
                    q.emplace_front(d,v);
                }
            }
        }
        else{
            int p=pos[u];
            if(d<dist[p]){
                dist[p]=d;
                q.emplace_front(d,p);
            }
            if((cc[u]&1) && d+1<dist[u-1]){
                dist[u-1]=d+1;
                q.emplace_back(d+1,u-1);
            }
            if((cc[u]&2) && d+1<dist[u+1]){
                dist[u+1]=d+1;
                q.emplace_back(d+1,u+1);
            }
        }
    }
    cout << (dist[B[2]]==inf?-1:dist[B[2]]) << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1032 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 1040 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1036 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 2 ms 1392 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 2 ms 1432 KB Output is correct
18 Correct 1 ms 1300 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 1236 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 1 ms 1236 KB Output is correct
24 Correct 2 ms 1492 KB Output is correct
25 Correct 2 ms 1428 KB Output is correct
26 Correct 1 ms 1236 KB Output is correct
27 Correct 1 ms 1304 KB Output is correct
28 Correct 2 ms 1620 KB Output is correct
29 Correct 2 ms 1976 KB Output is correct
30 Correct 1 ms 1296 KB Output is correct
31 Correct 2 ms 1716 KB Output is correct
32 Correct 1 ms 1420 KB Output is correct
33 Correct 4 ms 3132 KB Output is correct
34 Correct 4 ms 3132 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1032 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 1036 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1036 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 2 ms 1364 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 2 ms 1492 KB Output is correct
18 Correct 2 ms 1400 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1152 KB Output is correct
21 Correct 2 ms 1168 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 1 ms 1236 KB Output is correct
24 Correct 2 ms 1492 KB Output is correct
25 Correct 2 ms 1484 KB Output is correct
26 Correct 1 ms 1216 KB Output is correct
27 Correct 1 ms 1236 KB Output is correct
28 Correct 2 ms 1560 KB Output is correct
29 Correct 2 ms 1976 KB Output is correct
30 Correct 1 ms 1364 KB Output is correct
31 Correct 2 ms 1716 KB Output is correct
32 Correct 1 ms 1364 KB Output is correct
33 Correct 4 ms 3072 KB Output is correct
34 Correct 5 ms 3064 KB Output is correct
35 Correct 15 ms 5740 KB Output is correct
36 Correct 3 ms 2004 KB Output is correct
37 Correct 14 ms 5784 KB Output is correct
38 Correct 19 ms 7048 KB Output is correct
39 Correct 26 ms 7108 KB Output is correct
40 Correct 19 ms 7132 KB Output is correct
41 Correct 19 ms 7136 KB Output is correct
42 Correct 4 ms 1948 KB Output is correct
43 Correct 4 ms 2004 KB Output is correct
44 Correct 4 ms 1940 KB Output is correct
45 Correct 24 ms 10784 KB Output is correct
46 Correct 29 ms 10812 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1036 KB Output is correct
2 Correct 1 ms 1036 KB Output is correct
3 Correct 1 ms 1036 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 2 ms 1236 KB Output is correct
12 Correct 1 ms 1040 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 2 ms 1304 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 2 ms 1432 KB Output is correct
18 Correct 1 ms 1236 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 1236 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 1 ms 1236 KB Output is correct
24 Correct 2 ms 1432 KB Output is correct
25 Correct 2 ms 1428 KB Output is correct
26 Correct 2 ms 1236 KB Output is correct
27 Correct 1 ms 1236 KB Output is correct
28 Correct 2 ms 1620 KB Output is correct
29 Correct 2 ms 1976 KB Output is correct
30 Correct 1 ms 1364 KB Output is correct
31 Correct 2 ms 1716 KB Output is correct
32 Correct 2 ms 1420 KB Output is correct
33 Correct 4 ms 3132 KB Output is correct
34 Correct 4 ms 3132 KB Output is correct
35 Correct 16 ms 5712 KB Output is correct
36 Correct 3 ms 2004 KB Output is correct
37 Correct 14 ms 5760 KB Output is correct
38 Correct 25 ms 7028 KB Output is correct
39 Correct 19 ms 7012 KB Output is correct
40 Correct 19 ms 7116 KB Output is correct
41 Correct 20 ms 7124 KB Output is correct
42 Correct 5 ms 2004 KB Output is correct
43 Correct 5 ms 1944 KB Output is correct
44 Correct 4 ms 1944 KB Output is correct
45 Correct 24 ms 10800 KB Output is correct
46 Correct 24 ms 10820 KB Output is correct
47 Correct 38 ms 13412 KB Output is correct
48 Correct 14 ms 7368 KB Output is correct
49 Correct 13 ms 6168 KB Output is correct
50 Correct 9 ms 5292 KB Output is correct
51 Correct 27 ms 9576 KB Output is correct
52 Correct 28 ms 9944 KB Output is correct
53 Correct 21 ms 6904 KB Output is correct
54 Correct 1 ms 1748 KB Output is correct
55 Correct 2 ms 2172 KB Output is correct
56 Correct 8 ms 3284 KB Output is correct
57 Correct 13 ms 6664 KB Output is correct
58 Correct 6 ms 2968 KB Output is correct
59 Correct 7 ms 3432 KB Output is correct
60 Correct 8 ms 3756 KB Output is correct
61 Correct 8 ms 3772 KB Output is correct
62 Correct 33 ms 11848 KB Output is correct
63 Correct 93 ms 32284 KB Output is correct
64 Correct 105 ms 38360 KB Output is correct
65 Correct 159 ms 52948 KB Output is correct
66 Correct 292 ms 90284 KB Output is correct
67 Correct 259 ms 90208 KB Output is correct