Submission #1024054

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1024054	2024-07-15T10:50:34 Z	Muhammet	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	36 / 100	1000 ms	1248 KB

skyscraper

#include <bits/stdc++.h>
using namespace std;

#define N 30001
#define ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second

int T, n, m, b[N], p[N], d[N], vis[N];

int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    cin >> n >> m;

    for(int i = 0; i < m; i++){
        cin >> b[i] >> p[i];
        d[i] = 1e9;
    }
    d[0] = 0;
    int x = 0;
    vis[0] = 1;
    vector <int> v;
    for(int i = 1; i < m; i++) v.push_back(i);
    while(sz(v) > 0){
    	if(x == 1) break;
        int mn = 1e9, ind = x;
        for(auto i : v){
            int k = (abs(b[i]-b[x]));
            if(d[i] < mn) ind = i;
            mn = min(d[i],mn);
            if(k % p[x] != 0) continue;
            d[i] = min(d[x] + (k/p[x]), d[i]);
            if(d[i] < mn) ind = i;
            mn = min(d[i],mn);
        }
        if(x == ind) break;
        x = ind;
        for(int i = 0; i < sz(v); i++){
        	if(v[i] == ind){
        		v.erase(v.begin() + i);
        		break;
        	}
        }
    }

    if(d[1] == 1e9) d[1] = -1;
    cout << d[1];

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	5 ms	516 KB	Output is correct
14	Correct	5 ms	348 KB	Output is correct
15	Correct	5 ms	600 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	5 ms	516 KB	Output is correct
14	Correct	6 ms	348 KB	Output is correct
15	Correct	5 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	3 ms	516 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	5 ms	516 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	5 ms	348 KB	Output is correct
25	Correct	2 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	344 KB	Output is correct
28	Correct	5 ms	348 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	5 ms	512 KB	Output is correct
34	Correct	5 ms	348 KB	Output is correct

Subtask #4
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	5 ms	348 KB	Output is correct
14	Correct	6 ms	512 KB	Output is correct
15	Correct	5 ms	516 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	3 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	5 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	4 ms	512 KB	Output is correct
25	Correct	2 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	352 KB	Output is correct
28	Correct	5 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	5 ms	348 KB	Output is correct
34	Correct	5 ms	348 KB	Output is correct
35	Correct	664 ms	988 KB	Output is correct
36	Correct	7 ms	348 KB	Output is correct
37	Correct	89 ms	888 KB	Output is correct
38	Correct	363 ms	1040 KB	Output is correct
39	Correct	4 ms	860 KB	Output is correct
40	Correct	21 ms	1060 KB	Output is correct
41	Correct	219 ms	1044 KB	Output is correct
42	Correct	3 ms	860 KB	Output is correct
43	Correct	11 ms	856 KB	Output is correct
44	Execution timed out	1010 ms	1036 KB	Time limit exceeded
45	Halted	0 ms	0 KB	-

Subtask #5
0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	5 ms	520 KB	Output is correct
14	Correct	5 ms	516 KB	Output is correct
15	Correct	5 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	3 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	6 ms	344 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	4 ms	344 KB	Output is correct
25	Correct	2 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	5 ms	348 KB	Output is correct
29	Correct	2 ms	344 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	2 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	5 ms	516 KB	Output is correct
34	Correct	5 ms	348 KB	Output is correct
35	Correct	664 ms	856 KB	Output is correct
36	Correct	7 ms	588 KB	Output is correct
37	Correct	90 ms	860 KB	Output is correct
38	Correct	357 ms	860 KB	Output is correct
39	Correct	4 ms	856 KB	Output is correct
40	Correct	20 ms	1068 KB	Output is correct
41	Correct	214 ms	856 KB	Output is correct
42	Correct	4 ms	856 KB	Output is correct
43	Correct	11 ms	856 KB	Output is correct
44	Correct	940 ms	1040 KB	Output is correct
45	Execution timed out	1006 ms	1248 KB	Time limit exceeded
46	Halted	0 ms	0 KB	-

Submission #1024054

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 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
0 / 21.0

Subtask #5
0 / 43.0