Submission #243888

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
243888	2020-07-02T04:50:56 Z	Nson	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	115 ms	86948 KB

skyscraper

// modified from Leonardo_Paes's code https://pastebin.com/RUnXKRRp
#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];
vector<pii> fila[maxn*10];
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int n, m;
    cin >> n >> m;
    for(int i=0; i<m; i++){
        cin >> b[i] >> p[i];
        doges[b[i]].push_back(i);
    }
    memset(dist1, inf, sizeof dist1);
    memset(dist2, inf, sizeof dist2);
    fila[0].push_back({b[0], 0});
	for(int d = 0; !fila[d].empty(); d++) {
		while(!fila[d].empty()){
			int u = fila[d].back().f, id = fila[d].back().s;
			int power = p[id];
			fila[d].pop_back();
			if(power <= magic){
				if(dist2[u][power] == inf) dist2[u][power] = d;
				if(u + power < n and dist2[u + power][power] == inf){
					fila[d + 1].push_back({u + power, id});
					dist2[u + power][power] = d + 1;
				}
				if(u - power >= 0 and dist2[u - power][power] == inf){
					fila[d + 1].push_back({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[d+qtd].push_back({v, id});
					for(int v=u-power, qtd=1; v>=0; v-=power, qtd++) fila[d+qtd].push_back({v, id});
				}
			}
			if(!doges[u].empty()){
				for(auto v : doges[u]) fila[d].push_back({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

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	32256 KB	Output is correct
2	Correct	22 ms	32248 KB	Output is correct
3	Correct	25 ms	32384 KB	Output is correct
4	Correct	24 ms	32256 KB	Output is correct
5	Correct	23 ms	32256 KB	Output is correct
6	Correct	22 ms	32256 KB	Output is correct
7	Correct	22 ms	32256 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	32384 KB	Output is correct
2	Correct	23 ms	32256 KB	Output is correct
3	Correct	24 ms	32384 KB	Output is correct
4	Correct	22 ms	32256 KB	Output is correct
5	Correct	24 ms	32256 KB	Output is correct
6	Correct	23 ms	32256 KB	Output is correct
7	Correct	22 ms	32256 KB	Output is correct
8	Correct	23 ms	32256 KB	Output is correct
9	Correct	22 ms	32384 KB	Output is correct
10	Correct	23 ms	32384 KB	Output is correct
11	Correct	23 ms	32384 KB	Output is correct
12	Correct	24 ms	32384 KB	Output is correct
13	Correct	24 ms	32384 KB	Output is correct
14	Correct	25 ms	32384 KB	Output is correct
15	Correct	22 ms	32384 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	27 ms	32380 KB	Output is correct
2	Correct	24 ms	32384 KB	Output is correct
3	Correct	23 ms	32248 KB	Output is correct
4	Correct	23 ms	32256 KB	Output is correct
5	Correct	22 ms	32256 KB	Output is correct
6	Correct	24 ms	32384 KB	Output is correct
7	Correct	23 ms	32384 KB	Output is correct
8	Correct	22 ms	32256 KB	Output is correct
9	Correct	25 ms	32384 KB	Output is correct
10	Correct	24 ms	32384 KB	Output is correct
11	Correct	23 ms	32384 KB	Output is correct
12	Correct	24 ms	32384 KB	Output is correct
13	Correct	23 ms	32512 KB	Output is correct
14	Correct	25 ms	32384 KB	Output is correct
15	Correct	24 ms	32376 KB	Output is correct
16	Correct	25 ms	32248 KB	Output is correct
17	Correct	23 ms	32512 KB	Output is correct
18	Correct	22 ms	32384 KB	Output is correct
19	Correct	22 ms	32384 KB	Output is correct
20	Correct	23 ms	32512 KB	Output is correct
21	Correct	22 ms	32384 KB	Output is correct
22	Correct	23 ms	32376 KB	Output is correct
23	Correct	23 ms	32384 KB	Output is correct
24	Correct	23 ms	32512 KB	Output is correct
25	Correct	24 ms	32512 KB	Output is correct
26	Correct	23 ms	32512 KB	Output is correct
27	Correct	25 ms	32512 KB	Output is correct
28	Correct	25 ms	33024 KB	Output is correct
29	Correct	25 ms	33020 KB	Output is correct
30	Correct	24 ms	32512 KB	Output is correct
31	Correct	26 ms	32888 KB	Output is correct
32	Correct	25 ms	32640 KB	Output is correct
33	Correct	27 ms	33408 KB	Output is correct
34	Correct	27 ms	33400 KB	Output is correct

Subtask #4
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	32376 KB	Output is correct
2	Correct	23 ms	32256 KB	Output is correct
3	Correct	22 ms	32248 KB	Output is correct
4	Correct	23 ms	32256 KB	Output is correct
5	Correct	23 ms	32256 KB	Output is correct
6	Correct	23 ms	32256 KB	Output is correct
7	Correct	22 ms	32256 KB	Output is correct
8	Correct	22 ms	32256 KB	Output is correct
9	Correct	22 ms	32256 KB	Output is correct
10	Correct	23 ms	32256 KB	Output is correct
11	Correct	23 ms	32384 KB	Output is correct
12	Correct	22 ms	32384 KB	Output is correct
13	Correct	24 ms	32384 KB	Output is correct
14	Correct	22 ms	32384 KB	Output is correct
15	Correct	22 ms	32384 KB	Output is correct
16	Correct	27 ms	32256 KB	Output is correct
17	Correct	23 ms	32512 KB	Output is correct
18	Correct	23 ms	32384 KB	Output is correct
19	Correct	23 ms	32376 KB	Output is correct
20	Correct	25 ms	32384 KB	Output is correct
21	Correct	23 ms	32384 KB	Output is correct
22	Correct	22 ms	32256 KB	Output is correct
23	Correct	23 ms	32384 KB	Output is correct
24	Correct	24 ms	32512 KB	Output is correct
25	Correct	25 ms	32504 KB	Output is correct
26	Correct	23 ms	32512 KB	Output is correct
27	Correct	22 ms	32512 KB	Output is correct
28	Correct	24 ms	33024 KB	Output is correct
29	Correct	24 ms	33024 KB	Output is correct
30	Correct	25 ms	32512 KB	Output is correct
31	Correct	26 ms	32768 KB	Output is correct
32	Correct	25 ms	32640 KB	Output is correct
33	Correct	28 ms	33408 KB	Output is correct
34	Correct	26 ms	33408 KB	Output is correct
35	Correct	32 ms	33664 KB	Output is correct
36	Correct	24 ms	32512 KB	Output is correct
37	Correct	32 ms	34172 KB	Output is correct
38	Correct	37 ms	34292 KB	Output is correct
39	Correct	34 ms	34300 KB	Output is correct
40	Correct	35 ms	34244 KB	Output is correct
41	Correct	34 ms	34244 KB	Output is correct
42	Correct	29 ms	33408 KB	Output is correct
43	Correct	29 ms	33408 KB	Output is correct
44	Correct	28 ms	33408 KB	Output is correct
45	Correct	41 ms	36824 KB	Output is correct
46	Correct	41 ms	36776 KB	Output is correct

Subtask #5
0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	32384 KB	Output is correct
2	Correct	22 ms	32256 KB	Output is correct
3	Correct	24 ms	32248 KB	Output is correct
4	Correct	24 ms	32256 KB	Output is correct
5	Correct	23 ms	32256 KB	Output is correct
6	Correct	22 ms	32256 KB	Output is correct
7	Correct	22 ms	32288 KB	Output is correct
8	Correct	22 ms	32256 KB	Output is correct
9	Correct	22 ms	32256 KB	Output is correct
10	Correct	23 ms	32256 KB	Output is correct
11	Correct	23 ms	32512 KB	Output is correct
12	Correct	23 ms	32384 KB	Output is correct
13	Correct	23 ms	32384 KB	Output is correct
14	Correct	23 ms	32512 KB	Output is correct
15	Correct	22 ms	32384 KB	Output is correct
16	Correct	24 ms	32256 KB	Output is correct
17	Correct	23 ms	32512 KB	Output is correct
18	Correct	22 ms	32384 KB	Output is correct
19	Correct	22 ms	32256 KB	Output is correct
20	Correct	22 ms	32384 KB	Output is correct
21	Correct	24 ms	32384 KB	Output is correct
22	Correct	22 ms	32384 KB	Output is correct
23	Correct	25 ms	32376 KB	Output is correct
24	Correct	26 ms	32504 KB	Output is correct
25	Correct	23 ms	32512 KB	Output is correct
26	Correct	26 ms	32512 KB	Output is correct
27	Correct	23 ms	32512 KB	Output is correct
28	Correct	27 ms	33024 KB	Output is correct
29	Correct	24 ms	33024 KB	Output is correct
30	Correct	24 ms	32512 KB	Output is correct
31	Correct	23 ms	32768 KB	Output is correct
32	Correct	23 ms	32640 KB	Output is correct
33	Correct	28 ms	33536 KB	Output is correct
34	Correct	30 ms	33528 KB	Output is correct
35	Correct	31 ms	33664 KB	Output is correct
36	Correct	24 ms	32512 KB	Output is correct
37	Correct	31 ms	34292 KB	Output is correct
38	Correct	35 ms	34292 KB	Output is correct
39	Correct	35 ms	34300 KB	Output is correct
40	Correct	33 ms	34244 KB	Output is correct
41	Correct	34 ms	34252 KB	Output is correct
42	Correct	30 ms	33408 KB	Output is correct
43	Correct	28 ms	33408 KB	Output is correct
44	Correct	28 ms	33400 KB	Output is correct
45	Correct	40 ms	36820 KB	Output is correct
46	Correct	40 ms	36776 KB	Output is correct
47	Correct	69 ms	39988 KB	Output is correct
48	Correct	29 ms	33152 KB	Output is correct
49	Correct	34 ms	33148 KB	Output is correct
50	Correct	31 ms	33024 KB	Output is correct
51	Correct	52 ms	36856 KB	Output is correct
52	Correct	54 ms	36856 KB	Output is correct
53	Correct	43 ms	34680 KB	Output is correct
54	Correct	25 ms	32768 KB	Output is correct
55	Correct	24 ms	33024 KB	Output is correct
56	Correct	40 ms	34552 KB	Output is correct
57	Correct	49 ms	37112 KB	Output is correct
58	Correct	33 ms	34812 KB	Output is correct
59	Correct	38 ms	35956 KB	Output is correct
60	Correct	40 ms	35832 KB	Output is correct
61	Correct	39 ms	35712 KB	Output is correct
62	Runtime error	115 ms	86948 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
63	Halted	0 ms	0 KB	-

Submission #243888

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