답안 #243885

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
243885	2020-07-02T04:26:07 Z	Leonardo_Paes	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1000 ms	50516 KB

skyscraper

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> pip;
#define f first
#define s second
const int maxn = 3e4+10, magic = 200, inf = 0x3f3f3f3f;
int b[maxn], p[maxn], dist1[maxn], dist2[maxn][magic+5];
vector<int> doges[maxn];
bool mark[maxn];
inline void scan (int &x)
{
    x=0; static int p; p=1; static char c; c=getchar();
    while (!isdigit(c)) { if (c=='-') p=-1; c=getchar(); }
    while ( isdigit(c)) { x=(x<<1)+(x<<3)+(c-48); c=getchar(); }
    x*=p;
}
int main(){
    //ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int n, m;
    scan(n), scan(m);
    for(int i=0; i<m; i++){
        scan(b[i]), scan(p[i]);
        doges[b[i]].push_back(i);
    }
    priority_queue<pip, vector<pip>, greater<pip>> fila;
    memset(dist1, inf, sizeof dist1);
    memset(dist2, inf, sizeof dist2);
    fila.push({0, {b[0], 0}});
    while(!fila.empty()){
        int d = fila.top().f, u = fila.top().s.f, id = fila.top().s.s, power = p[fila.top().s.s];
        fila.pop();
        if(power <= magic){
            if(dist2[u][power] == inf) dist2[u][power] = d;
            if(u + power < n and dist2[u + power][power] == inf){
                fila.push({d + 1, {u + power, id}});
                dist2[u + power][power] = d + 1;
            }
            if(u - power >= 0 and dist2[u - power][power] == inf){
                fila.push({d + 1, {u - power, id}});
                dist2[u - power][power] = d + 1;
            }
        }
        else{
            if(dist1[u] == inf) dist1[u] = d;
            if(!mark[id]){
                mark[id] = 1;
                for(int v=u+power, qtd=1; v<n; v+=power, qtd++) fila.push({d + qtd, {v, id}});
                for(int v=u-power, qtd=1; v>=0; v-=power, qtd++) fila.push({d + qtd, {v, id}});
            }
        }
        if(!doges[u].empty()){
            for(auto v : doges[u]) fila.push({d, {u, v}});
            doges[u].clear();
        }
    }
    int ans = dist1[b[1]];
    for(int i=1; i<=magic; i++) ans = min(ans, dist2[b[1]][i]);
    cout << (ans == inf ? -1 : ans) << "\n";
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	25216 KB	Output is correct
2	Correct	21 ms	25216 KB	Output is correct
3	Correct	18 ms	25216 KB	Output is correct
4	Correct	17 ms	25216 KB	Output is correct
5	Correct	17 ms	25216 KB	Output is correct
6	Correct	17 ms	25216 KB	Output is correct
7	Correct	16 ms	25216 KB	Output is correct
8	Correct	17 ms	25216 KB	Output is correct
9	Correct	17 ms	25216 KB	Output is correct
10	Correct	17 ms	25216 KB	Output is correct
11	Correct	20 ms	25344 KB	Output is correct
12	Correct	17 ms	25344 KB	Output is correct
13	Correct	17 ms	25344 KB	Output is correct
14	Correct	18 ms	25392 KB	Output is correct
15	Correct	20 ms	25344 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	25216 KB	Output is correct
2	Correct	18 ms	25216 KB	Output is correct
3	Correct	17 ms	25216 KB	Output is correct
4	Correct	17 ms	25216 KB	Output is correct
5	Correct	17 ms	25216 KB	Output is correct
6	Correct	17 ms	25216 KB	Output is correct
7	Correct	17 ms	25216 KB	Output is correct
8	Correct	17 ms	25216 KB	Output is correct
9	Correct	17 ms	25216 KB	Output is correct
10	Correct	17 ms	25216 KB	Output is correct
11	Correct	18 ms	25344 KB	Output is correct
12	Correct	17 ms	25344 KB	Output is correct
13	Correct	19 ms	25344 KB	Output is correct
14	Correct	19 ms	25344 KB	Output is correct
15	Correct	20 ms	25344 KB	Output is correct
16	Correct	17 ms	25216 KB	Output is correct
17	Correct	20 ms	25344 KB	Output is correct
18	Correct	17 ms	25216 KB	Output is correct
19	Correct	18 ms	25216 KB	Output is correct
20	Correct	17 ms	25344 KB	Output is correct
21	Correct	17 ms	25216 KB	Output is correct
22	Correct	17 ms	25216 KB	Output is correct
23	Correct	20 ms	25216 KB	Output is correct
24	Correct	20 ms	25344 KB	Output is correct
25	Correct	19 ms	25344 KB	Output is correct
26	Correct	18 ms	25344 KB	Output is correct
27	Correct	18 ms	25344 KB	Output is correct
28	Correct	19 ms	25472 KB	Output is correct
29	Correct	26 ms	25344 KB	Output is correct
30	Correct	19 ms	25216 KB	Output is correct
31	Correct	25 ms	25344 KB	Output is correct
32	Correct	19 ms	25216 KB	Output is correct
33	Correct	32 ms	25344 KB	Output is correct
34	Correct	32 ms	25344 KB	Output is correct

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	25216 KB	Output is correct
2	Correct	16 ms	25216 KB	Output is correct
3	Correct	16 ms	25216 KB	Output is correct
4	Correct	18 ms	25216 KB	Output is correct
5	Correct	16 ms	25216 KB	Output is correct
6	Correct	17 ms	25216 KB	Output is correct
7	Correct	16 ms	25216 KB	Output is correct
8	Correct	17 ms	25216 KB	Output is correct
9	Correct	17 ms	25216 KB	Output is correct
10	Correct	18 ms	25216 KB	Output is correct
11	Correct	18 ms	25344 KB	Output is correct
12	Correct	17 ms	25344 KB	Output is correct
13	Correct	17 ms	25344 KB	Output is correct
14	Correct	19 ms	25372 KB	Output is correct
15	Correct	19 ms	25344 KB	Output is correct
16	Correct	17 ms	25216 KB	Output is correct
17	Correct	20 ms	25344 KB	Output is correct
18	Correct	17 ms	25216 KB	Output is correct
19	Correct	17 ms	25216 KB	Output is correct
20	Correct	17 ms	25344 KB	Output is correct
21	Correct	19 ms	25216 KB	Output is correct
22	Correct	17 ms	25344 KB	Output is correct
23	Correct	18 ms	25344 KB	Output is correct
24	Correct	20 ms	25344 KB	Output is correct
25	Correct	18 ms	25344 KB	Output is correct
26	Correct	20 ms	25344 KB	Output is correct
27	Correct	19 ms	25344 KB	Output is correct
28	Correct	21 ms	25472 KB	Output is correct
29	Correct	25 ms	25344 KB	Output is correct
30	Correct	19 ms	25216 KB	Output is correct
31	Correct	20 ms	25216 KB	Output is correct
32	Correct	19 ms	25216 KB	Output is correct
33	Correct	32 ms	25344 KB	Output is correct
34	Correct	33 ms	25344 KB	Output is correct
35	Correct	43 ms	26176 KB	Output is correct
36	Correct	20 ms	25344 KB	Output is correct
37	Correct	53 ms	26492 KB	Output is correct
38	Correct	51 ms	26612 KB	Output is correct
39	Correct	53 ms	26620 KB	Output is correct
40	Correct	53 ms	26620 KB	Output is correct
41	Correct	54 ms	26620 KB	Output is correct
42	Correct	25 ms	26108 KB	Output is correct
43	Correct	25 ms	26108 KB	Output is correct
44	Correct	24 ms	26176 KB	Output is correct
45	Correct	112 ms	27384 KB	Output is correct
46	Correct	116 ms	27384 KB	Output is correct

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	25216 KB	Output is correct
2	Correct	16 ms	25216 KB	Output is correct
3	Correct	16 ms	25216 KB	Output is correct
4	Correct	18 ms	25216 KB	Output is correct
5	Correct	17 ms	25216 KB	Output is correct
6	Correct	17 ms	25216 KB	Output is correct
7	Correct	17 ms	25216 KB	Output is correct
8	Correct	17 ms	25216 KB	Output is correct
9	Correct	17 ms	25216 KB	Output is correct
10	Correct	17 ms	25216 KB	Output is correct
11	Correct	18 ms	25344 KB	Output is correct
12	Correct	17 ms	25344 KB	Output is correct
13	Correct	18 ms	25344 KB	Output is correct
14	Correct	18 ms	25344 KB	Output is correct
15	Correct	20 ms	25344 KB	Output is correct
16	Correct	19 ms	25216 KB	Output is correct
17	Correct	21 ms	25344 KB	Output is correct
18	Correct	19 ms	25344 KB	Output is correct
19	Correct	19 ms	25216 KB	Output is correct
20	Correct	19 ms	25344 KB	Output is correct
21	Correct	19 ms	25216 KB	Output is correct
22	Correct	19 ms	25216 KB	Output is correct
23	Correct	20 ms	25336 KB	Output is correct
24	Correct	21 ms	25344 KB	Output is correct
25	Correct	19 ms	25344 KB	Output is correct
26	Correct	19 ms	25344 KB	Output is correct
27	Correct	18 ms	25344 KB	Output is correct
28	Correct	19 ms	25344 KB	Output is correct
29	Correct	25 ms	25216 KB	Output is correct
30	Correct	19 ms	25216 KB	Output is correct
31	Correct	21 ms	25216 KB	Output is correct
32	Correct	22 ms	25216 KB	Output is correct
33	Correct	31 ms	25344 KB	Output is correct
34	Correct	31 ms	25344 KB	Output is correct
35	Correct	40 ms	26176 KB	Output is correct
36	Correct	21 ms	25344 KB	Output is correct
37	Correct	52 ms	26492 KB	Output is correct
38	Correct	52 ms	26620 KB	Output is correct
39	Correct	52 ms	26620 KB	Output is correct
40	Correct	52 ms	26620 KB	Output is correct
41	Correct	51 ms	26620 KB	Output is correct
42	Correct	27 ms	26108 KB	Output is correct
43	Correct	26 ms	26108 KB	Output is correct
44	Correct	25 ms	26176 KB	Output is correct
45	Correct	111 ms	27384 KB	Output is correct
46	Correct	111 ms	27384 KB	Output is correct
47	Correct	201 ms	29044 KB	Output is correct
48	Correct	23 ms	25848 KB	Output is correct
49	Correct	22 ms	25856 KB	Output is correct
50	Correct	20 ms	25728 KB	Output is correct
51	Correct	98 ms	26996 KB	Output is correct
52	Correct	102 ms	27004 KB	Output is correct
53	Correct	31 ms	26112 KB	Output is correct
54	Correct	19 ms	25216 KB	Output is correct
55	Correct	19 ms	25216 KB	Output is correct
56	Correct	26 ms	26368 KB	Output is correct
57	Correct	99 ms	25344 KB	Output is correct
58	Correct	27 ms	26176 KB	Output is correct
59	Correct	31 ms	26108 KB	Output is correct
60	Correct	43 ms	26104 KB	Output is correct
61	Correct	36 ms	26176 KB	Output is correct
62	Correct	67 ms	26488 KB	Output is correct
63	Correct	645 ms	38116 KB	Output is correct
64	Correct	853 ms	38244 KB	Output is correct
65	Execution timed out	1087 ms	50516 KB	Time limit exceeded
66	Halted	0 ms	0 KB	-

답안 #243885

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 21.0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
21.0 / 21.0

Subtask #5
0 / 43.0