oj.uz

답안 #459529

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
459529 2021-08-08T15:14:10 Z azberjibiou Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 815 ms 149620 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[2*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()
{
    int cnt=0;
    while(lc!=rc)
    {
        //assert(cnt<=mxM/3);
        int now=lst[lc];
        lc++;
        cnt++;
        Chk[now]=true;
        if(now<=N)
        {
            for(int nxt : out[now])
            {
                if(Chk[nxt] && dis[nxt]<=dis[now])  continue;
                dis[nxt]=dis[now];
                lst[--lc]=nxt;
                Chk[nxt]=true;
            }
        }
        else
        {
            if(l[now]!=-1)
            {
                if(!Chk[l[now]] && 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(!Chk[r[now]] && dis[r[now]]>dis[now]+1)
                {
                    dis[r[now]]=dis[now]+1;
                    lst[rc++]=r[now];
                    //lst.push_back(r[now]);
                }
            }
            if(!Chk[in[now]] && dis[in[now]]>dis[now])
            {
                dis[in[now]]=dis[now];
                lst[--lc]=in[now];
                Chk[in[now]]=true;
                //lst.push_front(in[now]);
                if(in[now]==Y)  return;
            }
        }
    }
}
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;
    //assert(idx<=2*mxM/3);
    zero_one_bfs();
    if(dis[Y]==mxM) cout << -1;
    else    cout << dis[Y];
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 1 ms 972 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 1100 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 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 1 ms 972 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 ms 1100 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 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 1 ms 1228 KB Output is correct
24 Correct 2 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 1484 KB Output is correct
29 Correct 3 ms 2264 KB Output is correct
30 Correct 1 ms 1356 KB Output is correct
31 Correct 2 ms 1740 KB Output is correct
32 Correct 2 ms 1484 KB Output is correct
33 Correct 5 ms 3532 KB Output is correct
34 Correct 5 ms 3244 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 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 944 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 1 ms 972 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 1100 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 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 1 ms 1228 KB Output is correct
24 Correct 2 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 1484 KB Output is correct
29 Correct 3 ms 2316 KB Output is correct
30 Correct 1 ms 1356 KB Output is correct
31 Correct 2 ms 1688 KB Output is correct
32 Correct 2 ms 1484 KB Output is correct
33 Correct 6 ms 3532 KB Output is correct
34 Correct 5 ms 3276 KB Output is correct
35 Correct 13 ms 3148 KB Output is correct
36 Correct 3 ms 1356 KB Output is correct
37 Correct 12 ms 4324 KB Output is correct
38 Correct 16 ms 4292 KB Output is correct
39 Correct 16 ms 4172 KB Output is correct
40 Correct 15 ms 4164 KB Output is correct
41 Correct 16 ms 4236 KB Output is correct
42 Correct 11 ms 1356 KB Output is correct
43 Correct 14 ms 1356 KB Output is correct
44 Correct 15 ms 1412 KB Output is correct
45 Correct 35 ms 11228 KB Output is correct
46 Correct 27 ms 10316 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 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 2 ms 1100 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 ms 1100 KB Output is correct
16 Correct 2 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 1 ms 1228 KB Output is correct
24 Correct 2 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 1484 KB Output is correct
29 Correct 3 ms 2276 KB Output is correct
30 Correct 1 ms 1356 KB Output is correct
31 Correct 2 ms 1740 KB Output is correct
32 Correct 2 ms 1484 KB Output is correct
33 Correct 6 ms 3488 KB Output is correct
34 Correct 5 ms 3296 KB Output is correct
35 Correct 15 ms 3172 KB Output is correct
36 Correct 4 ms 1356 KB Output is correct
37 Correct 14 ms 4268 KB Output is correct
38 Correct 16 ms 4232 KB Output is correct
39 Correct 18 ms 4096 KB Output is correct
40 Correct 15 ms 4172 KB Output is correct
41 Correct 16 ms 4300 KB Output is correct
42 Correct 12 ms 1412 KB Output is correct
43 Correct 14 ms 1408 KB Output is correct
44 Correct 12 ms 1408 KB Output is correct
45 Correct 44 ms 11136 KB Output is correct
46 Correct 31 ms 10364 KB Output is correct
47 Correct 26 ms 13888 KB Output is correct
48 Correct 15 ms 5452 KB Output is correct
49 Correct 17 ms 3964 KB Output is correct
50 Correct 28 ms 3836 KB Output is correct
51 Correct 20 ms 7372 KB Output is correct
52 Correct 21 ms 7856 KB Output is correct
53 Correct 15 ms 3404 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 2992 KB Output is correct
57 Correct 7 ms 8140 KB Output is correct
58 Correct 11 ms 2820 KB Output is correct
59 Correct 16 ms 3236 KB Output is correct
60 Correct 14 ms 3660 KB Output is correct
61 Correct 15 ms 3404 KB Output is correct
62 Correct 37 ms 12024 KB Output is correct
63 Correct 197 ms 48272 KB Output is correct
64 Correct 172 ms 58904 KB Output is correct
65 Correct 475 ms 84220 KB Output is correct
66 Correct 815 ms 149620 KB Output is correct
67 Correct 521 ms 135788 KB Output is correct