oj.uz

답안 #1085728

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1085728 2024-09-08T15:46:59 Z codexistent Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 3684 KB 
#include <iostream>
#include <vector>
#include <set>
using namespace std;
#define FOR(i, a, b) for(long long i = a; i <= b; i++)
#define MAXN 30005
 
long long n, m, t[MAXN], s, e;
vector<long long> p[MAXN];
set<long long> a;
 
int main(){
    cin >> n >> m;
    FOR(i, 0, n - 1) t[i] = -1;
    FOR(i, 0, m - 1){
        int b, pi; cin >> b >> pi;
        if(i == 0) s = b, t[b] = 0;
        if(i == 1) e = b;
        p[b].push_back(pi);
    }
    FOR(i, 0, n - 1) if(i != s) a.insert(i);
    
    long long c = s;
    pair<long long, long long> nx = make_pair(-1, -1);
    while(c != -1){
        for(long long i : a){
            for(long long j : p[c]){
                if(abs(i - c) % j == 0){
                    t[i] = (t[i] == -1) ? (t[c] + (long long)abs(i - c) / j) : min(t[i], t[c] + (long long)abs(i - c) / j);
                }
            }
            
          if(t[i] != -1 && (nx.first == -1 || (nx.first > t[i]))){
            nx.first = t[i];
                nx.second = i;
          }
        }
        
        c = nx.second;
      a.erase(nx.second);
        nx.first = nx.second = -1;
    }
    
    cout << t[e] << endl;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 956 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1160 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1192 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1148 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 0 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 2 ms 1184 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 4 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1140 KB Output is correct
20 Correct 11 ms 1112 KB Output is correct
21 Correct 1 ms 1160 KB Output is correct
22 Correct 1 ms 1112 KB Output is correct
23 Correct 9 ms 1112 KB Output is correct
24 Correct 13 ms 1304 KB Output is correct
25 Correct 13 ms 1116 KB Output is correct
26 Correct 11 ms 1292 KB Output is correct
27 Correct 12 ms 1296 KB Output is correct
28 Correct 12 ms 1344 KB Output is correct
29 Correct 13 ms 1116 KB Output is correct
30 Correct 11 ms 1116 KB Output is correct
31 Correct 12 ms 1268 KB Output is correct
32 Correct 11 ms 1368 KB Output is correct
33 Correct 20 ms 1112 KB Output is correct
34 Correct 21 ms 1112 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1160 KB Output is correct
12 Correct 2 ms 1368 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1120 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 4 ms 1128 KB Output is correct
18 Correct 1 ms 1128 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 11 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 9 ms 1116 KB Output is correct
24 Correct 13 ms 1116 KB Output is correct
25 Correct 13 ms 1320 KB Output is correct
26 Correct 13 ms 1116 KB Output is correct
27 Correct 11 ms 1116 KB Output is correct
28 Correct 12 ms 1340 KB Output is correct
29 Correct 14 ms 1112 KB Output is correct
30 Correct 11 ms 1264 KB Output is correct
31 Correct 12 ms 1116 KB Output is correct
32 Correct 11 ms 1268 KB Output is correct
33 Correct 20 ms 1296 KB Output is correct
34 Correct 21 ms 1112 KB Output is correct
35 Correct 51 ms 1628 KB Output is correct
36 Correct 10 ms 1112 KB Output is correct
37 Correct 53 ms 1624 KB Output is correct
38 Correct 82 ms 1880 KB Output is correct
39 Correct 83 ms 1884 KB Output is correct
40 Correct 84 ms 1884 KB Output is correct
41 Correct 81 ms 1884 KB Output is correct
42 Correct 23 ms 1748 KB Output is correct
43 Correct 37 ms 1752 KB Output is correct
44 Correct 17 ms 1748 KB Output is correct
45 Correct 153 ms 1628 KB Output is correct
46 Correct 153 ms 1624 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 0 ms 1152 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct
17 Correct 4 ms 1112 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1112 KB Output is correct
20 Correct 11 ms 1340 KB Output is correct
21 Correct 2 ms 1112 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 9 ms 1116 KB Output is correct
24 Correct 13 ms 1116 KB Output is correct
25 Correct 13 ms 1116 KB Output is correct
26 Correct 11 ms 1292 KB Output is correct
27 Correct 13 ms 1296 KB Output is correct
28 Correct 12 ms 1116 KB Output is correct
29 Correct 13 ms 1116 KB Output is correct
30 Correct 11 ms 1264 KB Output is correct
31 Correct 12 ms 1368 KB Output is correct
32 Correct 11 ms 1272 KB Output is correct
33 Correct 20 ms 1196 KB Output is correct
34 Correct 22 ms 1116 KB Output is correct
35 Correct 52 ms 1748 KB Output is correct
36 Correct 10 ms 1116 KB Output is correct
37 Correct 54 ms 1436 KB Output is correct
38 Correct 82 ms 1880 KB Output is correct
39 Correct 91 ms 1884 KB Output is correct
40 Correct 83 ms 1668 KB Output is correct
41 Correct 82 ms 1884 KB Output is correct
42 Correct 23 ms 1628 KB Output is correct
43 Correct 30 ms 1752 KB Output is correct
44 Correct 17 ms 1704 KB Output is correct
45 Correct 153 ms 1628 KB Output is correct
46 Correct 155 ms 1624 KB Output is correct
47 Correct 766 ms 2340 KB Output is correct
48 Correct 13 ms 2904 KB Output is correct
49 Correct 13 ms 3160 KB Output is correct
50 Correct 10 ms 3160 KB Output is correct
51 Execution timed out 1099 ms 3684 KB Time limit exceeded
52 Halted 0 ms 0 KB -