Submission #1037670

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1037670	2024-07-29T06:34:24 Z	Muhammet	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	928 ms	1372 KB

skyscraper

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

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

const ll N = 30002;

int T, n, m, dis[N], c[N];

vector <int> v1, v;

pair<int,int> a[N];

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

    cin >> n >> m;

    for(int i = 0; i < m; i++){
        cin >> a[i].ff >> a[i].ss;
    }

    int ind = a[0].ff, p = a[1].ff;

    sort (a,a+m);

    c[a[0].ff] = 0;
    v.push_back(a[0].ff);
    for(int i = 1; i < m; i++){
        if(a[i].ff != a[i-1].ff) c[a[i].ff] = i, v.push_back(a[i].ff);
    }

    for(int i = 0; i <= n; i++) dis[i] = 1e9;
    dis[ind] = 0;

    for(int i = 0; i < m; i++){
        if(a[i].ff == ind){
            if(sz(v1) > 0 and a[i].ss == v1.back()) continue;
            v1.push_back(a[i].ss);
        }
    }

    while(sz(v) > 0){
        int mn = 1e9, k = -1, b = 0, cnt = 0;
        for(auto i : v1){
            cnt = 0;
            for(auto j : v){
                cnt++;
                if(dis[j] <= mn){
                    mn = dis[j];
                    k = j;
                    b = cnt-1;
                }
                if(abs(j-ind) % i != 0) continue;
                dis[j] = min(dis[j],dis[ind]+abs(j-ind)/i);
                if(dis[j] <= mn){
                    mn = dis[j];
                    k = j;
                    b = cnt-1;
                }
            }
        }
        v1.clear();
        int x = c[k];
        ind = k;
        for(int i = x; i < m; i++){
            if(a[i].ff == ind){
                if(sz(v1) > 0 and a[i].ss == v1.back()) continue;
                v1.push_back(a[i].ss);
            }
            else break;
        }
        v.erase(v.begin() + b);
        if(ind == p) break;
    }

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

    return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	344 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	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	344 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	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	476 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	4 ms	524 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	3 ms	348 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	1 ms	344 KB	Output is correct
28	Correct	6 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct

Subtask #4
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 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	1 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	1 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	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	4 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	4 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	5 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	41 ms	664 KB	Output is correct
36	Correct	2 ms	348 KB	Output is correct
37	Correct	25 ms	604 KB	Output is correct
38	Correct	68 ms	708 KB	Output is correct
39	Correct	6 ms	604 KB	Output is correct
40	Correct	19 ms	604 KB	Output is correct
41	Correct	79 ms	708 KB	Output is correct
42	Correct	3 ms	692 KB	Output is correct
43	Correct	3 ms	604 KB	Output is correct
44	Correct	8 ms	652 KB	Output is correct
45	Correct	10 ms	604 KB	Output is correct
46	Correct	10 ms	856 KB	Output is correct

Subtask #5
43.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	1 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	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	1 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	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	4 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	0 ms	348 KB	Output is correct
28	Correct	5 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	41 ms	604 KB	Output is correct
36	Correct	3 ms	344 KB	Output is correct
37	Correct	25 ms	604 KB	Output is correct
38	Correct	68 ms	604 KB	Output is correct
39	Correct	7 ms	600 KB	Output is correct
40	Correct	20 ms	604 KB	Output is correct
41	Correct	65 ms	600 KB	Output is correct
42	Correct	3 ms	600 KB	Output is correct
43	Correct	3 ms	604 KB	Output is correct
44	Correct	7 ms	604 KB	Output is correct
45	Correct	10 ms	716 KB	Output is correct
46	Correct	10 ms	604 KB	Output is correct
47	Correct	96 ms	860 KB	Output is correct
48	Correct	288 ms	856 KB	Output is correct
49	Correct	229 ms	1116 KB	Output is correct
50	Correct	124 ms	1104 KB	Output is correct
51	Correct	457 ms	1368 KB	Output is correct
52	Correct	527 ms	1372 KB	Output is correct
53	Correct	143 ms	1372 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	0 ms	348 KB	Output is correct
56	Correct	928 ms	1176 KB	Output is correct
57	Correct	1 ms	604 KB	Output is correct
58	Correct	3 ms	732 KB	Output is correct
59	Correct	4 ms	856 KB	Output is correct
60	Correct	4 ms	1116 KB	Output is correct
61	Correct	3 ms	1116 KB	Output is correct
62	Correct	902 ms	1372 KB	Output is correct
63	Correct	22 ms	856 KB	Output is correct
64	Correct	16 ms	860 KB	Output is correct
65	Correct	14 ms	860 KB	Output is correct
66	Correct	11 ms	1036 KB	Output is correct
67	Correct	10 ms	1040 KB	Output is correct

Submission #1037670

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 43.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
43.0 / 43.0