답안 #1024107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1024107 2024-07-15T12:03:02 Z Muhammet Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
1000 ms 1624 KB
	#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

const int M = 300000;

int T, n, m, b[N], p[N], d[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] = M;
    }
    d[0] = 0;
    int x = 0;
    vector <int> v;
    for(int i = 1; i < m; i++) v.push_back(i);
    while(sz(v) > 0){
        int mn = M, 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;
    	if(x == 1) break;
        for(int i = 0; i < sz(v); i++){
        	if(v[i] == ind){
        		v.erase(v.begin() + i);
        		break;
        	}
        }
    }

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

    return 0;
}   
# 결과 실행 시간 메모리 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 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
# 결과 실행 시간 메모리 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 1 ms 460 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 600 KB Output is correct
11 Correct 0 ms 508 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 5 ms 524 KB Output is correct
15 Correct 5 ms 520 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 460 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 348 KB Output is correct
9 Correct 1 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 1 ms 348 KB Output is correct
13 Correct 5 ms 524 KB Output is correct
14 Correct 5 ms 348 KB Output is correct
15 Correct 6 ms 524 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 4 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 528 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 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 1 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 1 ms 348 KB Output is correct
33 Correct 5 ms 600 KB Output is correct
34 Correct 5 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 7 ms 472 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 4 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 9 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 6 ms 528 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 1 ms 348 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 6 ms 348 KB Output is correct
34 Correct 6 ms 344 KB Output is correct
35 Correct 742 ms 1204 KB Output is correct
36 Correct 10 ms 624 KB Output is correct
37 Correct 111 ms 860 KB Output is correct
38 Correct 439 ms 1296 KB Output is correct
39 Correct 8 ms 1116 KB Output is correct
40 Correct 23 ms 1276 KB Output is correct
41 Correct 245 ms 1300 KB Output is correct
42 Correct 4 ms 1112 KB Output is correct
43 Correct 11 ms 1112 KB Output is correct
44 Execution timed out 1032 ms 1236 KB Time limit exceeded
45 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 456 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 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 1 ms 348 KB Output is correct
13 Correct 6 ms 468 KB Output is correct
14 Correct 6 ms 348 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 4 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 5 ms 348 KB Output is correct
21 Correct 1 ms 428 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 508 KB Output is correct
24 Correct 5 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 1 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 1 ms 348 KB Output is correct
33 Correct 5 ms 524 KB Output is correct
34 Correct 6 ms 348 KB Output is correct
35 Correct 650 ms 1200 KB Output is correct
36 Correct 7 ms 600 KB Output is correct
37 Correct 103 ms 1048 KB Output is correct
38 Correct 350 ms 1112 KB Output is correct
39 Correct 7 ms 1112 KB Output is correct
40 Correct 22 ms 1116 KB Output is correct
41 Correct 238 ms 1116 KB Output is correct
42 Correct 4 ms 1112 KB Output is correct
43 Correct 11 ms 1116 KB Output is correct
44 Correct 955 ms 1240 KB Output is correct
45 Correct 955 ms 1248 KB Output is correct
46 Correct 913 ms 1248 KB Output is correct
47 Correct 162 ms 1192 KB Output is correct
48 Correct 3 ms 1116 KB Output is correct
49 Correct 4 ms 1116 KB Output is correct
50 Correct 2 ms 860 KB Output is correct
51 Correct 786 ms 1372 KB Output is correct
52 Correct 833 ms 1368 KB Output is correct
53 Correct 232 ms 1624 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Execution timed out 1090 ms 1224 KB Time limit exceeded
57 Halted 0 ms 0 KB -