oj.uz

Submission #459499

# Submission time Handle Problem Language Result Execution time Memory
459499 2021-08-08T14:42:40 Z azberjibiou Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 844 ms 149852 KB 
#include <bits/stdc++.h>
#define gibon ios::sync_with_stdio(false); cin.tie(0);
#define bp __builtin_popcount
#define fir first
#define sec second
#define pii pair<int, int>
#define pll pair<ll, ll>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
using namespace std;
int dx[4]={0, 1, 0, -1}, dy[4]={1, 0, -1 , 0};
const int mxN=30010;
const int mxM=7300000;
const int mxK=100001;
const int MOD=1000000007;
const ll INF=9223372036854775807;
int N, M;
vector <pii> BP;
int l[mxM], r[mxM], in[mxM];
vector <int> out[mxN];
int idx;
int X, Y;
int lst[4*mxM], lc, rc;
int dis[mxM];
bool Chk[mxM];
bool cmp1(pii a, pii b)
{
    if(a.sec!=b.sec) return a.sec<b.sec;
    if(a.fir%a.sec!=b.fir%b.sec)    return a.fir%a.sec<b.fir%b.sec;
    return a.fir<b.fir;
}
void zero_one_bfs()
{
    while(lc!=rc)
    {
        int now=lst[lc];
        lc++;
        if(Chk[now])    continue;
        Chk[now]=true;
        if(now<=N)
        {
            for(int nxt : out[now])
            {
                if(dis[nxt]>dis[now])
                {
                    dis[nxt]=dis[now];
                    lst[--lc]=nxt;
                }
            }
        }
        else
        {
            if(l[now]!=-1)
            {
                if(dis[l[now]]>dis[now]+1)
                {
                    dis[l[now]]=dis[now]+1;
                    lst[rc++]=l[now];
                    //lst.push_back(l[now]);
                }
            }
            if(r[now]!=-1)
            {
                if(dis[r[now]]>dis[now]+1)
                {
                    dis[r[now]]=dis[now]+1;
                    lst[rc++]=r[now];
                    //lst.push_back(r[now]);
                }
            }
            if(dis[in[now]]>dis[now])
            {
                dis[in[now]]=dis[now];
                lst[--lc]=in[now];
                //lst.push_front(in[now]);
            }
        }
    }
}
int main()
{
    gibon
    cin >> N >> M;
    idx=N+1;
    BP.resize(M);
    for(int i=0;i<M;i++)
    {
        cin >> BP[i].fir >> BP[i].sec;
        BP[i].fir++;
        if(i==0)    X=BP[i].fir;
        if(i==1)    Y=BP[i].fir;
    }
    sort(BP.begin(), BP.end(), cmp1);
    int cur=0;
    while(cur<M)
    {
        int ncur=cur;
        bool jog=false;
        for(int j=(BP[ncur].fir-1)%BP[ncur].sec+1;j<=N;j+=BP[ncur].sec)
        {
            if(cur<M && BP[cur].fir==j && BP[cur].sec==BP[ncur].sec)
            {
                out[j].push_back(idx);
                while(cur<M && BP[cur].fir==j && BP[cur].sec==BP[ncur].sec)   cur++;
            }
            in[idx]=j;
            if(!jog)    jog=true;
            else
            {
                l[idx]=idx-1;
                r[idx-1]=idx;
            }
            idx++;
        }
    }
    for(int i=0;i<idx;i++)
    {
        dis[i]=mxM;
    }
    dis[X]=0;
    lst[mxM]=X;
    lc=mxM, rc=mxM+1;
    zero_one_bfs();
    if(dis[Y]==mxM) cout << -1;
    else    cout << dis[Y];
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 1032 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 2 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1036 KB Output is correct
11 Correct 2 ms 1172 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 2 ms 1100 KB Output is correct
14 Correct 2 ms 1228 KB Output is correct
15 Correct 2 ms 1228 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 1028 KB Output is correct
6 Correct 1 ms 1036 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1168 KB Output is correct
12 Correct 2 ms 1100 KB Output is correct
13 Correct 2 ms 1100 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 ms 1228 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 2 ms 1356 KB Output is correct
18 Correct 1 ms 1228 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 2 ms 1100 KB Output is correct
21 Correct 2 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 2 ms 1228 KB Output is correct
24 Correct 2 ms 1408 KB Output is correct
25 Correct 2 ms 1228 KB Output is correct
26 Correct 2 ms 1228 KB Output is correct
27 Correct 2 ms 1228 KB Output is correct
28 Correct 3 ms 1612 KB Output is correct
29 Correct 3 ms 2252 KB Output is correct
30 Correct 2 ms 1356 KB Output is correct
31 Correct 2 ms 1740 KB Output is correct
32 Correct 2 ms 1544 KB Output is correct
33 Correct 6 ms 3532 KB Output is correct
34 Correct 6 ms 3532 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 2 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 2 ms 1228 KB Output is correct
15 Correct 2 ms 1228 KB Output is correct
16 Correct 2 ms 1100 KB Output is correct
17 Correct 2 ms 1304 KB Output is correct
18 Correct 1 ms 1228 KB Output is correct
19 Correct 1 ms 1168 KB Output is correct
20 Correct 2 ms 1100 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 1 ms 1172 KB Output is correct
24 Correct 3 ms 1356 KB Output is correct
25 Correct 2 ms 1228 KB Output is correct
26 Correct 2 ms 1228 KB Output is correct
27 Correct 2 ms 1228 KB Output is correct
28 Correct 2 ms 1612 KB Output is correct
29 Correct 3 ms 2252 KB Output is correct
30 Correct 1 ms 1356 KB Output is correct
31 Correct 2 ms 1668 KB Output is correct
32 Correct 2 ms 1484 KB Output is correct
33 Correct 6 ms 3532 KB Output is correct
34 Correct 6 ms 3532 KB Output is correct
35 Correct 18 ms 3660 KB Output is correct
36 Correct 3 ms 1484 KB Output is correct
37 Correct 16 ms 4940 KB Output is correct
38 Correct 21 ms 4920 KB Output is correct
39 Correct 20 ms 4940 KB Output is correct
40 Correct 20 ms 4932 KB Output is correct
41 Correct 19 ms 4880 KB Output is correct
42 Correct 13 ms 1616 KB Output is correct
43 Correct 12 ms 1616 KB Output is correct
44 Correct 12 ms 1620 KB Output is correct
45 Correct 45 ms 11472 KB Output is correct
46 Correct 37 ms 11416 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 1032 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1104 KB Output is correct
12 Correct 2 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 ms 1228 KB Output is correct
16 Correct 2 ms 1100 KB Output is correct
17 Correct 3 ms 1356 KB Output is correct
18 Correct 1 ms 1228 KB Output is correct
19 Correct 2 ms 1100 KB Output is correct
20 Correct 3 ms 1228 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 2 ms 1228 KB Output is correct
24 Correct 2 ms 1356 KB Output is correct
25 Correct 3 ms 1228 KB Output is correct
26 Correct 2 ms 1228 KB Output is correct
27 Correct 2 ms 1228 KB Output is correct
28 Correct 3 ms 1612 KB Output is correct
29 Correct 3 ms 2252 KB Output is correct
30 Correct 2 ms 1420 KB Output is correct
31 Correct 2 ms 1672 KB Output is correct
32 Correct 2 ms 1484 KB Output is correct
33 Correct 6 ms 3472 KB Output is correct
34 Correct 6 ms 3532 KB Output is correct
35 Correct 15 ms 3660 KB Output is correct
36 Correct 3 ms 1556 KB Output is correct
37 Correct 16 ms 5048 KB Output is correct
38 Correct 19 ms 4940 KB Output is correct
39 Correct 19 ms 4940 KB Output is correct
40 Correct 19 ms 4880 KB Output is correct
41 Correct 21 ms 4984 KB Output is correct
42 Correct 12 ms 1612 KB Output is correct
43 Correct 12 ms 1612 KB Output is correct
44 Correct 13 ms 1620 KB Output is correct
45 Correct 41 ms 11464 KB Output is correct
46 Correct 44 ms 11460 KB Output is correct
47 Correct 58 ms 16804 KB Output is correct
48 Correct 13 ms 5684 KB Output is correct
49 Correct 12 ms 4172 KB Output is correct
50 Correct 9 ms 4004 KB Output is correct
51 Correct 28 ms 8596 KB Output is correct
52 Correct 29 ms 9164 KB Output is correct
53 Correct 18 ms 3916 KB Output is correct
54 Correct 2 ms 1740 KB Output is correct
55 Correct 2 ms 2124 KB Output is correct
56 Correct 19 ms 3164 KB Output is correct
57 Correct 24 ms 10188 KB Output is correct
58 Correct 11 ms 2840 KB Output is correct
59 Correct 15 ms 3564 KB Output is correct
60 Correct 16 ms 4144 KB Output is correct
61 Correct 15 ms 3916 KB Output is correct
62 Correct 27 ms 12408 KB Output is correct
63 Correct 221 ms 48520 KB Output is correct
64 Correct 247 ms 59376 KB Output is correct
65 Correct 510 ms 84556 KB Output is correct
66 Correct 826 ms 149816 KB Output is correct
67 Correct 844 ms 149852 KB Output is correct